HomeSort by relevance Sort by last modified time
    Searched full:begin (Results 576 - 600 of 17279) sorted by null

<<21222324252627282930>>

  /external/chromium_org/third_party/angle/src/libGLESv2/
Query.cpp 27 void Query::begin() function in class:gl::Query
29 mQuery->begin();
  /external/chromium_org/third_party/openssl/openssl/crypto/pkcs7/
server.pem 3 -----BEGIN CERTIFICATE-----
16 -----BEGIN RSA PRIVATE KEY-----
  /external/chromium_org/third_party/opus/src/doc/
footer.html 1 <!--BEGIN GENERATE_TREEVIEW-->
8 <!--BEGIN !GENERATE_TREEVIEW-->
  /external/chromium_org/third_party/skia/src/svg/
SkSVGGroup.cpp 18 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++) {
43 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++)
  /external/chromium_org/third_party/sqlite/src/test/
tkt2285.test 29 BEGIN;
44 BEGIN;
  /external/chromium_org/url/
url_parse_internal.h 25 // Given an already-initialized begin index and length, this shrinks the range
27 // indicate the length of untrimmed data from |*begin|, but rather the position
28 // in the input string (so the string starts at character |*begin| in the spec,
31 inline void TrimURL(const CHAR* spec, int* begin, int* len,
34 while (*begin < *len && ShouldTrimFromURL(spec[*begin]))
35 (*begin)++;
41 while (*len > *begin && ShouldTrimFromURL(spec[*len - 1]))
  /external/clang/test/CodeGenObjCXX/
arc-new-delete.mm 74 // CHECK: icmp eq i8** [[BEGIN:%.*]], null
76 // CHECK: [[END:%.*]] = getelementptr inbounds i8** [[BEGIN]], i64 [[LEN]]
77 // CHECK-NEXT: icmp eq i8** [[BEGIN]], [[END]]
81 // CHECK-NEXT: icmp eq i8** [[CUR]], [[BEGIN]]
85 // CHECK: icmp eq i8** [[BEGIN:%.*]], null
87 // CHECK: [[END:%.*]] = getelementptr inbounds i8** [[BEGIN]], i64 [[LEN]]
88 // CHECK-NEXT: icmp eq i8** [[BEGIN]], [[END]]
92 // CHECK-NEXT: icmp eq i8** [[CUR]], [[BEGIN]]
  /external/libogg/win32/VS6/
ogg_static.dsp 24 # Begin Project
79 # Begin Target
83 # Begin Group "Source Files"
86 # Begin Source File
90 # Begin Source File
95 # Begin Group "Header Files"
98 # Begin Source File
102 # Begin Source File
  /external/libvpx/libvpx/vpx_ports/
asm_offsets.h 23 #define BEGIN int main(void) {
27 #define BEGIN
  /external/openssl/crypto/pkcs7/
server.pem 3 -----BEGIN CERTIFICATE-----
16 -----BEGIN RSA PRIVATE KEY-----
  /external/oprofile/libutil++/
glob_filter.cpp 30 cit = find_if(exclude.begin(), exclude.end(), fnmatcher(str));
34 cit = find_if(include.begin(), include.end(), fnmatcher(str));
string_filter.cpp 40 cit = find(exclude.begin(), exclude.end(), str);
44 cit = find(include.begin(), include.end(), str);
  /external/skia/src/svg/
SkSVGGroup.cpp 18 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++) {
43 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++)
  /external/stlport/test/eh/
test.cpp 10 for(it = coll.begin(); it != coll.end(); ++it) {
24 set1.insert(aVector.begin(), aVector.end());
  /external/stlport/test/unit/
accum_test.cpp 36 int sum = accumulate(v.begin(), v.end(), 0);
44 int prod = accumulate(v.begin(), v.end(), 1, mult);
setdiff_test.cpp 59 __iota(v1.begin(), v1.end(), 0);
61 __iota(v2.begin(), v2.end(), 7);
64 set_symmetric_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
111 __iota(v1.begin(), v1.end(), 0);
113 __iota(v2.begin(), v2.end(), 7);
116 set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
  /external/tinyxml/
tinyxml.dsw 14 Begin Project Dependency
29 Begin Project Dependency
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/
initializer_list_compare_alloc.pass.cpp 41 assert(distance(m.begin(), m.end()) == 3);
42 assert(*m.begin() == V(1, 1));
43 assert(*next(m.begin()) == V(2, 1));
44 assert(*next(m.begin(), 2) == V(3, 1));
65 assert(distance(m.begin(), m.end()) == 3);
66 assert(*m.begin() == V(1, 1));
67 assert(*next(m.begin()) == V(2, 1));
68 assert(*next(m.begin(), 2) == V(3, 1));
iter_iter_comp.pass.cpp 43 assert(distance(m.begin(), m.end()) == 3);
44 assert(*m.begin() == V(1, 1));
45 assert(*next(m.begin()) == V(2, 1));
46 assert(*next(m.begin(), 2) == V(3, 1));
67 assert(distance(m.begin(), m.end()) == 3);
68 assert(*m.begin() == V(1, 1));
69 assert(*next(m.begin()) == V(2, 1));
70 assert(*next(m.begin(), 2) == V(3, 1));
iter_iter_comp_alloc.pass.cpp 47 assert(distance(m.begin(), m.end()) == 3);
48 assert(*m.begin() == V(1, 1));
49 assert(*next(m.begin()) == V(2, 1));
50 assert(*next(m.begin(), 2) == V(3, 1));
73 assert(distance(m.begin(), m.end()) == 3);
74 assert(*m.begin() == V(1, 1));
75 assert(*next(m.begin()) == V(2, 1));
76 assert(*next(m.begin(), 2) == V(3, 1));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/
assign_range.pass.cpp 29 C c(std::begin(t1), std::end(t1));
31 c.assign(I(std::begin(t0)), I(std::end(t0)));
42 C c(std::begin(t1), std::end(t1));
44 c.assign(I(std::begin(t0)), I(std::end(t0)));
56 C c(std::begin(t1), std::end(t1));
58 c.assign(I(std::begin(t0)), I(std::end(t0)));
69 C c(std::begin(t1), std::end(t1));
71 c.assign(I(std::begin(t0)), I(std::end(t0)));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
pop_front.pass.cpp 30 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 0);
43 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 0);
58 assert(distance(c.begin(), c.end()) == 1);
61 assert(distance(c.begin(), c.end()) == 0);
71 assert(distance(c.begin(), c.end()) == 1);
74 assert(distance(c.begin(), c.end()) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/
resize_size.pass.cpp 25 assert(std::distance(l.begin(), l.end()) == 2);
32 assert(std::distance(l.begin(), l.end()) == 10);
41 assert(std::distance(l.begin(), l.end()) == 5);
47 assert(std::distance(l.begin(), l.end()) == 20);
55 assert(std::distance(l.begin(), l.end()) == 2);
62 assert(std::distance(l.begin(), l.end()) == 10);
71 assert(std::distance(l.begin(), l.end()) == 5);
77 assert(std::distance(l.begin(), l.end()) == 20);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/
size_type.pass.cpp 25 assert(std::distance(l.begin(), l.end()) == 3);
26 std::list<int>::const_iterator i = l.begin();
36 assert(std::distance(l.begin(), l.end()) == 3);
37 std::list<int>::const_iterator i = l.begin();
48 assert(std::distance(l.begin(), l.end()) == 3);
55 assert(std::distance(l.begin(), l.end()) == 3);
56 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
67 assert(std::distance(l.begin(), l.end()) == 3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
iterators.fail.cpp 16 // iterator begin() {return __table_.begin();}
18 // const_iterator begin() const {return __table_.begin();}
20 // const_iterator cbegin() const {return __table_.begin();}
44 assert(std::distance(c.begin(), c.end()) == c.size());
46 C::iterator i = c.begin();
66 assert(std::distance(c.begin(), c.end()) == c.size());

Completed in 1113 milliseconds

<<21222324252627282930>>