kamal-github

#ex array
a = [3,4,5,1,2]

pivot = -1
(0..a.length-1).each do |i|
    if a[i] > a[i+1] 
      pivot = i+1
      break
    end
end

kamal-github

#ex array
def rev_rotation_by_d(a, d)
    d.times do
        a << a.shift
    end
    a
end

def rotation_by_d(a, d)
    d.times do

kamal-github

type T struct {
    A int
    B string
}

t := T{23, "skidoo"}
s := reflect.ValueOf(&t).Elem()
typeOfT := s.Type()

for i := 0; i < s.NumField(); i++ {

kamal-github

kamal-github

// Func is the type of the function to memoize.
type Func func(key string) (interface{}, error)

type result struct {
    value interface{}
    err   error
}

type entry struct {
    res   result

kamal-github

# Author: Pieter Noordhuis
# Description: Simple demo to showcase Redis PubSub with EventMachine
#
# Update 7 Oct 2010:
# - This example does *not* appear to work with Chrome >=6.0. Apparently,
#   the WebSocket protocol implementation in the cramp gem does not work
#   well with Chrome's (newer) WebSocket implementation.
#
# Requirements:
# - rubygems: eventmachine, thin, cramp, sinatra, yajl-ruby

kamal-github

package main

import (
	"context"
	"log"
	"net/http"
	"os"
	"os/signal"
	"time"
)

kamal-github

// This example demonstrates a priority queue built using the heap interface.
package main

import (
	"container/heap"
	"fmt"
)

// An Item is something we manage in a priority queue.
type Item struct {

kamal-github

// Pool holds Clients.
type Pool struct {
    pool   chan *Client
}

// NewPool creates a new pool of Clients.
func NewPool(max int) *Pool {
    return &Pool{
        pool:   make(chan *Client, max),
    }

kamal-github

// Pattern to start all go routines only after all are created.

func goRoutine() {
  <-start
  // do whatever
}

func main() {

  start := make(chan, struct{})