| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| lower_bound0.pass.cpp | 16 // iterator lower_bound(const key_type& k);
17 // const_iterator lower_bound(const key_type& k) const;
19 // The member function templates find, count, lower_bound, upper_bound, and
33 M().lower_bound(C2Int{5});
|
| 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(5);
45 r = m.lower_bound(7);
47 r = m.lower_bound(9);
49 r = m.lower_bound(11);
51 r = m.lower_bound(13);
53 r = m.lower_bound(15);
55 r = m.lower_bound(17);
57 r = m.lower_bound(19)
[all...] |
| lower_bound1.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| lower_bound2.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| lower_bound3.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
| lower_bound0.pass.cpp | 16 // iterator lower_bound(const key_type& k);
17 // const_iterator lower_bound(const key_type& k) const;
19 // The member function templates find, count, lower_bound, upper_bound, and
33 M().lower_bound(C2Int{5});
|
| lower_bound.pass.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
44 R r = m.lower_bound(4);
46 r = m.lower_bound(5);
48 r = m.lower_bound(6);
50 r = m.lower_bound(7);
52 r = m.lower_bound(8);
54 r = m.lower_bound(9);
56 r = m.lower_bound(10);
74 R r = m.lower_bound(4)
[all...] |
| lower_bound1.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| lower_bound2.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| lower_bound3.fail.cpp | 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
17 // The member function templates find, count, lower_bound, upper_bound, and
36 M().lower_bound(C2Int{5});
|
| /external/libcxx/test/std/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/std/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...] |
| /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/libunwind_llvm/test/ |
| libunwind_01.pass.cpp | 4 void backtrace(int lower_bound) {
19 if (n < lower_bound) {
|
| /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/webrtc/webrtc/voice_engine/test/auto_test/ |
| voe_output_test.cc | 36 OutputTest(int16_t lower_bound, int16_t upper_bound);
43 void SetOutputBound(int16_t lower_bound, int16_t upper_bound);
53 VoEOutputCheckMediaProcess(int16_t lower_bound, int16_t upper_bound);
75 OutputTest::OutputTest(int16_t lower_bound, int16_t upper_bound)
76 : output_checker_(lower_bound, upper_bound) {
143 int16_t lower_bound, int16_t upper_bound)
145 lower_bound_(lower_bound),
|
| /external/autotest/client/site_tests/hardware_EC/ |
| hardware_EC.py | 53 lower_bound = target_fanspeed - fan_rpm_error_margin
55 if not (lower_bound <= current_reading <= upper_bound):
|
| /ndk/tests/device/test-gnustl-full/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);
|
| /ndk/tests/device/test-stlport/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);
|
| /external/google-breakpad/src/processor/ |
| contained_range_map-inl.h | 75 MapIterator iterator_base = map_->lower_bound(base);
76 MapIterator iterator_high = map_->lower_bound(high);
167 MapConstIterator iterator = map_->lower_bound(address);
|
| static_contained_range_map-inl.h | 68 MapConstIterator iterator = map_.lower_bound(address);
|
| /external/chromium-trace/catapult/third_party/closure_linter/closure_linter/ |
| errorrules.py | 32 'without warning.', lower_bound=1)
|
