StringMap.opBinaryRight

Complexity: O(log(s)), where s is the number of the keys with the same length as the input key.

struct StringMap(T, U = uint)
@system pure nothrow @nogc inout
inout(T)*
opBinaryRight
(
string op : "in"
)
(
scope const(char)[] key
)
if (
isMutable!T &&
!__traits(hasMember, T, "opPostMove")
&&
__traits(isUnsigned, U)
)

Examples

StringMap!double map;
assert(("c" in map) is null);
map["c"] = 3.0;
assert(*("c" in map) == 3.0);

Meta