/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
find_fn_imps.hpp | 44 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 63 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/ |
find_fn_imps.hpp | 44 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 63 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
|
/bionic/libc/bionic/ |
mbrtoc32.cpp | 78 char32_t lower_bound; local 86 lower_bound = 0; 90 lower_bound = 0x80; 94 lower_bound = 0x800; 98 lower_bound = 0x10000; 126 if (c32 < lower_bound) {
|
/external/google-breakpad/src/processor/ |
static_map-inl.h | 59 // find(), lower_bound() and upper_bound() implement binary search algorithm. 83 StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { function in class:google_breakpad::StaticMap
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
find_fn_imps.hpp | 160 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC 166 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 176 point_iterator l_bound_it = lower_bound(r_key); 194 point_const_iterator l_bound_it = lower_bound(r_key);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
find_fn_imps.hpp | 160 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC 166 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 176 point_iterator l_bound_it = lower_bound(r_key); 194 point_const_iterator l_bound_it = lower_bound(r_key);
|
/external/eigen/Eigen/src/Core/ |
ConditionEstimator.h | 80 // lower_bound is a lower bound on 84 RealScalar lower_bound = v.template lpNorm<1>(); local 86 return lower_bound; 91 RealScalar old_lower_bound = lower_bound; 112 lower_bound = v.template lpNorm<1>(); 113 if (lower_bound <= old_lower_bound) { 114 // Break if the gradient step did not increase the lower_bound. 121 old_lower_bound = lower_bound; 141 return numext::maxi(lower_bound, alternate_lower_bound);
|
/system/bt/packet/tests/base/ |
iterator_test.cc | 33 auto lower_bound = bounds.first; local 36 return TestPacket::Make(test_l2cap_data, lower_bound, upper_bound);
|
/external/webrtc/webrtc/modules/audio_coding/neteq/ |
nack.cc | 109 NackList::const_iterator lower_bound = local 110 nack_list_.lower_bound(static_cast<uint16_t>( 113 for (NackList::iterator it = nack_list_.begin(); it != lower_bound; ++it)
|
/external/webrtc/webrtc/modules/audio_processing/aec/ |
system_delay_unittest.cc | 245 int lower_bound = WebRtcAec_extended_filter_enabled(self_->aec) local 248 EXPECT_LE(lower_bound, WebRtcAec_system_delay(self_->aec));
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
set.h | 313 lower_bound(const key_type& __x) function in class:__profile::set 314 { return iterator(_Base::lower_bound(__x)); } 319 lower_bound(const key_type& __x) const function in class:__profile::set 320 { return const_iterator(_Base::lower_bound(__x)); }
|
map.h | 429 lower_bound(const key_type& __x) function in class:__profile::map 432 return iterator(_Base::lower_bound(__x)); 436 lower_bound(const key_type& __x) const function in class:__profile::map 439 return const_iterator(_Base::lower_bound(__x));
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
set.h | 313 lower_bound(const key_type& __x) function in class:__profile::set 314 { return iterator(_Base::lower_bound(__x)); } 319 lower_bound(const key_type& __x) const function in class:__profile::set 320 { return const_iterator(_Base::lower_bound(__x)); }
|
/art/libartbase/base/ |
safe_map.h | 78 iterator lower_bound(const K& k) { return map_.lower_bound(k); } function in class:art::SafeMap 79 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); } function in class:art::SafeMap 135 auto lb = lower_bound(k);
|
/external/google-breakpad/src/testing/src/ |
gmock-spec-builders.cc | 194 const int lower_bound = cardinality().ConservativeLowerBound(); local 200 } else if (0 < action_count && action_count < lower_bound &&
|
/external/googletest/googlemock/src/ |
gmock-spec-builders.cc | 193 const int lower_bound = cardinality().ConservativeLowerBound(); local 199 } else if (0 < action_count && action_count < lower_bound &&
|
/external/v8/testing/gmock/src/ |
gmock-spec-builders.cc | 194 const int lower_bound = cardinality().ConservativeLowerBound(); local 200 } else if (0 < action_count && action_count < lower_bound &&
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_map.h | 461 iterator __i = lower_bound(__k); 481 iterator __i = lower_bound(__k); 503 iterator __i = lower_bound(__k); 512 const_iterator __i = lower_bound(__k); 863 lower_bound(const key_type& __x) function in class:map 864 { return _M_t.lower_bound(__x); } 878 lower_bound(const key_type& __x) const function in class:map 879 { return _M_t.lower_bound(__x); } [all...] |
stl_multimap.h | 769 lower_bound(const key_type& __x) function in class:multimap 770 { return _M_t.lower_bound(__x); } 784 lower_bound(const key_type& __x) const function in class:multimap 785 { return _M_t.lower_bound(__x); } 815 * std::make_pair(c.lower_bound(val), 832 * std::make_pair(c.lower_bound(val), [all...] |
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),
|
stl_set.h | 683 lower_bound(const key_type& __x) function in class:set 684 { return _M_t.lower_bound(__x); } 687 lower_bound(const key_type& __x) const function in class:set 688 { return _M_t.lower_bound(__x); } 716 * std::make_pair(c.lower_bound(val),
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
map.h | 391 lower_bound(const key_type& __x) function in class:__debug::map 392 { return iterator(_Base::lower_bound(__x), this); } 395 lower_bound(const key_type& __x) const function in class:__debug::map 396 { return const_iterator(_Base::lower_bound(__x), this); }
|
multimap.h | 374 lower_bound(const key_type& __x) function in class:__debug::multimap 375 { return iterator(_Base::lower_bound(__x), this); } 378 lower_bound(const key_type& __x) const function in class:__debug::multimap 379 { return const_iterator(_Base::lower_bound(__x), this); }
|
multiset.h | 361 lower_bound(const key_type& __x) function in class:__debug::multiset 362 { return iterator(_Base::lower_bound(__x), this); } 367 lower_bound(const key_type& __x) const function in class:__debug::multiset 368 { return const_iterator(_Base::lower_bound(__x), this); }
|
set.h | 370 lower_bound(const key_type& __x) function in class:__debug::set 371 { return iterator(_Base::lower_bound(__x), this); } 376 lower_bound(const key_type& __x) const function in class:__debug::set 377 { return const_iterator(_Base::lower_bound(__x), this); }
|