| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 14 // iterator upper_bound(const key_type& k);
15 // const_iterator upper_bound(const key_type& k) const;
41 R r = m.upper_bound(5);
43 r = m.upper_bound(7);
45 r = m.upper_bound(9);
47 r = m.upper_bound(11);
49 r = m.upper_bound(13);
51 r = m.upper_bound(15);
53 r = m.upper_bound(17);
55 r = m.upper_bound(19)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| upper_bound.pass.cpp | 14 // iterator upper_bound(const key_type& k);
15 // const_iterator upper_bound(const key_type& k) const;
41 R r = m.upper_bound(5);
43 r = m.upper_bound(7);
45 r = m.upper_bound(9);
47 r = m.upper_bound(11);
49 r = m.upper_bound(13);
51 r = m.upper_bound(15);
53 r = m.upper_bound(17);
55 r = m.upper_bound(19)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| upper_bound.pass.cpp | 14 // iterator upper_bound(const key_type& k);
15 // const_iterator upper_bound(const key_type& k) const;
42 R r = m.upper_bound(4);
44 r = m.upper_bound(5);
46 r = m.upper_bound(6);
48 r = m.upper_bound(7);
50 r = m.upper_bound(8);
52 r = m.upper_bound(9);
54 r = m.upper_bound(10);
72 R r = m.upper_bound(4)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| upper_bound.pass.cpp | 14 // iterator upper_bound(const key_type& k);
15 // const_iterator upper_bound(const key_type& k) const;
42 R r = m.upper_bound(4);
44 r = m.upper_bound(5);
46 r = m.upper_bound(6);
48 r = m.upper_bound(7);
50 r = m.upper_bound(8);
52 r = m.upper_bound(9);
54 r = m.upper_bound(11);
72 R r = m.upper_bound(4)
[all...] |
| /external/openssh/openbsd-compat/ |
| bsd-arc4random.c | 107 * Calculate a uniformly distributed random number less than upper_bound
111 * returned is outside the range [0, 2**32 % upper_bound). This
113 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound)
114 * after reduction modulo upper_bound.
117 arc4random_uniform(u_int32_t upper_bound)
121 if (upper_bound < 2)
125 min = 0x100000000UL % upper_bound;
127 /* Calculate (2**32 % upper_bound) avoiding 64-bit math */
128 if (upper_bound > 0x80000000
[all...] |
| /bionic/libc/bionic/ |
| arc4random.c | 245 * Calculate a uniformly distributed random number less than upper_bound
249 * returned is outside the range [0, 2**32 % upper_bound). This
251 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound)
252 * after reduction modulo upper_bound.
255 arc4random_uniform(u_int32_t upper_bound)
259 if (upper_bound < 2)
263 min = 0x100000000UL % upper_bound;
265 /* Calculate (2**32 % upper_bound) avoiding 64-bit math */
266 if (upper_bound > 0x80000000
[all...] |
| /external/stlport/test/unit/ |
| bound_test.cpp | 46 int location = upper_bound((int*)arr, (int*)arr + 20, 3) - arr;
56 int location = (upper_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less) - str);
|
| multiset_test.cpp | 70 i = s.upper_bound(3);
80 ci = s.upper_bound(3);
93 ci = crs.upper_bound(3);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| bound_test.cpp | 46 int location = upper_bound((int*)arr, (int*)arr + 20, 3) - arr;
56 int location = (upper_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less) - str);
|
| multiset_test.cpp | 70 i = s.upper_bound(3);
80 ci = s.upper_bound(3);
93 ci = crs.upper_bound(3);
|
| /ndk/tests/device/test-stlport/unit/ |
| bound_test.cpp | 46 int location = upper_bound((int*)arr, (int*)arr + 20, 3) - arr;
56 int location = (upper_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less) - str);
|
| multiset_test.cpp | 70 i = s.upper_bound(3);
80 ci = s.upper_bound(3);
93 ci = crs.upper_bound(3);
|
| /external/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/ |
| _tree.h | 192 iterator upper_bound(const _KT& __x) function in class:_Rb_tree
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
195 const_iterator upper_bound(const _KT& __x) const function in class:_Rb_tree
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
206 const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
|
| /external/chromium_org/chrome/browser/sync_file_system/local/ |
| local_file_sync_status.cc | 74 URLCountMap::const_iterator upper = writing_.upper_bound(url);
87 FileSystemURLSet::const_iterator upper = syncing_.upper_bound(url);
|
| /external/oprofile/libpp/ |
| sample_container.cpp | 62 return samples.upper_bound(key);
94 iterator it2 = samples_by_loc.upper_bound(&upper);
|
| /external/stlport/stlport/stl/ |
| _set.h | 200 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:set
202 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:set
371 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:multiset
373 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:multiset
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value);
27 Iter i = std::upper_bound(first, last, value);
|
| upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp);
28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _set.h | 200 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:set
202 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:set
371 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:multiset
373 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:multiset
|
