Searched refs:heuristic (Results 1 - 9 of 9) sorted by relevance
/external/chromium_org/extensions/browser/ |
H A D | quota_service.cc | 58 return std::string(); // No heuristic implies no limit. 66 for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin(); 67 heuristic != heuristics.end(); 68 ++heuristic) { 69 // Apply heuristic to each item (bucket). 70 if (!(*heuristic)->ApplyToArgs(args, event_time)) { 71 failed_heuristic = *heuristic;
|
/external/valgrind/main/memcheck/ |
H A D | mc_leakcheck.c | 431 UInt heuristic: (sizeof(UInt)*8)-3; member in struct:__anon33030 433 // LchNone if state != Reachable or no heuristic needed to 513 // are considered reachable due to the corresponding heuristic. 599 default: return "???invalid heuristic???"; 675 // If ch is heuristically reachable via an heuristic member of heur_set, 676 // returns this heuristic. 791 if (ex->heuristic && ptr == ch->data) 792 // If block was considered reachable via an heuristic, and it is now 793 // directly reachable via ptr, clear the heuristic field. 794 ex->heuristic [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | math_semantic_tree.js | 9 * given MathML expression. This is a very heuristic approach that assumes a 677 // heuristic otherwise we get them as implicit operations! 684 * This is the main heuristic to rewrite a flat row of terms into a meaningful 913 * The basic idea of the heuristic is as follows: 1347 var heuristic = cvox.SemanticTree.classifyFunction_(firstNode, restNodes); 1349 if (!heuristic) { 1355 var newRest = this.getFunctionArgs_(firstNode, processedRest, heuristic); 1361 * Classifies a function wrt. the heuristic that should be applied. 1366 * @return {!string} The string specifying the heuristic. 1423 * given heuristic [all...] |
/external/jdiff/src/jdiff/ |
H A D | DiffMyers.java | 63 /** When set to true, the comparison uses a heuristic to speed it up. 64 With this heuristic, for files with a constant small density 66 public boolean heuristic = false; field in class:DiffMyers 202 With this heuristic, for files with a constant small density 205 if (c > 200 && big_snake && heuristic)
|
/external/valgrind/main/memcheck/tests/ |
H A D | leak_cpp_interior.stderr.exp | 13 of which reachable via heuristic: 27 of which reachable via heuristic: 40 of which reachable via heuristic: 52 of which reachable via heuristic: 61 block at 0x........ considered reachable by ptr 0x........ using newarray heuristic
|
/external/chromium_org/extensions/browser/api/web_request/ |
H A D | web_request_api.cc | 2113 // This quota heuristic is intended to limit the number of times the cache is 2437 ClearCacheQuotaHeuristic* heuristic = local 2439 heuristics->push_back(heuristic);
|
/external/guava/guava/lib/ |
H A D | jdiff.jar | META-INF/ META-INF/MANIFEST.MF jdiff/ jdiff/API.class API.java package jdiff ... |
/external/robolectric/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |
Completed in 209 milliseconds