| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| prev_permutation_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // prev_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C());
|
| /external/v8/test/cctest/ |
| test-gc-tracer.cc | 38 typedef RingBuffer<int, max_size>::const_iterator Iter;
53 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
54 CHECK(*iter == i);
61 Iter iter = ring_buffer.back(); local
63 CHECK(*iter == i);
64 if (iter == ring_buffer.begin()) break
94 Iter iter = ring_buffer.back(); local
[all...] |
| /external/llvm/lib/Target/ |
| TargetRecip.cpp | 132 RecipIter Iter = RecipMap.find(Val);
133 if (Iter == RecipMap.end()) {
135 Iter = RecipMap.find(Val.str() + 'f');
136 if (Iter == RecipMap.end()) {
137 Iter = RecipMap.find(Val.str() + 'd');
138 assert(Iter == RecipMap.end() && "Float entry missing from map");
150 if (Iter->second.Enabled != Uninitialized)
154 Iter->second.Enabled = !IsDisabled;
156 Iter->second.RefinementSteps = RefSteps;
179 ConstRecipIter Iter = RecipMap.find(Key)
[all...] |
| /external/skia/include/core/ |
| SkOSFile.h | 94 class Iter {
96 Iter();
97 Iter(const char path[], const char suffix[] = NULL);
98 ~Iter();
|
| SkClipStack.h | 362 class Iter {
365 kBottom_IterStart = SkDeque::Iter::kFront_IterStart,
366 kTop_IterStart = SkDeque::Iter::kBack_IterStart
372 Iter();
374 Iter(const SkClipStack& stack, IterStart startLoc);
396 SkDeque::Iter fIter;
401 * It inherits privately from Iter to prevent access to reverse iteration.
403 class B2TIter : private Iter {
408 * Wrap Iter's 2 parameter ctor to force initialization to the
415 using Iter::next
[all...] |
| /external/skia/src/gpu/text/ |
| GrTextBlobCache.cpp | 15 SkTDynamicHash<GrAtlasTextBlob, GrAtlasTextBlob::Key>::Iter iter(&fCache);
16 while (!iter.done()) {
17 GrAtlasTextBlob* blob = &(*iter);
20 ++iter;
|
| /external/bison/src/ |
| state.h | 151 #define FOR_EACH_SHIFT(Transitions, Iter) \
152 for (Iter = 0; \
153 Iter < Transitions->num \
154 && (TRANSITION_IS_DISABLED (Transitions, Iter) \
155 || TRANSITION_IS_SHIFT (Transitions, Iter)); \
156 ++Iter) \
157 if (!TRANSITION_IS_DISABLED (Transitions, Iter))
|
| /external/skia/src/gpu/ |
| GrTraceMarker.cpp | 27 for (Iter iter = markerSet.begin(); iter != markerSet.end(); ++iter) {
28 this->add(*iter);
97 GrTraceMarkerSet::Iter GrTraceMarkerSet::begin() const {
98 return Iter(this, 0);
101 GrTraceMarkerSet::Iter GrTraceMarkerSet::end() const {
102 return Iter(this, this->fMarkerArray.count());
|
| GrLayerAtlas.h | 133 typedef PlotList::Iter PlotIter;
134 Plot* iterInit(PlotIter* iter, IterOrder order) {
135 return iter->init(fPlotList, kLRUFirst_IterOrder == order
136 ? PlotList::Iter::kTail_IterStart
137 : PlotList::Iter::kHead_IterStart);
|
| /external/skia/src/ports/ |
| SkOSFile_posix.cpp | 105 static_assert(sizeof(SkOSFileIterData) <= SkOSFile::Iter::kStorageSize, "not_enough_space");
107 SkOSFile::Iter::Iter() { new (fSelf.get()) SkOSFileIterData; }
109 SkOSFile::Iter::Iter(const char path[], const char suffix[]) {
114 SkOSFile::Iter::~Iter() {
122 void SkOSFile::Iter::reset(const char path[], const char suffix[]) {
147 bool SkOSFile::Iter::next(SkString* name, bool getDir) {
|
| SkOSFile_win.cpp | 134 static_assert(sizeof(SkOSFileIterData) <= SkOSFile::Iter::kStorageSize, "not_enough_space");
161 SkOSFile::Iter::Iter() { new (fSelf.get()) SkOSFileIterData; }
163 SkOSFile::Iter::Iter(const char path[], const char suffix[]) {
168 SkOSFile::Iter::~Iter() {
177 void SkOSFile::Iter::reset(const char path[], const char suffix[]) {
229 bool SkOSFile::Iter::next(SkString* name, bool getDir) {
|
| /external/libcxx/test/support/ |
| test_iterators.h | 309 template <class Iter>
310 inline Iter base(output_iterator<Iter> i) { return i.base(); }
312 template <class Iter>
313 inline Iter base(input_iterator<Iter> i) { return i.base(); }
315 template <class Iter>
316 inline Iter base(forward_iterator<Iter> i) { return i.base(); }
318 template <class Iter>
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/support/ |
| test_iterators.h | 287 template <class Iter>
288 inline Iter base(output_iterator<Iter> i) { return i.base(); }
290 template <class Iter>
291 inline Iter base(input_iterator<Iter> i) { return i.base(); }
293 template <class Iter>
294 inline Iter base(forward_iterator<Iter> i) { return i.base(); }
296 template <class Iter>
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill_n(Iter first, Size n, const T& value);
25 template <class Iter>
31 assert(std::fill_n(Iter(ca), UDI(n), char(1)) == std::next(Iter(ca), n));
38 template <class Iter>
44 assert(std::fill_n(Iter(ia), UDI(n), 1) == std::next(Iter(ia), n));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill_n(Iter first, Size n, const T& value);
22 template <class Iter>
28 assert(std::fill_n(Iter(ca), n, char(1)) == std::next(Iter(ca), n));
35 template <class Iter>
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
|
| /external/skia/src/core/ |
| SkRWBuffer.h | 30 class Iter {
32 Iter(const SkROBuffer*);
|
| SkPtrRecorder.h | 64 class Iter {
66 Iter(const SkPtrSet& set)
|
| SkTInternalLList.h | 177 class Iter {
184 Iter() : fCurr(NULL) {}
185 Iter(const Iter& iter) : fCurr(iter.fCurr) {}
186 Iter& operator= (const Iter& iter) { fCurr = iter.fCurr; return *this;
229 Iter iter; local
[all...] |
| /external/llvm/include/llvm/TableGen/ |
| SetTheory.h | 127 template<typename Iter>
128 void evaluate(Iter begin, Iter end, RecSet &Elts, ArrayRef<SMLoc> Loc) {
|
| /external/llvm/tools/llvm-pdbdump/ |
| LinePrinter.h | 40 template <typename Iter>
41 void SetFilters(std::list<Regex> &List, Iter Begin, Iter End) {
|
| /external/clang/include/clang/AST/ |
| UnresolvedSet.h | 36 explicit UnresolvedSetIterator(DeclAccessPair *Iter)
37 : iterator_adaptor_base(Iter) {}
38 explicit UnresolvedSetIterator(const DeclAccessPair *Iter)
39 : iterator_adaptor_base(const_cast<DeclAccessPair *>(Iter)) {}
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CastSizeChecker.cpp | 56 RecordDecl::field_iterator Iter(RD->field_begin());
59 for (; Iter != End; ++Iter)
60 Last = *Iter;
|
| /external/skia/include/private/ |
| SkTDict.h | 98 friend class Iter;
101 class Iter {
103 Iter(const SkTDict<T>& dict) {
143 friend class Iter;
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| mandelbrot.go | 57 const Iter = 50
69 for i := 0; i < Iter && (Tr+Ti <= Limit*Limit); i++ {
|
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| mandelbrot.go | 57 const Iter = 50
69 for i := 0; i < Iter && (Tr+Ti <= Limit*Limit); i++ {
|
