RedBlackTree.removeKey

size_t removeKey(U...)(U elems) if (allSatisfy!(isImplicitlyConvertibleToElem, U))

Removes elements from the container that are equal to the given values according to the less comparator. One element is removed for each value given which is in the container. If allowDuplicates is true, duplicates are removed only if duplicate values are given.

Returns

The number of elements removed.

Complexity: m log(n) (where m is the number of elements to remove)

Example:

import std.algorithm, std.container;

auto rbt = redBlackTree!true(0, 1, 1, 1, 4, 5, 7);
rbt.removeKey(1, 4, 7);
assert(equal(rbt[], [0, 1, 1, 5]));

rbt.removeKey(1, 1, 0);
assert(equal(rbt[], [5]));

size_t removeKey(U)(scope U[] elems) if (isImplicitlyConvertible!(U, Elem))

Ditto

size_t removeKey(Stuff)(Stuff stuff) if (isInputRange!Stuff &&
         isImplicitlyConvertible!(ElementType!Stuff,  Elem)  &&
        !isDynamicArray!Stuff)

Ditto