\returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */
| 123 | |
| 124 | /** \returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */ |
| 125 | inline Index searchLowerIndex(Index key) const |
| 126 | { |
| 127 | return searchLowerIndex(0, m_size, key); |
| 128 | } |
| 129 | |
| 130 | /** \returns the largest \c k in [start,end) such that for all \c j in [start,k) index[\c j]\<\a key */ |
| 131 | inline Index searchLowerIndex(Index start, Index end, Index key) const |