HashSet

Object Hierarchy:

Description:

public class HashSet<G> : AbstractSet<G>

Hash table implementation of the Set interface.

This implementation is better fit for highly heterogeneous values. In case of high value hashes redundancy or higher amount of data prefer using tree implementation like TreeSet.

Content:

Properties:

public EqualDataFunc<G> equal_func { get; }
The elements' equality testing function.
public HashDataFunc<G> hash_func { get; }
The elements' hash function.
public override bool read_only { get; }
public override int size { get; }

Creation methods:

public HashSet (owned HashDataFunc<G>? hash_func = null, owned EqualDataFunc<G>? equal_func = null)
Constructs a new, empty hash set.

Methods:

public override bool @foreach (ForallFunc<G> f)
public override bool add (G key)
public override void clear ()
public override bool contains (G key)
public override Iterator<G> iterator ()
public override bool remove (G key)

Inherited Members:

All known members inherited from class Gee.AbstractSet

read_only_view

All known members inherited from class Gee.AbstractCollection

All known members inherited from class GLib.Object

All known members inherited from interface Gee.Set

empty

read_only_view

All known members inherited from interface Gee.Traversable

All known members inherited from interface Gee.Iterable

iterator

All known members inherited from interface Gee.Collection