Searched refs:lower_bound (Results 1 - 25 of 247) sorted by relevance

12345678910

/external/libcxx/test/containers/associative/multiset/
H A Dlower_bound.pass.cpp14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
43 R r = m.lower_bound(4);
45 r = m.lower_bound(5);
47 r = m.lower_bound(6);
49 r = m.lower_bound(7);
51 r = m.lower_bound(8);
53 r = m.lower_bound(9);
55 r = m.lower_bound(11);
73 R r = m.lower_bound(
[all...]
/external/libcxx/test/containers/associative/map/map.ops/
H A Dlower_bound.pass.cpp14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
42 R r = m.lower_bound(5);
44 r = m.lower_bound(7);
46 r = m.lower_bound(9);
48 r = m.lower_bound(11);
50 r = m.lower_bound(13);
52 r = m.lower_bound(15);
54 r = m.lower_bound(17);
56 r = m.lower_bound(1
[all...]
H A DAndroid.mk27 test_name := containers/associative/map/map.ops/lower_bound
28 test_src := lower_bound.pass.cpp
/external/libcxx/test/containers/associative/set/
H A Dlower_bound.pass.cpp14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
42 R r = m.lower_bound(5);
44 r = m.lower_bound(7);
46 r = m.lower_bound(9);
48 r = m.lower_bound(11);
50 r = m.lower_bound(13);
52 r = m.lower_bound(15);
54 r = m.lower_bound(17);
56 r = m.lower_bound(1
[all...]
/external/libcxx/test/containers/associative/multimap/multimap.ops/
H A Dlower_bound.pass.cpp14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
43 R r = m.lower_bound(4);
45 r = m.lower_bound(5);
47 r = m.lower_bound(6);
49 r = m.lower_bound(7);
51 r = m.lower_bound(8);
53 r = m.lower_bound(9);
55 r = m.lower_bound(10);
73 R r = m.lower_bound(
[all...]
H A DAndroid.mk27 test_name := containers/associative/multimap/multimap.ops/lower_bound
28 test_src := lower_bound.pass.cpp
/external/chromium_org/media/cast/test/
H A Dfake_receiver_time_offset_estimator.cc28 base::TimeDelta* lower_bound,
30 *lower_bound = offset_;
27 GetReceiverOffsetBounds( base::TimeDelta* lower_bound, base::TimeDelta* upper_bound) argument
H A Dfake_receiver_time_offset_estimator.h30 virtual bool GetReceiverOffsetBounds(base::TimeDelta* lower_bound,
/external/chromium_org/chrome/browser/metrics/variations/
H A Dgenerated_resources_map_lookup.cc13 const uint32_t* element = std::lower_bound(kResourceHashes, kEnd, hash);
/external/chromium_org/media/base/
H A Dtime_delta_interpolator.cc46 void TimeDeltaInterpolator::SetBounds(base::TimeDelta lower_bound, argument
48 DCHECK(lower_bound <= upper_bound);
49 DCHECK(lower_bound != kNoTimestamp());
51 lower_bound_ = std::max(base::TimeDelta(), lower_bound);
H A Dtime_delta_interpolator.h48 // |upper_bound| must be greater or equal to |lower_bound|.
52 void SetBounds(base::TimeDelta lower_bound, base::TimeDelta upper_bound);
/external/chromium_org/media/cast/logging/
H A Dreceiver_time_offset_estimator.h29 // If bounds are known, assigns |lower_bound| and |upper_bound| with the
32 virtual bool GetReceiverOffsetBounds(base::TimeDelta* lower_bound,
H A Dreceiver_time_offset_estimator_impl_unittest.cc56 base::TimeDelta lower_bound; local
59 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
82 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
96 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
103 EXPECT_TRUE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
105 int64 lower_bound_ms = lower_bound.InMilliseconds();
119 base::TimeDelta lower_bound; local
122 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
145 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound, &upper_bound));
155 EXPECT_FALSE(estimator_.GetReceiverOffsetBounds(&lower_bound,
181 base::TimeDelta lower_bound; local
[all...]
H A Dreceiver_time_offset_estimator_impl.cc104 base::TimeDelta* lower_bound,
109 *lower_bound = -lower_bound_.bound();
114 if (upper_bound < lower_bound) {
115 lower_bound += (lower_bound - upper_bound) / 2;
116 upper_bound = lower_bound;
103 GetReceiverOffsetBounds( base::TimeDelta* lower_bound, base::TimeDelta* upper_bound) argument
/external/chromium_org/chrome/browser/install_verification/win/
H A Dimported_module_verification.cc62 std::set<ModuleInfo>::const_iterator lower_bound = std::lower_bound( local
65 if (lower_bound != loaded_modules.end() &&
66 lower_bound->ContainsAddress(*address)) {
67 imported_modules->insert(lower_bound->name);
/external/chromium_org/ui/gfx/
H A Dcolor_utils.cc155 const HSL& lower_bound,
160 DCHECK(lower_bound.h < 0 || upper_bound.h < 0 ||
161 (lower_bound.h <= 1 && upper_bound.h <= lower_bound.h + 1))
162 << "lower_bound.h: " << lower_bound.h
164 DCHECK(lower_bound.s < 0 || upper_bound.s < 0 ||
165 (lower_bound.s <= upper_bound.s && upper_bound.s <= 1))
166 << "lower_bound.s: " << lower_bound
154 IsWithinHSLRange(const HSL& hsl, const HSL& lower_bound, const HSL& upper_bound) argument
[all...]
H A Dcolor_analysis.h61 // |lower_bound| represents the minimum bound of HSL values to allow.
86 // largest weight that's centroid falls between |lower_bound| and
92 const HSL& lower_bound,
96 // for |lower_bound|, |upper_bound| and |sampler|.
103 const HSL& lower_bound,
107 // for |lower_bound|, |upper_bound| and |sampler|.
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/
H A DAndroid.mk19 test_name := algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound
20 test_src := lower_bound.pass.cpp
/external/llvm/lib/MC/MCAnalysis/
H A DMCModule.cpp32 AtomListTy::iterator I = std::lower_bound(atom_begin(), atom_end(),
56 AtomListTy::iterator I = std::lower_bound(atom_begin(), atom_end(),
65 AtomListTy::iterator NewI = std::lower_bound(atom_begin(), atom_end(),
77 AtomListTy::const_iterator I = std::lower_bound(atom_begin(), atom_end(),
115 I = std::lower_bound(BBsByAtom.begin(), BBsByAtom.end(),
126 BBsByAtomTy::iterator I = std::lower_bound(BBsByAtom.begin(),
/external/chromium_org/third_party/closure_linter/closure_linter/
H A Derrorrules.py32 'without warning.', lower_bound=1)
/external/stlport/test/unit/
H A Dbound_test.cpp67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3);
77 char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less);
H A Dmultiset_test.cpp68 i = s.lower_bound(3);
78 ci = s.lower_bound(3);
91 ci = crs.lower_bound(3);
/external/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp209 BreakpointSiteList::FindInRange (lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSiteList &bp_site_list) const argument
211 if (lower_bound > upper_bound)
216 lower = m_bp_site_list.lower_bound(lower_bound);
228 if (prev_bp->GetLoadAddress() + prev_bp->GetByteSize() > lower_bound)
/external/chromium_org/sandbox/win/src/
H A Dpolicy_engine_opcodes.cc161 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/ceres-solver/internal/ceres/
H A Dprogram.cc203 const double lower_bound = parameter_block->LowerBoundForParameter(j); local
205 if (lower_bound > -std::numeric_limits<double>::max() ||
225 const double lower_bound = parameter_block->LowerBoundForParameter(j); local
227 if (parameters[j] < lower_bound || parameters[j] > upper_bound) {
234 parameters, size, j, lower_bound, parameters[j], upper_bound);
244 const double lower_bound = parameter_block->LowerBoundForParameter(j); local
246 if (lower_bound >= upper_bound) {
253 parameters, size, j, lower_bound, upper_bound);

Completed in 1740 milliseconds

12345678910