HomeSort by relevance Sort by last modified time
    Searched full:shortest (Results 101 - 125 of 250) sorted by null

1 2 3 45 6 7 8 910

  /external/protobuf/src/google/protobuf/io/
coded_stream.h 288 // shortest limit on the stack is always enforced, even if it is not the
312 // maximum message length should be limited to the shortest length that
313 // will not harm usability. The theoretical shortest message that could
    [all...]
  /external/chromium/chrome/browser/history/
url_database.h 176 // Tries to find the shortest URL beginning with |base| that strictly
  /external/chromium/chrome/browser/search_engines/
template_url_model.h 111 // shortest-first. If support_replacement_only is true, only keywords that
  /external/clang/www/
get_started.html 18 <p>This page gives you the shortest path to checking out Clang and demos a few
  /external/icu4c/common/
unisetspan.cpp 547 * or recursively span for all but the shortest one and
548 * iteratively continue the span with the shortest local match.
575 * pop the shortest string match end point and continue
580 * Continue the loop with the shortest end point of either this code point
    [all...]
utf_impl.c 160 * Starting with Unicode 3.0.1, non-shortest forms are illegal.
  /external/llvm/docs/TableGen/
LangRef.rst 75 TokCodeFragment: "[{" <shortest text not containing "}]"> "}]"
  /external/proguard/src/proguard/classfile/instruction/
Instruction.java 674 * Shrinks this instruction to its shortest possible form.
  /external/replicaisland/res/values/
wanda.xml 96 Did you even think about what you were doing? Did you even consider that maybe, just maybe, there was some other way to resolve the situation? Or do you just calculate the shortest possible path to your objective and then iterate until it?s complete? Just follow the rules by rote, never considering whether or not your way is the best way?
  /external/stlport/src/
c_locale.h 220 * Returns the number of bytes of the shortest allowed multibyte
  /external/v8/src/
conversions.cc 266 // shortest representation (which happens when f equals -1).
  /external/valgrind/main/coregrind/m_initimg/
simple_huffman.c 473 /* Sort histogram - shortest code first (bubble sort) */
  /external/webkit/Source/WebCore/platform/graphics/openvg/
PathOpenVG.cpp 264 // arcs for arcTo(), as the arc is defined as the "shortest arc" of the
  /ndk/sources/cxx-stl/stlport/src/
c_locale.h 220 * Returns the number of bytes of the shortest allowed multibyte
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/configuration/
VaryingConfiguration.java 173 // language, such as either with the strings of the largest or shortest
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
BinPacker.java 130 // Pick a rectangle. This currently tries to find the rectangle whose shortest
  /external/jdiff/src/jdiff/
DiffMyers.java 85 /** Find the midpoint of the shortest edit script for a specified
90 When the two searches meet, we have found the midpoint of the shortest
  /packages/apps/Calendar/res/values/
strings.xml 64 should use the shortest acceptable abbreviation to save space. -->
74 should use the shortest acceptable abbreviation of 'hour' to save space. -->
84 should use the shortest acceptable abbreviation of 'day' to save space. -->
    [all...]
  /external/icu4c/test/cintltst/
utf8tst.c 384 0xc0, 0x80, /* non-shortest form */
526 0xc0, 0x80, /* non-shortest form */
    [all...]
  /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
closurizednamespacesinfo.py 472 # The namespace for a class is the shortest prefix ending in a class
  /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
BugReporter.h 521 /// bug reporter will try to pick the shortest path, but this is not
  /external/flac/libFLAC/
format.c 311 * also disallows non-shortest-form encodings, c.f.
  /external/icu4c/common/unicode/
ucnv_err.h 162 Also, starting with Unicode 3.0.1, non-shortest byte sequences
  /external/icu4c/i18n/
colldata.cpp 871 // find out shortest string for the longest sequence of ces.
ucol_wgt.cpp 292 /* copy the ranges, shortest first, into the result array */

Completed in 721 milliseconds

1 2 3 45 6 7 8 910