scalation
API
Generated with
scalation/scalation/scalation.database/JTreeMultiMap

JTreeMultiMap

scalation.database.JTreeMultiMap
class JTreeMultiMap[K, V](implicit evidence$1: ClassTag[K], evidence$2: ClassTag[V], val ord: Ordering[K]) extends Serializable

The TreeMultiMap class provides tree maps that use the Red-Black Tree algorithm. It build on Java's TreeMap allowing values to multi-valued Set [V] and can be used for building Non-Unique Indices.

Type parameters

K

the type of the keys contained in this tree map

V

the base-type of the values assigned to keys in this tree map

Value parameters

ord

the implicit ordering used to compare objects of type K

Attributes

See also

java.util.TreeMap

Graph
Supertypes
trait Serializable
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def addOne1(elem: (K, V)): tree.type

Add one key-value pair into this tree map and return this (called by put). The addOne method adds a set of values, whereas addOne1 adds a single value.

Add one key-value pair into this tree map and return this (called by put). The addOne method adds a set of values, whereas addOne1 adds a single value.

Value parameters

elem

the key-value pair to add/insert for an individual value

Attributes

def show(): Unit

Show/print this TreeMap.

Show/print this TreeMap.

Attributes

Concrete fields

val count: Int
protected val tree: TreeMap[K, Set[V]]

Implicits

Implicits

implicit val ord: Ordering[K]
Generated with