| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| recall2.sed | 3 # have to obey leftmost-longest. The tricky part is to recompile
|
| /cts/tests/tests/webkitsecurity/assets/ |
| select-crash-002.html | 11 <h1>The Longest German Word?</h1>
|
| select-crash-001.html | 11 <h1 id="test">The Longest German Word?</h1>
|
| /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);
|
| /external/chromium/chrome/browser/ |
| oom_priority_manager.h | 23 // been idle for longest, and take up the most memory, in that order
|
| /external/icu4c/common/ |
| ucat.c | 20 * Longest possible key is "-2147483648%-2147483648" */
|
| triedict.h | 79 * iterator is left after the longest prefix match in the dictionary.
153 * iterator is left after the longest prefix match in the dictionary.
201 * iterator is left after the longest prefix match in the dictionary.
284 * iterator is left after the longest prefix match in the dictionary.
|
| unisetspan.cpp | 217 // span(longest match) but only the relevant ones for span(while contained).
547 * + Remember the longest recursive span (the farthest end point).
549 * nor for any set string, then stop and return the longest recursive span length.
568 * and find the longest recursive match from their end.
614 * must be matched with a full overlap because the longest-match algorithm
619 * ~ Remember the longest set string match (farthest end point) from the earliest
624 * longest match from the earliest position.
690 // For longest match, we do need to try to match even an all-contained string
700 // Longest match: Need to match fully inside the code point span
715 maxInc=inc; // Longest match from earliest start
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
| wb_vad_c.h | 71 #define HANG_HIGH 12 /* longest hangover */
73 #define HANG_P1 THR_LOW /* threshold for longest hangover */
78 #define BURST_HIGH 8 /* longest burst length */
80 #define BURST_P1 THR_HIGH /* threshold for longest burst */
|
| /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/icu4c/i18n/ |
| ucurrimp.h | 32 * code. If multiple display names match, then the longest one is
|
| uni2name.cpp | 81 // Accomodate the longest possible name plus padding
|
| name2uni.cpp | 119 // Accomodate the longest possible name
225 // If we go past the longest possible name then abort.
|
| rbt_set.h | 60 * Length of the longest preceding context
91 * @return the length of the longest preceding context.
|
| /external/sqlite/android/ |
| PhonebookIndex.h | 36 * to hold the longest phone book index (e.g. a three-char word in Japan).
|
| /external/zlib/doc/ |
| algorithm.txt | 25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
|
| /external/chromium/chrome/common/extensions/docs/server/ |
| README | 40 view and delete the version which was deployed the longest time ago. Then
|
| /external/grub/stage2/ |
| defs.h | 84 * MAXPATHLEN defines the longest permissible path length
|
| /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);
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashTable.cpp | 50 printf("longest collision chain: %d\n", maxCollisions);
|
| /development/samples/training/bitmapfun/src/com/example/android/bitmapfun/ui/ |
| ImageDetailActivity.java | 67 final int longest = height > width ? height : width; local
70 mImageWorker = new ImageFetcher(this, longest);
|
| /external/iproute2/man/man8/ |
| tc-drr.8 | 84 This implementation does not drop packets from the longest queue on overrun,
|
| /external/libselinux/src/ |
| avc_sidtab.c | 127 "%s: %d SID entries and %d/%d buckets used, longest "
|
| /external/sepolicy/ |
| ocontexts | 52 # proc labeling can be further refined (longest matching prefix).
|
