/external/openssh/openbsd-compat/ |
H A D | 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) argument 121 if (upper_bound < 2) 125 min = 0x100000000UL % upper_bound; 127 /* Calculate (2**32 % upper_bound) avoiding 64-bit math */ 128 if (upper_bound > [all...] |
/external/stlport/test/unit/ |
H A D | 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);
|
H A D | multiset_test.cpp | 70 i = s.upper_bound(3); 80 ci = s.upper_bound(3); 93 ci = crs.upper_bound(3);
|
H A D | set_test.cpp | 139 sit = s.upper_bound(5); 162 scit = s.upper_bound(5); 180 scit = crs.upper_bound(5); 409 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); 415 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); 433 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); 439 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); 456 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); 462 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); 480 CPPUNIT_ASSERT( keySet.upper_bound( [all...] |
H A D | map_test.cpp | 138 i = m.upper_bound(3); 248 i = m.upper_bound( 'x' ); 353 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); 359 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); 378 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); 384 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); 402 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); 408 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); 427 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); 433 CPPUNIT_ASSERT( ccont.upper_bound( [all...] |
H A D | equal_test.cpp | 113 it = upper_bound(tv.begin(), tv.end(), 5);
|
/external/oprofile/libpp/ |
H A D | sample_container.cpp | 62 return samples.upper_bound(key); 94 iterator it2 = samples_by_loc.upper_bound(&upper);
|
H A D | symbol_container.cpp | 72 it last = symbols_by_loc.upper_bound(&symbol);
|
/external/chromium-trace/trace-viewer/third_party/python_gflags/ |
H A D | gflags.py | 87 number. Takes optional args lower_bound and upper_bound; 92 optional args lower_bound and upper_bound as for floats. 141 Also, lower_bound and upper_bound for numerical flags are enforced using flag 381 flags: lower_bound, upper_bound (for flags that specify bounds), 2138 if parser.lower_bound is not None or parser.upper_bound is not None: 2448 (self.upper_bound is not None and val > self.upper_bound)) 2459 if self.upper_bound is not None: 2460 _WriteSimpleXMLElement(outfile, 'upper_bound', self.upper_bound, inden [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _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/stlport/stlport/stl/ |
H A D | _map.h | 220 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:map 222 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:map 396 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } function in class:multimap 398 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } function in class:multimap
|
H A D | _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
|
H A D | _tree.h | 605 iterator upper_bound(const _KT& __x) { return iterator(_M_upper_bound(__x)); } function in class:_Rb_tree 607 const_iterator upper_bound(const _KT& __x) const { return const_iterator(_M_upper_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)); }
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | httpcommon.h | 340 return headers_.upper_bound(name); 346 return headers_.upper_bound(name); 372 return headers_.upper_bound(ToString(header)); 378 return headers_.upper_bound(ToString(header));
|
/external/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 91 iterator I = std::upper_bound(Rep.begin(), Rep.end(), K, Compare());
|
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 278 iterator upper_bound(const _KT& __x) function in class:set 279 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); } 281 const_iterator upper_bound(const _KT& __x) const function in class:set 282 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); } 533 iterator upper_bound(const _KT& __x) function in class:multiset 534 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); } 536 const_iterator upper_bound(const _KT& __x) const function in class:multiset 537 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
|
/external/chromium/testing/gmock/src/ |
H A D | gmock-spec-builders.cc | 193 const int upper_bound = cardinality().ConservativeUpperBound(); local 197 if (action_count > upper_bound || 198 (action_count == upper_bound && repeated_action_specified_)) {
|
/external/clang/lib/Edit/ |
H A D | EditedSource.cpp | 94 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); 148 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); 321 FileEditsTy::iterator I = FileEdits.upper_bound(Offs);
|
/external/llvm/lib/CodeGen/ |
H A D | LiveInterval.cpp | 35 // This algorithm is basically std::upper_bound. 36 // Unfortunately, std::upper_bound cannot be used with mixed types until we 117 i = std::upper_bound(i, ie, j->start); 123 j = std::upper_bound(j, je, i->start); 293 iterator it = std::upper_bound(From, ranges.end(), Start); 345 iterator I = std::upper_bound(begin(), end(), Kill.getPrevSlot()); 545 iterator LE = end(), LI = std::upper_bound(begin(), LE, *RI);
|
/external/clang/lib/Lex/ |
H A D | PreprocessingRecord.cpp | 240 I = std::upper_bound(PreprocessedEntities.begin(), 292 pp_iter I = std::upper_bound(PreprocessedEntities.begin(), 440 upp = std::upper_bound(low, CondDirectiveLocs.end(),
|
/external/chromium/chrome/browser/sync/engine/ |
H A D | change_reorder_buffer.cc | 89 return links_.upper_bound(
|
/external/clang/lib/ARCMigrate/ |
H A D | TransEmptyStatementsAndDealloc.cpp | 47 I = std::upper_bound(MacroLocs.begin(), MacroLocs.end(), SemiLoc,
|
/external/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 78 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
|
/external/elfutils/tests/ |
H A D | run-show-die-info.sh | 180 Attrs : upper_bound type 433 Attrs : upper_bound type 501 Attrs : upper_bound type 735 Attrs : upper_bound type 751 Attrs : upper_bound type
|
/external/flac/libFLAC/ |
H A D | stream_decoder.c | 2982 FLAC__uint64 first_frame_offset = decoder->private_->first_frame_offset, lower_bound, upper_bound, lower_bound_sample, upper_bound_sample, this_frame_sample; local 3027 upper_bound = stream_length; 3040 FLAC__uint64 new_upper_bound = upper_bound; 3076 upper_bound = new_upper_bound; 3098 if (lower_bound_sample >= upper_bound_sample || lower_bound > upper_bound) { 3105 pos = (FLAC__int64)lower_bound + (FLAC__int64)((FLAC__double)(FLAC__int64)(target_sample - lower_bound_sample) / (FLAC__double)(FLAC__int64)(upper_bound_sample - lower_bound_sample) * (FLAC__double)(FLAC__int64)(upper_bound - lower_bound)) - approx_bytes_per_frame; 3107 pos = (FLAC__int64)lower_bound + (FLAC__int64)((FLAC__double)(target_sample - lower_bound_sample) / (FLAC__double)(upper_bound_sample - lower_bound_sample) * (FLAC__double)(upper_bound - lower_bound)) - approx_bytes_per_frame; 3111 if(upper_bound - lower_bound < 0xffffffff) 3112 pos = (FLAC__int64)lower_bound + (FLAC__int64)(((target_sample - lower_bound_sample) * (upper_bound - lower_bound)) / (upper_bound_sample - lower_bound_sample)) - approx_bytes_per_frame; 3114 pos = (FLAC__int64)lower_bound + (FLAC__int64)((((target_sample - lower_bound_sample)>>8) * ((upper_bound [all...] |