Steve Howell showell

## lib_cache_call.rb
class CacheCall
  # Calls a function that accepts a hash as its only parameter UNLESS
  # the result has been recently cached.  Cache keys are essentially a
  # URL of the hash keys and values.
  #
  # ====Parameters
  #
  # +method_obj+::
  #   A Ruby method object that supports call() and .name
  #

## gist:906814
require 'pp'

def succ(a, n)
  # a is an array of integers <= n
  # see tests
  return nil if n == 0
  a = Array.new(a)
  x = a.pop
  if x + 1 < n
    return a + [x + 1]

## permutations.rb
require 'pp'

def succ(a)
  # destructive to a
  n = a.size
  k = (n-2).downto(0) do |k|
    break k if a[k] < a[k+1]
  end
  return nil if a[k] >= a[k+1]
  l = (n-1).downto(0) do |l|

## bsearch.rb
require 'pp'

def chop(key, a)
  low = 0
  high = a.size - 1
  while low < high do
    mid = (low + high) / 2
    val = a[mid]
    return mid if val == key
    if val > key

## weather_kata.rb
require 'pp'

def lines(fn)
  File.open(fn) do |f|
    return f.readlines
  end
end

def data
  lines('weather.dat').map do |line|

## game_of_life.rb
require 'pp'

HEIGHT = 37
WIDTH = 17

def alive(game_board, x, y)
  x %= WIDTH
  y %= HEIGHT
  coords = "#{x},#{y}"
  game_board[coords]

## design.html
<a href="game_of_life.html">Game of Life</a>


<h3>Computer Programs are...</h3>

Poetry for Robots?  Maybe...but how about?

<ul>
  <li>Algorithms</li>
  <li>Configuration</li>

## max_run.coffee
assert = (cond) ->
  throw("error") unless cond

max_run = (a) ->
  m = 0
  c = 0
  for n in a
    c += n
    c = 0 if c < 0
    m = c if m < c

## gist:1057894
<head>
  <script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/jquery/1.6.1/jquery.min.js"></script>
</head>
<h1>SOME APP</h1>

## bizz.coffee
  # This extremely dubious code shows how to simulate
  # a custom control structure in CS.  bizz_buzz does
  # a highly configurable loop through the integers.
  bizz_buzz = (config) ->
    i = 0
    while true
      i += 1
      break if config.quit(i)
      if config.bizz(i) && config.buzz(i)
        console.log "bizzbuzz"
	class CacheCall
	# Calls a function that accepts a hash as its only parameter UNLESS
	# the result has been recently cached. Cache keys are essentially a
	# URL of the hash keys and values.
	#
	# ====Parameters
	#
	# +method_obj+::
	# A Ruby method object that supports call() and .name
	#
	require 'pp'

	def succ(a, n)
	# a is an array of integers <= n
	# see tests
	return nil if n == 0
	a = Array.new(a)
	x = a.pop
	if x + 1 < n
	return a + [x + 1]
	require 'pp'

	def succ(a)
	# destructive to a
	n = a.size
	k = (n-2).downto(0) do \|k\|
	break k if a[k] < a[k+1]
	end
	return nil if a[k] >= a[k+1]
	l = (n-1).downto(0) do \|l\|
	require 'pp'

	def chop(key, a)
	low = 0
	high = a.size - 1
	while low < high do
	mid = (low + high) / 2
	val = a[mid]
	return mid if val == key
	if val > key
	require 'pp'

	def lines(fn)
	File.open(fn) do \|f\|
	return f.readlines
	end
	end

	def data
	lines('weather.dat').map do \|line\|
	require 'pp'

	HEIGHT = 37
	WIDTH = 17

	def alive(game_board, x, y)
	x %= WIDTH
	y %= HEIGHT
	coords = "#{x},#{y}"
	game_board[coords]
	<a href="game_of_life.html">Game of Life</a>


	<h3>Computer Programs are...</h3>

	Poetry for Robots? Maybe...but how about?

	<ul>
	<li>Algorithms</li>
	<li>Configuration</li>
	assert = (cond) ->
	throw("error") unless cond

	max_run = (a) ->
	m = 0
	c = 0
	for n in a
	c += n
	c = 0 if c < 0
	m = c if m < c
	<head>
	<script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/jquery/1.6.1/jquery.min.js"></script>
	</head>
	<h1>SOME APP</h1>
	# This extremely dubious code shows how to simulate
	# a custom control structure in CS. bizz_buzz does
	# a highly configurable loop through the integers.
	bizz_buzz = (config) ->
	i = 0
	while true
	i += 1
	break if config.quit(i)
	if config.bizz(i) && config.buzz(i)
	console.log "bizzbuzz"