HomeSort by relevance Sort by last modified time
    Searched refs:lower_bound (Results 101 - 125 of 365) sorted by null

1 2 3 45 6 7 8 91011>>

  /system/update_engine/payload_generator/
extent_ranges.cc 196 auto lower = extent_set_.lower_bound(ExtentForRange(block, 1));
202 auto upper = extent_set_.lower_bound(ExtentForRange(block + 1, 0));
265 auto lower = extent_set.lower_bound(extent);
266 // We need to decrement the lower_bound to look at the extent that could
270 auto upper = extent_set.lower_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/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/opencv3/modules/imgproc/src/
emd.cpp 121 CvEMDState * state, float *lower_bound,
154 float *lower_bound,
212 if( lower_bound )
253 &state, lower_bound, local_buf );
255 if( result > 0 && lower_bound )
257 emd = *lower_bound;
327 CvEMDState* state, float* lower_bound,
431 if( lower_bound && equal_sums ) /* check lower bound */
457 i = *lower_bound <= lb;
458 *lower_bound = lb
    [all...]
  /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/
eval.pass.cpp 79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
129 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
179 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
229 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
279 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
329 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
eval_param.pass.cpp 78 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
  /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;
eval_param.pass.cpp 76 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/current/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);
  /device/google/contexthub/firmware/src/drivers/window_orientation/
window_orientation.c 135 int lower_bound, upper_bound; local
145 lower_bound = rotation * 90 - 45
149 && (orientation_angle < lower_bound + 360)) {
153 if (orientation_angle < lower_bound) {
  /external/clang/include/clang/Serialization/
ContinuousRangeMap.h 74 iterator I = std::lower_bound(Rep.begin(), Rep.end(), Val, Compare());
  /external/llvm/include/llvm/MC/
MCSubtargetInfo.h 163 auto Found = std::lower_bound(ProcDesc.begin(), ProcDesc.end(), CPU);
  /external/llvm/lib/DebugInfo/DWARF/
DWARFDebugAranges.cpp 118 std::lower_bound(begin, end, range);
  /external/llvm/lib/MC/
MCSubtargetInfo.cpp 89 std::lower_bound(ProcSchedModels, ProcSchedModels+NumProcs, CPU);
  /external/webrtc/webrtc/base/
httpcommon.h 331 return headers_.lower_bound(name);
337 return headers_.lower_bound(name);
363 return headers_.lower_bound(ToString(header));
369 return headers_.lower_bound(ToString(header));
  /frameworks/compile/mclinker/lib/LD/
DiagnosticInfos.cpp 89 std::lower_bound(static_info, static_info + info_size, key);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/
fixed_mapping.hpp 94 iterator it = boost::detail::lower_bound( m_map.begin(), m_map.end(), key, p1() );
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
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_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.11-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); }
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/resize_policy/
hash_prime_size_policy_imp.hpp 153 const std::size_t* p_lower = std::lower_bound(detail::g_a_sizes,

Completed in 963 milliseconds

1 2 3 45 6 7 8 91011>>