| /prebuilts/gdb/darwin-x86/lib/python2.7/idlelib/ |
| SearchDialog.py | 14 pat = text.get("sel.first", "sel.last")
46 last = "%d.%d" % (line, j)
49 sellast = text.index("sel.last")
50 if selfirst == first and sellast == last:
56 text.tag_add("sel", first, last)
57 text.mark_set("insert", self.engine.isback() and first or last)
65 pat = text.get("sel.first", "sel.last")
|
| /prebuilts/gdb/linux-x86/lib/python2.7/idlelib/ |
| SearchDialog.py | 14 pat = text.get("sel.first", "sel.last")
46 last = "%d.%d" % (line, j)
49 sellast = text.index("sel.last")
50 if selfirst == first and sellast == last:
56 text.tag_add("sel", first, last)
57 text.mark_set("insert", self.engine.isback() and first or last)
65 pat = text.get("sel.first", "sel.last")
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialog.py | 14 pat = text.get("sel.first", "sel.last")
46 last = "%d.%d" % (line, j)
49 sellast = text.index("sel.last")
50 if selfirst == first and sellast == last:
56 text.tag_add("sel", first, last)
57 text.mark_set("insert", self.engine.isback() and first or last)
65 pat = text.get("sel.first", "sel.last")
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialog.py | 14 pat = text.get("sel.first", "sel.last")
46 last = "%d.%d" % (line, j)
49 sellast = text.index("sel.last")
50 if selfirst == first and sellast == last:
56 text.tag_add("sel", first, last)
57 text.mark_set("insert", self.engine.isback() and first or last)
65 pat = text.get("sel.first", "sel.last")
|
| /external/v8/src/interpreter/ |
| bytecode-peephole-optimizer.cc | 77 // An action shouldn't leave a NOP as last bytecode unless it has
87 // The rules for allowing the elision of the last bytecode based
102 // expression positions. Whenever the last bytecode is elided it's
106 // The last bytecode could be elided for the MAYBE cases if the last
121 Bytecode new_bytecode, BytecodeNode* const last,
123 DCHECK_EQ(last->bytecode(), Bytecode::kLdaSmi);
124 BytecodeNode node(new_bytecode, last->operand(0), current->operand(0),
126 if (last->source_info().is_valid()) {
127 node.set_source_info(last->source_info())
[all...] |
| /external/google-breakpad/src/common/linux/ |
| linux_libc_support_unittest.cc | 171 const char* last; local
173 last = my_read_hex_ptr(&result, "");
175 ASSERT_EQ(*last, 0);
177 last = my_read_hex_ptr(&result, "0");
179 ASSERT_EQ(*last, 0);
181 last = my_read_hex_ptr(&result, "0123");
183 ASSERT_EQ(*last, 0);
185 last = my_read_hex_ptr(&result, "0123a");
187 ASSERT_EQ(*last, 0);
189 last = my_read_hex_ptr(&result, "0123a-")
196 const char* last; local
[all...] |
| /external/kernel-headers/original/uapi/asm-generic/ |
| msgbuf.h | 27 __kernel_time_t msg_stime; /* last msgsnd time */
31 __kernel_time_t msg_rtime; /* last msgrcv time */
35 __kernel_time_t msg_ctime; /* last change time */
42 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
43 __kernel_pid_t msg_lrpid; /* last receive pid */
|
| /external/kernel-headers/original/uapi/asm-mips/asm/ |
| msgbuf.h | 21 __kernel_time_t msg_stime; /* last msgsnd time */
28 __kernel_time_t msg_rtime; /* last msgrcv time */
35 __kernel_time_t msg_ctime; /* last change time */
42 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
43 __kernel_pid_t msg_lrpid; /* last receive pid */
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/strftime/ |
| coverage.txt | 8 conformance/interfaces/strftime/1-1.c:67: warning: `%c' yields only last 2 digits of year in some locales
9 conformance/interfaces/strftime/1-1.c:95: warning: `%D' yields only last 2 digits of year
10 conformance/interfaces/strftime/1-1.c:132: warning: `%g' yields only last 2 digits of year
11 conformance/interfaces/strftime/1-1.c:312: warning: `%x' yields only last 2 digits of year in some locales
12 conformance/interfaces/strftime/1-1.c:330: warning: `%y' yields only last 2 digits of year
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| api_def_NthElement.pbtxt | 6 1-D or higher with last dimension at least `n+1`.
12 0-D. Position of sorted vector to select along the last dimension (along
19 The `n`-th order statistic along each last dimensional slice.
29 summary: "Finds values of the `n`-th order statistic for the last dimension."
35 nth-smallest value in each row (resp. vector along the last dimension). Thus,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/asm-generic/ |
| msgbuf.h | 26 __kernel_time_t msg_stime; /* last msgsnd time */
30 __kernel_time_t msg_rtime; /* last msgrcv time */
34 __kernel_time_t msg_ctime; /* last change time */
41 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
42 __kernel_pid_t msg_lrpid; /* last receive pid */
|
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_carray.swg | 36 carray(_Iterator first, _Iterator last) {
37 assign(first, last);
52 void assign(_Iterator first, _Iterator last) {
53 if (std::distance(first,last) == size()) {
54 std::copy(first, last, v);
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/arm/ |
| thumb2_it_bad.l | 2 [^:]*:8: Error: branch must be last instruction in IT block -- `beq foo'
3 [^:]*:9: Error: branch must be last instruction in IT block -- `bleq foo'
4 [^:]*:10: Error: branch must be last instruction in IT block -- `blxeq r0'
6 [^:]*:13: Error: branch must be last instruction in IT block -- `bxeq r0'
7 [^:]*:14: Error: branch must be last instruction in IT block -- `tbbeq \[r0,r1\]'
|
| /external/python/cpython3/Lib/idlelib/ |
| replace.py | 41 last = text.index("sel.last")
43 last = None
45 last = last or first
46 self.show_hit(first, last)
108 first = last = None
123 last = "%d.%d" % (line, j)
125 text.mark_set("insert", last)
128 if first != last
[all...] |
| /external/libdivsufsort/lib/ |
| sssort.c | 168 saidx_t *first, saidx_t *last, saidx_t depth) {
173 for(i = last - 2; first <= i; --i) {
175 do { *(j - 1) = *j; } while((++j < last) && (*j < 0));
176 if(last <= j) { break; }
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) {
267 t = last - first;
272 return ss_median3(Td, PA, first, middle, last - 1);
275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1);
281 last = ss_median3(Td, PA, last - 1 - (t << 1), last - 1 - t, last - 1)
[all...] |
| /development/tools/idegen/src/ |
| Stopwatch.java | 22 long last = System.currentTimeMillis(); field in class:Stopwatch
26 Log.info(label + ": " + (now - last) + "ms");
27 last = now;
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/FaultTolerantWritePei/ |
| FaultTolerantWritePei.uni | 4 // This module installs gEdkiiFaultTolerantWriteGuid PPI to inform the check for FTW last write data has been done.
18 #string STR_MODULE_ABSTRACT #language en-US "This module installs gEdkiiFaultTolerantWriteGuid PPI to inform the check for FTW last write data has been done."
20 #string STR_MODULE_DESCRIPTION #language en-US "This module installs gEdkiiFaultTolerantWriteGuid PPI to inform the check for FTW last write data has been done."
|
| /external/autotest/client/site_tests/video_YouTubePage/ |
| control.last_second | 7 PURPOSE = "Verify that YouTube page HTML5 video plays last second of video."
10 last second of the video.
21 This test verifies a YouTube video plays the last second fully.
|
| /external/pdfium/fxbarcode/ |
| BC_Utils.cpp | 13 uint32_t last,
16 if (first > last || count <= 0) {
19 dst.Delete(first, last - first);
|
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowAbsListView.java | 40 * Robolectric accessor for the last smoothScrolledPosition
49 * Robolectric accessor for the last smoothScrollBy distance
58 * Robolectric accessor for the last smoothScrollBy duration
|
| /external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/ |
| ShadowAbsListView.java | 40 * Robolectric accessor for the last smoothScrolledPosition
49 * Robolectric accessor for the last smoothScrollBy distance
58 * Robolectric accessor for the last smoothScrollBy duration
|
| /external/toybox/toys/lsb/ |
| seq.c | 1 /* seq.c - Count from first to last, by increment.
14 usage: seq [-w|-f fmt_str] [-s sep_str] [first] [increment] last
16 Count from first to last, by increment. Omitted arguments default
17 to 1. Two arguments are used as first and last. Arguments can be
60 double first = 1, increment = 1, last, dd; local
67 default: last = parsef(toys.optargs[toys.optc-1]);
79 dd = (double []){first, increment, last}[i];
85 // Other implementations output nothing if increment is 0 and first > last,
86 // but loop forever if first < last or even first == last. We outpu
[all...] |
| /external/v8/tools/clang/plugins/tests/ |
| enum_last_value_from_c.c | 5 // We warn when xxxLAST constants aren't last.
24 // We don't warn when xxxLAST constants are last.
33 // We don't warn when xxx_LAST constants are last.
|
| /frameworks/base/core/tests/coretests/src/android/widget/gridview/touch/ |
| GridTouchStackFromBottomTest.java | 62 assertEquals("Last item not the last child in the grid",
65 assertEquals("Last item not at the bottom of the grid",
79 assertEquals("Last item not the last child in the grid",
82 assertEquals("Last item not at the bottom of the grid",
96 assertEquals("Last item not the last child in the grid",
99 assertEquals("Last item not at the bottom of the grid",
113 assertEquals("Last item not the last child in the grid"
[all...] |
| /external/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
| spreadsort.hpp | 65 find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAccessIter & min)
69 while(++current < last) {
80 find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAccessIter & min, compare comp)
83 while(++current < last) {
130 spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset
136 find_extremes(first, last, max, min);
141 unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min >> 0)));
149 for (RandomAccessIter current = first; current != last;)
185 bins[bin_count - 1] = last;
192 size_t max_count = get_max_count(log_divisor, last - first);
[all...] |
