BTreeMap.insert

Insertion

class BTreeMap(KeyT, ValueT, size_t NodeSizeV = 256, alias KeyLessF = "a < b")
void
insert
(
K
V
)
(
K key
,)
if (
isImplicitlyConvertible!(K, KeyT) &&
isImplicitlyConvertible!(V, ValueT)
)

Meta