| /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;
|
| /bionic/libc/upstream-freebsd/lib/libc/string/ |
| wcsrchr.c | 35 const wchar_t *last; local
37 last = NULL;
40 last = s;
46 return ((wchar_t *)last);
|
| /bionic/libc/upstream-openbsd/lib/libc/string/ |
| strtok.c | 35 static char *last; local
37 return strtok_r(s, delim, &last);
41 strtok_r(char *s, const char *delim, char **last)
48 if (s == NULL && (s = *last) == NULL)
62 *last = NULL;
80 *last = s;
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_basic_block.h | 26 ir_instruction *last,
|
| /external/mesa3d/src/glsl/ |
| ir_basic_block.h | 26 ir_instruction *last,
|
| /external/valgrind/main/memcheck/tests/ |
| sbfragment.stdout.exp | 1 after 3000 loops, last size block requested 96032008
|
| /development/tools/yuv420sp2rgb/ |
| debug.c | 9 int i, last; local
13 for (i = last = 0; i < len; i++) {
22 while (last < i) {
23 if (isprint(pchr[last]))
24 fputc(pchr[last], s);
29 last++;
|
| /external/libexif/test/ |
| test-sorted.c | 33 ExifTag last = 0, current; local
34 num = exif_tag_table_count() - 1; /* last entry is a NULL terminator */
37 if (current < last) {
46 last = current;
|
| /frameworks/base/core/java/android/content/ |
| ContentUris.java | 73 * Converts the last path segment to a long.
76 * stored in the last segment.
79 * @throws NumberFormatException if the last segment isn't a number
81 * @return the long conversion of the last segment or -1 if the path is
85 String last = contentUri.getLastPathSegment(); local
86 return last == null ? -1 : Long.parseLong(last);
|
| /external/chromium_org/native_client_sdk/src/libraries/sdk_util/ |
| string_util.h | 23 size_t last = 0; local
27 std::string tmp(str, last, i - last);
32 last = i + 1;
|
| /external/chromium_org/third_party/libaddressinput/src/cpp/src/util/ |
| string_split.cc | 21 size_t last = 0; local
25 std::string tmp(str, last, i - last);
31 last = i + 1;
|
| /external/oprofile/daemon/ |
| opd_mangling.h | 30 int opd_open_sample_file(odb_t *file, struct sfile *last,
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
45 s_top=source+last;
47 d_top=dest+last;
62 long last=nr_elements-1; local
76 for(;last-first>2;)
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
81 if(first_equal>pos) last=first_equal-1;
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
45 s_top=source+last;
47 d_top=dest+last;
62 long last=nr_elements-1; local
76 for(;last-first>2;)
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
81 if(first_equal>pos) last=first_equal-1;
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
45 s_top=source+last;
47 d_top=dest+last;
62 long last=nr_elements-1; local
76 for(;last-first>2;)
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
81 if(first_equal>pos) last=first_equal-1;
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /external/chromium_org/cc/base/ |
| scoped_ptr_algorithm.h | 16 ForwardIterator last,
19 for (; first != last; ++first) {
|
| /external/oprofile/libregex/tests/ |
| regex_test.cpp | 36 string test, expect, last; local
38 while (getline(fin, last)) {
39 last = trim(last);
40 if (last.length() == 0 || last[0] == '#')
44 test = last;
47 expect = last;
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_qsort.c | 110 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon13116
111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
113 #define doLeft {first=ffirst;llast=last;continue;}
114 #define doRight {ffirst=first;last=llast;continue;}
117 last=llast=stack[stacktop].last;\
133 * 3. We choose a pivot by looking at the first, last
187 { size_t l=last-ffirst,r=llast-first;
325 char *first,*last; local
356 char *first,*last; local
387 char *first,*last; local
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 15 // max_element(Iter first, Iter last);
24 test(Iter first, Iter last)
26 Iter i = std::max_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
33 assert(i == last);
|
| max_element_comp.pass.cpp | 15 // max_element(Iter first, Iter last, Compare comp);
25 test(Iter first, Iter last)
27 Iter i = std::max_element(first, last, std::greater<int>());
28 if (first != last)
30 for (Iter j = first; j != last; ++j)
34 assert(i == last);
|
| min_element.pass.cpp | 15 // min_element(Iter first, Iter last);
24 test(Iter first, Iter last)
26 Iter i = std::min_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
33 assert(i == last);
|
| min_element_comp.pass.cpp | 15 // min_element(Iter first, Iter last, Compare comp);
25 test(Iter first, Iter last)
27 Iter i = std::min_element(first, last, std::greater<int>());
28 if (first != last)
30 for (Iter j = first; j != last; ++j)
34 assert(i == last);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 15 // max_element(Iter first, Iter last);
24 test(Iter first, Iter last)
26 Iter i = std::max_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
33 assert(i == last);
|
| min_element.pass.cpp | 15 // min_element(Iter first, Iter last);
24 test(Iter first, Iter last)
26 Iter i = std::min_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
33 assert(i == last);
|
| /libcore/luni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 156 // Find the last element in unenqueued.
157 Reference<?> last = unenqueued; local
158 while (last.pendingNext != unenqueued) {
159 last = last.pendingNext;
162 last.pendingNext = list;
163 last = list;
164 while (last.pendingNext != list) {
165 last = last.pendingNext
[all...] |
