std/container/rbtree.d

730  * elements $(D a) and $(D b), $(D less(a, b) == !less(b, a)). $(D less(a, a)) should
734  * once continues to add more elements.  If it is $(D false), duplicate elements are
735  * ignored on insertion.  If duplicates are allowed, then new elements are
736  * inserted after all existing duplicate elements.
959      * Check if any elements exist in the container.  Returns $(D false) if at least
968         Returns the number of elements in the container.
979      * copy of the elements.
1002      * Fetch a range that spans all the elements in the container.
1098      * Removes all elements from the container.
1121      * Returns: The number of elements inserted.
1139      * Insert a range of elements in the container.  Note that this does not
1142      * Returns: The number of elements inserted.
1283         Returns: A range containing all of the elements that were after the
1286         Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1327         Returns: A range containing all of the elements that were after the
1330         Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1378        Removes elements from the container that are equal to the given values
1383        Returns: The number of elements removed.
1385        Complexity: $(BIGOH m log(n)) (where m is the number of elements to remove)
1528      * Get a range from the container with all elements that are > e according
1551      * Get a range from the container with all elements that are < e according
1574      * Get a range from the container with all elements that are == e according
1723      * Constructor. Pass in an array of elements, or individual elements to
1733      * Constructor. Pass in a range of elements to initialize the tree with.
1827         elems = elements to insert into the rbtree (variadic arguments)
1828         range = range elements to insert into the rbtree (alternative to elems)
2054 @safe pure unittest // const/immutable elements (issue 17519)