ConcreteIntervalArray

Instance Constructors

new ConcreteIntervalArray(array: Array[(K, T)], maxIntervalWidth: Long)(implicit arg0: ClassTag[T])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val array: Array[(K, T)]

Definition Classes
ConcreteIntervalArray → IntervalArray
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect(): Array[(K, T)]

Collects and returns all elements in this array.
Collects and returns all elements in this array.
returns
An array containing all elements.

Definition Classes
IntervalArray
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def filter(pred: ((K, T)) ⇒ Boolean): IntervalArray[K, T]

Filters items in an IntervalArray based on a given predicate.
Filters items in an IntervalArray based on a given predicate.
pred
The predicate to filter elements by.
returns
A new IntervalArray with filtered elements.

Definition Classes
IntervalArray
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def get(rr: K, requireOverlap: Boolean = true): Iterable[(K, T)]

Gets all overlapping intervals in array for a given K, however if no overlapping intervals are found, uses the element that is the closest to the query.
Gets all overlapping intervals in array for a given K, however if no overlapping intervals are found, uses the element that is the closest to the query.
rr
The interval to filter by.
returns
An Iterable of elements filtered by the query interval containing overlapping or the closest element in array.

Definition Classes
IntervalArray
def get(rr: K): Iterable[(K, T)]

Gets all overlapping intervals in array for a given query interval.
Gets all overlapping intervals in array for a given query interval.
rr
The interval to filter by.
returns
Iterable of elements filtered by the query interval containing overlapping elements in array. If none exist, returns an empty Iterable.

Definition Classes
IntervalArray
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def insert(kvs: Iterator[(K, T)], sorted: Boolean = false): IntervalArray[K, T]

Insert an Iterator of items into existing IntervalArray.
Insert an Iterator of items into existing IntervalArray.
kvs
The tuples to insert into IntervalArray.
returns
new IntervalArray with inserted values.

Definition Classes
IntervalArray
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def length: Int

Definition Classes
IntervalArray
def mapValues[T2](f: (T) ⇒ T2)(implicit arg0: ClassTag[T2]): IntervalArray[K, T2]

Maps values from T to T2.
Maps values from T to T2.
T2
The new type to map values to.
f
Function mapping T to T2.
returns
new IntervalArray with mapped values.

Definition Classes
IntervalArray
val maxIntervalWidth: Long

Definition Classes
ConcreteIntervalArray → IntervalArray
def midpoint: Int

Definition Classes
IntervalArray
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def replace(arr: Array[(K, T)], maxWidth: Long): IntervalArray[K, T]

Attributes
protected
Definition Classes
ConcreteIntervalArray → IntervalArray
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package array

case class ConcreteIntervalArray[K <: Interval[K], T](array: Array[(K, T)], maxIntervalWidth: Long)(implicit evidence$10: ClassTag[T]) extends IntervalArray[K, T] with Product with Serializable

Instance Constructors

new ConcreteIntervalArray(array: Array[(K, T)], maxIntervalWidth: Long)(implicit arg0: ClassTag[T])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val array: Array[(K, T)]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect(): Array[(K, T)]

final def eq(arg0: AnyRef): Boolean

def filter(pred: ((K, T)) ⇒ Boolean): IntervalArray[K, T]

def finalize(): Unit

def get(rr: K, requireOverlap: Boolean = true): Iterable[(K, T)]

def get(rr: K): Iterable[(K, T)]

final def getClass(): Class[_]

def insert(kvs: Iterator[(K, T)], sorted: Boolean = false): IntervalArray[K, T]

final def isInstanceOf[T0]: Boolean

def length: Int

def mapValues[T2](f: (T) ⇒ T2)(implicit arg0: ClassTag[T2]): IntervalArray[K, T2]

val maxIntervalWidth: Long

def midpoint: Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def replace(arr: Array[(K, T)], maxWidth: Long): IntervalArray[K, T]

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Product

Inherited from Equals

Inherited from IntervalArray[K, T]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped