redBlackTree

fnauto redBlackTree(E)(E[] elems...)

Convenience function for creating a RedBlackTree!E from a list of values.

Parameters

`allowDuplicates`	Whether duplicates should be allowed (optional, default: false)
`less`	predicate to sort by (optional)
`elems`	elements to insert into the rbtree (variadic arguments)
`range`	range elements to insert into the rbtree (alternative to elems)

fnauto redBlackTree(bool allowDuplicates, E)(E[] elems...)

Ditto

fnauto redBlackTree(alias less, E)(E[] elems...) if (is(typeof(binaryFun!less(E.init, E.init))))

Ditto

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

Ditto

fnauto redBlackTree(Stuff)(Stuff range) if (isInputRange!Stuff && !isArray!(Stuff))

Ditto

fnauto redBlackTree(bool allowDuplicates, Stuff)(Stuff range) if (isInputRange!Stuff && !isArray!(Stuff))

Ditto

auto redBlackTree(alias  less,  Stuff)(Stuff range) if (  is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
     &&  isInputRange!Stuff && !isArray!(Stuff))

Ditto

auto redBlackTree(alias  less,  bool  allowDuplicates,  Stuff)(Stuff range) if (  is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
     &&  isInputRange!Stuff && !isArray!(Stuff))

Ditto