ImmutableHashSet

The immutable hash set is useful for constructing a read-only collection that supports quickly determining if an element is present.

Because the set does not support inserting, it only takes up as much memory as is necessary to contain the elements provided at construction. Memory is managed by malloc/free.

struct ImmutableHashSet (

alias hashFunction

) {

this();

this(this);

this(T[] values);

immutable(T)[] opSlice();

bool contains(T value);

}

Constructors

this this()
this this(T[] values): Constructs an immutable hash set from the given values. The values must not have any duplicates.

Destructor

A destructor is present on this object, but not explicitly documented in the source.

Postblit

this(this) this(this)

Members

Functions

contains bool contains(T value)
opSlice immutable(T)[] opSlice()

Variables

empty bool empty;: True if the set is empty.
length size_t length;: The number of items in the set.

Examples

auto ihs1 = immutable ImmutableHashSet!(int, a => a)([1, 3, 5, 19, 31, 40, 17]);
assert (ihs1.contains(1));
assert (ihs1.contains(3));
assert (ihs1.contains(5));
assert (ihs1.contains(19));
assert (ihs1.contains(31));
assert (ihs1.contains(40));
assert (ihs1.contains(17));
assert (!ihs1.contains(100));
assert (ihs1[].length == 7);

auto ihs2 = immutable ImmutableHashSet!(int, a => a)([]);
assert (ihs2.length == 0);
assert (ihs2.empty);
assert (ihs2[].length == 0);
assert (!ihs2.contains(42));

The OpenD Programming Language