LinkedSetBacking

Used to store and manipulate multiple linked lists within a single array based storage.

struct LinkedSetBacking (

T

) {

import std.container.array : Array;;

import std.range : isInputRange;;

Handle emptySet [@property getter];

Handle create(T[] items);

void insert(Handle* h, T value);

void insert(Handle* h, R items);

LinkedSetHash getHash(Handle sh);

auto getItems(Handle sh);

auto getItems(Handle sh);

bool hasMaxLength(Handle sh, size_t l);

bool hasLength(Handle sh, size_t l);

}

Members

Functions

create Handle create(T[] items): Undocumented in source. Be warned that the author may not have intended to support it.
getHash LinkedSetHash getHash(Handle sh): Undocumented in source. Be warned that the author may not have intended to support it.
getItems auto getItems(Handle sh): Undocumented in source. Be warned that the author may not have intended to support it.
getItems auto getItems(Handle sh): Undocumented in source. Be warned that the author may not have intended to support it.
hasLength bool hasLength(Handle sh, size_t l): Undocumented in source. Be warned that the author may not have intended to support it.
hasMaxLength bool hasMaxLength(Handle sh, size_t l): Undocumented in source. Be warned that the author may not have intended to support it.
insert void insert(Handle* h, T value): Undocumented in source. Be warned that the author may not have intended to support it.
insert void insert(Handle* h, R items): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

emptySet Handle emptySet [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Structs

Handle struct Handle: Undocumented in source.

Meta

Source

See Implementation

index vibe http router aliases

LinkedSetHash

classes

URLRouter

structs