Farley Knight farleyknight

Provider	Singleton	Instantiable	Configurable
Constant	Yes	No	No
Value	Yes	No	No
Service	Yes	No	No
Factory	Yes	Yes	No
Decorator	Yes	No?	No
Provider	Yes	Yes	Yes

Constant

Clojure Destructuring Tutorial and Cheat Sheet

(Related blog post)

Simply put, destructuring in Clojure is a way extract values from a datastructure and bind them to symbols, without having to explicitly traverse the datstructure. It allows for elegant and concise Clojure code.

Vectors and Sequences

Basic unit type:

λ> replTy "()"
() :: ()

Basic functions:

	source :rubygems

	gem 'json', '= 1.5.4' # knife/chef 11.0 and 11.20 is broken with json 1.5.5/1.7.7
	gem 'vagrant'
	gem 'vagrant-hostmaster'

	# Based on http://cr.yp.to/streamciphers/timings/estreambench/submissions/salsa20/chacha8/ref/chacha.c

	import binascii
	import numpy as np

	np.seterr(over='ignore')

	def rotl32(v, c):
	assert isinstance(v, np.uint32)
	assert isinstance(c, np.uint32)

	import sys; from PIL import Image; import numpy as np

	chars = np.asarray(list(' .,:;irsXA253hMHGS#9B&@'))

	if len(sys.argv) != 4: print( 'Usage: ./asciinator.py image scale factor' ); sys.exit()
	f, SC, GCF, WCF = sys.argv[1], float(sys.argv[2]), float(sys.argv[3]), 7/4

	img = Image.open(f)
	S = ( round(img.size[0]SCWCF), round(img.size[1]*SC) )
	img = np.sum( np.asarray( img.resize(S) ), axis=2)

	#Import library essentials
	from sumy.parsers.plaintext import PlaintextParser #We're choosing a plaintext parser here, other parsers available for HTML etc.
	from sumy.nlp.tokenizers import Tokenizer
	from sumy.summarizers.lex_rank import LexRankSummarizer #We're choosing Lexrank, other algorithms are also built in

	file = "plain_text.txt" #name of the plain-text file
	parser = PlaintextParser.from_file(file, Tokenizer("english"))
	summarizer = LexRankSummarizer()

	summary = summarizer(parser.document, 5) #Summarize the document with 5 sentences

	class KMP:
	def partial(self, pattern):
	""" Calculate partial match table: String -> [Int]"""
	ret = [0]

	for i in range(1, len(pattern)):
	j = ret[i - 1]
	while j > 0 and pattern[j] != pattern[i]:
	j = ret[j - 1]
	ret.append(j + 1 if pattern[j] == pattern[i] else j)

	# Includes Operating System name from `uname`

	export PS1="\[\033[36m\]\u\[\033[m\]@\[\033[32m\]\h\[\033[35m\][$(uname)]\[\033[33;1m\]\w\[\033[m\]\n$ "