IntervalMap

abstract def +[B1 >: B](kv: (Interval[A], B1)): IntervalMap[A, B1]

abstract def -(key: Interval[A]): IntervalMap[A, B]

abstract def containsIntersectingKey(interval: Interval[A]): Boolean

指定した区間と共通部分を持つ区間に対するマッピングがマップに含まれている場合に true を返す。

abstract def get(key: LimitValue[A]): Option[B]

abstract def get(key: Interval[A]): Option[B]

abstract val intervalMap: Map[Interval[A], B]

abstract def iterator: Iterator[(Interval[A], B)]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[B1 >: B](elem1: (Interval[A], B1), elem2: (Interval[A], B1), elems: (Interval[A], B1)*): Map[Interval[A], B1]

def ++[B1 >: B](xs: GenTraversableOnce[(Interval[A], B1)]): Map[Interval[A], B1]

def ++[B >: (Interval[A], B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def ++:[B >: (Interval[A], B), That](that: Traversable[B])(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def ++:[B >: (Interval[A], B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def -(elem1: Interval[A], elem2: Interval[A], elems: Interval[A]*): IntervalMap[A, B]

def --(xs: GenTraversableOnce[Interval[A]]): IntervalMap[A, B]

def /:[B](z: B)(op: (B, (Interval[A], B)) ⇒ B): B

def :\[B](z: B)(op: ((Interval[A], B), B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, (Interval[A], B)) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (B) ⇒ C): PartialFunction[Interval[A], C]

def apply(key: Interval[A]): B

def applyOrElse[A1 <: Interval[A], B1 >: B](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[(Interval[A], B), B])(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def collectFirst[B](pf: PartialFunction[(Interval[A], B), B]): Option[B]

def companion: GenericCompanion[Iterable]

def compose[A](g: (A) ⇒ Interval[A]): (A) ⇒ B

def contains(key: Interval[A]): Boolean

def copyToArray[B >: (Interval[A], B)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (Interval[A], B)](xs: Array[B]): Unit

def copyToArray[B >: (Interval[A], B)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (Interval[A], B)](dest: Buffer[B]): Unit

def count(p: ((Interval[A], B)) ⇒ Boolean): Int

def default(key: Interval[A]): B

def drop(n: Int): IntervalMap[A, B]

def dropRight(n: Int): IntervalMap[A, B]

def dropWhile(p: ((Interval[A], B)) ⇒ Boolean): IntervalMap[A, B]

def empty: IntervalMap[A, B]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((Interval[A], B)) ⇒ Boolean): Boolean

def filter(p: ((Interval[A], B)) ⇒ Boolean): IntervalMap[A, B]

def filterKeys(p: (Interval[A]) ⇒ Boolean): Map[Interval[A], B]

def filterNot(p: ((Interval[A], B)) ⇒ Boolean): IntervalMap[A, B]

def finalize(): Unit

def find(p: ((Interval[A], B)) ⇒ Boolean): Option[(Interval[A], B)]

def flatMap[B, That](f: ((Interval[A], B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def flatten[B](implicit asTraversable: ((Interval[A], B)) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: (Interval[A], B)](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (Interval[A], B)) ⇒ B): B

def foldRight[B](z: B)(op: ((Interval[A], B), B) ⇒ B): B

def forall(p: ((Interval[A], B)) ⇒ Boolean): Boolean

def foreach[U](f: ((Interval[A], B)) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

final def getClass(): Class[_]

def getOrElse[B1 >: B](key: Interval[A], default: ⇒ B1): B1

def groupBy[K](f: ((Interval[A], B)) ⇒ K): Map[K, IntervalMap[A, B]]

def grouped(size: Int): Iterator[IntervalMap[A, B]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (Interval[A], B)

def headOption: Option[(Interval[A], B)]

def init: IntervalMap[A, B]

def inits: Iterator[IntervalMap[A, B]]

def isDefinedAt(key: Interval[A]): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def keySet: Set[Interval[A]]

def keys: Iterable[Interval[A]]

def keysIterator: Iterator[Interval[A]]

def last: (Interval[A], B)

def lastOption: Option[(Interval[A], B)]

def lift: (Interval[A]) ⇒ Option[B]

def map[B, That](f: ((Interval[A], B)) ⇒ B)(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def mapValues[C](f: (B) ⇒ C): Map[Interval[A], C]

def max[B >: (Interval[A], B)](implicit cmp: Ordering[B]): (Interval[A], B)

def maxBy[B](f: ((Interval[A], B)) ⇒ B)(implicit cmp: Ordering[B]): (Interval[A], B)

def min[B >: (Interval[A], B)](implicit cmp: Ordering[B]): (Interval[A], B)

def minBy[B](f: ((Interval[A], B)) ⇒ B)(implicit cmp: Ordering[B]): (Interval[A], B)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[(Interval[A], B), IntervalMap[A, B]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Interval[A], B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par: ParMap[Interval[A], B]

def parCombiner: Combiner[(Interval[A], B), ParMap[Interval[A], B]]

def partition(p: ((Interval[A], B)) ⇒ Boolean): (IntervalMap[A, B], IntervalMap[A, B])

def product[B >: (Interval[A], B)](implicit num: Numeric[B]): B

def reduce[A1 >: (Interval[A], B)](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (Interval[A], B)](op: (B, (Interval[A], B)) ⇒ B): B

def reduceLeftOption[B >: (Interval[A], B)](op: (B, (Interval[A], B)) ⇒ B): Option[B]

def reduceOption[A1 >: (Interval[A], B)](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (Interval[A], B)](op: ((Interval[A], B), B) ⇒ B): B

def reduceRightOption[B >: (Interval[A], B)](op: ((Interval[A], B), B) ⇒ B): Option[B]

def repr: IntervalMap[A, B]

def reversed: List[(Interval[A], B)]

def runWith[U](action: (B) ⇒ U): (Interval[A]) ⇒ Boolean

def sameElements[B >: (Interval[A], B)](that: GenIterable[B]): Boolean

def scan[B >: (Interval[A], B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (Interval[A], B)) ⇒ B)(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def scanRight[B, That](z: B)(op: ((Interval[A], B), B) ⇒ B)(implicit bf: CanBuildFrom[IntervalMap[A, B], B, That]): That

def seq: Map[Interval[A], B]

def size: Int

def slice(from: Int, until: Int): IntervalMap[A, B]

def sliding(size: Int, step: Int): Iterator[IntervalMap[A, B]]

def sliding(size: Int): Iterator[IntervalMap[A, B]]

def span(p: ((Interval[A], B)) ⇒ Boolean): (IntervalMap[A, B], IntervalMap[A, B])

def splitAt(n: Int): (IntervalMap[A, B], IntervalMap[A, B])

def stringPrefix: String

def sum[B >: (Interval[A], B)](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: IntervalMap[A, B]

def tails: Iterator[IntervalMap[A, B]]

def take(n: Int): IntervalMap[A, B]

def takeRight(n: Int): IntervalMap[A, B]

def takeWhile(p: ((Interval[A], B)) ⇒ Boolean): IntervalMap[A, B]

def thisCollection: Iterable[(Interval[A], B)]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Interval[A], B), Col[(Interval[A], B)]]): Col[(Interval[A], B)]

def toArray[B >: (Interval[A], B)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[C >: (Interval[A], B)]: Buffer[C]

def toCollection(repr: IntervalMap[A, B]): Iterable[(Interval[A], B)]

def toIndexedSeq: IndexedSeq[(Interval[A], B)]

def toIterable: Iterable[(Interval[A], B)]

def toIterator: Iterator[(Interval[A], B)]

def toList: List[(Interval[A], B)]

def toMap[T, U](implicit ev: <:<[(Interval[A], B), (T, U)]): Map[T, U]

def toSeq: Seq[(Interval[A], B)]

def toSet[B >: (Interval[A], B)]: Set[B]

def toStream: Stream[(Interval[A], B)]

def toString(): String

def toTraversable: Traversable[(Interval[A], B)]

def toVector: Vector[(Interval[A], B)]

def transform[C, That](f: (Interval[A], B) ⇒ C)(implicit bf: CanBuildFrom[IntervalMap[A, B], (Interval[A], C), That]): That

def transpose[B](implicit asTraversable: ((Interval[A], B)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: ((Interval[A], B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((Interval[A], B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def updated[B1 >: B](key: Interval[A], value: B1): IntervalMap[A, B1]

Add a key/value pair to this map.

def values: Iterable[B]

def valuesIterator: Iterator[B]

def view(from: Int, until: Int): IterableView[(Interval[A], B), IntervalMap[A, B]]

def view: IterableView[(Interval[A], B), IntervalMap[A, B]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withDefault[B1 >: B](d: (Interval[A]) ⇒ B1): Map[Interval[A], B1]

def withDefaultValue[B1 >: B](d: B1): Map[Interval[A], B1]

def withFilter(p: ((Interval[A], B)) ⇒ Boolean): FilterMonadic[(Interval[A], B), IntervalMap[A, B]]

def zip[A1 >: (Interval[A], B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IntervalMap[A, B], (A1, B), That]): That

def zipAll[B, A1 >: (Interval[A], B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IntervalMap[A, B], (A1, B), That]): That

def zipWithIndex[A1 >: (Interval[A], B), That](implicit bf: CanBuildFrom[IntervalMap[A, B], (A1, Int), That]): That

def /:\[A1 >: (Interval[A], B)](z: A1)(op: (A1, A1) ⇒ A1): A1