Searched refs:first (Results 76 - 100 of 9193) sorted by relevance

1234567891011>>

/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Dassign_move.pass.cpp65 assert(std::distance(eq.first, eq.second) == 2);
66 C::const_iterator i = eq.first;
67 assert(i->first == 1);
70 assert(i->first == 1);
73 assert(std::distance(eq.first, eq.second) == 2);
74 i = eq.first;
75 assert(i->first == 2);
78 assert(i->first == 2);
82 assert(std::distance(eq.first, eq.second) == 1);
83 i = eq.first;
[all...]
H A Dinit.pass.cpp50 assert(std::distance(eq.first, eq.second) == 2);
51 C::const_iterator i = eq.first;
52 assert(i->first == 1);
55 assert(i->first == 1);
58 assert(std::distance(eq.first, eq.second) == 2);
59 i = eq.first;
60 assert(i->first == 2);
63 assert(i->first == 2);
67 assert(std::distance(eq.first, eq.second) == 1);
68 i = eq.first;
[all...]
H A Drange.pass.cpp17 // unordered_multimap(InputIterator first, InputIterator last);
54 assert(std::distance(eq.first, eq.second) == 2);
55 C::const_iterator i = eq.first;
56 assert(i->first == 1);
59 assert(i->first == 1);
62 assert(std::distance(eq.first, eq.second) == 2);
63 i = eq.first;
64 assert(i->first == 2);
67 assert(i->first == 2);
71 assert(std::distance(eq.first, e
[all...]
H A Dassign_init.pass.cpp56 assert(std::distance(eq.first, eq.second) == 2);
57 C::const_iterator i = eq.first;
58 assert(i->first == 1);
61 assert(i->first == 1);
64 assert(std::distance(eq.first, eq.second) == 2);
65 i = eq.first;
66 assert(i->first == 2);
69 assert(i->first == 2);
73 assert(std::distance(eq.first, eq.second) == 1);
74 i = eq.first;
[all...]
H A Dinit_size.pass.cpp52 assert(std::distance(eq.first, eq.second) == 2);
53 C::const_iterator i = eq.first;
54 assert(i->first == 1);
57 assert(i->first == 1);
60 assert(std::distance(eq.first, eq.second) == 2);
61 i = eq.first;
62 assert(i->first == 2);
65 assert(i->first == 2);
69 assert(std::distance(eq.first, eq.second) == 1);
70 i = eq.first;
[all...]
H A Dinit_size_hash.pass.cpp53 assert(std::distance(eq.first, eq.second) == 2);
54 C::const_iterator i = eq.first;
55 assert(i->first == 1);
58 assert(i->first == 1);
61 assert(std::distance(eq.first, eq.second) == 2);
62 i = eq.first;
63 assert(i->first == 2);
66 assert(i->first == 2);
70 assert(std::distance(eq.first, eq.second) == 1);
71 i = eq.first;
[all...]
H A Dinit_size_hash_equal.pass.cpp55 assert(std::distance(eq.first, eq.second) == 2);
56 C::const_iterator i = eq.first;
57 assert(i->first == 1);
60 assert(i->first == 1);
63 assert(std::distance(eq.first, eq.second) == 2);
64 i = eq.first;
65 assert(i->first == 2);
68 assert(i->first == 2);
72 assert(std::distance(eq.first, eq.second) == 1);
73 i = eq.first;
[all...]
H A Dinit_size_hash_equal_allocator.pass.cpp56 assert(std::distance(eq.first, eq.second) == 2);
57 C::const_iterator i = eq.first;
58 assert(i->first == 1);
61 assert(i->first == 1);
64 assert(std::distance(eq.first, eq.second) == 2);
65 i = eq.first;
66 assert(i->first == 2);
69 assert(i->first == 2);
73 assert(std::distance(eq.first, eq.second) == 1);
74 i = eq.first;
[all...]
H A Drange_size.pass.cpp17 // unordered_multimap(InputIterator first, InputIterator last, size_type n);
56 assert(std::distance(eq.first, eq.second) == 2);
57 C::const_iterator i = eq.first;
58 assert(i->first == 1);
61 assert(i->first == 1);
64 assert(std::distance(eq.first, eq.second) == 2);
65 i = eq.first;
66 assert(i->first == 2);
69 assert(i->first == 2);
73 assert(std::distance(eq.first, e
[all...]
H A Drange_size_hash.pass.cpp17 // unordered_multimap(InputIterator first, InputIterator last, size_type n,
58 assert(std::distance(eq.first, eq.second) == 2);
59 C::const_iterator i = eq.first;
60 assert(i->first == 1);
63 assert(i->first == 1);
66 assert(std::distance(eq.first, eq.second) == 2);
67 i = eq.first;
68 assert(i->first == 2);
71 assert(i->first == 2);
75 assert(std::distance(eq.first, e
[all...]
/external/chromium_org/components/policy/core/common/
H A Dexternal_data_fetcher.cc28 bool ExternalDataFetcher::Equals(const ExternalDataFetcher* first, argument
30 if (!first && !second)
32 if (!first || !second)
34 return first->manager_.get() == second->manager_.get() &&
35 first->policy_ == second->policy_;
/external/libcxx/test/re/re.results/re.results.acc/
H A Dindex.pass.cpp26 assert(m[0].first == s+2);
30 assert(m[1].first == s+4);
34 assert(m[2].first == s+4);
38 assert(m[3].first == s+11);
42 assert(m[4].first == s+11);
/external/libcxx/test/containers/unord/unord.map/
H A Dequal_range_const.pass.cpp43 assert(std::distance(r.first, r.second) == 1);
44 assert(r.first->first == 30);
45 assert(r.first->second == "thirty");
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
69 assert(r.first->first == 30);
70 assert(r.first->second == "thirty");
72 assert(std::distance(r.first,
[all...]
H A Dequal_range_non_const.pass.cpp43 assert(std::distance(r.first, r.second) == 1);
44 assert(r.first->first == 30);
45 assert(r.first->second == "thirty");
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
69 assert(r.first->first == 30);
70 assert(r.first->second == "thirty");
72 assert(std::distance(r.first,
[all...]
/external/libcxx/test/containers/unord/unord.set/
H A Dequal_range_const.pass.cpp44 assert(std::distance(r.first, r.second) == 1);
45 assert(*r.first == 30);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 1);
50 assert(*r.first == 50);
72 assert(std::distance(r.first, r.second) == 1);
73 assert(*r.first == 30);
75 assert(std::distance(r.first, r.second) == 0);
77 assert(std::distance(r.first, r.second) == 1);
78 assert(*r.first
[all...]
H A Dequal_range_non_const.pass.cpp44 assert(std::distance(r.first, r.second) == 1);
45 assert(*r.first == 30);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 1);
50 assert(*r.first == 50);
72 assert(std::distance(r.first, r.second) == 1);
73 assert(*r.first == 30);
75 assert(std::distance(r.first, r.second) == 0);
77 assert(std::distance(r.first, r.second) == 1);
78 assert(*r.first
[all...]
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/
H A Derase_key.pass.cpp44 assert(next(m.begin(), 0)->first == 1);
46 assert(next(m.begin(), 1)->first == 1);
48 assert(next(m.begin(), 2)->first == 1);
50 assert(next(m.begin(), 3)->first == 3);
52 assert(next(m.begin(), 4)->first == 3);
54 assert(next(m.begin(), 5)->first == 3);
60 assert(next(m.begin(), 0)->first == 1);
62 assert(next(m.begin(), 1)->first == 1);
64 assert(next(m.begin(), 2)->first == 1);
66 assert(next(m.begin(), 3)->first
[all...]
H A Derase_iter.pass.cpp44 assert(m.begin()->first == 1);
46 assert(next(m.begin())->first == 1);
48 assert(next(m.begin(), 2)->first == 1);
50 assert(next(m.begin(), 3)->first == 2);
52 assert(next(m.begin(), 4)->first == 2);
54 assert(next(m.begin(), 5)->first == 3);
56 assert(next(m.begin(), 6)->first == 3);
58 assert(next(m.begin(), 7)->first == 3);
64 assert(next(m.begin(), 0)->first == 1);
66 assert(next(m.begin(), 1)->first
[all...]
H A Dinsert_iter_iter.pass.cpp15 // void insert(InputIterator first, InputIterator last);
43 assert(m.begin()->first == 1);
45 assert(next(m.begin())->first == 1);
47 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 3)->first == 2);
51 assert(next(m.begin(), 4)->first == 2);
53 assert(next(m.begin(), 5)->first == 2);
55 assert(next(m.begin(), 6)->first == 3);
57 assert(next(m.begin(), 7)->first == 3);
59 assert(next(m.begin(), 8)->first
[all...]
/external/elfutils/0.153/lib/
H A Ddynamicsizehash.c112 htab->table[idx].next = htab->first;
113 htab->first = &htab->table[idx];
116 if (htab->first == NULL)
117 htab->first = htab->table[idx].next = &htab->table[idx];
120 htab->table[idx].next = htab->first->next;
121 htab->first = htab->first->next = &htab->table[idx];
135 __typeof__ (htab->first) first;
137 __typeof__ (htab->first) run
[all...]
/external/chromium_org/chrome/browser/content_settings/
H A Dcontent_settings_utils_unittest.cc15 EXPECT_FALSE(pattern_pair.first.IsValid());
19 EXPECT_FALSE(pattern_pair.first.IsValid());
23 EXPECT_TRUE(pattern_pair.first.IsValid());
28 EXPECT_TRUE(pattern_pair.first.IsValid());
33 EXPECT_TRUE(pattern_pair.first.IsValid());
38 EXPECT_FALSE(pattern_pair.first.IsValid());
43 EXPECT_FALSE(pattern_pair.first.IsValid());
/external/chromium_org/net/spdy/
H A Dspdy_session_key.cc28 DVLOG(1) << "SpdySessionKey(hppp=" << host_port_proxy_pair.first.ToString()
38 if (!host_port_proxy_pair_.first.Equals(other.host_port_proxy_pair_.first))
39 return host_port_proxy_pair_.first < other.host_port_proxy_pair_.first;
45 host_port_proxy_pair_.first.Equals(other.host_port_proxy_pair_.first) &&
/external/chromium_org/third_party/boringssl/src/crypto/x509/
H A Dt_x509a.c68 char oidstr[80], first; local
73 first = 1;
77 if(!first) BIO_puts(out, ", ");
78 else first = 0;
86 first = 1;
90 if(!first) BIO_puts(out, ", ");
91 else first = 0;
/external/chromium_org/v8/src/
H A Darraybuffer.js39 var first;
42 first = MathMax(byte_length + relativeStart, 0);
44 first = MathMin(relativeStart, byte_length);
54 if (fin < first) {
55 fin = first;
57 var newLen = fin - first;
61 %ArrayBufferSliceImpl(this, result, first);
/external/libcxx/test/algorithms/alg.sorting/alg.min.max/
H A Dminmax_element.pass.cpp15 // minmax_element(Iter first, Iter last);
24 test(Iter first, Iter last) argument
26 std::pair<Iter, Iter> p = std::minmax_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
31 assert(!(*j < *p.first));
37 assert(p.first == last);
71 assert(base(p.first) == a);

Completed in 353 milliseconds

1234567891011>>