std/container/rbtree.d

737  * elements `a` and `b`, $(D less(a, b) == !less(b, a)). $(D less(a, a)) should
741  * once continues to add more elements.  If it is `false`, duplicate elements are
742  * ignored on insertion.  If duplicates are allowed, then new elements are
743  * inserted after all existing duplicate elements.
970      * Check if any elements exist in the container.  Returns `false` if at least
979         Returns the number of elements in the container.
990      * copy of the elements.
1013      * Fetch a range that spans all the elements in the container.
1237      * Removes all elements from the container.
1260      * Returns: The number of elements inserted.
1278      * Insert a range of elements in the container.  Note that this does not
1281      * Returns: The number of elements inserted.
1423         Returns: A range containing all of the elements that were after the
1426         Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1467         Returns: A range containing all of the elements that were after the
1470         Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1518        Removes elements from the container that are equal to the given values
1523        Returns: The number of elements removed.
1525        Complexity: $(BIGOH m log(n)) (where m is the number of elements to remove)
1668      * Get a range from the container with all elements that are > e according
1691      * Get a range from the container with all elements that are < e according
1714      * Get a range from the container with all elements that are == e according
1864      * Constructor. Pass in an array of elements, or individual elements to
1874      * Constructor. Pass in a range of elements to initialize the tree with.
1975         elems = elements to insert into the rbtree (variadic arguments)
1976         range = range elements to insert into the rbtree (alternative to elems)
2208 // const/immutable elements (https://issues.dlang.org/show_bug.cgi?id=17519)