HomeSort by relevance Sort by last modified time
    Searched refs:begin (Results 51 - 75 of 10094) sorted by null

1 23 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
erase_iter.pass.cpp 24 std::list<int>::const_iterator i = l1.begin();
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
35 assert(distance(l1.begin(), l1.end()) == 1);
36 assert(*l1.begin() == 1);
37 j = l1.erase(l1.begin());
40 assert(distance(l1.begin(), l1.end()) == 0);
46 std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l1.end()) == 2)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 24 std::vector<int>::const_iterator i = l1.begin();
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
35 assert(distance(l1.begin(), l1.end()) == 1);
36 assert(*l1.begin() == 1);
37 j = l1.erase(l1.begin());
40 assert(distance(l1.begin(), l1.end()) == 0);
46 std::vector<int, min_allocator<int>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l1.end()) == 2)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/
erase_iter.pass.cpp 25 std::vector<bool>::const_iterator i = l1.begin();
29 assert(distance(l1.begin(), l1.end()) == 2);
31 assert(*l1.begin() == 1);
32 assert(*next(l1.begin()) == true);
36 assert(distance(l1.begin(), l1.end()) == 1);
37 assert(*l1.begin() == true);
38 j = l1.erase(l1.begin());
41 assert(distance(l1.begin(), l1.end()) == 0);
46 std::vector<bool, min_allocator<bool>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l1.end()) == 2)
    [all...]
  /external/linux-tools-perf/util/include/linux/
list.h 18 * @begin: first element in the range to delete from the list.
23 static inline void list_del_range(struct list_head *begin,
26 begin->prev->next = end->next;
27 end->next->prev = begin->prev;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
splice_pos_list_iter.pass.cpp 30 l1.splice(l1.end(), l2, l2.begin());
32 assert(distance(l1.begin(), l1.end()) == 1);
34 assert(distance(l2.begin(), l2.end()) == 0);
35 std::list<int>::const_iterator i = l1.begin();
41 l1.splice(l1.end(), l2, l2.begin());
43 assert(distance(l1.begin(), l1.end()) == 1);
45 assert(distance(l2.begin(), l2.end()) == 1);
46 std::list<int>::const_iterator i = l1.begin();
48 i = l2.begin();
54 l1.splice(l1.end(), l2, next(l2.begin()));
    [all...]
splice_pos_list_iter_iter.pass.cpp 29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
31 assert(distance(l1.begin(), l1.end()) == 3);
32 std::list<int>::const_iterator i = l1.begin();
41 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
43 assert(distance(l1.begin(), l1.end()) == 3);
44 std::list<int>::const_iterator i = l1.begin();
    [all...]
  /libcore/luni/src/main/java/java/util/regex/
Splitter.java 69 int begin = 0; local
71 while (separatorCount + 1 != limit && (end = input.indexOf(ch, begin)) != -1) {
73 begin = end + 1;
76 if (limit == 0 && begin == lastPartEnd) {
84 --begin;
85 } while (input.charAt(begin - 1) == ch);
87 separatorCount -= input.length() - begin;
88 lastPartEnd = begin;
93 begin = 0;
95 end = input.indexOf(ch, begin);
119 int begin = 0; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/
iter_iter_comp.pass.cpp 44 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(), 8) == V(3, 2))
    [all...]
iter_iter_comp_alloc.pass.cpp 47 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(), 8) == V(3, 2))
    [all...]
  /external/marisa-trie/lib/marisa/
range.h 11 Range(UInt32 begin, UInt32 end, UInt32 pos)
12 : begin_(begin), end_(end), pos_(pos) {}
14 void set_begin(UInt32 begin) {
15 begin_ = begin;
24 UInt32 begin() const { function in class:marisa::Range
45 WRange(UInt32 begin, UInt32 end, UInt32 pos, double weight)
46 : range_(begin, end, pos), weight_(weight) {}
48 void set_begin(UInt32 begin) {
49 range_.set_begin(begin);
64 UInt32 begin() const function in class:marisa::WRange
    [all...]
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
range.h 11 Range(UInt32 begin, UInt32 end, UInt32 pos)
12 : begin_(begin), end_(end), pos_(pos) {}
14 void set_begin(UInt32 begin) {
15 begin_ = begin;
24 UInt32 begin() const { function in class:marisa_alpha::Range
45 WRange(UInt32 begin, UInt32 end, UInt32 pos, double weight)
46 : range_(begin, end, pos), weight_(weight) {}
48 void set_begin(UInt32 begin) {
49 range_.set_begin(begin);
64 UInt32 begin() const function in class:marisa_alpha::WRange
    [all...]
  /external/chromium/chrome/browser/extensions/
extension_i18n_api.cc 34 size_t begin = 0; local
37 end = acceptLanguages.find(',', begin);
38 if (end > begin) {
40 string16 acceptLang = acceptLanguages.substr(begin, end - begin);
44 begin = end + 1;
45 // 'begin >= acceptLanguages.length()' to guard against a value
47 if (end == string16::npos || begin >= acceptLanguages.length())
  /external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
stl_util.h 52 void STLDeleteContainerPointers(ForwardIterator begin,
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/protobuf/src/google/protobuf/stubs/
stl_util-inl.h 52 void STLDeleteContainerPointers(ForwardIterator begin,
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) {
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/
lower_bound.pass.cpp 43 assert(r == next(m.begin(), 0));
45 assert(r == next(m.begin(), 0));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 9));
73 assert(r == next(m.begin(), 0));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 3))
    [all...]
upper_bound.pass.cpp 43 assert(r == next(m.begin(), 0));
45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 9));
55 assert(r == next(m.begin(), 9));
73 assert(r == next(m.begin(), 0));
75 assert(r == next(m.begin(), 3));
77 assert(r == next(m.begin(), 3))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
emplace_after.pass.cpp 30 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...]
insert_after_const.pass.cpp 27 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...]
insert_after_rv.pass.cpp 29 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...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])

Completed in 550 milliseconds

1 23 4 5 6 7 8 91011>>