MirStringTable

Fast string table used to get key's id. The keys should be first sorted by length and then lexicographically.

struct MirStringTable(U, C = char)
struct MirStringTable(size_t length, size_t maxKeyLength, bool caseInsensetive = false, C = char)
struct MirStringTable (
size_t length
size_t maxKeyLength
bool caseInsensetive = false
C = char
) if (
is(C == char) ||
is(C == wchar)
||
is(C == dchar)
) {
const(immutable(C)[])[length] sortedKeys;
this(immutable(C)[][length] sortedKeys);
bool get(const(C)[] key, uint index);
uint opIndex(C[] key);
}

Constructors

this this(immutable(C)[][length] sortedKeys): The keys should be first sorted by length and then lexicographically.

Members

Functions

get bool get(const(C)[] key, uint index)
opIndex uint opIndex(C[] key)

Variables

sortedKeys const(immutable(C)[])[length] sortedKeys;

Parameters

C: character type

Meta

Source

See Implementation

mir string_table functions

structs

MirStringTable

templates