/external/chromium_org/sandbox/win/src/ |
H A D | policy_engine_opcodes.cc | 161 unsigned long lower_bound, 164 if (lower_bound > upper_bound) { 170 opcode->SetArgument(0, lower_bound); 183 unsigned long lower_bound = 0; local 185 opcode->GetArgument(0, &lower_bound); 187 return((lower_bound <= value) && (upper_bound >= value))? 160 MakeOpUlongMatchRange(int16 selected_param, unsigned long lower_bound, unsigned long upper_bound, uint32 options) argument
|
/external/chromium_org/sync/internal_api/public/base/ |
H A D | ordinal.h | 178 // |lower_bound| and is still valid. |bytes| should be greater than 179 // |lower_bound|. 180 static size_t GetProperLength(const std::string& lower_bound, 415 size_t Ordinal<Traits>::GetProperLength(const std::string& lower_bound, argument 417 CHECK_GT(bytes, lower_bound); 428 bytes.compare(0, truncated_length, lower_bound) > 0)
|
/external/stlport/stlport/stl/ |
H A D | _algo.h | 461 // auxiliary class for lower_bound, etc. 479 // Binary search (lower_bound, upper_bound, equal_range, binary_search). 481 inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, function 491 inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, function
|
H A D | _map.h | 176 iterator __i = lower_bound(__k); 216 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:map 218 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:map 392 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:multimap 394 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:multimap
|
H A D | _set.h | 196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:set 198 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:set 367 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:multiset 369 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:multiset
|
H A D | _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);
|
/external/stlport/stlport/stl/debug/ |
H A D | _tree.h | 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree 186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } 188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree 189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
|
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 272 iterator lower_bound(const _KT& __x) function in class:set 273 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 275 const_iterator lower_bound(const _KT& __x) const function in class:set 276 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 527 iterator lower_bound(const _KT& __x) function in class:multiset 528 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 530 const_iterator lower_bound(const _KT& __x) const function in class:multiset 531 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); }
|
/external/chromium/testing/gmock/src/ |
H A D | gmock-spec-builders.cc | 194 const int lower_bound = cardinality().ConservativeLowerBound(); local 200 } else if (0 < action_count && action_count < lower_bound &&
|
/external/chromium_org/chromeos/network/onc/ |
H A D | onc_validator.cc | 341 int lower_bound, 345 (lower_bound <= actual_value && actual_value <= upper_bound)) { 351 << "', but expected a value in the range [" << lower_bound 517 int lower_bound = 1; local 521 lower_bound, upper_bound)) { 339 FieldExistsAndIsNotInRange(const base::DictionaryValue& object, const std::string &field_name, int lower_bound, int upper_bound) argument
|
/external/chromium_org/ui/views/accessibility/ |
H A D | native_view_accessibility_win.cc | 1154 int nav_dir, int start_id, int lower_bound, int upper_bound) const { 1160 if ((start_id - 1) <= lower_bound) { 1153 IsValidNav( int nav_dir, int start_id, int lower_bound, int upper_bound) const argument
|
/external/opencv/cv/src/ |
H A D | 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 149 cvCalcEMD2( const CvArr* signature_arr1, const CvArr* signature_arr2, int dist_type, CvDistanceFunction dist_func, const CvArr* cost_matrix, CvArr* flow_matrix, float *lower_bound, void *user_param ) argument 334 icvInitEMD( const float* signature1, int size1, const float* signature2, int size2, int dims, CvDistanceFunction dist_func, void* user_param, const float* cost, int cost_step, CvEMDState* state, float* lower_bound, char* local_buffer, int local_buffer_size ) argument [all...] |
/external/sfntly/cpp/src/sample/chromium/ |
H A D | subsetter_impl.cc | 287 IntegerSet::const_iterator left = glyph_ids.lower_bound(range_begin); 288 IntegerSet::const_iterator right = glyph_ids.lower_bound(range_end); 397 int32_t lower_bound = b->first_glyph_index(); local 400 BitmapGlyphInfoMap::const_iterator i = loca.lower_bound(lower_bound); 450 int32_t lower_bound = b->first_glyph_index(); local 453 BitmapGlyphInfoMap::const_iterator i = loca.lower_bound(lower_bound);
|
/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 3025 lower_bound = first_frame_offset; 3039 FLAC__uint64 new_lower_bound = lower_bound; 3075 lower_bound = new_lower_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 < [all...] |
/external/chromium_org/content/browser/indexed_db/ |
H A D | indexed_db_backing_store.cc | 2379 bool lower_bound = range.lower().IsValid(); local 2387 if (!lower_bound) { 2451 bool lower_bound = range.lower().IsValid(); local 2459 if (!lower_bound) {
|
/external/chromium_org/net/url_request/ |
H A D | url_request_unittest.cc | 3302 int lower_bound = 0; local 3308 lower_bound = upper_bound; 3319 while (upper_bound - lower_bound >= tolerance) { 3320 int num_cookies = (lower_bound + upper_bound) / 2; 3323 lower_bound = num_cookies;
|
/external/valgrind/main/drd/tests/ |
H A D | tsan_unittest.cpp | 7464 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS, local 7467 for (int i = lower_bound; i < upper_bound; 7509 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS, local 7515 for (int i = lower_bound + mutex_id, cnt = 0;
|
/external/valgrind/unittest/ |
H A D | racecheck_unittest.cc | 7130 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS, local 7133 for (int i = lower_bound; i < upper_bound; 7177 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS, local 7183 for (int i = lower_bound + mutex_id, cnt = 0;
|