| /bionic/libc/upstream-openbsd/lib/libc/crypt/ |
| arc4random_uniform.c | 23 * Calculate a uniformly distributed random number less than upper_bound
27 * returned is outside the range [0, 2**32 % upper_bound). This
29 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound)
30 * after reduction modulo upper_bound.
33 arc4random_uniform(uint32_t upper_bound)
37 if (upper_bound < 2)
41 min = -upper_bound % upper_bound;
55 return r % upper_bound;
[all...] |
| /external/libcxx/test/std/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;
43 R r = m.upper_bound(4);
45 r = m.upper_bound(5);
47 r = m.upper_bound(6);
49 r = m.upper_bound(7);
51 r = m.upper_bound(8);
53 r = m.upper_bound(9);
55 r = m.upper_bound(11);
73 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;
43 R r = m.upper_bound(4);
45 r = m.upper_bound(5);
47 r = m.upper_bound(6);
49 r = m.upper_bound(7);
51 r = m.upper_bound(8);
53 r = m.upper_bound(9);
55 r = m.upper_bound(11);
73 R r = m.upper_bound(4)
[all...] |
| /external/libcxx/test/std/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;
42 R r = m.upper_bound(5);
44 r = m.upper_bound(7);
46 r = m.upper_bound(9);
48 r = m.upper_bound(11);
50 r = m.upper_bound(13);
52 r = m.upper_bound(15);
54 r = m.upper_bound(17);
56 r = m.upper_bound(19)
[all...] |
| /external/libcxx/test/std/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;
42 R r = m.upper_bound(5);
44 r = m.upper_bound(7);
46 r = m.upper_bound(9);
48 r = m.upper_bound(11);
50 r = m.upper_bound(13);
52 r = m.upper_bound(15);
54 r = m.upper_bound(17);
56 r = m.upper_bound(19)
[all...] |
| /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;
42 R r = m.upper_bound(5);
44 r = m.upper_bound(7);
46 r = m.upper_bound(9);
48 r = m.upper_bound(11);
50 r = m.upper_bound(13);
52 r = m.upper_bound(15);
54 r = m.upper_bound(17);
56 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;
42 R r = m.upper_bound(5);
44 r = m.upper_bound(7);
46 r = m.upper_bound(9);
48 r = m.upper_bound(11);
50 r = m.upper_bound(13);
52 r = m.upper_bound(15);
54 r = m.upper_bound(17);
56 r = m.upper_bound(19)
[all...] |
| /external/libcxx/test/std/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;
43 R r = m.upper_bound(4);
45 r = m.upper_bound(5);
47 r = m.upper_bound(6);
49 r = m.upper_bound(7);
51 r = m.upper_bound(8);
53 r = m.upper_bound(9);
55 r = m.upper_bound(10);
73 R r = m.upper_bound(4)
[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;
43 R r = m.upper_bound(4);
45 r = m.upper_bound(5);
47 r = m.upper_bound(6);
49 r = m.upper_bound(7);
51 r = m.upper_bound(8);
53 r = m.upper_bound(9);
55 r = m.upper_bound(10);
73 R r = m.upper_bound(4)
[all...] |
| /external/google-breakpad/src/processor/ |
| static_address_map-inl.h | 50 // upper_bound gives the first element whose key is greater than address,
52 // Decrement the iterator to get there, but not if the upper_bound already
56 MapConstIterator iterator = map_.upper_bound(address);
|
| address_map-inl.h | 69 // upper_bound gives the first element whose key is greater than address,
71 // Decrement the iterator to get there, but not if the upper_bound already
74 MapConstIterator iterator = map_.upper_bound(address);
|
| /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);
|
| /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);
|
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| DWARFDIECollection.cpp | 25 iterator insert_pos = upper_bound(m_dies.begin(), end_pos, die);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 71 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 71 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ov_tree_map_/ |
| debug_fn_imps.hpp | 68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
| /external/jemalloc/src/ |
| quarantine.c | 18 size_t upper_bound);
109 quarantine_drain(tsd_t *tsd, quarantine_t *quarantine, size_t upper_bound)
112 while (quarantine->curbytes > upper_bound && quarantine->curobjs > 0)
134 size_t upper_bound = (opt_quarantine >= usize) ? opt_quarantine local
136 quarantine_drain(tsd, quarantine, upper_bound);
|
| /external/lldb/source/Breakpoint/ |
| BreakpointSiteList.cpp | 209 BreakpointSiteList::FindInRange (lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSiteList &bp_site_list) const
211 if (lower_bound > upper_bound)
218 || (*lower).first >= upper_bound)
233 upper = m_bp_site_list.upper_bound(upper_bound);
|
