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 (
U
C = char
) if (
__traits(isUnsigned, U) &&
(
is(C == char) ||
is(C == wchar)
||
is(C == dchar)
)
) {
const(immutable(C)[])[] sortedKeys;
this(const(immutable(C)[])[] sortedKeys);
bool get(C[] key, uint index);
uint opIndex(C[] key);
}
struct MirStringTable(size_t length, size_t maxKeyLength, bool caseInsensetive = false, C = char)

Constructors

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

Members

Functions

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

Variables

sortedKeys const(immutable(C)[])[] sortedKeys;: Keys sorted by length and then lexicographically.

Parameters

U: an unsigned type that can hold an index of sorted keys. U.max must be less then length of the table.
C: character type

Meta

Source

See Implementation

mir string_table functions

structs

MirStringTable

templates