HomeSort by relevance Sort by last modified time
    Searched refs:comparison (Results 51 - 75 of 87) sorted by null

1 23 4

  /external/v8/test/mjsunit/
array-sort.js 173 // Test that sorting using an unsound comparison function still gives a
smi-ops.js 703 // Regression test for correct handling of overflow in smi comparison.
  /external/chromium/base/
file_path.cc 596 // Perform character-wise upper case comparison rather than using the
1170 int comparison = strcasecmp(string1.c_str(), string2.c_str()); local
    [all...]
  /external/dropbear/libtommath/
bn.tex 787 for any comparison.
800 \caption{Comparison Codes for $a, b$}
807 \subsection{Unsigned comparison}
809 An unsigned comparison considers only the digits themselves and not the associated \textit{sign} flag of the
810 mp\_int structures. This is analogous to an absolute comparison. The function mp\_cmp\_mag() will compare two
865 \subsection{Signed comparison}
    [all...]
  /external/libvpx/libvpx/vp8/encoder/arm/armv5te/
vp8_packtokens_partitions_armv5.asm 102 str r9, [sp, #0] ; save stop for later comparison
  /external/opencv/cvaux/include/
cvvidsurv.hpp 58 #error Do not know how to make case-insensitive string comparison on this platform
    [all...]
  /external/v8/benchmarks/
deltablue.js 99 * this class, so pointer comparison can be used for value comparison.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-deltablue.js 93 * this class, so pointer comparison can be used for value comparison.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-deltablue.js 93 * this class, so pointer comparison can be used for value comparison.
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-deltablue.js 93 * this class, so pointer comparison can be used for value comparison.
  /external/icu4c/i18n/
ucol.cpp 7017 int32_t comparison; local
    [all...]
  /external/dexmaker/src/test/java/com/google/dexmaker/
DexMakerTest.java 476 Method lt = branchingMethod(Comparison.LT);
481 Method le = branchingMethod(Comparison.LE);
486 Method eq = branchingMethod(Comparison.EQ);
491 Method ge = branchingMethod(Comparison.GE);
496 Method gt = branchingMethod(Comparison.GT);
501 Method ne = branchingMethod(Comparison.NE);
507 private Method branchingMethod(Comparison comparison) throws Exception {
510 * if (a comparison b) {
525 code.compare(comparison, ifBody, localA, localB)
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jar 
org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar 
org.eclipse.equinox.p2.repository.tools_2.0.1.R36x_v20100823.jar 
org.apache.lucene_1.9.1.v20100518-1140.jar 
  /dalvik/vm/mterp/out/
InterpAsm-mips.S     [all...]
InterpAsm-armv5te.S     [all...]
  /external/clang/lib/Sema/
SemaChecking.cpp     [all...]
  /external/llvm/bindings/ocaml/llvm/
llvm.mli 148 (** The predicate for an integer comparison ([icmp]) instruction.
164 (** The predicate for a floating-point comparison ([fcmp]) instruction.
927 (** [const_icmp pred c1 c2] returns the constant comparison of two integer
933 (** [const_fcmp pred c1 c2] returns the constant comparison of two floating
    [all...]
  /external/blktrace/btt/doc/
btt.tex 257 seeks. The larger the count for the mode in comparison to the total
    [all...]
  /external/ceres-solver/docs/
solving.tex 332 The cost of forming and storing the Schur complement $S$ can be prohibitive for large problems. Indeed, for an inexact Newton solver that computes $S$ and runs PCG on it, almost all of its time is spent in constructing $S$; the time spent inside the PCG algorithm is negligible in comparison. Because PCG only needs access to $S$ via its product with a vector, one way to evaluate $Sx$ is to observe that
    [all...]
  /build/tools/droiddoc/templates-sdk/assets/js/
docs.js     [all...]
  /prebuilts/tools/common/m2/internal/commons-lang/commons-lang/2.4/
commons-lang-2.4.jar 
  /external/dropbear/libtomcrypt/
crypt.tex     [all...]

Completed in 3862 milliseconds

1 23 4