View source code
Display the source code in std/container/rbtree.d from which this page was generated on
github.
Improve this page
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.
Page wiki
View or edit the community-maintained wiki page associated with this page.
Function std.container.rbtree.RedBlackTree.upperBound
Get a range from the container with all elements that are > e according
to the less comparator
Prototype
RedBlackTree.Range upperBound( RedBlackTree. Elem e );
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 ).