TreeMap

Object Hierarchy:

Description:

public class TreeMap<K,V> : AbstractMap<K,V>

Left-leaning red-black tree implementation of the Map interface.

This implementation is especially well designed for large quantity of data. The (balanced) tree implementation insure that the set and get methods are in logarithmic complexity.

Content:

Properties:

public override int size { get; }
public override Set<K> keys { owned get; }
public override Collection<V> values { owned get; }
public override Set<Entry<K,V>> entries { owned get; }
public CompareFunc key_compare_func { get; }
The keys' comparator function.
public EqualFunc value_equal_func { get; }
The values' equality testing function.

Creation methods:

public TreeMap (CompareFunc? key_compare_func = null, EqualFunc? value_equal_func = null)
Constructs a new, empty tree map sorted according to the specified comparator function.

Methods:

public override bool has_key (K key)
public override bool has (K key, V value)
public override V @get (K key)
public override void @set (K key, V value)
public override bool unset (K key, out V value = null)
public override void clear ()
public override MapIterator<K,V> map_iterator ()

Inherited Members:

All known members inherited from class Gee.AbstractMap

All known members inherited from class GLib.Object

All known members inherited from interface Gee.Iterable

element_type

iterator

All known members inherited from interface Gee.Map