Searched refs:begin (Results 51 - 75 of 8525) sorted by relevance

1234567891011>>

/external/libcxx/test/containers/associative/multiset/
H A Dequal_range.pass.cpp44 assert(r.first == next(m.begin(), 0));
45 assert(r.second == next(m.begin(), 0));
47 assert(r.first == next(m.begin(), 0));
48 assert(r.second == next(m.begin(), 3));
50 assert(r.first == next(m.begin(), 3));
51 assert(r.second == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
54 assert(r.second == next(m.begin(), 6));
56 assert(r.first == next(m.begin(), 6));
57 assert(r.second == next(m.begin(),
[all...]
H A Dlower_bound.pass.cpp44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 0));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 0));
78 assert(r == next(m.begin(),
[all...]
H A Dupper_bound.pass.cpp44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 6));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 9));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 3));
78 assert(r == next(m.begin(),
[all...]
H A Dfind.pass.cpp43 assert(r == m.begin());
45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
76 assert(r == m.begin());
[all...]
/external/libcxx/test/containers/associative/multimap/multimap.cons/
H A Diter_iter.pass.cpp40 assert(distance(m.begin(), m.end()) == 9);
41 assert(*m.begin() == V(1, 1));
42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(),
[all...]
H A Diter_iter_comp.pass.cpp44 assert(distance(m.begin(), m.end()) == 9);
45 assert(*m.begin() == V(1, 1));
46 assert(*next(m.begin()) == V(1, 1.5));
47 assert(*next(m.begin(), 2) == V(1, 2));
48 assert(*next(m.begin(), 3) == V(2, 1));
49 assert(*next(m.begin(), 4) == V(2, 1.5));
50 assert(*next(m.begin(), 5) == V(2, 2));
51 assert(*next(m.begin(), 6) == V(3, 1));
52 assert(*next(m.begin(), 7) == V(3, 1.5));
53 assert(*next(m.begin(),
[all...]
H A Diter_iter_comp_alloc.pass.cpp47 assert(distance(m.begin(), m.end()) == 9);
48 assert(*m.begin() == V(1, 1));
49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(),
[all...]
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
H A Dstl_util.h52 void STLDeleteContainerPointers(ForwardIterator begin, argument
54 while (begin != end) {
55 ForwardIterator temp = begin;
56 ++begin;
85 return str->empty() ? NULL : &*str->begin();
90 // hash_set, or any other STL container which defines sensible begin(), end(),
101 STLDeleteContainerPointers(container->begin(), container->end());
112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
H A Demplace_after.pass.cpp30 assert(i == c.begin());
32 assert(distance(c.begin(), c.end()) == 1);
35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == Emplaceable(1, 2.5));
38 assert(distance(c.begin(), c.end()) == 2);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == Emplaceable(1, 2.5));
44 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
45 assert(distance(c.begin(), c.end()) == 3);
48 assert(i == next(c.begin()));
[all...]
H A Dinsert_after_const.pass.cpp27 assert(i == c.begin());
30 assert(distance(c.begin(), c.end()) == 1);
33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
36 assert(distance(c.begin(), c.end()) == 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
43 assert(distance(c.begin(), c.end()) == 3);
46 assert(i == next(c.begin()));
[all...]
H A Dinsert_after_rv.pass.cpp29 assert(i == c.begin());
32 assert(distance(c.begin(), c.end()) == 1);
35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == 1);
38 assert(distance(c.begin(), c.end()) == 2);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == 1);
44 assert(*next(c.begin(), 2) == 2);
45 assert(distance(c.begin(), c.end()) == 3);
48 assert(i == next(c.begin()));
[all...]
/external/protobuf/src/google/protobuf/stubs/
H A Dstl_util-inl.h52 void STLDeleteContainerPointers(ForwardIterator begin, argument
54 while (begin != end) {
55 ForwardIterator temp = begin;
56 ++begin;
85 return str->empty() ? NULL : &*str->begin();
90 // hash_set, or any other STL container which defines sensible begin(), end(),
101 STLDeleteContainerPointers(container->begin(), container->end());
112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
/external/libcxx/test/strings/basic.string/string.modifiers/string_insert/
H A Diter_char.pass.cpp29 typename S::difference_type pos = p - s.begin();
33 assert(i - s.begin() == pos);
44 test(s, s.begin(), '1', S("1"));
45 test(s, s.begin(), 'a', S("a1"));
52 test(s, s.begin()+1, '5', S("a51432dcb"));
53 test(s, s.begin()+2, '6', S("a561432dcb"));
54 test(s, s.begin()+3, '7', S("a5671432dcb"));
55 test(s, s.begin()+4, 'A', S("a567A1432dcb"));
56 test(s, s.begin()+5, 'B', S("a567AB1432dcb"));
57 test(s, s.begin()
[all...]
/external/libcxx/test/containers/associative/set/
H A Dequal_range.pass.cpp43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 1));
46 assert(r.first == next(m.begin(), 1));
47 assert(r.second == next(m.begin(), 2));
49 assert(r.first == next(m.begin(), 2));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 4));
55 assert(r.first == next(m.begin(), 4));
56 assert(r.second == next(m.begin(),
[all...]
H A Dfind.pass.cpp43 assert(r == m.begin());
45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
76 assert(r == m.begin());
[all...]
H A Dlower_bound.pass.cpp43 assert(r == m.begin());
45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(),
[all...]
H A Dupper_bound.pass.cpp43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(),
[all...]
/external/chromium_org/third_party/WebKit/Source/core/frame/csp/
H A DCSPSourceList.cpp19 static bool isSourceListNone(const UChar* begin, const UChar* end) argument
21 skipWhile<UChar, isASCIISpace>(begin, end);
23 const UChar* position = begin;
25 if (!equalIgnoringCase("'none'", begin, position - begin))
97 void CSPSourceList::parse(const UChar* begin, const UChar* end) argument
100 if (isSourceListNone(begin, end))
103 const UChar* position = begin;
137 bool CSPSourceList::parseSource(const UChar* begin, const UChar* end, String& scheme, String& host, int& port, String& path, CSPSource::WildcardDisposition& hostWildcard, CSPSource::WildcardDisposition& portWildcard) argument
139 if (begin
261 parseNonce(const UChar* begin, const UChar* end, String& nonce) argument
285 parseHash(const UChar* begin, const UChar* end, DigestValue& hash, ContentSecurityPolicyHashAlgorithm& hashAlgorithm) argument
343 parseScheme(const UChar* begin, const UChar* end, String& scheme) argument
369 parseHost(const UChar* begin, const UChar* end, String& host, CSPSource::WildcardDisposition& hostWildcard) argument
407 parsePath(const UChar* begin, const UChar* end, String& path) argument
428 parsePort(const UChar* begin, const UChar* end, int& port, CSPSource::WildcardDisposition& portWildcard) argument
[all...]
/external/libcxx/test/containers/associative/map/map.modifiers/
H A Demplace_hint.pass.cpp33 assert(r == m.begin());
35 assert(m.begin()->first == 0);
36 assert(m.begin()->second == DefaultOnly());
41 assert(r == next(m.begin()));
43 assert(next(m.begin())->first == 1);
44 assert(next(m.begin())->second == DefaultOnly());
49 assert(r == next(m.begin()));
51 assert(next(m.begin())->first == 1);
52 assert(next(m.begin())->second == DefaultOnly());
63 assert(r == m.begin());
[all...]
/external/libcxx/test/containers/associative/map/map.ops/
H A Dfind.pass.cpp43 assert(r == m.begin());
45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
76 assert(r == m.begin());
[all...]
H A Dlower_bound.pass.cpp43 assert(r == m.begin());
45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(),
[all...]
H A Dupper_bound.pass.cpp43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(),
[all...]
/external/bison/examples/calc++/
H A Dlocation.hh55 : begin (b)
62 : begin (p)
71 : begin (f, l, c)
82 begin.initialize (f, l, c);
83 end = begin;
92 begin = end;
111 position begin; member in class:yy::location
117 inline const location operator+ (const location& begin, const location& end) argument
119 location res = begin;
125 inline const location operator+ (const location& begin, unsigne argument
[all...]
/external/libcxx/test/containers/associative/multimap/multimap.ops/
H A Dequal_range.pass.cpp44 assert(r.first == m.begin());
45 assert(r.second == m.begin());
47 assert(r.first == m.begin());
48 assert(r.second == next(m.begin(), 3));
50 assert(r.first == next(m.begin(), 3));
51 assert(r.second == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
54 assert(r.second == next(m.begin(), 6));
56 assert(r.first == next(m.begin(), 6));
57 assert(r.second == next(m.begin(),
[all...]
/external/stlport/test/unit/
H A Dperm_test.cpp54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end());
60 prev_permutation(v1.begin(), v1.end());
64 prev_permutation(v1.begin(), v1.end());
68 prev_permutation(v1.begin(), v1.end());
72 prev_permutation(v1.begin(), v1.end());
76 prev_permutation(v1.begin(), v1.end());
80 prev_permutation(v1.begin(), v1.end());
84 prev_permutation(v1.begin(), v1.end());
88 prev_permutation(v1.begin(), v
[all...]

Completed in 5557 milliseconds

1234567891011>>