| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| 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));
|
| /external/libvpx/libvpx/vpx_ports/ |
| vpx_timer.h | 52 LARGE_INTEGER begin, end; member in struct:vpx_usec_timer
54 struct timeval begin, end;
68 QueryPerformanceCounter(&t->end);
70 gettimeofday(&t->end, NULL);
78 diff.QuadPart = t->end.QuadPart - t->begin.QuadPart;
85 timersub(&t->end, &t->begin, &diff);
|
| /external/ltp/lib/ |
| get_path.c | 57 const char *end; local
64 end = strchr(start, ':');
66 if (end != NULL)
67 snprintf(buf, MIN(buf_len, (size_t) (end - start + 1)),
84 * If there is no '/' ad the end of path from $PATH add it.
98 start = end + 1;
100 } while (end != NULL);
|
| /external/pdfium/core/fpdfdoc/ |
| cpvt_wordrange.h | 19 CPVT_WordRange(const CPVT_WordPlace& begin, const CPVT_WordPlace& end)
20 : BeginPos(begin), EndPos(end) {
29 void Set(const CPVT_WordPlace& begin, const CPVT_WordPlace& end) {
31 EndPos = end;
40 void SetEndPos(const CPVT_WordPlace& end) {
41 EndPos = end;
|
| /external/piex/src/binary_parse/ |
| cached_paged_byte_array.cc | 20 // at the begining of the vector, the most recent at the end.
35 const unsigned char** end,
42 *end = cached_pages_[cache_index].end;
45 // Remove the page to insert it at the end of the cache later.
50 paged_byte_array_->getPage(page_index, begin, end, page);
58 // Cache the most recently used page to the end of the vector.
63 cache_page.end = *end;
|
| /external/skia/resources/lua/ |
| test.lua | 11 end
18 end
20 rndX = function () return rnd(640) end
21 rndY = function () return rnd(480) end
27 end
34 end
43 end
44 end
55 end
56 end
[all...] |
| /external/skia/tools/lua/ |
| ngrams_aggregate.lua | 11 end
16 end
22 end
|
| scrape.lua | 6 end
11 end
16 end
17 end
19 end
37 end
44 end
59 end
69 end
70 end
[all...] |
| /external/skqp/platform_tools/android/apps/skqp/src/main/assets/resources/lua/ |
| test.lua | 11 end
18 end
20 rndX = function () return rnd(640) end
21 rndY = function () return rnd(480) end
27 end
34 end
43 end
44 end
55 end
56 end
[all...] |
| /external/skqp/resources/lua/ |
| test.lua | 11 end
18 end
20 rndX = function () return rnd(640) end
21 rndY = function () return rnd(480) end
27 end
34 end
43 end
44 end
55 end
56 end
[all...] |
| /external/skqp/tools/lua/ |
| ngrams_aggregate.lua | 11 end
16 end
22 end
|
| scrape.lua | 6 end
11 end
16 end
17 end
19 end
37 end
44 end
59 end
69 end
70 end
[all...] |
| /external/syslinux/gpxe/src/image/ |
| segment.c | 46 physaddr_t end = user_to_phys ( segment, memsz ); local
49 DBG ( "Preparing segment [%lx,%lx,%lx)\n", start, mid, end );
53 DBG ( "Insane segment [%lx,%lx,%lx)\n", start, mid, end );
66 ( end <= memmap.regions[i].end ) ) {
75 start, mid, end );
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/utils/ |
| sparse_column_iterable_test.cc | 33 EXPECT_EQ(iterable.begin(), iterable.end());
55 EXPECT_EQ(1, range.end);
59 EXPECT_EQ(4, range.end);
63 EXPECT_EQ(5, range.end);
67 EXPECT_EQ(7, range.end);
71 EXPECT_GE(range.start, range.end);
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/ |
| reinterpret_string_to_float_op.cc | 39 int32 end) {
43 for (int32 i = start; i < end; ++i) {
70 auto work = [&input_data, output_data, num_data](int64 start, int64 end) {
71 CHECK(start <= end);
72 CHECK(end <= num_data);
74 static_cast<int32>(end));
|
| /frameworks/base/core/java/android/widget/ |
| RtlSpacingHelper.java | 21 * RtlSpacingHelper manages the relationship between left/right and start/end for views
54 public void setRelative(int start, int end) {
56 mEnd = end;
59 if (end != UNDEFINED) mLeft = end;
63 if (end != UNDEFINED) mRight = end;
|
| /frameworks/minikin/tests/unittest/ |
| BidiUtilsTest.cpp | 38 EXPECT_NE(bidiText.end(), it);
42 EXPECT_EQ(bidiText.end(), it);
47 EXPECT_NE(bidiText.end(), it);
51 EXPECT_EQ(bidiText.end(), it);
56 EXPECT_NE(bidiText.end(), it);
60 EXPECT_EQ(bidiText.end(), it);
65 EXPECT_NE(bidiText.end(), it);
69 EXPECT_EQ(bidiText.end(), it);
74 EXPECT_NE(bidiText.end(), it);
78 EXPECT_EQ(bidiText.end(), it)
[all...] |
| /frameworks/support/slices/core/src/main/java/androidx/slice/ |
| ArrayUtils.java | 42 final int end; local
44 end = array.length;
45 result = (T[]) Array.newInstance(kind, end + 1);
46 System.arraycopy(array, 0, result, 0, end);
48 end = 0;
51 result[end] = element;
|
| /frameworks/support/v7/appcompat/src/main/java/androidx/appcompat/widget/ |
| RtlSpacingHelper.java | 21 * RtlSpacingHelper manages the relationship between left/right and start/end for views
54 public void setRelative(int start, int end) {
56 mEnd = end;
59 if (end != UNDEFINED) mLeft = end;
63 if (end != UNDEFINED) mRight = end;
|
| /libcore/ojluni/src/test/java/time/test/java/time/chrono/ |
| TestChronologyPerf.java | 45 long end = System.nanoTime(); local
46 Duration d = Duration.of(end - start, ChronoUnit.NANOS);
51 end = System.nanoTime();
52 d = Duration.of(end - start, ChronoUnit.NANOS);
57 end = System.nanoTime();
58 d = Duration.of(end - start, ChronoUnit.NANOS);
|
| /packages/apps/Email/src/com/android/email/mail/internet/ |
| EmailHtmlUtil.java | 40 int end = 0; local
43 out.append(text.substring(end, start));
44 end = match.end();
48 for (int i = 1, n = end - start; i < n; ++i) {
62 out.append(text.substring(end));
|
| /packages/inputmethods/LatinIME/common/src/com/android/inputmethod/latin/common/ |
| CollectionUtils.java | 40 * @param end Last index exclusive to be converted.
41 * @throws IllegalArgumentException if start or end are out of range or start > end.
45 final int end) {
46 if (start < 0 || start > end || end > array.length) {
47 throw new IllegalArgumentException("Invalid start: " + start + " end: " + end
51 final ArrayList<E> list = new ArrayList<>(end - start);
52 for (int i = start; i < end; i++)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.modifiers/ |
| insert_iter_cv.pass.cpp | 31 R r = m.insert(m.end(), v1);
38 r = m.insert(m.end(), v2);
45 r = m.insert(m.end(), v3);
46 assert(r == prev(m.end()));
52 r = m.insert(m.end(), v4);
53 assert(r == prev(m.end()));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_iter_cv.pass.cpp | 30 R r = m.insert(m.end(), v1);
37 r = m.insert(m.end(), v2);
44 r = m.insert(m.end(), v3);
45 assert(r == prev(m.end()));
51 r = m.insert(prev(m.end()), v4);
52 assert(r == prev(m.end(), 2));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
| 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));
|
