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

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicBase.h 1 //===-- HeuristcBase.h --- Heuristic base class for PBQP --------*- C++ -*-===//
17 /// \brief Abstract base class for heuristic implementations.
19 /// This class provides a handy base for heuristic implementations with common
22 /// To implement your own heuristic using this class as a base you'll have to
26 /// heuristic reduction list.
27 /// <li> void heuristicReduce() : Perform a single heuristic reduction.
37 /// the solver which is using this heuristic.
48 /// These can be used to attach data relevant to your heuristic to each
61 // Return a reference to the derived heuristic.
73 /// @param solver The solver which is using this heuristic instance
    [all...]
HeuristicSolver.h 1 //===-- HeuristicSolver.h - Heuristic PBQP Solver --------------*- C++ -*-===//
10 // Heuristic PBQP solver. This solver is able to perform optimal reductions for
11 // nodes of degree 0, 1 or 2. For nodes of degree >2 a plugable heuristic is
26 /// \brief Heuristic PBQP solver implementation.
117 /// \brief Construct a heuristic solver implementation to solve the given
127 /// \brief Get the heuristic data attached to the given node.
129 /// @return The heuristic data attached to the given node.
134 /// \brief Get the heuristic data attached to the given edge.
136 /// @return The heuristic data attached to the given node.
162 /// Does <i>not</i> notify the heuristic of the removal. That should b
    [all...]
  /external/chromium/chrome/browser/autofill/
autofill_field_unittest.cc 21 // Set the heuristic type and check it.
29 // Remove the server type to make sure the heuristic type is preserved.
62 // Heuristic type does not affect FieldSignature.
78 // Only heuristic type is set.
autofill_field.h 29 // Sets the heuristic type of this field, validating the input.
36 // This function automatically chooses between server and heuristic autofill
autofill_download.h 49 // Called when heuristic either successfully considered for upload and
116 // with new data, if available. If false heuristic data is uploaded to our
form_structure.h 70 // Runs a quick heuristic to rule out forms that are obviously not
132 // Associates the field with the heuristic type for each of the field views.
autofill_merge_unittest.cc 194 // Set the heuristic type for each field, which is currently serialized
  /external/chromium/chrome/browser/extensions/
extensions_quota_service.h 9 // watch an item (for a particular heuristic) before making a decision about
10 // quota violations'. A heuristic is two functions: one mapping input
66 // Each heuristic will be evaluated and ANDed together to get a final answer.
77 // A QuotaLimitHeuristic is two things: 1, A heuristic to map extension
79 // heuristic for determining if a new event involving a particular item
94 // A Bucket is how the heuristic portrays an individual item (since quota
158 // constitutes a quota violation according to this heuristic.
172 // A simple per-item heuristic to limit the number of events that can occur in
181 // A per-item heuristic to limit the number of events that can occur in a
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/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 1 //===-- Briggs.h --- Briggs Heuristic for PBQP ------------------*- C++ -*-===//
29 /// \brief PBQP Heuristic which applies an allocability test based on
32 /// This heuristic assumes that the elements of cost vectors in the PBQP
37 /// If one or more nodes can be proven allocable by this heuristic (by
111 /// \brief Construct an instance of the Briggs heuristic.
112 /// @param solver A reference to the solver which is using this heuristic.
126 /// selected for heuristic reduction instead.
135 /// \brief Add a node to the heuristic reduce list.
136 /// @param nItr Node iterator to add to the heuristic reduce list.
148 /// \brief Heuristically reduce one of the nodes in the heuristic
    [all...]
  /external/llvm/include/llvm/Analysis/
InlineCost.h 133 /// getInlineCost - The heuristic used to determine if we should inline the
138 /// getCalledFunction - The heuristic used to determine if we should inline
147 /// getSpecializationBonus - The heuristic used to determine the per-call
153 /// getSpecializationCost - The heuristic used to determine the code-size
  /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/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/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/webkit/Source/WebCore/platform/graphics/mac/
SimpleFontDataATSUI.mm 59 // heuristic is that if such a font has a glyph metamorphosis table, then
  /external/llvm/include/llvm/CodeGen/
LatencyPriorityQueue.h 38 /// predecessor for. This is used as a tie-breaker heuristic for better
  /external/protobuf/
CONTRIBUTORS.txt 49 * Heuristic detection of sub-messages when printing unknown fields in
  /libcore/luni/src/main/java/libcore/net/http/
ResponseHeaders.java 324 * Returns true if computeFreshnessLifetime used a heuristic. If we used a
325 * heuristic to serve a cached response older than 24 hours, we are required
430 headers.add("Warning", "113 HttpURLConnection \"Heuristic expiration\"");
  /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/chromium/chrome/browser/
intranet_redirect_detector.cc 174 // the same thread. So just use the heuristic that any all-lowercase a-z

Completed in 1298 milliseconds

1 2 3 4 5 6 7 8 91011>>