| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| multiset.h | 273 lower_bound(const key_type& __x) function in class:__profile::multiset
274 { return iterator(_Base::lower_bound(__x)); }
279 lower_bound(const key_type& __x) const function in class:__profile::multiset
280 { return const_iterator(_Base::lower_bound(__x)); }
|
| set.h | 283 lower_bound(const key_type& __x) function in class:__profile::set
284 { return iterator(_Base::lower_bound(__x)); }
289 lower_bound(const key_type& __x) const function in class:__profile::set
290 { return const_iterator(_Base::lower_bound(__x)); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_multiset.h | 612 lower_bound(const key_type& __x) function in class:multiset
613 { return _M_t.lower_bound(__x); }
616 lower_bound(const key_type& __x) const function in class:multiset
617 { return _M_t.lower_bound(__x); }
645 * std::make_pair(c.lower_bound(val),
|
| stl_set.h | 633 lower_bound(const key_type& __x) function in class:set
634 { return _M_t.lower_bound(__x); }
637 lower_bound(const key_type& __x) const function in class:set
638 { return _M_t.lower_bound(__x); }
666 * std::make_pair(c.lower_bound(val),
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| debug_fn_imps.hpp | 75 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| multiset.h | 274 lower_bound(const key_type& __x) function in class:__profile::multiset
275 { return iterator(_Base::lower_bound(__x)); }
280 lower_bound(const key_type& __x) const function in class:__profile::multiset
281 { return const_iterator(_Base::lower_bound(__x)); }
|
| set.h | 284 lower_bound(const key_type& __x) function in class:__profile::set
285 { return iterator(_Base::lower_bound(__x)); }
290 lower_bound(const key_type& __x) const function in class:__profile::set
291 { return const_iterator(_Base::lower_bound(__x)); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_multiset.h | 666 lower_bound(const key_type& __x) function in class:multiset
667 { return _M_t.lower_bound(__x); }
670 lower_bound(const key_type& __x) const function in class:multiset
671 { return _M_t.lower_bound(__x); }
699 * std::make_pair(c.lower_bound(val),
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/pat_trie_/ |
| debug_fn_imps.hpp | 75 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pat_trie_/ |
| debug_fn_imps.hpp | 75 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
|
| /system/netd/server/ |
| UidRanges.cpp | 24 auto iter = std::lower_bound(mRanges.begin(), mRanges.end(), Range(uid, uid));
|
| /external/chromium_org/ash/shelf/ |
| shelf_model.cc | 136 // Since lower_bound only checks weights against each other, we do not need
142 return std::lower_bound(items_.begin(), items_.end(), weight_dummy,
149 return std::lower_bound(items_.begin(), items_.end(), weight_dummy,
175 index = std::max(std::lower_bound(items_.begin(), items_.end(), weight_dummy,
|
| /external/chromium_org/third_party/webrtc/modules/audio_coding/main/acm2/ |
| nack.cc | 109 NackList::const_iterator lower_bound = nack_list_.lower_bound( local
113 for (NackList::iterator it = nack_list_.begin(); it != lower_bound; ++it)
|
| /external/opencv/cv/src/ |
| cvemd.cpp | 121 CvEMDState * state, float *lower_bound,
155 float *lower_bound,
218 if( lower_bound )
259 &state, lower_bound, local_buffer_ptr,
262 if( result > 0 && lower_bound )
264 emd = *lower_bound;
338 CvEMDState* state, float* lower_bound,
451 if( lower_bound && equal_sums ) /* check lower bound */
477 i = *lower_bound <= lb;
478 *lower_bound = lb
[all...] |
| /external/chromium_org/ui/gfx/ |
| color_analysis.cc | 223 const HSL& lower_bound,
344 if (IsWithinHSLRange(hsl, lower_bound, upper_bound)) {
363 const HSL& lower_bound,
381 lower_bound,
395 const HSL& lower_bound,
408 lower_bound,
|
| /external/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| eval.pass.cpp | 77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
127 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
177 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
227 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
277 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
327 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /external/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| eval.pass.cpp | 77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
127 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
177 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
227 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
277 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
327 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } function in class:_Rb_tree
610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); }
613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); }
617 __p.second = lower_bound(__x);
630 __p.second = lower_bound(__x);
|
| /external/chromium_org/chrome/browser/ |
| internal_auth.cc | 223 std::deque<int64>::iterator it = std::lower_bound(
234 std::lower_bound(used_ticks_.begin(), used_ticks_.end(),
373 std::lower_bound(used_ticks_.begin(), used_ticks_.end(),
409 std::lower_bound(used_ticks_.begin(), used_ticks_.end(), tick), tick);
|
