cprieto

function fish_greeting
	echo '                    ##        .         '
	echo '              ## ## ##       ==         '
	echo '           ## ## ## ##      ===         '
	echo '      /""""""""""""""""\___/ ===        '
	echo ' ~~~ {~~ ~~~~ ~~~ ~~~~ ~~ ~ /  ===- ~~~ ' 
	echo '      \______ o          __/            '
	echo '        \    \        __/               '
	echo '         \____\______/                  '
end

cprieto

deps/engines-3.7.0-11.qe-napi-2-7d9243c73ade811196e360a14435eb4756076300

cprieto

package main

// StringNode Is a node in a binary tree
type StringNode struct {
	Data  string
	Left  *StringNode
	Right *StringNode
}

/* Tree traversal functions (Depth-first traversal) */

cprieto

package algo

// BubbleSort returns a sorted list of integers using the bubble sort algorithm
func BubbleSort(elems []int) []int {
	if elems == nil {
		return nil
	}

	for mx := len(elems) - 1; mx >= 0; mx-- {
		for idx := 1; idx <= mx; idx++ {

cprieto

(* This is a code fragment in OCaml *)

match watever with
| (true, _) ->
  match String.lowecase Path.GetExtension path with
  | ".sln" | ".csproj" | ".fsproj" -> Path.GetFullPath path
  _ -> failwith "Whatever"

cprieto

Write a simple server that sends a notification about every 2 seconds. To receive the notification, a client has to register with the server.

cprieto

defmodule SpawnEx1 do
  import :timer, only: [sleep: 1]

  def greet(pid) do
    send pid, {:ok, "I'm alive"}
    exit(:dead)
  end

  def process_messages() do
    receive do

cprieto

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stddef.h>

typedef int *ptr_int;

typedef struct unordered {
  int a;
  double b;

cprieto

package com.cprieto.samples

class ShortToStringConverterListener: ArrayInitBaseListener() {
    private val builder = StringBuilder()

    override fun enterInit(ctx: ArrayInitParser.InitContext?) {
        builder.append("{")
    }

    override fun toString(): String {

cprieto

{- 
- 1.
- Using a list comprehension, give an expression that calculates the sum 
- 1^2 + 2^2 + . . . 100^2 of the first one hundred integer squares.
-}
sqrsum  :: Int -> Int
sqrsum n = sum [ x^2 | x <- xs ]
	where
		xs = [1..n]