Map<K:Compare,V>

Balanced tree of 'Compare' keys and 'Base' values

• New
• Each
• Empty
• Filter
• Find
• GetKeyValues
• GetKeys
• GetValues
• Has
• Insert
• IsEmpty
• Remove
• Size
• ToString
• Zip

Code example:

function : Example() ~ Nil {
   # insert elements
   map := Collection.Map->New()<IntRef, String>;
   map->Insert(415, "San Francisco");
   map->Insert(510, "Oakland");
   map->Insert(925, "East Bay");

   # get size
   map->Size()->PrintLine();

   # get value by key
   map->Find(510)->PrintLine();

   # get key/values
   key_values := map->GetKeyValues()<Pair<IntRef, String>>;
   each(key_value := key_values) {
      key_value->GetFirst()->PrintLine();
   };

   # get values
   values := map->GetValues()<String>;
   each(value := values) {
      value->PrintLine();
   };

   # check for key
   map->Has(408)->PrintLine();
}

New

Default constructor

Each

Function called for each element

Empty

Clears the map

Filter

Uses the given function to filter out values

Find

Searches for a value in a map

GetKeyValues

Get a collection of keys

GetKeys

Get a collection of keys

GetValues

Gets a collection of values

Has

Checks for a value in a map

Insert

Inserts a value into the map

IsEmpty

Checks to see if the map is empty

Remove

Removes a value from the map

Size

Size of queue

ToString

Formats the collection into a string. If an element implements the 'Stringify' interface, it's 'ToString()' is called.

Zip

Creates a map from a vector of keys and values