| /minix3/external/bsd/libc++/dist/libcxx/test/std/containers/associative/set/ |
| H A D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/containers/associative/map/map.ops/ |
| H A D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
| H A D | upper_bound0.pass.cpp | 33 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound2.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound3.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound1.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/containers/associative/set/ |
| H A D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/containers/associative/map/map.ops/ |
| H A D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
| H A D | upper_bound.pass.cpp | 44 R r = m.upper_bound(4); in main() 46 r = m.upper_bound(5); in main() 48 r = m.upper_bound(6); in main() 50 r = m.upper_bound(7); in main() 52 r = m.upper_bound(8); in main() 54 r = m.upper_bound(9); in main() 56 r = m.upper_bound(10); in main() 74 R r = m.upper_bound(4); in main() 76 r = m.upper_bound(5); in main() 78 r = m.upper_bound(6); in main() [all …]
|
| H A D | upper_bound0.pass.cpp | 33 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound1.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound3.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| H A D | upper_bound2.fail.cpp | 36 M().upper_bound(C2Int{5}); in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/containers/associative/multiset/ |
| H A D | upper_bound.pass.cpp | 43 R r = m.upper_bound(4); in main() 45 r = m.upper_bound(5); in main() 47 r = m.upper_bound(6); in main() 49 r = m.upper_bound(7); in main() 51 r = m.upper_bound(8); in main() 53 r = m.upper_bound(9); in main() 55 r = m.upper_bound(11); in main() 73 R r = m.upper_bound(4); in main() 75 r = m.upper_bound(5); in main() 77 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/containers/associative/multiset/ |
| H A D | upper_bound.pass.cpp | 43 R r = m.upper_bound(4); in main() 45 r = m.upper_bound(5); in main() 47 r = m.upper_bound(6); in main() 49 r = m.upper_bound(7); in main() 51 r = m.upper_bound(8); in main() 53 r = m.upper_bound(9); in main() 55 r = m.upper_bound(11); in main() 73 R r = m.upper_bound(4); in main() 75 r = m.upper_bound(5); in main() 77 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/containers/associative/multimap/multimap.ops/ |
| H A D | upper_bound.pass.cpp | 43 R r = m.upper_bound(4); in main() 45 r = m.upper_bound(5); in main() 47 r = m.upper_bound(6); in main() 49 r = m.upper_bound(7); in main() 51 r = m.upper_bound(8); in main() 53 r = m.upper_bound(9); in main() 55 r = m.upper_bound(10); in main() 73 R r = m.upper_bound(4); in main() 75 r = m.upper_bound(5); in main() 77 r = m.upper_bound(6); in main() [all …]
|
| /minix3/external/bsd/libevent/dist/ |
| H A D | arc4random.c | 523 arc4random_uniform(unsigned int upper_bound) in arc4random_uniform() argument 527 if (upper_bound < 2) in arc4random_uniform() 531 min = 0x100000000UL % upper_bound; in arc4random_uniform() 534 if (upper_bound > 0x80000000) in arc4random_uniform() 535 min = 1 + ~upper_bound; /* 2**32 - upper_bound */ in arc4random_uniform() 538 min = ((0xffffffff - (upper_bound * 2)) + 1) % upper_bound; in arc4random_uniform() 554 return r % upper_bound; in arc4random_uniform()
|
| /minix3/external/bsd/libc++/dist/libcxx/include/ |
| H A D | set | 153 iterator upper_bound(const key_type& k); 154 const_iterator upper_bound(const key_type& k) const; 156 iterator upper_bound(const K& x); // C++14 158 const_iterator upper_bound(const K& x) const; // C++14 333 iterator upper_bound(const key_type& k); 334 const_iterator upper_bound(const key_type& k) const; 336 iterator upper_bound(const K& x); // C++14 338 const_iterator upper_bound(const K& x) const; // C++14 693 iterator upper_bound(const key_type& __k) 694 {return __tree_.upper_bound(__k);} [all …]
|
| H A D | map | 188 iterator upper_bound(const key_type& k); 189 const_iterator upper_bound(const key_type& k) const; 191 iterator upper_bound(const K& x); // C++14 193 const_iterator upper_bound(const K& x) const; // C++14 381 iterator upper_bound(const key_type& k); 382 const_iterator upper_bound(const key_type& k) const; 384 iterator upper_bound(const K& x); // C++14 386 const_iterator upper_bound(const K& x) const; // C++14 1290 iterator upper_bound(const key_type& __k) 1291 {return __tree_.upper_bound(__k);} [all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| H A D | upper_bound.pass.cpp | 27 Iter i = std::upper_bound(first, last, value); in test()
|
| H A D | upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| H A D | upper_bound.pass.cpp | 27 Iter i = std::upper_bound(first, last, value); in test()
|
| H A D | upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
|
| /minix3/external/bsd/llvm/dist/clang/lib/Edit/ |
| H A D | EditedSource.cpp | 93 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); in commitInsertFromRange() 147 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); in commitRemove() 393 FileEditsTy::iterator I = FileEdits.upper_bound(Offs); in getActionForOffset()
|
| /minix3/external/bsd/llvm/dist/llvm/test/Transforms/SimplifyCFG/ |
| H A D | multiple-phis.ll | 11 define i32 @upper_bound(i32* %r, i32 %high, i32 %k) nounwind {
|