| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/utility/pairs/pairs.spec/ |
| non_member_swap.pass.cpp | 27 assert(p1.second == 6);
29 assert(p2.second == 4);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/re/re.results/re.results.acc/ |
| index.pass.cpp | 27 assert(m[0].second == s+9);
31 assert(m[1].second == s+7);
35 assert(m[2].second == s+5);
39 assert(m[3].second == s+11);
43 assert(m[4].second == s+11);
|
| /external/webkit/Source/WebCore/bridge/ |
| IdentifierRep.cpp | 71 if (result.second) {
72 ASSERT(!result.first->second);
73 result.first->second = new IdentifierRep(intID);
75 identifierSet().add(result.first->second);
78 return result.first->second;
97 if (result.second) {
98 ASSERT(!result.first->second);
99 result.first->second = new IdentifierRep(name);
101 identifierSet().add(result.first->second);
104 return result.first->second;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_key.pass.cpp | 41 assert(std::distance(eq.first, eq.second) == 2);
44 assert(k->second == "one");
47 assert(k->second == "four");
49 assert(std::distance(eq.first, eq.second) == 2);
52 assert(k->second == "two");
55 assert(k->second == "four");
57 assert(std::distance(eq.first, eq.second) == 1);
60 assert(k->second == "three");
62 assert(std::distance(eq.first, eq.second) == 1);
65 assert(k->second == "four")
[all...] |
| insert_init.pass.cpp | 44 assert(std::distance(eq.first, eq.second) == 2);
47 assert(k->second == "one");
50 assert(k->second == "four");
52 assert(std::distance(eq.first, eq.second) == 2);
55 assert(k->second == "two");
58 assert(k->second == "four");
60 assert(std::distance(eq.first, eq.second) == 1);
63 assert(k->second == "three");
65 assert(std::distance(eq.first, eq.second) == 1);
68 assert(k->second == "four")
[all...] |
| insert_range.pass.cpp | 44 assert(std::distance(eq.first, eq.second) == 2);
47 assert(k->second == "one");
50 assert(k->second == "four");
52 assert(std::distance(eq.first, eq.second) == 2);
55 assert(k->second == "two");
58 assert(k->second == "four");
60 assert(std::distance(eq.first, eq.second) == 1);
63 assert(k->second == "three");
65 assert(std::distance(eq.first, eq.second) == 1);
68 assert(k->second == "four")
[all...] |
| erase_const_iter.pass.cpp | 43 assert(std::distance(eq.first, eq.second) == 2);
46 assert(k->second == "one");
49 assert(k->second == "four");
51 assert(std::distance(eq.first, eq.second) == 1);
54 assert(k->second == "four");
56 assert(std::distance(eq.first, eq.second) == 1);
59 assert(k->second == "three");
61 assert(std::distance(eq.first, eq.second) == 1);
64 assert(k->second == "four");
|
| /external/junit/src/org/junit/runner/manipulation/ |
| Filter.java | 36 public Filter intersect(Filter second) {
37 return second;
94 * by this Filter and {@code second}
96 public Filter intersect(final Filter second) {
97 if (second == this || second == ALL) {
105 && second.shouldRun(description);
110 return first.describe() + " and " + second.describe();
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowPair.java | 19 public void __constructor__(Object first, Object second) {
20 setFields(realPair, first, second);
30 return realPair.first.hashCode() + realPair.second.hashCode();
38 return realPair.first.equals(other.first) && realPair.second.equals(other.second);
41 private static void setFields(Pair p, Object first, Object second) {
47 Field s = Pair.class.getDeclaredField("second");
49 s.set(p, second);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 42 assert(m.begin()->second == 1.5);
44 assert(next(m.begin())->second == 2.5);
46 assert(next(m.begin(), 2)->second == 3.5);
48 assert(next(m.begin(), 3)->second == 5.5);
50 assert(next(m.begin(), 4)->second == 6.5);
52 assert(next(m.begin(), 5)->second == 7.5);
54 assert(next(m.begin(), 6)->second == 8.5);
60 assert(m.begin()->second == 2.5);
62 assert(next(m.begin())->second == 3.5);
64 assert(next(m.begin(), 2)->second == 5.5)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_pair.h | 91 typedef _T2 second_type; /// @c second_type is the second bound type
94 _T2 second; /// @c second is a copy of the second object member in struct:pair
98 /** The default constructor creates @c first and @c second using their
101 : first(), second() { }
105 : first(__a), second(__b) { }
111 : first(__p.first), second(__p.second) { }
117 : first(__p.first), second(__p.second) {
[all...] |
| /bionic/libstdc++/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 47 if (X.second > Y.second) return true;
48 if (X.second < Y.second) return false;
56 size_t XSizeB = getBlockSize(X.first.second);
57 size_t YSizeB = getBlockSize(Y.first.second);
83 Forest.insert(e.second);
91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) {
92 Forest.unionSets(e.first, e.second);
|
| /ndk/sources/cxx-stl/gabi++/include/ |
| stl_pair.h | 77 _T2 second; member in struct:pair
78 pair() : first(), second() {}
79 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
82 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
88 return __x.first == __y.first && __x.second == __y.second;
95 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.modifiers/ |
| erase_iter.pass.cpp | 43 assert(m.begin()->second == 1);
45 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->second == 1.5);
51 assert(next(m.begin(), 4)->second == 2);
53 assert(next(m.begin(), 5)->second == 1);
55 assert(next(m.begin(), 6)->second == 1.5);
57 assert(next(m.begin(), 7)->second == 2);
63 assert(next(m.begin(), 0)->second == 1.5);
65 assert(next(m.begin(), 1)->second == 2)
[all...] |
| /ndk/sources/cxx-stl/system/include/ |
| stl_pair.h | 77 _T2 second; member in struct:pair
78 pair() : first(), second() {}
79 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
82 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
88 return __x.first == __y.first && __x.second == __y.second;
95 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-4/arch-arm/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-5/arch-arm/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-5/arch-x86/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-8/arch-arm/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/4/platforms/android-8/arch-x86/usr/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/5/sources/cxx-stl/system/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/6/sources/cxx-stl/system/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
| /prebuilts/ndk/7/sources/cxx-stl/gabi++/include/ |
| stl_pair.h | 69 _T2 second; member in struct:pair
70 pair() : first(), second() {}
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
80 return __x.first == __y.first && __x.second == __y.second;
87 (!(__y.first < __x.first) && __x.second < __y.second);
|
