| 1044 | } |
| 1045 | |
| 1046 | iterator lower_bound(const T &value) FL_NOEXCEPT { |
| 1047 | iterator first = mArray.begin(); |
| 1048 | iterator last = mArray.end(); |
| 1049 | while (first != last) { |
| 1050 | iterator mid = first + (last - first) / 2; |
| 1051 | if (mLess(*mid, value)) { |
| 1052 | first = mid + 1; |
| 1053 | } else { |
| 1054 | last = mid; |
| 1055 | } |
| 1056 | } |
| 1057 | return first; |
| 1058 | } |
| 1059 | |
| 1060 | const_iterator lower_bound(const T &value) const FL_NOEXCEPT { |
| 1061 | return const_cast<SortedHeapVector *>(this)->lower_bound(value); |
no test coverage detected