| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
|
| size_value_alloc.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
26 std::list<int>::const_iterator i = l.begin();
36 assert(std::distance(l.begin(), l.end()) == 3);
37 std::list<int>::const_iterator i = l.begin();
48 assert(std::distance(l.begin(), l.end()) == 3);
49 std::list<int>::const_iterator i = l.begin();
60 assert(std::distance(l.begin(), l.end()) == 3);
61 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
71 assert(std::distance(l.begin(), l.end()) == 3);
72 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
[all...] |
| default.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
50 assert(std::distance(l.begin(), l.end()) == 0);
55 assert(std::distance(l.begin(), l.end()) == 0);
60 assert(std::distance(l.begin(), l.end()) == 0);
65 assert(std::distance(l.begin(), l.end()) == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/multiset.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/set.cons/ |
| default.pass.cpp | 26 assert(m.begin() == m.end());
32 assert(m.begin() == m.end());
39 assert(m.begin() == m.end());
45 assert(m.begin() == m.end());
51 assert(m.begin() == m.end());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
|
| size_value_alloc.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
26 std::list<int>::const_iterator i = l.begin();
36 assert(std::distance(l.begin(), l.end()) == 3);
37 std::list<int>::const_iterator i = l.begin();
48 assert(std::distance(l.begin(), l.end()) == 3);
49 std::list<int>::const_iterator i = l.begin();
60 assert(std::distance(l.begin(), l.end()) == 3);
61 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
71 assert(std::distance(l.begin(), l.end()) == 3);
72 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| emplace.pass.cpp | 34 assert(r == m.begin());
36 assert(*m.begin() == DefaultOnly());
40 assert(r == next(m.begin()));
42 assert(*m.begin() == DefaultOnly());
51 assert(r == m.begin());
53 assert(*m.begin() == Emplaceable());
55 assert(r == next(m.begin()));
59 assert(r == next(m.begin(), 2));
68 assert(r == m.begin());
77 assert(r == m.begin());
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| emplace.pass.cpp | 34 assert(r == m.begin());
36 assert(*m.begin() == DefaultOnly());
40 assert(r == next(m.begin()));
42 assert(*m.begin() == DefaultOnly());
51 assert(r == m.begin());
53 assert(*m.begin() == Emplaceable());
55 assert(r == next(m.begin()));
59 assert(r == next(m.begin(), 2));
68 assert(r == m.begin());
77 assert(r == m.begin());
[all...] |
| /system/core/libmemunreachable/ |
| HeapWalker.cpp | 33 bool HeapWalker::Allocation(uintptr_t begin, uintptr_t end) {
34 if (end == begin) {
35 end = begin + 1;
37 Range range{begin, end};
40 valid_allocations_range_.begin = std::min(valid_allocations_range_.begin, begin);
47 MEM_ALOGE("range %p-%p overlaps with existing range %p-%p", reinterpret_cast<void*>(begin),
48 reinterpret_cast<void*>(end), reinterpret_cast<void*>(overlap.begin),
62 if (value >= valid_allocations_range_.begin && value < valid_allocations_range_.end)
[all...] |
| /art/compiler/utils/ |
| intrusive_forward_list_test.cc | 64 ASSERT_EQ(std::distance((expected).begin(), (expected).end()), \
65 std::distance((value).begin(), (value).end())); \
66 ASSERT_TRUE(std::equal((expected).begin(), (expected).end(), (value).begin())); \
129 typename ListType::iterator begin = ifl.begin(); local
131 typename ListType::const_iterator converted_begin = begin;
145 ASSERT_TRUE(ifl.begin() == ifl.cbegin());
146 ASSERT_FALSE(ifl.begin() != ifl.cbegin());
150 ASSERT_TRUE(ifl.begin() == ifl.end()); // Empty
[all...] |
| /external/libcxx/test/std/numerics/numeric.ops/exclusive.scan/ |
| exclusive_scan.pass.cpp | 35 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
40 std::exclusive_scan(v.begin(), v.end(), v.begin(), init);
41 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
65 std::fill(v.begin(), v.end(), 3);
66 std::exclusive_scan(v.begin(), v.end(), v.begin(), 50);
73 std::iota(v.begin(), v.end(), 0);
74 std::exclusive_scan(v.begin(), v.end(), v.begin(), 30)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/exclusive.scan/ |
| exclusive_scan.pass.cpp | 32 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
37 std::exclusive_scan(v.begin(), v.end(), v.begin(), init);
38 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
62 std::fill(v.begin(), v.end(), 3);
63 std::exclusive_scan(v.begin(), v.end(), v.begin(), 50);
70 std::iota(v.begin(), v.end(), 0);
71 std::exclusive_scan(v.begin(), v.end(), v.begin(), 30)
[all...] |
| /external/icu/icu4c/source/common/ |
| uchriter.cpp | 83 && begin == realThat.begin
89 return ustr_hashUCharsN(text, textLength) ^ pos ^ begin ^ end;
99 pos = begin;
109 pos = begin;
120 if(pos > begin) {
129 if(position < begin) {
130 pos = begin;
145 if (pos >= begin && pos < end) {
179 if (pos > begin) {
[all...] |
| /external/webrtc/webrtc/system_wrappers/include/ |
| stl_util.h | 47 void STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) {
48 while (begin != end) {
49 ForwardIterator temp = begin;
50 ++begin;
63 void STLDeleteContainerPairPointers(ForwardIterator begin,
65 while (begin != end) {
66 ForwardIterator temp = begin;
67 ++begin;
77 void STLDeleteContainerPairFirstPointers(ForwardIterator begin,
79 while (begin != end)
[all...] |
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter.pass.cpp | 41 std::vector<int>::const_iterator i = l1.begin();
46 assert(distance(l1.begin(), l1.end()) == 2);
48 assert(*l1.begin() == 1);
49 assert(*next(l1.begin()) == 3);
54 assert(distance(l1.begin(), l1.end()) == 1);
55 assert(*l1.begin() == 1);
57 j = l1.erase(l1.begin());
60 assert(distance(l1.begin(), l1.end()) == 0);
67 std::vector<int, min_allocator<int>>::const_iterator i = l1.begin();
72 assert(distance(l1.begin(), l1.end()) == 2)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.modifiers/ |
| erase_iter.pass.cpp | 41 std::vector<int>::const_iterator i = l1.begin();
46 assert(distance(l1.begin(), l1.end()) == 2);
48 assert(*l1.begin() == 1);
49 assert(*next(l1.begin()) == 3);
54 assert(distance(l1.begin(), l1.end()) == 1);
55 assert(*l1.begin() == 1);
57 j = l1.erase(l1.begin());
60 assert(distance(l1.begin(), l1.end()) == 0);
67 std::vector<int, min_allocator<int>>::const_iterator i = l1.begin();
72 assert(distance(l1.begin(), l1.end()) == 2)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| AbstractStorelessUnivariateStatistic.java | 80 * @param begin the index of the first element to include
86 public double evaluate(final double[] values, final int begin, final int length) {
87 if (test(values, begin, length)) {
89 incrementAll(values, begin, length);
139 * @param begin index of the first array element to add
144 public void incrementAll(double[] values, int begin, int length) {
145 if (test(values, begin, length)) {
146 int k = begin + length;
147 for (int i = begin; i < k; i++) {
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
| copy.pass.cpp | 29 C c0(std::begin(t), std::end(t), A(10));
32 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
34 assert(n == std::end(t) - std::begin(t));
44 C c0(std::begin(t), std::end(t), A(10));
47 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
49 assert(n == std::end(t) - std::begin(t));
58 C c0(std::begin(t), std::end(t), A());
61 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
63 assert(n == std::end(t) - std::begin(t));
|
| copy_alloc.pass.cpp | 28 C c0(std::begin(t), std::end(t), A(10));
31 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
33 assert(n == std::end(t) - std::begin(t));
42 C c0(std::begin(t), std::end(t), A(10));
45 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
47 assert(n == std::end(t) - std::begin(t));
57 C c0(std::begin(t), std::end(t), A());
60 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
62 assert(n == std::end(t) - std::begin(t));
|
