© 2008 Nokia Corporation. All rights reserved. This documentation can be used in the connection with this Product to help and support the user.
lower_bound - A version of binary search that returns the first position where the specified value can be inserted without violating the ordering.
libstdcpp.lib
templateForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
None
For additional information or queries on this page send feedback.
|
© 2008 Nokia Corporation. All rights reserved. This documentation can be used in the connection with this Product to help and support the user. |
|