sealed abstract
class
Diev[A] extends AnyRef
Abstract Value Members
-
abstract
def
+(value: A): Diev[A]
-
abstract
def
+(interval: (A, A)): Diev[A]
-
abstract
def
++(other: Diev[A]): Diev[A]
-
abstract
def
-(value: A): Diev[A]
-
abstract
def
-(interval: (A, A)): Diev[A]
-
abstract
def
--(other: Diev[A]): Diev[A]
-
abstract
def
contains(interval: (A, A)): Boolean
-
abstract
def
contains(value: A): Boolean
-
abstract
def
filter(f: (A) ⇒ Boolean): Diev[A]
-
abstract
def
flatMap[B](f: (A) ⇒ Diev[B])(implicit EB: Enum[B]): Diev[B]
-
abstract
def
foldLeft[B](z: B)(f: (B, A) ⇒ B): B
-
abstract
def
foreach(f: (A) ⇒ Unit): Unit
-
abstract
def
intervals: Vector[(A, A)]
-
abstract
def
map[B](f: (A) ⇒ B)(implicit EB: Enum[B]): Diev[B]
-
abstract
def
toIList(): IList[A]
-
abstract
def
toList(): List[A]
-
abstract
def
toSet(): Set[A]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Implementation of a Discrete Interval Encoding Tree http://web.engr.oregonstate.edu/~erwig/diet/ that is actually implemented using a Vector and is balanced at all times as a result.