| counting_numbers = Enumerator.new do |yielder| | |
| (0..1.0/0).each do |number| yielder.yield number | |
| end | |
| end | |
| def nilstuff(a,stuff="") | |
| if(a.nil?) | |
| return stuff | |
| else | |
| return a |
| def fibs(base) | |
| fib = Enumerator.new do |y| | |
| a = b = base | |
| loop do | |
| y.yield a | |
| a, b = b, a + b | |
| end | |
| end | |
| fib | |
| end |
| require 'twitter' | |
| require 'uri' | |
| require 'emoji_data' | |
| smile_emoji = "😄" | |
| def nilstuff(a,stuff="") | |
| if(a.nil?) | |
| return stuff | |
| else |
| #Chad Brewbaker May 10, 2014 | |
| #Laser maze problem | |
| def get_coords(s) | |
| return s.gsub(/[vVlLrR]/, ' ').strip.split(',').map {|i| i.to_i}.dup | |
| end | |
| get_coords("1,7V") != [1,7] ? abort("ERROR in get_coords") : nil | |
| def laser_paths(line = "") | |
| if(line =~ /RL/) |
| import Test.QuickCheck | |
| import Data.List | |
| type Height = Integer | |
| type Width = Integer | |
| type Cell = (Height, Width) | |
| type LiveCells = [Cell] | |
| type World = (LiveCells, Height, Width) | |
| type AliveNeighborCount = Integer | |
| type AmIAlive = Bool |
oxer Video howto https://www.youtube.com/watch?v=KL9Te_hSiOA
8-port PoE midspan injector http://www.amazon.com/WS-POE-8-48v60w-passive-Ethernet-Injector-cameras/dp/B0086SQDMM/ref=sr_1_3?ie=UTF8&qid=1417751427&sr=8-3&keywords=power+over+ethernet
cheap PoE splitter http://www.amazon.com/Power-Ethernet-Injector-Splitter-Cable/dp/B00APVQYA4/ref=sr_1_6?ie=UTF8&qid=1417754731&sr=8-6&keywords=poe+splitter
| require "zlib" | |
| if(ARGV.length != 2) | |
| puts "usage: ruby zdist.rb file1 file2" | |
| else | |
| f1 = File.read(ARGV[0]) | |
| f2 = File.read(ARGV[1]) | |
| f1d = Zlib::Deflate.deflate(f1) | |
| f2d = Zlib::Deflate.deflate(f2) | |
| compressed = Zlib::Deflate.deflate(f1+f2) |
| #include <stdio.h> | |
| typedef unsigned long long int llu; | |
| llu BUDGET = 542; | |
| const int ITEMS = 11; | |
| llu PRICES[ITEMS] = {100, 100, 400, 23, 64, 39, 18, 39, 29, 39, 28}; | |
| #define CHECK_BIT(var, pos) ((var) & (1 << (pos))) | |
| void printItems(llu mask) { |
| def mutation | |
| end | |
| def crossover | |
| end |
| monogenic :: Int -> Int -> (Int -> Int -> Int) -> [Int] | |
| monogenic size seed mult = take size $ iterate f seed | |
| where | |
| f = mult seed | |
| endoscope :: Int -> (Int -> Int -> Int) -> Graph | |
| endoscope size mult = buildG (0,size) $ concat [ g i | i <- [0..size]] | |
| where | |
| g blar = zip (replicate size blar) (f blar) |