| /external/linux-tools-perf/util/ |
| help.c | 73 static void pretty_print_string_list(struct cmdnames *cmds, int longest)
76 int space = longest + 1; /* min 1 SP between words */
201 unsigned int i, longest = 0; local
204 if (longest < main_cmds->names[i]->len)
205 longest = main_cmds->names[i]->len;
207 if (longest < other_cmds->names[i]->len)
208 longest = other_cmds->names[i]->len;
216 pretty_print_string_list(main_cmds, longest);
225 pretty_print_string_list(other_cmds, longest);
|
| parse-events.c | 363 int n, longest = -1; local
368 if (n > longest && !strncasecmp(*str, names[i][j], n))
369 longest = n;
371 if (longest > 0) {
372 *str += longest;
|
| /external/regex-re2/re2/ |
| bitstate.cc | 39 bool anchored, bool longest,
53 bool longest_; // whether search wants leftmost-longest match
294 bool anchored, bool longest,
306 longest_ = longest || prog_->anchor_end();
355 // If full match, we ask for an anchored longest match
370 bool longest = kind != kFirstMatch; local
371 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| nfa.cc | 42 // * If longest is true, returns the longest match starting
51 bool anchored, bool longest,
112 bool longest_; // whether searching for longest match
346 // Leftmost-longest mode: save this match only if
401 bool anchored, bool longest,
425 longest = true;
437 longest_ = longest;
441 // longest match (if longest is true) and also to tel
[all...] |
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 54 bool anchored, bool longest,
67 bool longest_; // whether search wants leftmost-longest match
95 bool anchored, bool longest,
106 longest_ = longest | prog_->anchor_end();
231 // If full match, we ask for an anchored longest match
246 bool longest = kind != kFirstMatch; local
247 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| exhaustive_tester.cc | 103 RE2::Options longest; local
104 longest.set_longest_match(true);
105 RE2 relongest(regexp, longest);
|
| /external/linux-tools-perf/ |
| builtin-help.c | 280 unsigned int i, longest = 0; local
283 if (longest < strlen(common_cmds[i].name))
284 longest = strlen(common_cmds[i].name);
289 printf(" %-*s ", longest, common_cmds[i].name);
|
| /development/samples/training/bitmapfun/src/com/example/android/bitmapfun/ui/ |
| ImageDetailActivity.java | 67 // For this sample we'll use half of the longest width to resize our images. As the
72 final int longest = (height > width ? height : width) / 2; local
79 mImageFetcher = new ImageFetcher(this, longest);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| ImageGeometry.java | 386 float longest = (float) Math.sqrt(x * x + y * y) / 2; local
387 float minX = centerX - longest;
388 float maxX = centerX + longest;
389 float minY = centerY - longest;
390 float maxY = centerY + longest;
|
| /external/icu4c/tools/tzcode/ |
| zdump.c | 160 static size_t longest; variable
427 longest = 0;
429 if (strlen(argv[i]) > longest)
430 longest = strlen(argv[i]);
440 (fakeenv[0] = (char *) malloc(longest + 4)) == NULL) {
747 (void) printf("%-*s ", (int) longest, zone);
|
| /external/chromium/chrome/browser/resources/touch_ntp/standalone/ |
| standalone_hack.js | 99 description: 'Create the longest path possible and challenge your ' +
|
| /external/iproute2/doc/ |
| ip-cref.tex | [all...] |
