BTree.contains

Search for an element.

struct BTree(K, V, alias less = "a < b", bool allowDuplicates = false, bool duplicateKeyIsUB = false)
nothrow @nogc const
bool
contains
(
K key
)

Return Value

Type: bool

true if the element is present.

Meta