BiMap

Bidirectional map between key-and-values of type X and Y inspired by C++ Boost Bimap (boost::bimap).

@safe pure

struct BiMap (

X

Y

alias Map = Y[X]

) {

void insert(X x, Y y);

bool contains(X x, Y y);

void clear();

bool empty();

size_t length();

const(LeftMap) left();

const(RightMap) right();

}

Members

Functions

clear void clear(): Clear contents.
contains bool contains(X x, Y y): Check if (x, y) is stored.
empty bool empty(): Check if empty.
insert void insert(X x, Y y): Insert (x, y).
left const(LeftMap) left(): Access to left map must be non-mutating.
length size_t length(): Get length.
right const(RightMap) right(): Access to right map must be non-mutating.

Examples

test with builtin associative arrays

alias HashMap(Key, Value) = Value[Key];
BiMap!(size_t, string, HashMap) bm;

bm.insert(42, "42");

assert(bm.left.length == 1);
assert(bm.right.length == 1);

assert(bm.contains(42, "42"));

bm.clear();
assert(bm.empty);

See Also

http://www.boost.org/doc/libs/1_65_1/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html

Meta

Source

See Implementation

nxt bimap modules