HomeSort by relevance Sort by last modified time
    Searched full:strategy (Results 501 - 525 of 1010) sorted by null

<<21222324252627282930>>

  /external/chromium_org/third_party/libwebp/utils/
bit_reader.h 61 // The right-justify strategy tends to use less shifts and is often faster.
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_logic.c 417 * pre-computed and stored in another constant. The best strategy depends
  /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/
command_line_interface.h 291 // PATH (or other OS-specific search strategy) is searched.
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3Int.h 163 i16 eSearch; /* Search strategy (see below) */
fts3_aux.c 334 int idxNum, /* Strategy index */
  /external/chromium_org/third_party/zlib/
deflate.h 188 int strategy; /* favor or force Huffman coding*/ member in struct:internal_state
  /external/chromium_org/tools/site_compare/drivers/win32/
windowing.py 41 # The strategy will be to take windows_to_check and use it
  /external/chromium_org/v8/src/
compiler.h 586 // General strategy: Source code is translated into an anonymous function w/o
  /external/clang/include/clang/StaticAnalyzer/Core/
AnalyzerOptions.h 162 /// strategy. We get better code coverage when retry is enabled.
  /external/compiler-rt/make/platform/
clang_darwin.mk 62 # a different code generation strategy).
  /external/eigen/Eigen/src/Core/
Redux.h 23 * Part 1 : the logic deciding a strategy for vectorization and unrolling
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 16 * \brief Incomplete LU factorization with dual-threshold strategy
  /external/emma/core/java12/com/vladium/util/exception/
ExceptionCommon.java 63 * This strategy ensures that error codes follow inheritance and hiding rules
  /external/icu4c/common/
ubidiwrt.c 165 * The general strategy for this is to read the source text
  /external/iproute2/tc/
q_cbq.c 478 fprintf(stderr, "CBQ: too short overlimit strategy %u/%u\n",
  /external/llvm/lib/CodeGen/
GCStrategy.cpp 170 MI->getFunctionInfo(*I); // Instantiate the GC strategy.
  /external/llvm/lib/Transforms/Utils/
LoopUnrollRuntime.cpp 18 // The current strategy generates an if-then-else sequence prior to the
  /external/mesa3d/src/gallium/auxiliary/gallivm/
lp_bld_logic.c 417 * pre-computed and stored in another constant. The best strategy depends
  /external/mtpd/
l2tp.c 108 /* According to RFC 2661 page 46, an exponential backoff strategy is required
  /external/protobuf/src/google/protobuf/compiler/
command_line_interface.h 260 // PATH (or other OS-specific search strategy) is searched.
  /external/qemu/distrib/sdl-1.2.15/test/
utf8.txt 57 sequence by a replacement character. If you follow this strategy in
  /external/qemu/distrib/zlib-1.2.3/
deflate.h 183 int strategy; /* favor or force Huffman coding*/ member in struct:internal_state
  /external/stlport/stlport/stl/
_num_put.c 33 // __do_put_float and its helper functions. Strategy: write the output
  /external/webp/src/utils/
bit_reader.h 61 // The right-justify strategy tends to use less shifts and is often faster.
  /external/zlib/src/contrib/iostream3/
zfstream.cc 41 // Set compression level and strategy

Completed in 1159 milliseconds

<<21222324252627282930>>