paul-english

unbind C-b
set -g prefix C-Space

set -g mode-keys vi

# Set XTerm key bindings
setw -g xterm-keys on

# Set XTerm overrides
set -g terminal-overrides "xterm*:XT:smcup@:rmcup@"

paul-english

import Levenshtein as levenshtein
import numpy as np

def dist(coord):
    i, j = coord
    return levenshtein.distance(strings_list[i], strings_list[j])

coords = np.triu_indices(len(strings_list), 1)

zipped_coords = zip(*coords)

paul-english

#!/bin/bash

# Clones a repo into an organized directory structure at your $CODEPATH.
# This organization is similar to how "go get" will organize your code into
# $GOPATH/<site>/../../<repo>

set -e

trap "echo ERRORS DETECTED" err

paul-english

#!/bin/bash

# Finds and converts git repositories in or under the working directory to
# reference GitHub Enterprise (code.redbrainlabs.com).

set -e

trap "echo ERRORS DETECTED" ERR

IFS="`printf '\n\t'`"

paul-english

using Images
using Match

function sample_S(n, iters=1000)
    S = zeros(Int32, n)
    for step = 1:iters
        i = rand(1:n)
        @match (i,S[i]) begin
            (1,0),if S[i+1]==0 end              => S[i]=1
            (1,0),if S[i+1]==1 end              => continue

paul-english

install.packages('car')

df <- read.csv("~/data.csv")

plot(df)

# Model 1
model1.y <- df$inf
model1.X <- df$unem

paul-english

import xml.etree.ElementTree as ET
@shared_task
def test_et():
    print('test_et')
    fpath = '<xml-file>'
    t = ET.parse(fpath)
    print('--- t', t)

paul-english

-- Exercise 1

invalidInt :: MaybeInt -> Bool
invalidInt (ValidInt _) = False
invalidInt InvalidInt = True

maybeIntValue :: MaybeInt -> Int
maybeIntValue (ValidInt val) = val
maybeIntValue  InvalidInt = 0

paul-english

-- Exercise 1

formableBy :: String -> Hand -> Bool
formableBy [] _ = True
formableBy [letter] hand = letter `elem` hand
formableBy (letter:letters) hand
  | letter `elem` hand = formableBy letters (delete letter hand)
  | otherwise = False

paul-english

-- Exercise 1

lastDigit :: Integer -> Integer
lastDigit x = mod x 10

dropLastDigit :: Integer -> Integer
dropLastDigit x = div x 10

-- Exercise 2