/external/chromium_org/third_party/WebKit/Source/core/frame/csp/ |
H A D | MediaListDirective.cpp | 29 void MediaListDirective::parse(const UChar* begin, const UChar* end) argument 31 const UChar* position = begin; 48 begin = position; 51 policy()->reportInvalidPluginTypes(String(begin, position - begin)); 60 policy()->reportInvalidPluginTypes(String(begin, position - begin)); 68 policy()->reportInvalidPluginTypes(String(begin, position - begin)); 77 policy()->reportInvalidPluginTypes(String(begin, positio [all...] |
/external/libcxx/test/containers/associative/set/set.cons/ |
H A D | copy_assign.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 3); 47 assert(*m.begin() == 1); 48 assert(*next(m.begin()) == 2); 49 assert(*next(m.begin(), 2) == 3); 54 assert(distance(mo.begin(), mo.end()) == 3); 55 assert(*mo.begin() == 1); 56 assert(*next(mo.begin()) == 2); 57 assert(*next(mo.begin(), 2) == 3); 72 assert(std::equal(m.begin(), m.end(), ar)); 96 assert(distance(m.begin(), [all...] |
H A D | default.pass.cpp | 26 assert(m.begin() == m.end()); 32 assert(m.begin() == m.end()); 37 assert(m.begin() == m.end());
|
H A D | copy.pass.cpp | 45 assert(distance(m.begin(), m.end()) == 3); 46 assert(*m.begin() == 1); 47 assert(*next(m.begin()) == 2); 48 assert(*next(m.begin(), 2) == 3); 53 assert(distance(mo.begin(), mo.end()) == 3); 54 assert(*mo.begin() == 1); 55 assert(*next(mo.begin()) == 2); 56 assert(*next(mo.begin(), 2) == 3); 80 assert(distance(m.begin(), m.end()) == 3); 81 assert(*m.begin() [all...] |
H A D | iter_iter_comp.pass.cpp | 43 assert(distance(m.begin(), m.end()) == 3); 44 assert(*m.begin() == 1); 45 assert(*next(m.begin()) == 2); 46 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
H A D | emplace.pass.cpp | 33 assert(r == m.begin()); 35 assert(m.begin()->first == 0); 36 assert(m.begin()->second == DefaultOnly()); 40 assert(r == next(m.begin())); 42 assert(next(m.begin())->first == 1); 43 assert(next(m.begin())->second == DefaultOnly()); 47 assert(r == next(m.begin(), 2)); 49 assert(next(m.begin(), 2)->first == 1); 50 assert(next(m.begin(), 2)->second == DefaultOnly()); 60 assert(r == m.begin()); [all...] |
H A D | emplace_hint.pass.cpp | 33 assert(r == m.begin()); 35 assert(m.begin()->first == 0); 36 assert(m.begin()->second == DefaultOnly()); 41 assert(r == next(m.begin())); 43 assert(next(m.begin())->first == 1); 44 assert(next(m.begin())->second == DefaultOnly()); 49 assert(r == next(m.begin(), 2)); 51 assert(next(m.begin(), 2)->first == 1); 52 assert(next(m.begin(), 2)->second == DefaultOnly()); 63 assert(r == m.begin()); [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | is_partitioned.pass.cpp | 30 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 36 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 42 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 48 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 54 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 55 input_iterator<const int*>(std::begin(ia)),
|
H A D | partition_point.pass.cpp | 30 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 36 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 42 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 48 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 54 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 60 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 66 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 72 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 73 forward_iterator<const int*>(std::begin(ia)),
|
/external/libcxx/test/containers/associative/map/map.cons/ |
H A D | copy.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 3); 47 assert(*m.begin() == V(1, 1)); 48 assert(*next(m.begin()) == V(2, 1)); 49 assert(*next(m.begin(), 2) == V(3, 1)); 54 assert(distance(mo.begin(), mo.end()) == 3); 55 assert(*mo.begin() == V(1, 1)); 56 assert(*next(mo.begin()) == V(2, 1)); 57 assert(*next(mo.begin(), 2) == V(3, 1)); 81 assert(distance(m.begin(), m.end()) == 3); 82 assert(*m.begin() [all...] |
H A D | 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)); 91 assert(distance(m.begin(), m.end()) == 3); 92 assert(*m.begin() [all...] |
H A D | copy_alloc.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 3); 47 assert(*m.begin() == V(1, 1)); 48 assert(*next(m.begin()) == V(2, 1)); 49 assert(*next(m.begin(), 2) == V(3, 1)); 54 assert(distance(mo.begin(), mo.end()) == 3); 55 assert(*mo.begin() == V(1, 1)); 56 assert(*next(mo.begin()) == V(2, 1)); 57 assert(*next(mo.begin(), 2) == V(3, 1)); 81 assert(distance(m.begin(), m.end()) == 3); 82 assert(*m.begin() [all...] |
/external/libcxx/test/containers/associative/multiset/multiset.cons/ |
H A D | move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0); 40 assert(distance(mo.begin(), mo.end()) == 0); 63 assert(distance(m.begin(), m.end()) == 9); 64 assert(*next(m.begin(), 0) == 1); 65 assert(*next(m.begin(), 1) == 1); 66 assert(*next(m.begin(), 2) == 1); 67 assert(*next(m.begin(), 3) == 2); 68 assert(*next(m.begin(), 4) == 2); 69 assert(*next(m.begin(), 5) == 2); 70 assert(*next(m.begin(), [all...] |
H A D | default.pass.cpp | 26 assert(m.begin() == m.end()); 32 assert(m.begin() == m.end()); 37 assert(m.begin() == m.end());
|
/external/libcxx/test/containers/associative/set/ |
H A D | insert_iter_iter.pass.cpp | 44 assert(*m.begin() == 1); 45 assert(*next(m.begin()) == 2); 46 assert(*next(m.begin(), 2) == 3); 68 assert(*m.begin() == 1); 69 assert(*next(m.begin()) == 2); 70 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | push_front_const.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 1); 30 assert(*next(c.begin()) == 1); 31 assert(distance(c.begin(), c.end()) == 2); 40 assert(distance(c.begin(), c.end()) == 1); 43 assert(*next(c.begin()) == 1); 44 assert(distance(c.begin(), c.end()) == 2);
|
H A D | push_front_rv.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1); 32 assert(*next(c.begin()) == 1); 33 assert(distance(c.begin(), c.end()) == 2); 42 assert(distance(c.begin(), c.end()) == 1); 45 assert(*next(c.begin()) == 1); 46 assert(distance(c.begin(), c.end()) == 2);
|
/external/libcxx/test/re/re.regex/re.regex.construct/ |
H A D | iter_iter_flg.pass.cpp | 40 test(F(s1.begin()), F(s1.end()), std::regex_constants::basic, 1); 41 test(F(s2.begin()), F(s2.end()), std::regex_constants::basic, 1); 42 test(F(s3.begin()), F(s3.end()), std::regex_constants::basic, 2); 43 test(F(s4.begin()), F(s4.end()), std::regex_constants::basic, 0); 45 test(F(s1.begin()), F(s1.end()), std::regex_constants::extended, 0); 46 test(F(s2.begin()), F(s2.end()), std::regex_constants::extended, 0); 47 test(F(s3.begin()), F(s3.end()), std::regex_constants::extended, 0); 48 test(F(s4.begin()), F(s4.end()), std::regex_constants::extended, 2); 50 test(F(s1.begin()), F(s1.end()), std::regex_constants::ECMAScript, 0); 51 test(F(s2.begin()), [all...] |
/external/elfutils/0.153/libdw/ |
H A D | dwarf_haspc.c | 65 Dwarf_Addr begin; local 69 &begin, &end)) > 0) 70 if (pc >= begin && pc < end)
|
/external/libcxx/test/containers/associative/map/map.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 43 assert(m.begin()->first == 1); 44 assert(m.begin()->second == 1); 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 1); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 1); 69 assert(m.begin()->first == 1); 70 assert(m.begin()->second == 1); 71 assert(next(m.begin())->first == 2); 72 assert(next(m.begin()) [all...] |
/external/stlport/test/unit/ |
H A D | rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0); 61 random_shuffle(v1.begin(), v1.end(), r); 62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); 63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); 64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); 65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); 66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); 67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); 68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); 69 CPPUNIT_ASSERT(count(v1.begin(), v [all...] |
/external/chromium_org/mojo/public/cpp/bindings/lib/ |
H A D | bounds_checker.cc | 39 uintptr_t begin = reinterpret_cast<uintptr_t>(position); local 40 uintptr_t end = begin + num_bytes; 42 if (!InternalIsValidRange(begin, end)) 65 uintptr_t begin = reinterpret_cast<uintptr_t>(position); local 66 uintptr_t end = begin + num_bytes; 68 return InternalIsValidRange(begin, end); 71 bool BoundsChecker::InternalIsValidRange(uintptr_t begin, uintptr_t end) const { argument 72 return end > begin && begin >= data_begin_ && end <= data_end_;
|
/external/clang/test/SemaCXX/ |
H A D | for-range-no-std.cpp | 5 int *begin(); 13 int begin(Range); // expected-note {{not viable}} 23 iter begin(ADL); // expected-note {{not viable}} 28 NS::iter begin(NS::NoADL); // expected-note {{not viable}}
|
/external/clang/unittests/AST/ |
H A D | ASTVectorTest.cpp | 23 V.insert(*C, V.begin(), 0);
|
/external/libcxx/test/containers/sequences/vector/ |
H A D | db_iterators_2.pass.cpp | 33 bool b = c1.begin() < c2.begin(); 42 bool b = c1.begin() < c2.begin();
|