class BreakMap[A, B] extends (A) ⇒ B with Serializable

A Map which provides specific Binary Search-based map behaviour with breaks and a break strategy.

val bm: BreakMap[Int, Int] = ...
val t: Tile = ...

// Map all the cells of `t` to a target bin value in O(klogn).
val newT: Tile = t.map(vm)

Note: A and B are specialized on Int and Double.

Linear Supertypes
Serializable, Serializable, (A) ⇒ B, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BreakMap
  2. Serializable
  3. Serializable
  4. Function1
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BreakMap(breakMap: Map[A, B], strategy: MapStrategy[B], noDataCheck: (A) ⇒ Boolean)(implicit arg0: Order[A], arg1: Order[B])

Value Members

  1. def andThen[A](g: (B) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  2. def apply(z: A): B
    Definition Classes
    BreakMap → Function1
  3. def compose[A](g: (A) ⇒ A): (A) ⇒ B
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  4. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any