std.container.rbtree.red_black_tree - multiple declarations

Prototypes

auto redBlackTree(E)(
  E[] elems
);

auto redBlackTree(bool allowDuplicates, E)(
  E[] elems
);

auto redBlackTree(alias less, E)(
  E[] elems
);

auto redBlackTree(alias less, bool allowDuplicates, E)(
  E[] elems
)
if (is(typeof(binaryFun!less(E.init, E.init))));

Example

auto rbt1 = redBlackTree(0, 1, 5, 7);
auto rbt2 = redBlackTree!string("hello", "world");
auto rbt3 = redBlackTree!true(0, 1, 5, 7, 5);
auto rbt4 = redBlackTree!"a > b"(0, 1, 5, 7);
auto rbt5 = redBlackTree!("a > b", true)(0.1, 1.3, 5.9, 7.2, 5.9);

All inserts, removes, searches, and any function in general has complexity of Ο(lg(n)).

To use a different comparison than "a < b", pass a different operator string that can be used by std.functional.binaryFun, or pass in a function, delegate, functor, or any type where less(a, b) results in a bool value.

Note that less should produce a strict ordering. That is, for two unequal elements a and b, less(a, b) == !less(b, a). less(a, a) should always equal false.

If allowDuplicates is set to true, then inserting the same element more than once continues to add more elements. If it is false, duplicate elements are ignored on insertion. If duplicates are allowed, then new elements are inserted after all existing duplicate elements.

Inherits from

• Object (base class)

Constructors

Properties

Methods

Inner structs

Aliases

Templates