austinmarton

/*
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 */

#include <arpa/inet.h>
#include <linux/if_packet.h>
#include <linux/ip.h>

retronym

class RichOrdering[A](oa: Ordering[A]) {
  def thenBy[B: Ordering](f: A => B): Ordering[A] = new Ordering[A] {
    def compare(a1: A, a2: A) = oa.compare(a1, a2) match {
      case 0 => Ordering[B].compare(f(a1), f(a2))
      case x => x
    }
  }
}

implicit def ToRichOrdering[A](oa: Ordering[A]): RichOrdering[A] = new RichOrdering(oa)

softprops

libraryDependencies ++= Seq(
  "net.databinder" %% "unfiltered-jetty" % "0.4.1",
  "net.databinder" %% "unfiltered-filter" % "0.4.1",
  "net.databinder" %% "unfiltered-json" % "0.4.1"
)

oxbowlakes

/**
 * Part Zero : 10:15 Saturday Night
 *
 * (In which we will see how to let the type system help you handle failure)...
 *
 * First let's define a domain. (All the following requires scala 2.9.x and scalaz 6.0)
 */

import scalaz._
import Scalaz._

sritchie

package forma;

import forma.WholeFileInputFormat;
import cascading.scheme.Scheme;
import cascading.tap.Tap;
import cascading.tuple.Fields;
import cascading.tuple.Tuple;
import cascading.tuple.TupleEntry;
import java.io.IOException;
import org.apache.hadoop.mapred.JobConf;