/external/smali/util/src/main/java/org/jf/util/ |
H A D | LinearSearch.java | 44 * @param initialGuess An initial guess of the location. 49 int guess = initialGuess; 50 if (guess >= list.size()) { 51 guess = list.size()-1; 53 int comparison = comparator.compare(list.get(guess), key); 55 return guess; 58 guess++; 59 while (guess < list.size()) { 60 comparison = comparator.compare(list.get(guess), key); 62 return guess; [all...] |
H A D | SparseIntArray.java | 246 int high = start + len, low = start - 1, guess; 249 guess = (high + low) / 2; 251 if (a[guess] < key) 252 low = guess; 254 high = guess;
|
H A D | SparseArray.java | 343 int high = start + len, low = start - 1, guess; 346 guess = (high + low) / 2; 348 if (a[guess] < key) 349 low = guess; 351 high = guess;
|
/external/srtp/crypto/replay/ |
H A D | rdbx.c | 76 * index_guess(&local, &guess, seq_from_packet). This function 77 * returns the difference of the guess and the local value. The local 78 * xtd_seq_num_t can be moved forward to the guess using the function 79 * index_advance(&guess, delta), where delta is the difference. 111 * index_guess(local, guess, s) 115 * (from a newly arrived packet), sets the contents of *guess to 116 * contain the best guess of the packet index to which s corresponds, 117 * and returns the difference between *guess and *local 125 xtd_seq_num_t *guess, 136 uint32_t guess_roc = ((high32(*guess) << 1 124 index_guess(const xtd_seq_num_t *local, xtd_seq_num_t *guess, sequence_number_t s) argument 329 rdbx_estimate_index(const rdbx_t *rdbx, xtd_seq_num_t *guess, sequence_number_t s) argument [all...] |
/external/srtp/crypto/include/ |
H A D | rdbx.h | 75 * rdbx_estimate_index(rdbx, guess, s) 78 * sets the contents of *guess to contain the best guess of the packet 80 * *guess and the locally stored synch info 85 xtd_seq_num_t *guess, 162 * index_guess(local, guess, s) 166 * arrived packet), sets the contents of *guess to contain the best 167 * guess of the packet index to which s corresponds, and returns the 168 * difference between *guess and *local 173 xtd_seq_num_t *guess, [all...] |
/external/v8/src/ |
H A D | strtod.cc | 346 // The variable guess should be a close guess that is either the correct double 354 double guess) { 355 if (guess == V8_INFINITY) { 356 return guess; 359 DiyFp upper_boundary = Double(guess).UpperBoundary(); 385 return guess; 387 return Double(guess).NextDouble(); 388 } else if ((Double(guess).Significand() & 1) == 0) { 390 return guess; [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
H A D | GaussianFitter.java | 102 createParametersGuesser(fitter.getObservations()).guess()));
|
H A D | HarmonicFitter.java | 30 * searched by a least square estimator initialized with a rough guess 52 * <p>This constructor can be used when a first guess of the 77 * the first guess cannot be computed 81 // shall we compute the first guess of the parameters ourselves ? 90 guesser.guess();
|
H A D | HarmonicCoefficientsGuesser.java | 26 * <p>The algorithm used to guess the coefficients is as follows:</p> 150 /** Estimate a first guess of the coefficients. 152 * the first guess cannot be computed (when the elements under the 155 public void guess() throws OptimizationException { method in class:HarmonicCoefficientsGuesser 189 /** Estimate a first guess of the a and ω coefficients. 191 * the first guess cannot be computed (when the elements under the 248 /** Estimate a first guess of the φ coefficient.
|
H A D | GaussianParametersGuesser.java | 48 * @param observations observed points upon which should base guess 65 public double[] guess() { method in class:GaussianParametersGuesser 75 * @param points observed points upon which should base guess
|
/external/cmockery/cmockery_0_1_2/packages/deb/ |
H A D | rules | 14 # from having to guess our platform (since we know it already) 64 ifneq "$(wildcard /usr/share/misc/config.guess)" "" 65 cp -f /usr/share/misc/config.guess config.guess
|
/external/smali/util/src/test/java/org/jf/util/ |
H A D | LinearSearchTest.java | 96 private void doTest(List<Integer> list, int key, int guess) { argument 99 Assert.assertEquals(expectedIndex, LinearSearch.linearSearch(list, Ordering.<Integer>natural(), key, guess));
|
/external/libvpx/libvpx/vp8/common/ |
H A D | mfqe.c | 102 unsigned int guess; local 107 guess=0; 110 guess |= (1<<p); 111 if (x<guess*guess) 112 guess -= (1<<p); 115 /* choose between guess or guess+1 */ 116 return guess+(guess*gues [all...] |
/external/icu/icu4c/source/test/perf/collationperf/ |
H A D | collperf.cpp | 499 int guess = -1; local 502 if (newGuess == guess) 504 guess = newGuess; 506 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); 512 hi = guess; 514 lo = guess; 537 int guess = -1; local 540 if (newGuess == guess) 542 guess = newGuess; 546 ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess]) 588 int guess = -1; local 639 int guess = -1; local [all...] |
/external/guava/guava/src/com/google/common/math/ |
H A D | LongMath.java | 295 long guess = (long) Math.sqrt(x); 296 // Note: guess is always <= FLOOR_SQRT_MAX_LONG. 297 long guessSquared = guess * guess; 303 return guess; 307 return guess - 1; 309 return guess; 313 return guess + 1; 315 return guess; 319 long sqrtFloor = guess [all...] |
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowSparseArray.java | 338 int high = start + len, low = start - 1, guess; 341 guess = (high + low) / 2; 343 if (a[guess] < key) 344 low = guess; 346 high = guess;
|
/external/crcalc/src/com/hp/creals/ |
H A D | UnaryCRFunction.java | 355 // initial guess 447 // chosen point (guess) in the middle. 449 BigInteger guess; 456 guess = l.add(h).shiftRight(1); 465 // tentative adjustment to l to compute guess 484 guess = (adj.signum() <= 0? l.add(big2) : l.add(adj)); 490 CR guess_cr = CR.valueOf(guess) 500 // and adjust guess slightly. 529 // guess might be exactly right; tweak it 531 trace("tweaking guess"); [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | OutputFinisher.java | 488 * opcode as a first "best guess" and then pessimizes from there 492 * @param guess {@code null-ok;} the current guess as to the best 498 private Dop findOpcodeForInsn(DalvInsn insn, Dop guess) { argument 500 * Note: The initial guess might be null, meaning that an 505 while (guess != null) { 506 if (guess.getFormat().isCompatible(insn)) { 510 guess = Dops.getNextOrNull(guess, dexOptions); 513 return guess; [all...] |
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 423 int guess = values[guessIdx]; 425 if (value <= guess) {
|
/external/eigen/Eigen/src/misc/ |
H A D | SparseSolve.h | 105 solve_retval_with_guess(const DecompositionType& dec, const Rhs& rhs, const Guess& guess) argument 106 : m_dec(dec), m_rhs(rhs), m_guess(guess)
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
H A D | PowellOptimizer.java | 93 final double[] guess = point.clone(); 94 final int n = guess.length; 101 double[] x = guess;
|
/external/libxml2/VxWorks/ |
H A D | build.sh | 35 rm -fR config.guess
|
/external/skia/src/utils/ |
H A D | SkInterpolator.cpp | 255 Dot14 guess = eval_cubic(t, A, B, C); local 256 if (x < guess) {
|
/external/icu/icu4c/source/test/perf/collperf/ |
H A D | collperf.cpp | 419 int guess; local 423 guess = (high + low)/2; 424 if (last_guess == guess) break; // nothing to search 426 r = (this->*fn)(random, guess); 432 high = guess; 434 low = guess; 436 last_guess = guess;
|
/external/dexmaker/src/main/java/com/google/dexmaker/ |
H A D | AppDataDirGuesser.java | 25 * Uses heuristics to guess the application's private data directory. 28 public File guess() { method in class:AppDataDirGuesser
|