/external/chromium_org/extensions/browser/ |
D | quota_service.cc | 66 for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin(); in Assess() local 67 heuristic != heuristics.end(); in Assess() 68 ++heuristic) { in Assess() 70 if (!(*heuristic)->ApplyToArgs(args, event_time)) { in Assess() 71 failed_heuristic = *heuristic; in Assess()
|
/external/chromium/chrome/browser/extensions/ |
D | extensions_quota_service.cc | 49 for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin(); in Assess() local 50 heuristic != heuristics.end(); ++heuristic) { in Assess() 52 global_decision = (*heuristic)->ApplyToArgs(args, event_time) && in Assess()
|
/external/jdiff/src/jdiff/ |
D | DiffMyers.java | 66 public boolean heuristic = false; field in DiffMyers 205 if (c > 200 && big_snake && heuristic) in diag()
|
/external/chromium/chrome/browser/ui/cocoa/ |
D | framed_browser_window.mm | 26 // like what the heuristic does when there are just a few tabs.
|
D | browser_window_controller.mm | 121 // this heuristic.) We don't, in general, want to shrink the window if the 1745 // |-windowWillMove| is called too early for us to apply our heuristic. (The 1746 // heuristic we use for detecting window movement is that if |windowTopGrowth_
|
/external/chromium_org/chrome/browser/ui/cocoa/ |
D | framed_browser_window.mm | 49 // like what the heuristic does when there are just a few tabs.
|
D | browser_window_controller.mm | 143 // this heuristic.) We don't, in general, want to shrink the window if the 1845 // |-windowWillMove| is called too early for us to apply our heuristic. (The 1846 // heuristic we use for detecting window movement is that if |windowTopGrowth_
|
/external/harfbuzz_ng/ |
D | NEWS | 306 - Unicode normalization shaping heuristic during glyph mapping.
|
/external/llvm/test/Transforms/MemCpyOpt/ |
D | form-memset.ll | 223 ; More aggressive heuristic
|
/external/llvm/test/CodeGen/X86/ |
D | multiple-loop-post-inc.ll | 6 ; machine scheduler develops an equivalent heuristic.
|
D | lsr-reuse.ll | 48 ; TODO: That's an over-general heuristic. It would be better for the target
|
/external/chromium_org/chrome/browser/extensions/api/web_request/ |
D | web_request_api.cc | 2330 ClearCacheQuotaHeuristic* heuristic = in GetQuotaLimitHeuristics() local 2332 heuristics->push_back(heuristic); in GetQuotaLimitHeuristics()
|
/external/chromium_org/third_party/harfbuzz-ng/ |
D | NEWS | 465 - Unicode normalization shaping heuristic during glyph mapping.
|
/external/clang/include/clang/Driver/ |
D | CC1Options.td | 85 HelpText<"Specify the function selection heuristic used during inlining">;
|
/external/elfutils/ |
D | NEWS | 773 Implement better hash size optimization heuristic in ld. It uses a formula
|
/external/chromium_org/third_party/libxml/src/ |
D | NEWS | 560 areBlanks() heuristic failure, duplicate attributes in DTD bug 1893 - It is possible to disable the ignorable blanks heuristic used by 1899 avoiding heuristic is really the Right Way :-\
|
D | ChangeLog | 1614 * parser.c: fixed the heuristic used when trying to detect mixed-content 1727 on validation errors, the heuristic to guess is a vctxt user 3837 * parser.c: fixing bug #166777 (and #169838), it was an heuristic 10060 * HTMLparser.c: fixed a nasty bug #119387, bad heuristic from
|
/external/ceres-solver/docs/source/ |
D | solving.rst | 1443 which break this finite difference heuristic, but they do not come 2034 rank. ``SuiteSparse``/``CHOLMOD`` supplies a heuristic for 2036 is only a heuristic and can have both false positive and false
|
/external/llvm/docs/ |
D | LangRef.rst | 927 heuristic is used to determine if a function needs stack protectors 928 or not. The heuristic used will enable protectors for functions with: 949 protector. This attribute causes a strong heuristic to be used when 950 determining if a function needs stack protectors. The strong heuristic
|
/external/zlib/src/ |
D | ChangeLog | 1074 - remove block truncation heuristic which had very marginal effect for zlib
|
/external/chromium_org/third_party/icu/patches/ |
D | segmentation.patch | 290 + // the following heuristic to Katakana: any continuous run of Katakana
|