jbrechtel

apt-get -y install build-essential libssl-dev libreadline-dev zlib1g-dev

jbrechtel

#!/usr/bin/env sh

##
# This is script with usefull tips taken from:
#   https://github.com/mathiasbynens/dotfiles/blob/master/.osx
#
# install it:
#   curl -sL https://raw.github.com/gist/6148219/hack.sh | sh
#

jbrechtel

(ns middler-clojure.core
  (:use org.httpkit.server)
  (:use clojure.walk)
  (:require [org.httpkit.client :as http])
  (:gen-class))

(defn app [req]
  (println req)
  (let [uri (:uri req)]
      (println (class uri))

jbrechtel

require 'rubygems'
require 'csv'
require 'json'
require 'pp'

data = CSV.parse(File.read(ARGV[0]))
cols = data.shift
hashes = data.map { |v| cols.zip(v) }.map { |a| Hash[*a.flatten] }
puts 'var e = '+hashes.to_json

jbrechtel

import org.specs2._
import execute.AsResult
import mutable.Around


/* this scope is incidentally lazy since the singleton never gets constructed if code that uses it isn't executed */
object databaseScope extends Around {
  def setupDB { println("#####################\nBUILDING DATABASE\n#####################") }
  setupDB
  def around[T: AsResult](t: => T) = AsResult(t)

jbrechtel

Conway's Game of Life

Conway's Game of Life is a set of rules which define a cellular automata. Read more about it in Wikipedia. Your task is to write a Conway's Game of Life (GOL) simulation.

GOL consists of a two-dimensional grid of cells. Each cell is either alive or dead. Your simulation should calculate the grid over a user-specified number of generations. To calculate the next generation you apply the following rules to each cell in the grid and the resulting grid is the next generation.

Rules

• Any live cell with fewer than two live neighbours dies, as if caused by under-population.
• Any live cell with two or three live neighbours lives on to the next generation.

jbrechtel

(defn add-prefix [prefix string]
  "Prepends prefix to string separated by a space"
  (str prefix " " string))

(def formalize-male
  "Returns a formal version of a male name"
  (partial add-prefix "Mr"))

(defn parenthesize [string]
  "Wraps names in parentheses"

jbrechtel

Dealing cards to players

Using the classes built in the previous dealing cards problem, we're going to deal cards to players now.

Your program will deal cards to a user-specified number of players.

The program should ask for user input and respond to the following 3 commands

• add_player
• deal_cards

jbrechtel

Dealing cards

A deck comprises 52 cards of 4 suits (spades, hearts, clubs, and diamonds). Each suit has 13 cards of values from 2-10, Jack, Queen, King, and Ace.

Write a class to represent a card. The class should have a suit and value property indicating its suit and value.

Write a class that has a draw method.

• The draw method should accept an integer as an argument.
• The draw method should return an array of card objects.

jbrechtel

You're building a system to process orders for seats to an event

You have two input files

The first is sections.txt. It contains a list of sections of seats. Each section has a name, a number of available seats and a cost per seat. It looks like this

Upper 30 50
Balcony 20 100