Display the source code in std/container/rbtree.d from which this page was generated on github.

If you spot a problem with this page, click here to create a Bugzilla issue.

Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

Function `std.container.rbtree.RedBlackTree.lowerBound`

Get a range from the container with all elements that are < e according to the less comparator


						
				RedBlackTree.Range lowerBound
				(
				

				  RedBlackTree.Elem e
				

				);
				

				

				RedBlackTree.ConstRange lowerBound
				(
				

				  RedBlackTree.Elem e
				

				) const;
				

				

				RedBlackTree.ImmutableRange lowerBound
				(
				

				  RedBlackTree.Elem e
				

				) immutable;

Complexity

Ο(log(n))

Authors

Steven Schveighoffer, Andrei Alexandrescu

License

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).