| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/utility/pairs/pairs.pair/ |
| copy_ctor.pass.cpp | 25 assert(p2.first == 3);
36 static_assert(p2.first == 3, "");
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 51 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
52 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 51 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
52 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 51 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
52 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| resize_store_hash_fn_imps.hpp | 51 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
52 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/xtensa/ |
| first_frag_align.d | 3 #name: record alignment for the first section frag
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value)
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value);
29 for (Iter j = first; j != i.first; ++j)
31 for (Iter j = i.first; j != last; ++j)
33 for (Iter j = first; j != i.second; ++j)
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| emplace.pass.cpp | 34 assert(*r.first == Emplaceable());
39 assert(*r.first == Emplaceable(5, 6));
44 assert(*r.first == Emplaceable(5, 6));
55 assert(*r.first == Emplaceable());
60 assert(*r.first == Emplaceable(5, 6));
65 assert(*r.first == Emplaceable(5, 6));
|
| /external/libcxx/test/std/re/re.alg/re.alg.search/ |
| grep.pass.cpp | 14 // regex_search(BidirectionalIterator first, BidirectionalIterator last,
33 assert(m.prefix().first == s);
34 assert(m.prefix().second == m[0].first);
36 assert(m.suffix().first == m[0].second);
49 assert(m.prefix().first == s);
50 assert(m.prefix().second == m[0].first);
52 assert(m.suffix().first == m[0].second);
|
| /external/toybox/toys/lsb/ |
| seq.c | 1 /* seq.c - Count from first to last, by increment.
14 usage: seq [-w|-f fmt_str] [-s sep_str] [first] [increment] last
16 Count from first to last, by increment. Omitted arguments default
17 to 1. Two arguments are used as first and last. Arguments can be
47 double first, increment, last, dd; local
53 first = increment = 1;
56 case 2: first = atof(*toys.optargs);
66 dd = (double []){first, increment, last}[i];
84 for (dd=first; (increment>0 && dd<=last) || (increment<0 && dd>=last);
87 if (dd != first) printf("%s", sep_str)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value)
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value);
29 for (Iter j = first; j != i.first; ++j)
31 for (Iter j = i.first; j != last; ++j)
33 for (Iter j = first; j != i.second; ++j)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| emplace.pass.cpp | 34 assert(*r.first == Emplaceable());
39 assert(*r.first == Emplaceable(5, 6));
44 assert(*r.first == Emplaceable(5, 6));
55 assert(*r.first == Emplaceable());
60 assert(*r.first == Emplaceable(5, 6));
65 assert(*r.first == Emplaceable(5, 6));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/ |
| grep.pass.cpp | 14 // regex_search(BidirectionalIterator first, BidirectionalIterator last,
33 assert(m.prefix().first == s);
34 assert(m.prefix().second == m[0].first);
36 assert(m.suffix().first == m[0].second);
49 assert(m.prefix().first == s);
50 assert(m.prefix().second == m[0].first);
52 assert(m.suffix().first == m[0].second);
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| pair.hpp | 31 typedef T1 first; typedef in struct:boost::mpl::pair
40 struct first struct in namespace:boost::mpl
43 typedef typename P::first type;
45 typedef typename aux::msvc_eti_base<P>::first type;
47 BOOST_MPL_AUX_LAMBDA_SUPPORT(1,first,(P))
65 BOOST_MPL_AUX_NA_SPEC(1, first)
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| InsnList.java | 58 * The first instruction in this list. May be <tt>null</tt>.
60 private AbstractInsnNode first;
field in class:InsnList
83 * Returns the first instruction in this list.
85 * @return the first instruction in this list, or <tt>null</tt> if the
89 return first;
131 AbstractInsnNode i = first;
169 AbstractInsnNode insn = first;
201 AbstractInsnNode elem = first;
237 first = insn;
265 first = insn;
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
47 assert(r.first == next(m.begin(), 0));
50 assert(r.first == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
56 assert(r.first == next(m.begin(), 6));
59 assert(r.first == next(m.begin(), 6));
62 assert(r.first == next(m.begin(), 9));
81 assert(r.first == next(m.begin(), 0));
84 assert(r.first == next(m.begin(), 0));
87 assert(r.first == next(m.begin(), 3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| equal_range.pass.cpp | 44 assert(r.first == m.begin());
47 assert(r.first == m.begin());
50 assert(r.first == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
56 assert(r.first == next(m.begin(), 6));
59 assert(r.first == next(m.begin(), 6));
62 assert(r.first == m.end());
81 assert(r.first == m.begin());
84 assert(r.first == m.begin());
87 assert(r.first == next(m.begin(), 3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
47 assert(r.first == next(m.begin(), 0));
50 assert(r.first == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
56 assert(r.first == next(m.begin(), 6));
59 assert(r.first == next(m.begin(), 6));
62 assert(r.first == next(m.begin(), 9));
81 assert(r.first == next(m.begin(), 0));
84 assert(r.first == next(m.begin(), 0));
87 assert(r.first == next(m.begin(), 3))
[all...] |
| /external/v8/test/unittests/interpreter/ |
| bytecode-peephole-optimizer-unittest.cc | 130 BytecodeNode first(Bytecode::kLdaNull);
132 optimizer()->Write(&first);
136 CHECK_EQ(last_written(), first); local
143 BytecodeNode first(Bytecode::kLdaTrue);
145 optimizer()->Write(&first);
149 CHECK_EQ(last_written(), first); local
157 BytecodeNode first(Bytecode::kLdaNull);
159 optimizer()->Write(&first);
163 CHECK_EQ(last_written(), first); local
170 BytecodeNode first(Bytecode::kLdaTrue)
176 CHECK_EQ(last_written(), first); local
191 CHECK_EQ(last_written(), first); local
205 CHECK_EQ(last_written(), first); local
218 CHECK_EQ(last_written(), first); local
235 CHECK_EQ(last_written(), first); local
250 CHECK_EQ(last_written(), first); local
263 CHECK_EQ(last_written(), first); local
275 CHECK_EQ(last_written(), first); local
290 CHECK_EQ(last_written(), first); local
304 CHECK_EQ(last_written(), first); local
[all...] |
| /external/llvm/unittests/ADT/ |
| MapVectorTest.cpp | 22 ASSERT_EQ(R.first, MV1.begin());
23 EXPECT_EQ(R.first->first, 1);
24 EXPECT_EQ(R.first->second, 2);
38 EXPECT_EQ(I->first, 1);
47 ASSERT_EQ(R.first, MV.begin());
48 EXPECT_EQ(R.first->first, 1);
49 EXPECT_EQ(R.first->second, 2);
53 ASSERT_EQ(R.first, MV.begin())
[all...] |
| /frameworks/base/test-runner/src/android/test/ |
| ViewAsserts.java | 121 * @param first The first view
124 static public void assertBaselineAligned(View first, View second) {
126 first.getLocationOnScreen(xy);
127 int firstTop = xy[1] + first.getBaseline();
139 * @param first The first view
142 static public void assertRightAligned(View first, View second) {
144 first.getLocationOnScreen(xy);
145 int firstRight = xy[0] + first.getMeasuredWidth()
[all...] |
| /external/skia/src/core/ |
| SkDeque.cpp | 78 Block* first = fFrontBlock; local
81 if (nullptr == first->fBegin) {
83 first->fEnd = first->fStop;
84 begin = first->fStop - fElemSize;
86 begin = first->fBegin - fElemSize;
87 if (begin < first->start()) { // no more room in this chunk
89 first = this->allocateBlock(fAllocCount);
90 first->fNext = fFrontBlock;
91 fFrontBlock->fPrev = first;
155 Block* first = fFrontBlock; local
[all...] |
| /external/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
| spreadsort.hpp | 68 //Start from the second item, as max and min are initialized to the first
130 spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset
134 //If you know the maximum and minimum ahead of time, you can pass those values in and skip this step for the first iteration
136 find_extremes(first, last, max, min);
137 //max and min will be the same (the first item) iff all values are equivalent
141 unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min >> 0)));
149 for (RandomAccessIter current = first; current != last;)
152 bins[0] = first;
158 RandomAccessIter nextbinstart = first;
192 size_t max_count = get_max_count(log_divisor, last - first);
[all...] |
| /external/clang/include/clang/Serialization/ |
| ContinuousRangeMap.h | 30 /// the first range is from I0 to I1, the second from I1 to I2, the third from
50 return L.first < R;
53 return L < R.first;
59 return L.first < R.first;
68 assert((Rep.empty() || Rep.back().first < Val.first) &&
75 if (I != Rep.end() && I->first == Val.first) {
93 // I points to the first entry with a key > K, which is the range tha
[all...] |
| /frameworks/base/services/accessibility/java/com/android/server/accessibility/ |
| GestureUtils.java | 26 private static boolean eventsWithinTimeAndDistanceSlop(MotionEvent first, MotionEvent second,
28 if (isTimedOut(first, second, timeout)) {
31 final double deltaMove = computeDistance(first, second, actionIndex);
38 public static double computeDistance(MotionEvent first, MotionEvent second, int pointerIndex) {
39 return MathUtils.dist(first.getX(pointerIndex), first.getY(pointerIndex),
48 public static boolean isSamePointerContext(MotionEvent first, MotionEvent second) {
49 return (first.getPointerIdBits() == second.getPointerIdBits()
50 && first.getPointerId(first.getActionIndex()
[all...] |
