Set

Set class. Manages a set of K's with fast lookup. The toHash() method must be implemented.

abstract

class Set : BucketSet!(0, K)(

K

) {

mixin IteratorClass!(BucketSet!(0, K).Iterator, SetIterator) ;

this(size_t n, float load_factor);

this(IAllocator allocator, size_t n, float load_factor);

bool opIn_r(K key);

alias opBinaryRight(istring op : "in") = opIn_r;

bool put(K key);

int opApply(SetIterator.Dg dg);

int opApply(SetIterator.Dgi dgi);

}

Constructors

this this(size_t n, float load_factor): Constructor.
this this(IAllocator allocator, size_t n, float load_factor): Constructor.

Members

Aliases

opBinaryRight alias opBinaryRight(istring op : "in") = opIn_r: Support for the 'in' operator

Functions

opApply int opApply(SetIterator.Dgi dgi): Same as above, but includes a counter
opApply int opApply(SetIterator.Dg dg): 'foreach' iteration over set.
opIn_r bool opIn_r(K key): Looks up key in the set.
put bool put(K key): Puts key into the set.

Mixins

__anonymous mixin IteratorClass!(BucketSet!(0, K).Iterator, SetIterator): Mixin of the specialized iterator classes which inherit from BucketSet.Iterator.

Meta

Source

See Implementation

ocean util container map Set classes