/external/libcxx/test/containers/sequences/vector/ |
H A D | db_iterators_3.pass.cpp | 33 int i = c1.begin() - c2.begin(); 42 int i = c1.begin() - c2.begin();
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | find.pass.cpp | 26 std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), false); 27 assert(j-b.begin() == i); 34 std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), true); 35 assert(j-b.begin() == i);
|
/external/libcxx/test/iterators/stream.iterators/iterator.range/ |
H A D | begin_array.pass.cpp | 12 // template <class T, size_t N> T* begin(T (&array)[N]); 20 int* i = std::begin(ia);
|
/external/libcxx/test/strings/basic.string/string.iterators/ |
H A D | db_iterators_2.pass.cpp | 32 bool b = s1.begin() < s2.begin(); 40 bool b = s1.begin() < s2.begin();
|
H A D | db_iterators_3.pass.cpp | 32 int i = s1.begin() - s2.begin(); 40 int i = s1.begin() - s2.begin();
|
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugRanges.cpp | 45 // Range::iterator pos = ranges.begin(); 47 // for (pos = ranges.begin(); pos != end_pos; ++pos) 63 // Range::iterator pos = ranges.begin(); 65 // for (pos = ranges.begin(); pos != end_pos; ++pos) 95 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); local 97 if (!begin && !end) 107 if (begin == 0xFFFFull) 108 begin = LLDB_INVALID_ADDRESS; 112 if (begin == 0xFFFFFFFFull) 113 begin 143 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); local [all...] |
/external/stlport/stlport/stl/ |
H A D | _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin()); 17 return lexicographical_compare(__x.begin(), __x.end(), 18 __y.begin(), __y.end());
|
/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | splice_pos_list.pass.cpp | 32 assert(distance(l1.begin(), l1.end()) == 0); 34 assert(distance(l2.begin(), l2.end()) == 0); 41 assert(distance(l1.begin(), l1.end()) == 1); 43 assert(distance(l2.begin(), l2.end()) == 0); 44 std::list<int>::const_iterator i = l1.begin(); 52 assert(distance(l1.begin(), l1.end()) == 2); 54 assert(distance(l2.begin(), l2.end()) == 0); 55 std::list<int>::const_iterator i = l1.begin(); 65 assert(distance(l1.begin(), l1.end()) == 3); 67 assert(distance(l2.begin(), l [all...] |
/external/openfst/src/include/fst/ |
H A D | interval-set.h | 40 T begin; member in struct:fst::IntervalSet::Interval 43 Interval() : begin(-1), end(-1) {} 45 Interval(T b, T e) : begin(b), end(e) {} 48 return begin < i.begin || (begin == i.begin && end > i.end); 52 return begin == i.begin && end == i.end; 56 return begin ! [all...] |
/external/chromium_org/net/proxy/ |
H A D | proxy_server.cc | 21 std::string::const_iterator begin, 23 if (LowerCaseEqualsASCII(begin, end, "proxy")) 25 if (LowerCaseEqualsASCII(begin, end, "socks")) { 31 if (LowerCaseEqualsASCII(begin, end, "socks4")) 33 if (LowerCaseEqualsASCII(begin, end, "socks5")) 35 if (LowerCaseEqualsASCII(begin, end, "direct")) 37 if (LowerCaseEqualsASCII(begin, end, "https")) 39 if (LowerCaseEqualsASCII(begin, end, "quic")) 48 ProxyServer::Scheme GetSchemeFromURIInternal(std::string::const_iterator begin, argument 50 if (LowerCaseEqualsASCII(begin, en 20 GetSchemeFromPacTypeInternal( std::string::const_iterator begin, std::string::const_iterator end) argument 95 FromURI(std::string::const_iterator begin, std::string::const_iterator end, Scheme default_scheme) argument 146 FromPacString(std::string::const_iterator begin, std::string::const_iterator end) argument 216 FromSchemeHostAndPort( Scheme scheme, std::string::const_iterator begin, std::string::const_iterator end) argument [all...] |
/external/libcxx/test/containers/associative/map/map.cons/ |
H A D | copy_assign.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)); 55 assert(distance(mo.begin(), mo.end()) == 3); 56 assert(*mo.begin() == V(1, 1)); 57 assert(*next(mo.begin()) == V(2, 1)); 58 assert(*next(mo.begin(), 2) == V(3, 1)); 73 assert(std::equal(m.begin(), m.end(), ar)); 97 assert(distance(m.begin(), [all...] |
H A D | initializer_list_compare.pass.cpp | 39 assert(distance(m.begin(), m.end()) == 3); 40 assert(*m.begin() == V(1, 1)); 41 assert(*next(m.begin()) == V(2, 1)); 42 assert(*next(m.begin(), 2) == V(3, 1)); 61 assert(distance(m.begin(), m.end()) == 3); 62 assert(*m.begin() == V(1, 1)); 63 assert(*next(m.begin()) == V(2, 1)); 64 assert(*next(m.begin(), 2) == V(3, 1));
|
H A D | iter_iter.pass.cpp | 40 assert(distance(m.begin(), m.end()) == 3); 41 assert(*m.begin() == V(1, 1)); 42 assert(*next(m.begin()) == V(2, 1)); 43 assert(*next(m.begin(), 2) == V(3, 1)); 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));
|
H A D | 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));
|
/external/libcxx/test/containers/associative/map/map.modifiers/ |
H A D | emplace.pass.cpp | 35 assert(r.first == m.begin()); 37 assert(m.begin()->first == 0); 38 assert(m.begin()->second == DefaultOnly()); 43 assert(r.first == next(m.begin())); 45 assert(next(m.begin())->first == 1); 46 assert(next(m.begin())->second == DefaultOnly()); 51 assert(r.first == next(m.begin())); 53 assert(next(m.begin())->first == 1); 54 assert(next(m.begin())->second == DefaultOnly()); 65 assert(r.first == m.begin()); [all...] |
/external/chromium_org/third_party/WebKit/Source/core/frame/csp/ |
H A D | CSPSourceList.h | 24 void parse(const UChar* begin, const UChar* end); 36 bool parseSource(const UChar* begin, const UChar* end, String& scheme, String& host, int& port, String& path, CSPSource::WildcardDisposition&, CSPSource::WildcardDisposition&); 37 bool parseScheme(const UChar* begin, const UChar* end, String& scheme); 38 bool parseHost(const UChar* begin, const UChar* end, String& host, CSPSource::WildcardDisposition&); 39 bool parsePort(const UChar* begin, const UChar* end, int& port, CSPSource::WildcardDisposition&); 40 bool parsePath(const UChar* begin, const UChar* end, String& path); 41 bool parseNonce(const UChar* begin, const UChar* end, String& nonce); 42 bool parseHash(const UChar* begin, const UChar* end, DigestValue& hash, ContentSecurityPolicyHashAlgorithm&);
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/clover/core/ |
H A D | geometry.hpp | 40 auto it = std::copy(v.begin(), v.end(), a.begin()); 45 std::copy(v, v + N, a.begin()); 58 std::transform(a.begin(), a.end(), p.a.begin(), 59 q.a.begin(), std::plus<T>()); 64 return std::inner_product(p.a.begin(), p.a.end(), a.begin(), 0);
|
/external/deqp/framework/delibs/decpp/ |
H A D | dePoolString.cpp | 35 std::copy(begin(), end(), str.begin()); 44 std::copy(str, str+len, begin()+oldEnd); 52 std::copy(str.begin(), str.end(), begin()+oldEnd); 60 std::copy(str.begin(), str.end(), begin()+oldEnd); 65 for (PoolString::ConstIterator i = string.begin(); i != string.end(); i++)
|
/external/libcxx/test/containers/associative/set/set.cons/ |
H A D | copy_alloc.pass.cpp | 44 assert(distance(m.begin(), m.end()) == 3); 45 assert(*m.begin() == 1); 46 assert(*next(m.begin()) == 2); 47 assert(*next(m.begin(), 2) == 3); 52 assert(distance(mo.begin(), mo.end()) == 3); 53 assert(*mo.begin() == 1); 54 assert(*next(mo.begin()) == 2); 55 assert(*next(mo.begin(), 2) == 3);
|
H A D | iter_iter_alloc.pass.cpp | 52 assert(distance(m.begin(), m.end()) == 3); 53 assert(*m.begin() == 1); 54 assert(*next(m.begin()) == 2); 55 assert(*next(m.begin(), 2) == 3); 77 assert(distance(m.begin(), m.end()) == 3); 78 assert(*m.begin() == 1); 79 assert(*next(m.begin()) == 2); 80 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.access/ |
H A D | front.pass.cpp | 27 C c(std::begin(t), std::end(t)); 31 assert(*c.begin() == 10); 37 const C c(std::begin(t), std::end(t)); 39 assert(*c.begin() == 0); 46 C c(std::begin(t), std::end(t)); 50 assert(*c.begin() == 10); 56 const C c(std::begin(t), std::end(t)); 58 assert(*c.begin() == 0);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | clear.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 0); 33 C c(std::begin(t), std::end(t)); 36 assert(distance(c.begin(), c.end()) == 0); 39 assert(distance(c.begin(), c.end()) == 0); 47 assert(distance(c.begin(), c.end()) == 0); 53 C c(std::begin(t), std::end(t)); 56 assert(distance(c.begin(), c.end()) == 0); 59 assert(distance(c.begin(), c.end()) == 0);
|
/external/libcxx/test/iterators/iterator.range/ |
H A D | Android.mk | 19 test_name := iterators/iterator.range/begin-end 20 test_src := begin-end.pass.cpp
|
/external/mesa3d/src/gallium/state_trackers/clover/core/ |
H A D | geometry.hpp | 40 auto it = std::copy(v.begin(), v.end(), a.begin()); 45 std::copy(v, v + N, a.begin()); 58 std::transform(a.begin(), a.end(), p.a.begin(), 59 q.a.begin(), std::plus<T>()); 64 return std::inner_product(p.a.begin(), p.a.end(), a.begin(), 0);
|
/external/chromium_org/tools/deep_memory_profiler/lib/ |
H A D | range_dict.py | 17 """A class like dict whose key is a range [begin, end) of integers. 25 An instance of this class is accessed only via iter_range(begin, end). 28 1) If the given range [begin, end) is not covered by the instance, 31 2) If the given range [begin, end) exactly covers ranges in the instance, 35 3) If the given range [begin, end) starts at and/or ends at a mid-point of 43 4) If the given range [begin, end) includes non-existing ranges in an 68 def iter_range(self, begin=None, end=None): 69 if not begin: 70 begin = self._tree.min_key() 76 self._tree[begin] [all...] |