BTree.opBinaryRight

Search the B-Tree by key.

struct BTree(K, V, alias less = "a < b", bool allowDuplicates = false, bool duplicateKeyIsUB = false)

nothrow @nogc inout

inout(V)*

opBinaryRight

(

string op

)

(

)

if (

op == "in"

)

Parameters

Type: inout(V)*

A pointer to the corresponding V value. null if not found.

Note: In case of duplicate keys, it returns one of those in unspecified order.