Landon Kuhn landon9720

## null-uuid.txt
00000000-0000-0000-0000-000000000000

## scala-sort-by-more-than-one-field.scala
rows.sortBy(r => (r.lastName, r.firstName))

## check-unset-vars-in-bash-script.txt
set -u

## cat-gzip-compressed-s3-file.txt
aws s3 cp s3://yourbucket/yourkey.gz - | gzcat

## psql_import_csv_with_progress.sh
pv < yourfile.csv | psql -c "copy yourtable from STDIN;"

## using-gist.txt
brew install gist; gist -f filename -Po

## joda_datetime_ordering.scala
implicit def `joda datetime ordering`: Ordering[DateTime] = Ordering.fromLessThan(_ isBefore _)

## gist:3005647
sudo defaults write com.apple.LaunchServices LSQuarantine -bool NO
sudo defaults write com.apple.dock no-bouncing -bool TRUE

## game_of_life.scala
// Conway's Game of Life, using Processing, written in Scala
// see: http://en.wikipedia.org/wiki/Conway's_Game_of_Life
// see: http://processing.org/
// see: http://www.scala-lang.org/

// run using processing-scala-sbt:
// https://github.com/landon9720/processing-scala-sbt

// this code is by Landon Kuhn

## prime-factors.scala
  // borrowed from http://louisbotterill.blogspot.com/2009/03/prime-factorization-comparison-between.html
  def factors(n:Int):List[Int] = {
    def divides(d:Int, n:Int) = (n % d) == 0
    def ld(n:Int):Int =  ldf(2, n)
    def ldf(k:Int, n:Int):Int = {
      if (divides(k, n)) k
      else if ((k*k) > n) n
      else ldf((k+1), n)
    }
    n match {
	sudo defaults write com.apple.LaunchServices LSQuarantine -bool NO
	sudo defaults write com.apple.dock no-bouncing -bool TRUE
	// Conway's Game of Life, using Processing, written in Scala
	// see: http://en.wikipedia.org/wiki/Conway's_Game_of_Life
	// see: http://processing.org/
	// see: http://www.scala-lang.org/

	// run using processing-scala-sbt:
	// https://github.com/landon9720/processing-scala-sbt

	// this code is by Landon Kuhn
	// borrowed from http://louisbotterill.blogspot.com/2009/03/prime-factorization-comparison-between.html
	def factors(n:Int):List[Int] = {
	def divides(d:Int, n:Int) = (n % d) == 0
	def ld(n:Int):Int = ldf(2, n)
	def ldf(k:Int, n:Int):Int = {
	if (divides(k, n)) k
	else if ((k*k) > n) n
	else ldf((k+1), n)
	}
	n match {