sw17ch

export HISTCONTROL=erasedups
export HISTSIZE=500
export HISTIGNORE=ls:'ls -l':fg

sw17ch

ack
bundle
cat
cd
cd-
ceedling
cp
curl
diff
find

sw17ch

res = File.read("/usr/share/dict/words").lines.map{|l| l.chomp.downcase}.inject({}) do |cont, w|
  a = w.tr('aeiou', '')
  cont.tap do |h|
    h[a] ||= []
    h[a] << w 
  end
end

most = res.map {|k, v| [k, v.length]}.sort_by {|a| a[1]}.reverse[0][0]
puts "Most commonly used abbreviation: '#{most}' with #{res[most].length} words."

sw17ch

#!/usr/bin/env ruby

def stats(b, c, t)
  puts "Byte: #{b} | Count: #{c} | #{Time.now - t}"
end

MOD_VAL = 255

start = Time.now
last = 0

sw17ch

import Data.Monoid
import Data.Maybe

main :: IO ()
main = do
  print $ expression

instance Monoid Integer where
  mempty = 0
  mappend = (+)

sw17ch

#include <stdio.h>
#include <stdlib.h>

#define IGNORE(X) ((void)X)
#define MAX_ALLOC (1024 * 1024)
#define MIN_ALLOC (128)

int main(int argc, char * argv[]) {
  IGNORE(argc);
  IGNORE(argv);

sw17ch

#include <stdio.h>

int main(int argc, char * argv[]) {
  float wat = 1.0 / 0.0;
  printf("%f\n", wat);
  return 0;
}

sw17ch

#include <stdio.h>

typedef int (binop)(int a, int b);

int add(int a, int b);
int sub(int a, int b);
int mul(int a, int b);
int div(int a, int b);

int do_op(int a, int b, binop op);

sw17ch

module Main where

main :: IO ()
main = print $ example

-- The binary tree type.
data Tree a = Tree a (Tree a) (Tree a) | Nil
  deriving (Show)

-- Breadth-first traversal

sw17ch

#ifndef ManualProfiler_h
#define ManualProfiler_h

#include <stdio.h>
#include <stdint.h>

typedef uint64_t (MPSampleTime)(void * param);

struct MPProfiler {
  FILE * profileLog;