/external/libcxx/test/containers/associative/multiset/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
H A D | emplace_hint.pass.cpp | 33 assert(r == m.begin()); 35 assert(*m.begin() == DefaultOnly()); 39 assert(r == m.begin()); 41 assert(*m.begin() == DefaultOnly()); 50 assert(r == m.begin()); 52 assert(*m.begin() == Emplaceable()); 54 assert(r == next(m.begin())); 58 assert(r == next(m.begin())); 67 assert(r == m.begin()); 77 assert(r == m.begin()); [all...] |
/external/libcxx/test/containers/associative/set/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
H A D | emplace.pass.cpp | 34 assert(r.first == m.begin()); 36 assert(*m.begin() == DefaultOnly()); 41 assert(r.first == m.begin()); 43 assert(*m.begin() == DefaultOnly()); 53 assert(r.first == m.begin()); 55 assert(*m.begin() == Emplaceable()); 58 assert(r.first == next(m.begin())); 63 assert(r.first == next(m.begin())); 73 assert(r.first == m.begin()); 84 assert(r.first == m.begin()); [all...] |
H A D | emplace_hint.pass.cpp | 33 assert(r == m.begin()); 35 assert(*m.begin() == DefaultOnly()); 39 assert(r == m.begin()); 41 assert(*m.begin() == DefaultOnly()); 50 assert(r == m.begin()); 52 assert(*m.begin() == Emplaceable()); 54 assert(r == next(m.begin())); 58 assert(r == next(m.begin())); 67 assert(r == m.begin()); 77 assert(r == m.begin()); [all...] |
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
H A D | range.pass.cpp | 29 C c(I(std::begin(t)), I(std::end(t))); 31 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 33 assert(n == std::end(t) - std::begin(t)); 41 C c(I(std::begin(t)), I(std::end(t))); 43 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 45 assert(n == std::end(t) - std::begin(t));
|
H A D | range_alloc.pass.cpp | 32 C c(I(std::begin(t)), I(std::end(t)), A(13)); 34 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 36 assert(n == std::end(t) - std::begin(t)); 46 C c(I(std::begin(t)), I(std::end(t)), A()); 48 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 50 assert(n == std::end(t) - std::begin(t));
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | emplace_front.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1); 32 assert(*next(c.begin()) == Emplaceable()); 33 assert(distance(c.begin(), c.end()) == 2); 42 assert(distance(c.begin(), c.end()) == 1); 45 assert(*next(c.begin()) == Emplaceable()); 46 assert(distance(c.begin(), c.end()) == 2);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | merge.pass.cpp | 28 C c1(std::begin(t1), std::end(t1)); 29 C c2(std::begin(t2), std::end(t2)); 31 C c3(std::begin(t3), std::end(t3)); 41 C c1(std::begin(t1), std::end(t1)); 42 C c2(std::begin(t2), std::end(t2)); 44 C c3(std::begin(t3), std::end(t3));
|
H A D | merge_pred.pass.cpp | 29 C c1(std::begin(t1), std::end(t1)); 30 C c2(std::begin(t2), std::end(t2)); 32 C c3(std::begin(t3), std::end(t3)); 42 C c1(std::begin(t1), std::end(t1)); 43 C c2(std::begin(t2), std::end(t2)); 45 C c3(std::begin(t3), std::end(t3));
|
H A D | remove.pass.cpp | 27 C c1(std::begin(t1), std::end(t1)); 28 C c2(std::begin(t2), std::end(t2)); 36 C c1(std::begin(t1), std::end(t1)); 46 C c1(std::begin(t1), std::end(t1)); 47 C c2(std::begin(t2), std::end(t2)); 64 C c1(std::begin(t1), std::end(t1)); 65 C c2(std::begin(t2), std::end(t2)); 75 C c1(std::begin(t1), std::end(t1)); 76 C c2(std::begin(t2), std::end(t2)); 84 C c1(std::begin(t [all...] |
H A D | remove_if.pass.cpp | 32 C c1(std::begin(t1), std::end(t1)); 33 C c2(std::begin(t2), std::end(t2)); 41 C c1(std::begin(t1), std::end(t1)); 51 C c1(std::begin(t1), std::end(t1)); 52 C c2(std::begin(t2), std::end(t2)); 69 C c1(std::begin(t1), std::end(t1)); 70 C c2(std::begin(t2), std::end(t2)); 80 C c1(std::begin(t1), std::end(t1)); 81 C c2(std::begin(t2), std::end(t2)); 89 C c1(std::begin(t [all...] |
/external/libvpx/libvpx/vpx_ports/ |
H A D | vpx_timer.h | 49 LARGE_INTEGER begin, end; member in struct:vpx_usec_timer 51 struct timeval begin, end; 59 QueryPerformanceCounter(&t->begin); 61 gettimeofday(&t->begin, NULL); 81 diff.QuadPart = t->end.QuadPart - t->begin.QuadPart; 88 timersub(&t->end, &t->begin, &diff);
|
/external/lldb/source/DataFormatters/ |
H A D | TypeCategoryMap.cpp | 90 ActiveCategoriesList::iterator iter = m_active_categories.begin(); 144 MapIterator iter = m_map.begin(); 167 for (pos = m_map.begin(); pos != end; pos++) 186 ActiveCategoriesIterator begin, end = m_active_categories.end(); local 190 for (begin = m_active_categories.begin(); begin != end; begin++) 192 lldb::TypeCategoryImplSP category_sp = *begin; 214 ActiveCategoriesIterator begin, en local 243 ActiveCategoriesIterator begin, end = m_active_categories.end(); local [all...] |
/external/chromium_org/components/language_usage_metrics/ |
H A D | language_usage_metrics_unittest.cc | 22 EXPECT_EQ(JAPANESE, *language_set.begin()); 31 EXPECT_EQ(JAPANESE, *language_set.begin()); 36 EXPECT_EQ(JAPANESE, *language_set.begin()); 41 EXPECT_EQ(JAPANESE, *language_set.begin()); 46 EXPECT_EQ(JAPANESE, *language_set.begin()); 51 it = language_set.begin(); 59 it = language_set.begin(); 71 EXPECT_EQ(JAPANESE, *language_set.begin()); 76 EXPECT_EQ(SPANISH, *language_set.begin()); 81 it = language_set.begin(); [all...] |
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/ |
H A D | unicodestring.cc | 38 return equal(text_.begin(), text_.end(), rhs.text_.begin()); 43 for (UnicodeString::const_iterator it = unicode_string.begin(); 51 for (UnicodeText::const_iterator it = text_.begin(); it != text_.end(); 63 UnicodeText::const_iterator start_it = text_.begin(); 66 unicode_text.append(text_.begin(), start_it); 76 UnicodeText::const_iterator pos_it = text_.begin(); 79 unicode_text.append(text_.begin(), pos_it); 94 UnicodeText::const_iterator start_it = text_.begin(); 106 cached_it_ = text_.begin(); [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRecordOpts.cpp | 28 // - a bool onMatch(SkRceord*, Pattern*, unsigned begin, unsigned end) method, 33 // record, and [begin,end) span of the commands that matched. 38 unsigned begin, end = 0; local 40 while (pattern.search(record, &begin, &end)) { 41 changed |= pass->onMatch(record, &pattern, begin, end); 53 bool onMatch(SkRecord* record, Pattern* pattern, unsigned begin, unsigned end) { argument 54 record->replace<NoOp>(begin); // Save 71 bool onMatch(SkRecord* record, Pattern* pattern, unsigned begin, unsigned end) { argument 73 for (unsigned i = begin; i < end; i++) { 92 bool onMatch(SkRecord* record, Pattern* pattern, unsigned begin, unsigne argument [all...] |
/external/clang/test/Analysis/inlining/ |
H A D | containers.cpp | 30 clang_analyzer_eval(set.begin().impl == set.end().impl); 39 sub.useIterator(sub.begin()); 51 clang_analyzer_eval(w1.begin().impl.impl == w1.begin().impl.impl); 119 iterator begin() { function in class:MySet 194 wrapped_iterator begin() { function in class:BeginOnlySet 199 return IterImpl(impl.begin()); 221 return impl.begin(); 243 return impl.begin(); 267 return iterator{impl.begin() [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | input_iterator.pass.cpp | 28 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 30 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j) 39 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 41 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j) 49 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 51 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j) 60 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 62 for (std::list<int, min_allocator<int>>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j) 71 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 73 for (std::list<int, min_allocator<int>>::const_iterator i = l.begin(), [all...] |
/external/chromium_org/content/common/android/ |
H A D | address_parser_internal.cc | 24 const base::string16::const_iterator& begin) { 25 if (it == begin) 69 Word::Word(const base::string16::const_iterator& begin, argument 71 : begin(begin), 73 DCHECK(begin <= end); 111 word->begin = it_ - result_chars_; 118 const base::string16::const_iterator& begin, 120 it_ = begin_ = begin; 126 size_t max_iterations = end - begin 23 SafePreviousChar(const base::string16::const_iterator& it, const base::string16::const_iterator& begin) argument 117 Parse( const base::string16::const_iterator& begin, const base::string16::const_iterator& end, Word* word) argument [all...] |
/external/chromium_org/chrome/utility/importer/ |
H A D | nss_decryptor.cc | 161 size_t begin = i; local 168 if (end - begin < 5) 181 if (lines[begin].find(kRealmBracketBegin) != std::string::npos) { 184 if (lines[begin].find("://") == std::string::npos) 185 lines[begin] = "http://" + lines[begin]; 187 size_t start = lines[begin].find(kRealmBracketBegin); 188 url = GURL(lines[begin].substr(0, start)); 191 size_t end = lines[begin].rfind(kRealmBracketEnd); 192 realm = lines[begin] [all...] |
/external/libcxx/test/containers/associative/map/map.cons/ |
H A D | move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0); 40 assert(distance(mo.begin(), mo.end()) == 0); 62 assert(distance(m.begin(), m.end()) == 3); 63 assert(*m.begin() == V(1, 1)); 64 assert(*next(m.begin()) == V(2, 1)); 65 assert(*next(m.begin(), 2) == V(3, 1)); 70 assert(distance(mo.begin(), mo.end()) == 0); 81 assert(distance(m.begin(), m.end()) == 0); 86 assert(distance(mo.begin(), mo.end()) == 0); 108 assert(distance(m.begin(), [all...] |
/external/chromium_org/components/invalidation/ |
H A D | single_object_invalidation_set.cc | 22 invalidations_.insert(other.begin(), other.end()); 35 invalidations_.begin()->is_unknown_version(); 58 return std::equal(invalidations_.begin(), 60 other.invalidations_.begin(), 65 SingleObjectInvalidationSet::begin() const { function in class:syncer::SingleObjectInvalidationSet 66 return invalidations_.begin(); 90 for (InvalidationsSet::const_iterator it = invalidations_.begin();
|
/external/llvm/include/llvm/ADT/ |
H A D | SmallVector.h | 113 iterator begin() { return (iterator)this->BeginX; } function in class:llvm::SmallVectorTemplateCommon 114 const_iterator begin() const { return (const_iterator)this->BeginX; } function in class:llvm::SmallVectorTemplateCommon 125 reverse_iterator rend() { return reverse_iterator(begin()); } 126 const_reverse_iterator rend() const { return const_reverse_iterator(begin());} 128 size_type size() const { return end()-begin(); } 133 size_t capacity() const { return capacity_ptr() - begin(); } 136 pointer data() { return pointer(begin()); } 138 const_pointer data() const { return const_pointer(begin()); } 141 assert(begin() + idx < end()); 142 return begin()[id [all...] |
/external/stlport/test/unit/ |
H A D | slist_test.cpp | 78 for(i = str.begin(); i != str.end(); i++) 87 for(i = str.begin(); i != str.end(); i++) 97 for(i = str.begin(); i != str.end(); i++) 106 for(i = str.begin(); i != str.end(); i++) 130 slit = sl.erase(sl.begin()); 134 slit = sl.erase(sl.begin(), slit); 139 slit = sl.erase_after(sl.begin()); 142 slit = sl.begin(); ++slit; ++slit; 143 slit = sl.erase_after(sl.begin(), slit); 160 sl.insert(sl.begin(), [all...] |