HomeSort by relevance Sort by last modified time
    Searched refs:begin (Results 151 - 175 of 3797) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/clang/lib/ARCMigrate/
Transforms.h 86 void clearRefsIn(iterator begin, iterator end, ExprSet &refs) {
87 for (; begin != end; ++begin)
88 clearRefsIn(*begin, refs);
  /external/clang/test/SemaTemplate/
example-dynarray.cpp 69 iterator begin() { return Start; } function in class:dynarray
70 const_iterator begin() const { return Start; } function in class:dynarray
135 for (dynarray<int>::iterator I = di.begin(), IEnd = di.end(); I != IEnd; ++I)
136 assert(*I == I - di.begin());
147 assert(di.begin() != di2.begin());
148 for (dynarray<int>::iterator I = di2.begin(), IEnd = di2.end();
150 assert(*I == I - di2.begin());
154 assert(di.begin() != di3.begin());
    [all...]
  /external/llvm/include/llvm/ADT/
SetOperations.h 26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
41 for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) {
53 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end();
64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
  /external/llvm/include/llvm/
ValueSymbolTable.h 90 inline iterator begin() { return vmap.begin(); } function in class:llvm::ValueSymbolTable
93 inline const_iterator begin() const { return vmap.begin(); } function in class:llvm::ValueSymbolTable
  /external/llvm/lib/Target/X86/
X86COFFMachineModuleInfo.h 38 externals_iterator externals_begin() const { return Externals.begin(); }
  /external/llvm/test/Bindings/Ocaml/
bitreader.ml 23 begin
25 begin try
35 test begin try
44 begin
46 let m = begin try
57 begin let oc = open_out fn in
63 test begin
66 let m = begin try
  /external/netperf/
hist.h 106 int delta_micro(hrtime_t *begin, hrtime_t *end);
108 int delta_micro(hrt_t *begin, hrt_t *end);
110 int delta_micro(LARGE_INTEGER *begin, LARGE_INTEGER *end);
112 int delta_micro(struct timeval *begin, struct timeval *end);
  /external/oprofile/libutil++/
path_filter.cpp 29 cit = find_if(exclude.begin(), exclude.end(),
43 cit = find_if(exclude.begin(), exclude.end(), fnmatcher(base));
48 cit = find_if(include.begin(), include.end(), fnmatcher(base));
56 cit = find_if(include.begin(), include.end(),
  /external/skia/src/animator/
SkDrawDash.cpp 42 return new SkDashPathEffect(intervals.begin(), count, phase);
SkOpArray.cpp 14 *operand = begin()[index];
  /external/skia/src/core/
SkPtrRecorder.cpp 5 Pair* p = fList.begin();
27 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp);
43 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp);
59 const Pair* p = fList.begin();
  /external/stlport/test/unit/
count_test.cpp 49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);
innerprod_test.cpp 58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0);
69 size_t result=inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)1, mult, add);
nthelm_test.cpp 52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
72 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end(), greater<int>());
setinter_test.cpp 54 __iota(v1.begin(), v1.end(), 0);
56 __iota(v2.begin(), v2.end(), 7);
59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
setunion_test.cpp 57 __iota(v1.begin(), v1.end(), 0);
59 __iota(v2.begin(), v2.end(), 7);
62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
  /external/webkit/Source/WebCore/bridge/jni/v8/
JavaInstanceV8.h 58 virtual void begin() = 0;
  /external/webkit/Source/WebCore/platform/sql/
SQLiteTransaction.h 42 void begin();
  /frameworks/compile/linkloader/include/
ELFSectionStrTab.h 44 return &*buf.begin() + index;
  /ndk/tests/device/test-gnustl-full/unit/
count_test.cpp 49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);
innerprod_test.cpp 58 size_t result = inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)0);
69 size_t result=inner_product(v1.begin(), v1.end(), v2.begin(), (size_t)1, mult, add);
nthelm_test.cpp 52 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());
72 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end(), greater<int>());
setinter_test.cpp 54 __iota(v1.begin(), v1.end(), 0);
56 __iota(v2.begin(), v2.end(), 7);
59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
setunion_test.cpp 57 __iota(v1.begin(), v1.end(), 0);
59 __iota(v2.begin(), v2.end(), 7);
62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
  /ndk/tests/device/test-stlport/unit/
count_test.cpp 49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);

Completed in 1404 milliseconds

1 2 3 4 5 67 8 91011>>