| /external/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 14 // 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(4)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 14 // 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(4)
[all...] |
| /external/libcxx/test/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 14 // 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(19)
[all...] |
| Android.mk | 27 test_name := containers/associative/map/map.ops/lower_bound
28 test_src := lower_bound.pass.cpp
|
| /external/libcxx/test/containers/associative/set/ |
| lower_bound.pass.cpp | 14 // 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(19)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 14 // 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(19)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| lower_bound.pass.cpp | 14 // 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(19)
[all...] |
| /external/chromium_org/media/cast/logging/ |
| receiver_time_offset_estimator.h | 29 // If bounds are known, assigns |lower_bound| and |upper_bound| with the
32 virtual bool GetReceiverOffsetBounds(base::TimeDelta* lower_bound,
|
| receiver_time_offset_estimator_impl_unittest.cc | 56 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, &upper_bound))
181 base::TimeDelta lower_bound; local
[all...] |
| receiver_time_offset_estimator_impl.cc | 104 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;
|
| /external/libcxx/test/containers/associative/multimap/multimap.ops/ |
| lower_bound.pass.cpp | 14 // 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(4)
[all...] |
| Android.mk | 27 test_name := containers/associative/multimap/multimap.ops/lower_bound
28 test_src := lower_bound.pass.cpp
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| lower_bound.pass.cpp | 14 // 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(4)
[all...] |
| /external/chromium_org/media/cast/test/ |
| fake_receiver_time_offset_estimator.cc | 28 base::TimeDelta* lower_bound,
30 *lower_bound = offset_;
|
| fake_receiver_time_offset_estimator.h | 30 virtual bool GetReceiverOffsetBounds(base::TimeDelta* lower_bound,
|
| /external/chromium_org/chrome/browser/metrics/variations/ |
| generated_resources_map_lookup.cc | 13 const uint32_t* element = std::lower_bound(kResourceHashes, kEnd, hash);
|
| /external/chromium_org/media/base/ |
| time_delta_interpolator.cc | 46 void TimeDeltaInterpolator::SetBounds(base::TimeDelta lower_bound,
48 DCHECK(lower_bound <= upper_bound);
49 DCHECK(lower_bound != kNoTimestamp());
51 lower_bound_ = std::max(base::TimeDelta(), lower_bound);
|
| time_delta_interpolator.h | 48 // |upper_bound| must be greater or equal to |lower_bound|.
52 void SetBounds(base::TimeDelta lower_bound, base::TimeDelta upper_bound);
|
| /external/chromium_org/chrome/browser/install_verification/win/ |
| imported_module_verification.cc | 62 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/ |
| color_utils.cc | 155 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.
[all...] |
| color_analysis.h | 61 // |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|.
|
| /bionic/libc/bionic/ |
| mbrtoc32.cpp | 78 char32_t lower_bound; local
86 lower_bound = 0;
90 lower_bound = 0x80;
94 lower_bound = 0x800;
98 lower_bound = 0x10000;
126 if (c32 < lower_bound) {
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| Android.mk | 19 test_name := algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound
20 test_src := lower_bound.pass.cpp
|
| /external/llvm/lib/MC/MCAnalysis/ |
| MCModule.cpp | 32 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/stlport/test/unit/ |
| bound_test.cpp | 67 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);
|
