leandronsp

use std::sync::{Arc, Mutex};
use std::sync::Condvar;
use std::thread;
use std::collections::HashMap;
use std::time::Duration;

struct Node<T> {
    value: T,
    next: Option<Arc<Mutex<Node<T>>>>,
    previous: Option<Arc<Mutex<Node<T>>>>,

leandronsp

// A UNIX socket server written in pure Rust

use std::io::Read;
use std::os::unix::net::{UnixListener, UnixStream};
use std::path::Path;

fn main() {
    let socket = Path::new("/tmp/echo.sock");

    if socket.exists() {

leandronsp

// A UNIX socket server written in Go, using the net package.

package main

import (
  "fmt"
  "net"
  "os"
)

leandronsp

// go mod init queues
// go mod tidy 
// go get github.com/stretchr/testify/assert
// go mod tidy
// go test background_job_test.go

package queues

import (
  "fmt"

leandronsp

Sidequico

A dead simple background job written in pure Ruby, using a double ended queue (deque) based on a doubly linked list (dll). The deque has a blocking version based on primitives such as mutex and condition variable, useful for a background job.

Because we perform operations in the deque at constant time $O(1)$, we are able to implement rpoplpush easily in a performant way, enabling reliability through the use of a processing queue and a dead-letter queue.

Run the unit test:

ruby sidequico_test.rb

leandronsp

require 'test/unit'

def woodpecker_distribution(items)
  count = 0
  distribution = { woodpecker: [], fink_fox: [], picked: {} }

  for idx in 0...items.length
    count += 1 unless distribution[:picked][idx]
    next if distribution[:picked][idx]

leandronsp

package sorting

// go mod init sorting
// go mod tidy

import (
  "testing"
  "github.com/stretchr/testify/assert"
)

leandronsp

############################# sort ############################# 
# Sorts a given node applying a merge sort algorithm,
# using a bottom-up approach (iterative) on a singly linked list
def sort(node)
  acc = node
  steps = 1

  while node
    acc = sort_pass(acc, steps)
    steps *= 2

leandronsp

def fib(position)
  return position if position < 2

  fib(position - 1) + fib(position - 2)
end

def fib_tc(position, _current = 0, _next = 1)
  return _current if position < 1

  fib_tc(position - 1, _next, _current + _next)

leandronsp

" Mostly stolen from Yan Pritzer's most excellent Yadr (github.com/skwp/dotfiles)

" Use Vim settings, rather then Vi settings (much better!).
" This must be first, because it changes other options as a side effect.
set nocompatible
set encoding=utf-8

" ================ General Config ====================
"
"