IndexMixin.HashedRangeT

the primary range for this index, which embodies a forward range. iteration has time complexity O(n)

mixintemplate IndexMixin(size_t N, alias KeyFromValue, alias Hash, alias Eq, bool allowDuplicates, alias SeqRange, ThisContainer)

struct HashedRangeT (

bool is_const

) {

alias Node = const(ThisNode);

alias Container = const(ThisContainer);

alias Container = ThisContainer;

alias Node = ThisNode;

alias front_node = node;

this(Container _c, Node* _node, size_t _n);

bool empty [@property getter];

front [@property getter];

void popFront();

save [@property getter];

}

Constructors

this this(Container _c, Node* _node, size_t _n): Undocumented in source.

Members

Aliases

Container alias Container = const(ThisContainer): Undocumented in source.
Container alias Container = ThisContainer: Undocumented in source.
Node alias Node = const(ThisNode): Undocumented in source.
Node alias Node = ThisNode: Undocumented in source.
front_node alias front_node = node: Undocumented in source.

Functions

popFront void popFront(): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

empty bool empty [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
front front [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
save save [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Variables

c Container c;: Undocumented in source.
n size_t n;: Undocumented in source.
node Node* node;: Undocumented in source.

Meta

Source

See Implementation