evansb

module Memoize (memoize) where

import Debug.Trace
import Data.Hashable
import System.IO.Unsafe

import qualified Data.HashTable.IO as H

type HashTable k v = H.CuckooHashTable k v

evansb

" Here come the bundles
Bundle 'gmarik/vundle'
Bundle 'Valloric/YouCompleteMe'
Bundle 'Lokaltog/powerline-fonts'
Bundle 'Lokaltog/vim-easymotion'
Bundle 'MarcWeber/vim-addon-mw-utils'
Bundle 'Raimondi/delimitMate'
Bundle 'bling/vim-airline'
Bundle 'bling/vim-bufferline'

evansb

set encoding=utf-8
scriptencoding utf-8

set nocompatible
filetype off

"let $PATH='/Users/evan/.opam/system/bin:/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin:/Users/evan/School/Haskell/.cabal-sandbox/bin:/Users/evan/.cabal/bin'

if has("gui_running")
    set guifont=Source\ Code\ Pro\ Medium:h14

evansb

#include <iostream>
#include <stdexcept>
#include <thread>

/* Thread guard is an RAII for thread that ensures
 * join is called when the function that creates
 * the thread goes out of scope.
*/
class ThreadGuard {

evansb

(* Tutorial 2 : Recursion & Higher-Order Functions *)

(*
    OCaml Reading Resources

    tutorial:
        http://ocaml.org/learn/tutorials/

    introduction:
        http://www.cs.jhu.edu/~scott/pl/lectures/caml-intro.html

evansb

import Control.Monad.State.Lazy
import Control.Monad.Error
import Control.Monad.Identity
import Control.Applicative

import Data.Char

-- Begin parser
type Parser a = StateT String (ErrorT String Identity) a

evansb

def ugly_pascal_triangle(level):
    table = []
    for row in range(level):
        for col in range(level):
            if row == 0:
                table.append([])
            if col == 0 or row == col:
                table[row].append(1)

evansb

import sys

DEBUG       = True
INFINITY    = 99999

def debug(var):
    if DEBUG:
        sys.stderr.write(repr(var) + "\n")

def make_adjacent(graph, people, paper):

evansb

-- Try to guess what divide does!
divide:: (Integral a) => [a] -> [[a]]
divide = f1 . f2 where
    f1 = foldr f3 []
    f2 = map (:[])
    f3 x acc
        | null acc = x : acc
        | (head x * head (head acc)) > 0 = (x ++ head acc) : tail acc
        | otherwise = x : acc

evansb

data Tree a = Leaf
            | Node Integer (Tree a) a (Tree a)
            deriving (Show, Eq)

foldTree :: [a] -> Tree a
foldTree [] = Leaf
foldTree xs = Node height 
            (foldTree $ take half xs) 
        (xs !! half)
            (foldTree $ drop (half + 1) xs)