royki

CUE for DevOps

Overview

This is a tutorial that uses a toy infrastructure project to highlight some of CUE's features and show how it can be used to simplify and manage infrastructure. Go to Tutorial if you want to skip the introductory stuff.

What is CUE?

From cuelang.org:

royki

---
- name: Ejecutar Proceso con VAULT_TOKEN
  hosts: localhost  # Puedes ajustar los hosts según tu entorno
  gather_facts: false  # Desactivar recopilación de hechos

  vars:
    vault_address: "http://direccion-de-tu-vault:8200"  # Ajusta la dirección de tu Vault Server

  tasks:
    - name: Establecer VAULT_TOKEN como variable de entorno

royki

import java.util.BitSet

object Solution {
    def solution(A: Array[Int]): Int = {
        val bitz = new BitSet(A.size + 1)
        
        val good = A.foldLeft(true)((current, i) => 
            if (current) {
                (i, bitz.get(i)) match {
                    case (x, _) if x > A.size => 

royki

object Solution {
    def solution(A: Array[Int]): Int = {
        val positive = new java.util.BitSet()
        val negative = new java.util.BitSet()
        
        A.foldLeft(0) { (current, i) =>
            val duplicate = if (i < 0) (negative get i * -1)
            else (positive get i)
        
            duplicate match {

royki

object Solution {
    def solution(A: Array[Int]): Int = {
        val (results, _) = A.sorted.foldLeft((0, 0)) { (t, item) =>
            val (current, last) = t

            val next = last + 1
            item match {
                case x if x < 0 => (current, last)
                case `last` => (item, item)

royki

object Solution {
    def solution(A: Array[Int]): Int = {

        (A.foldLeft[(Int, Option[Double], Int)]((0, None, -1)) { (t, item) =>
          val (index, min, results) = t

          val checkPair = index <= A.size - 2
          val checkTrio = index <= A.size - 3

royki

import scala.math.{min, abs}

object Solution {
    def solution(A: Array[Int]): Int = {
      if (A.size < 2 || A.size > 100000) sys.error(s"Invalid input - array size: ${A.size}")

      val total = A.map(_.toLong).sum

      (A.foldLeft[(Int, Long, Long)](-1, -1, 0l) { (t, i) =>
        if (i < -1000 || i > 1000) sys.error(s"Invalid array element: $i")

royki

object Solution {

  def solution(A: Array[Int]): Int = {
    val bitz = new java.util.BitSet(A.size)

    val n = A.foldLeft(0) { (total, i) =>
      if (i > 0 && i <= A.size && !bitz.get(i)) {
        bitz.set(i)
        total + 1
      } else total

royki

object Solution {

  def solution(T: Tree): Int = {
    def height(t: Tree, i: Int): Int = {
      val left = (Option(t.l).map(height(_, i + 1)) getOrElse i)
      val right = (Option(t.r).map(height(_, i + 1)) getOrElse i)

      scala.math.max(i, scala.math.max(left, right))
    }

royki

object Solution {
   def solution(A: Array[Int]): Int = {
    val N = A.size

    if (N < 1 || N > 1000000) sys.error(s"Invalid array size: $N")

    A.foldLeft(0) { (current, i) =>
      i ^ current
    }
  }