HomeSort by relevance Sort by last modified time
    Searched full:heuristic (Results 1 - 25 of 163) sorted by null

1 2 3 4 5 6 7

  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
predict.def 47 /* Heuristic applying when no heuristic below applies. */
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/
predict.def 47 /* Heuristic applying when no heuristic below applies. */
  /prebuilt/linux-x86/toolchain/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)
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/
gmon.h 100 * This is a heuristic; we will fail with a warning when profiling programs
106 * text size, thus raising the number of arcs expected by the heuristic).
112 * hides the inadequacy of the ARCDENSITY heuristic, at least
  /external/protobuf/
CONTRIBUTORS.txt 49 * Heuristic detection of sub-messages when printing unknown fields in
  /external/webkit/WebCore/platform/graphics/skia/
NativeImageSkia.cpp 108 // Otherwise, use the heuristic that if more than 1/4 of the image is
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/
NewItemSelectionDialog.java 134 // The heuristic is that generally one keeps adding the same kind of items to the
138 // Another heuristic is to find the most used item and default to that.
142 // Finally the last heuristic is to see if there's an item with a name
  /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/apache-http/src/org/apache/http/message/
LineParser.java 82 * This method implements a <i>heuristic</i> to check for a
  /external/kernel-headers/original/asm-arm/
elf.h 104 heuristic always trips on them. Until these binaries become uncommon
  /external/webkit/JavaScriptCore/wtf/
CrossThreadRefCounted.h 112 // is a heuristic but it seems to always work and has helped
  /external/webkit/WebKitTools/android/flex-2.5.4a/MISC/Macintosh/
alloca.c 22 invocation. This heuristic does not reclaim storage as
  /libcore/luni/src/main/java/java/math/
Multiplication.java 33 // static final int whenUseKaratsuba = 63; // an heuristic value
  /external/e2fsprogs/lib/blkid/
devname.c 513 * heuristic: partition name ends in a digit, & partition
517 * heuristic: size is 1
  /external/webkit/WebCore/accessibility/
AccessibilityTable.cpp 74 // the following is a heuristic used to determine if a
89 // this employs a heuristic to determine if this table should appear.
  /frameworks/base/core/java/android/bluetooth/
BluetoothPbap.java 219 * This is a simple heuristic that tries to guess if a device with the
BluetoothClass.java 265 * This is a simple heuristic that tries to guess if a device with the
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/editors/layout/gscripts/
IViewRule.java 62 * own heuristic, which is to keep the first 2 package components and the class name.
  /external/chromium/net/proxy/
proxy_service.h 262 // heuristic).
  /external/chromium/third_party/icu/source/i18n/
ucal.cpp 90 // heuristic: Starting with the current time, march
  /external/freetype/src/truetype/
ttpload.c 497 /* The limit for `num_records' is a heuristic value. */
  /external/icu4c/common/
dictbe.cpp 373 // We do this in code rather than using a rule so that the heuristic
  /packages/apps/Gallery3D/src/com/cooliris/media/
MediaClustering.java 106 // Heuristic to get min and max cluster size - half and double the
  /external/chromium/third_party/icu/source/common/
dictbe.cpp 378 // We do this in code rather than using a rule so that the heuristic
656 // the following heuristic to Katakana: any continuous run of Katakana

Completed in 1245 milliseconds

1 2 3 4 5 6 7