flazz

require 'rubygems'
require 'benchmark'
require 'riak'
require 'json'
require 'pp'

class Time

  def ms_from_epoc
    k = 1000

flazz

require 'rubygems'
require 'riak'
require 'json'
require 'benchmark'
require 'pp'

$client = Riak::Client.new :protocol => :pbc

def count_all_keys
  mr = Riak::MapReduce.new($client).

flazz

require 'rubygems'
require 'riak'
require 'json'
require 'benchmark'
require 'pp'

$client = Riak::Client.new :protocol => :pbc

def count_all_keys
  mr = Riak::MapReduce.new($client).

flazz

(ns lambda-list)

;;; basic linked list using lambdas

; construct a pair containing x and y
(defn pair [x y]
      (fn [b]
          (if b x y)))

; construct a singleton list containing x

flazz

module Huffman where

import Data.Map
import Data.Word
import Data.Ord
import Data.List
import Data.Maybe

data Tree a = Node {small::Tree a, big::Tree a}
            | Leaf {occurrences::Int, symbol::a}

flazz

# compose lambdas f & g
# (f << g).(x)
class Proc
  def <<(g)
    -> x { self.(g.(x)) }
  end
end

flazz

require 'pp'
raw = File.read 'redis.conf'

pp raw.lines.reject { |line| line =~ %r{^\s*[#]} }

pp raw.lines.reject do |line|
  line =~ %r{^\s*[#]}
end

flazz

threeven = -> n { n % 3 == 0 }
fourven = -> n { n % 4 == 0 }
fiven = -> n { n % 5 == 0 }

rs = (0..10000).to_a.sample(30)

rs.each do |r|

  case r

flazz

if r == P
  #do_something ...
elsif r * 2 < Q
  #do_something ...
elsif some_test(r)
  #do_something ...
else
  raise "unpossible"
end

flazz

puts $0
puts $0.size
puts

$0 = 'abc' * 20
puts $0
puts $0.size
puts