DenseHashTableIterator

A basic iterator type for finding entries and iterating. We're just an array, but we need to skip over empty and deleted elements.

TODO(vnayar): Coonvert DenseHashTable to be range based after S2Builder is modified to use it.

struct DenseHashTableIterator (

Value

Key

HashFcn

ExtractKey

SetKey

EqualKey

) {

alias Iterator = DenseHashTableIterator!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey);

this(DenseHashTable!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey) h, Value[] data, bool advance);

inout(Value) opUnary();

void advancePastEmptyAndDeleted();

DenseHashTableIterator opUnary();

bool opEquals(ThisT o);

Rebindable!(const DenseHashTable!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey)) _ht;

Value[] _data;

}

Constructors

this this(DenseHashTable!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey) h, Value[] data, bool advance): Undocumented in source.

Members

Aliases

Iterator alias Iterator = DenseHashTableIterator!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey): Undocumented in source.

Functions

advancePastEmptyAndDeleted void advancePastEmptyAndDeleted(): Undocumented in source. Be warned that the author may not have intended to support it.
opEquals bool opEquals(ThisT o): Undocumented in source. Be warned that the author may not have intended to support it.
opUnary inout(Value) opUnary(): Undocumented in source.
opUnary DenseHashTableIterator opUnary(): Undocumented in source.

Variables

_data Value[] _data;: Undocumented in source.
_ht Rebindable!(const DenseHashTable!(Value, Key, HashFcn, ExtractKey, SetKey, EqualKey)) _ht;: Undocumented in source.

Meta

Source

See Implementation

s2 util container dense_hash_table classes

DenseHashTable

functions

denseHashTable

structs

DenseHashTableIterator