Home

MultiMap

Binary tree that holds multiple values with the same key

Operations

New

Default constructor

New()

Empty

Clears the set

method : public : Empty() ~ Nil

Filter

Uses the given function to filter out values

method : public : Filter(f:(Compare)~Bool) ~ MultiMap
Parameters
NameTypeDescription
f(Compare)~Boolfunction to use a filter. If the function evaluates to true the value is added to the collection.

Return
TypeDescription
MultiMapfilter vector

Find

Checks for a value in a map

method : public : Find(key:Compare) ~ Vector
Parameters
NameTypeDescription
keyComparesearch key

Return
TypeDescription
Vectortrue if found, false otherwise

GetKeys

Get a collection of keys

method : public : GetKeys() ~ CompareVector
Return
TypeDescription
CompareVectorvector of keys

GetValues

Gets a collection of values

method : public : GetValues() ~ CompareVector
Return
TypeDescription
CompareVectorvector of values

Has

Checks for a value in a map

method : public : Has(key:Compare) ~ Bool
Parameters
NameTypeDescription
keyComparesearch key

Return
TypeDescription
Booltrue if found, false otherwise

Insert

Inserts a value into the map

method : public : Insert(key:Compare, value:Base) ~ Nil
Parameters
NameTypeDescription
keyComparekey
valueBasevalue

IsEmpty

Checks to see if the queue is empty

method : public : native : IsEmpty() ~ Bool
Return
TypeDescription
Booltrue if empty, false otherwise

Remove

Removes a set of values from the map

method : public : Remove(key:Compare) ~ Bool
Parameters
NameTypeDescription
keyComparekey for values to remove

Size

Size of unique keys

method : public : Size() ~ Int
Return
TypeDescription
Intsize of unique keys

TotalSize

Size of values

method : public : TotalSize() ~ Int
Return
TypeDescription
Intsize of values