/frameworks/base/core/java/android/text/ |
BidiFormatter.java | 85 * The default text direction heuristic. 189 * By default, uses the first-strong heuristic. 191 * @param heuristic the {@code TextDirectionHeuristic} to use. 194 public Builder setTextDirectionHeuristic(TextDirectionHeuristic heuristic) { 195 mTextDirectionHeuristic = heuristic; 262 * @param heuristic The default text direction heuristic. 264 private BidiFormatter(boolean isRtlContext, int flags, TextDirectionHeuristic heuristic) { 267 mDefaultTextDirectionHeuristic = heuristic; 292 * given explicitly by a heuristic to estimate the {@code str}'s directionality [all...] |
/frameworks/support/v4/java/android/support/v4/text/ |
BidiFormatter.java | 81 * The default text direction heuristic. 185 * By default, uses the first-strong heuristic. 187 * @param heuristic the {@code TextDirectionHeuristic} to use. 190 public Builder setTextDirectionHeuristic(TextDirectionHeuristicCompat heuristic) { 191 mTextDirectionHeuristicCompat = heuristic; 258 * @param heuristic The default text direction heuristic. 260 private BidiFormatter(boolean isRtlContext, int flags, TextDirectionHeuristicCompat heuristic) { 263 mDefaultTextDirectionHeuristicCompat = heuristic; 288 * given explicitly by a heuristic to estimate the {@code str}'s directionality [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
types.h | 64 // force_sequential, force_parallel, heuristic. 67 heuristic, enumerator in enum:__gnu_parallel::_AlgorithmStrategy
|
settings.h | 67 * c. heuristic 69 * For heuristic, the parallel algorithm implementation is called 276 _Settings() : algorithm_strategy(heuristic), sort_algorithm(MWMS), partial_sum_algorithm(LINEAR), multiway_merge_algorithm(LOSER_TREE), find_algorithm(CONSTANT_SIZE_BLOCKS), sort_splitting(EXACT), merge_splitting(EXACT), multiway_merge_splitting(EXACT), accumulate_minimal_n(1000), adjacent_difference_minimal_n(1000), count_minimal_n(1000), fill_minimal_n(1000), find_increasing_factor(2.0), find_initial_block_size(256), find_maximum_block_size(8192), find_sequential_search_size(256), for_each_minimal_n(1000), generate_minimal_n(1000), max_element_minimal_n(1000), merge_minimal_n(1000), merge_oversampling(10), min_element_minimal_n(1000), multiway_merge_minimal_n(1000), multiway_merge_minimal_k(2), multiway_merge_oversampling(10), nth_element_minimal_n(1000), partition_chunk_size(1000), partition_chunk_share(0.0), partition_minimal_n(1000), partial_sort_minimal_n(1000), partial_sum_dilation(1.0f), partial_sum_minimal_n(1000), random_shuffle_minimal_n(1000), replace_minimal_n(1000), set_difference_minimal_n(1000), set_intersection_minimal_n(1000), set_symmetric_difference_minimal_n(1000), set_union_minimal_n(1000), sort_minimal_n(1000), sort_mwms_oversampling(10), sort_qs_num_samples_preset(100), sort_qsb_base_case_maximal_n(100), transform_minimal_n(1000), unique_copy_minimal_n(10000), workstealing_chunk_size(100), L1_cache_size(16 << 10), L2_cache_size(256 << 10), TLB_size(128), cache_line_size(64), qsb_steals(0)
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
types.h | 66 // force_sequential, force_parallel, heuristic. 69 heuristic, enumerator in enum:__gnu_parallel::_AlgorithmStrategy
|
settings.h | 67 * c. heuristic 69 * For heuristic, the parallel algorithm implementation is called 288 algorithm_strategy(heuristic),
|
/external/chromium_org/chrome/browser/extensions/ |
extensions_quota_service.cc | 56 return std::string(); // No heuristic implies no limit. 64 for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin(); 65 heuristic != heuristics.end(); ++heuristic) { 66 // Apply heuristic to each item (bucket). 67 if (!(*heuristic)->ApplyToArgs(args, event_time)) { 68 failed_heuristic = *heuristic;
|
/external/chromium/chrome/browser/extensions/ |
extensions_quota_service.cc | 43 return true; // No heuristic implies no limit. 49 for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin(); 50 heuristic != heuristics.end(); ++heuristic) { 51 // Apply heuristic to each item (bucket). 52 global_decision = (*heuristic)->ApplyToArgs(args, event_time) &&
|
/external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
results.js | 94 // FIXME: Ideally this heuristic would be a bit smarter and not consider
|
/external/jdiff/src/jdiff/ |
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 197 /* Heuristic: check occasionally for a diagonal that has made 202 With this heuristic, for files with a constant small density 205 if (c > 200 && big_snake && heuristic)
|
/external/chromium_org/chrome/browser/extensions/api/web_request/ |
web_request_api.cc | 2253 ClearCacheQuotaHeuristic* heuristic = local [all...] |
/external/chromium_org/chrome/browser/resources/google_now/ |
background.js | 705 // prevents us from starting up everything (alarms are a heuristic to
|
/external/guava/guava/lib/ |
jdiff.jar | |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
difflib.py | 174 "automatic junk heuristic" that treats popular elements as junk [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
difflib.py | 174 "automatic junk heuristic" that treats popular elements as junk [all...] |
/development/samples/training/NavigationDrawer/libs/ |
android-support-v4.jar | |
/cts/suite/pts/deviceTests/browserbench/assets/octane/ |
deltablue.js | 605 * strength, strongest first, as a heuristic for avoiding
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-deltablue.js | 596 * strength, strongest first, as a heuristic for avoiding
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-deltablue.js | 596 * strength, strongest first, as a heuristic for avoiding
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-deltablue.js | 596 * strength, strongest first, as a heuristic for avoiding
|
/external/chromium_org/v8/benchmarks/ |
deltablue.js | 602 * strength, strongest first, as a heuristic for avoiding
|
/external/v8/benchmarks/ |
deltablue.js | 602 * strength, strongest first, as a heuristic for avoiding
|
/external/chromium_org/v8/src/ |
array.js | 163 // If the first element is a number then use the heuristic that the [all...] |
/external/v8/src/ |
array.js | 164 // If the first element is a number then use the heuristic that the [all...] |
/external/chromium_org/v8/test/mjsunit/ |
unicode-test.js | [all...] |