| /external/chromium/webkit/glue/resources/ |
| webkit_strings_de.xtb | 29 <translation id="5776402066334188252">Bitte bestätigen Sie, dass Sie dieses Plug-in installieren möchten. Installieren Sie nur Plug-ins, denen Sie vertrauen.</translation>
40 <translation id="5253117816378681419">Bitte bestätigen Sie, dass Sie das Plug-in <ph name="PLUGIN"/> installieren möchten. Installieren Sie nur Plug-ins, denen Sie vertrauen.</translation>
|
| /external/clang/lib/Sema/ |
| SemaOverload.cpp | [all...] |
| /external/icu4c/data/mappings/ |
| macos-29-10.2.ucm | 19 # |1 for the best fallback codepage byte sequence.
21 # |3 for the best reverse fallback Unicode scaler value
|
| macos-7_3-10.2.ucm | 19 # |1 for the best fallback codepage byte sequence.
21 # |3 for the best reverse fallback Unicode scaler value
|
| /external/icu4c/i18n/unicode/ |
| udatpg.h | 32 * will return the "best fit" pattern corresponding to that skeleton.
185 * Get the best pattern matching the input skeleton. It is guaranteed to
200 * The best pattern found from the given skeleton.
214 * Get the best pattern matching the input skeleton. It is guaranteed to
234 * The best pattern found from the given skeleton.
449 * "hhmmssSSSS", and the best matching pattern internally is "H:mm:ss", and
478 * "dd-MMMM hh:mm". This is used internally to get the best match for the
510 * "dd-MMMM hh:mm". This is used internally to get the best match for the
|
| /external/iproute2/ |
| README.iproute2+tc | 92 # direct it to class 1:4 and prescribe to fall to best effort,
101 # direct it to class 1:4 and prescribe to fall to best effort,
|
| /external/llvm/lib/CodeGen/ |
| CalcSpillWeights.cpp | 99 // Find the best physreg hist and the best virtreg hint.
|
| /external/qemu/elff/ |
| dwarf_die.h | 55 /* Gets the best name for this DIE.
58 * tries its best to get DIE name by iterating through different methods of
|
| /external/quake/quake/src/QW/server/ |
| pr_exec.c | 224 dfunction_t *f, *best; local
233 best = NULL;
240 best = f;
243 if (best)
246 Con_Printf ("%7i %s\n", best->profile, PR_GetString(best->s_name));
248 best->profile = 0;
250 } while (best);
|
| /external/quake/quake/src/WinQuake/ |
| pr_exec.cpp | 224 dfunction_t *f, *best; local
233 best = NULL;
240 best = f;
243 if (best)
246 Con_Printf ("%7i %s\n", best->profile, pr_strings+best->s_name);
248 best->profile = 0;
250 } while (best);
|
| /external/speex/libspeex/ |
| quant_lsp_bfin.h | 62 " R5 = 0;\n\t" /* R5: best cb entry */
124 " R5 = 0;\n\t" /* R5: best cb entry */
|
| vq.c | 75 /*Finds the indices of the n-best entries in a codebook*/
109 /*Finds the indices of the n-best entries in a codebook with sign*/
|
| cb_search.c | 158 /*Find new n-best based on previous n-best j*/
379 /*Find new n-best based on previous n-best j*/
391 /*update n-best list*/
|
| /external/srec/srec/Semproc/include/ |
| SR_SemanticResult.h | 45 * @param list [out] List of keys associated with n-best list entry.
88 * @param list [out] List of keys associated with n-best list entry.
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| heap.h | 87 // pop the (best/worst) from the heap
97 // return value of best in heap
|
| /external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| test_failures.py | 41 """Takes a set of test_failures and returns which result type best fits
42 the list of failures. "Best fits" means we use the worst type of failure.
|
| /frameworks/base/core/java/android/net/ |
| RouteInfo.java | 234 * Find the route from a Collection of routes that best matches a given address.
238 * @return the RouteInfo from the Collection that best fits the given address
|
| /frameworks/base/docs/html/guide/webapps/ |
| index.jd | 66 <dt><a href="{@docRoot}guide/webapps/best-practices.html"><strong>Best Practices for Web
|
| /frameworks/base/nfc-extras/java/com/android/nfc_extras/ |
| NfcAdapterExtras.java | 61 // best effort recovery
160 * NFC service dead - attempt best effort recovery
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| dwarf_die.h | 55 /* Gets the best name for this DIE.
58 * tries its best to get DIE name by iterating through different methods of
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| LocalMergeAlbum.java | 107 int k = -1; // k points to the best slot up to now.
119 // Pick the best slot and refill it.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/grid/ |
| GridMatch.java | 28 /** The distance to the matched edge - used to pick best matches */
51 * @param distance the absolute distance from the ideal match - used to find the best
|
| /sdk/ide_common/src/com/android/ide/common/resources/configuration/ |
| VersionQualifier.java | 147 // what we have is already the best possible match (exact match)
150 // got new exact value, this is the best!
|
| /external/webp/src/enc/ |
| quant.c | 393 int prev; // best previous
428 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous
502 // Inspect all possible non-dead predecessors. Retain only the best one.
530 // Now, record best terminal node (and thus best entry in the graph).
537 best_path[0] = n; // best eob position
538 best_path[1] = m; // best level
539 best_path[2] = p; // best predecesso
[all...] |
| /external/chromium/chrome/browser/autocomplete/ |
| history_url_provider.h | 200 // See if a shorter version of the best match should be created, and if so
202 // are prefixes of the best match (if they've been visited enough, compared
203 // to the best match), or create host-only suggestions even when they haven't
231 // Returns the best prefix that begins |text|. "Best" means "greatest number
|
