Scala snippets

bs.scala

import scala.math.Ordering.{String => StringOrdering}
import scala.collection.Searching._
import scala.util.Sorting

implicit class Search[A, LS](val coll: LS)(implicit ls2idxseq: LS => IndexedSeq[A]) {
  def binarySearch[B >: A](elem: B, from: Int = 0, to: Int = coll.length)
                          (implicit ord: Ordering[B]): SearchResult = {
    if (to == from) InsertionPoint(from) else {
      val idx = from + (to - from - 1) / 2
      math.signum(ord.compare(elem, coll(idx))) match {
        case -1 => binarySearch(elem, from, idx)(ord)
        case 1 => binarySearch(elem, idx + 1, to)(ord)
        case _ => Found(idx)
      }
    }
  }
}


val mySeq = Seq("a", "c", "b", "j", "z").toArray
Sorting.quickSort(mySeq)(StringOrdering)
Search(mySeq).binarySearch[String]("test")