raronson

implicit def Set2OrderingSet[A : Ordering]: Ordering[Set[A]] = { 
    new Ordering[Set[A]] {
      def compare(s1: Set[A], s2: Set[A]): Int = {
        for((x,y) <- s1.toList.sorted zip s2.toList.sorted) {
          val c = implicitly[Ordering[A]].compare(x, y)
          if(c != 0) return c
        }
        return s1.size - s2.size
      }
    }

raronson

package com.ambiata.ivory.scoobi

import org.specs2._
import com.nicta.scoobi.Scoobi._
import com.nicta.scoobi.testing.mutable._
import com.nicta.scoobi.testing.SimpleJobs
import com.nicta.scoobi.testing.TestFiles._
import com.nicta.scoobi.testing.TempFiles
import scalaz.{DList => _, _}, Scalaz._

raronson

Keybase proof

I hereby claim:

• I am raronson on github.
• I am raronson (https://keybase.io/raronson) on keybase.
• I have a public key ASAtOUQ-ZiluherX2vsEhL4MYMioYPh1QeWe0hk4D85Y8go

To claim this, I am signing this object: