| /external/smali/util/src/main/java/org/jf/util/ |
| D | LinearSearch.java | 49 int guess = initialGuess; in linearSearch() local
50 if (guess >= list.size()) { in linearSearch()
51 guess = list.size()-1; in linearSearch()
53 int comparison = comparator.compare(list.get(guess), key); in linearSearch()
55 return guess; in linearSearch()
58 guess++; in linearSearch()
59 while (guess < list.size()) { in linearSearch()
60 comparison = comparator.compare(list.get(guess), key); in linearSearch()
62 return guess; in linearSearch()
65 return -(guess+1); in linearSearch()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | double-conversion-strtod.cpp | 443 double* guess) { in ComputeGuess() argument
445 *guess = 0.0; in ComputeGuess()
449 *guess = Double::Infinity(); in ComputeGuess()
453 *guess = 0.0; in ComputeGuess()
457 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
458 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
461 if (*guess == Double::Infinity()) { in ComputeGuess()
489 double guess; in StrtodTrimmed() local
490 const bool is_correct = ComputeGuess(trimmed, exponent, &guess); in StrtodTrimmed()
492 return guess; in StrtodTrimmed()
[all …]
|
| /external/libsrtp2/crypto/replay/ |
| D | rdbx.c | 123 srtp_xtd_seq_num_t *guess, in srtp_index_guess() argument
158 *guess = make64(guess_roc >> 16, (guess_roc << 16) | guess_seq); in srtp_index_guess()
160 *guess = (((uint64_t)guess_roc) << 16) | guess_seq; in srtp_index_guess()
306 srtp_xtd_seq_num_t *guess, in srtp_rdbx_estimate_index() argument
324 return srtp_index_guess(&rdbx->index, guess, s); in srtp_rdbx_estimate_index()
328 *guess = make64(0, (uint32_t)s); in srtp_rdbx_estimate_index()
330 *guess = s; in srtp_rdbx_estimate_index()
|
| /external/rust/crates/num-integer/src/ |
| D | roots.rs | 248 fn guess(x: $T, n: u32) -> $T {
259 fn guess(x: $T, n: u32) -> $T {
272 fixpoint(guess(a, n), next)
301 fn guess(x: $T) -> $T {
307 fn guess(x: $T) -> $T {
313 fixpoint(guess(a), next)
365 fn guess(x: $T) -> $T {
371 fn guess(x: $T) -> $T {
377 fixpoint(guess(a), next)
|
| /external/icu/icu4c/source/test/perf/collationperf/ |
| D | collperf.cpp | 502 int guess = -1; in doBinarySearch() local
505 if (newGuess == guess) in doBinarySearch()
507 guess = newGuess; in doBinarySearch()
509 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); in doBinarySearch()
515 hi = guess; in doBinarySearch()
517 lo = guess; in doBinarySearch()
540 int guess = -1; in doBinarySearch() local
543 if (newGuess == guess) in doBinarySearch()
545 guess = newGuess; in doBinarySearch()
549 … ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey); in doBinarySearch()
[all …]
|
| /external/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| D | CollationPerformanceTest.java | 345 int guess = -1; in doBinarySearch() local
348 if(newGuess == guess){ in doBinarySearch()
351 guess = newGuess; in doBinarySearch()
352 r = tests[j].compareTo(tests[guess]); in doBinarySearch()
358 hi = guess; in doBinarySearch()
360 lo = guess; in doBinarySearch()
376 int guess = -1; in doBinarySearch() local
379 if(newGuess == guess){ in doBinarySearch()
382 guess = newGuess; in doBinarySearch()
383 …r = com.ibm.icu.text.Normalizer.compare(tests[j], tests[guess], Normalizer.COMPARE_CODE_POINT_ORDE… in doBinarySearch()
[all …]
|
| /external/smali/dexlib2/src/main/java/org/jf/util/ |
| D | SparseIntArray.java | 246 int high = start + len, low = start - 1, guess; in binarySearch() local
249 guess = (high + low) / 2; in binarySearch()
251 if (a[guess] < key) in binarySearch()
252 low = guess; in binarySearch()
254 high = guess; in binarySearch()
|
| D | SparseArray.java | 343 int high = start + len, low = start - 1, guess; in binarySearch() local
346 guess = (high + low) / 2; in binarySearch()
348 if (a[guess] < key) in binarySearch()
349 low = guess; in binarySearch()
351 high = guess; in binarySearch()
|
| /external/libvpx/libvpx/vp8/common/ |
| D | mfqe.c | 90 unsigned int guess; in int_sqrt() local
95 guess = 0; in int_sqrt()
97 guess |= (1 << p); in int_sqrt()
98 if (x < guess * guess) guess -= (1 << p); in int_sqrt()
102 return guess + (guess * guess + guess + 1 <= x); in int_sqrt()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | SolveWithGuess.h | 49 SolveWithGuess(const Decomposition &dec, const RhsType &rhs, const GuessType &guess)
50 : m_dec(dec), m_rhs(rhs), m_guess(guess)
58 EIGEN_DEVICE_FUNC const GuessType& guess() const { return m_guess; }
85 m_result = solve.guess();
106 dst = src.guess();
|
| /external/tensorflow/tensorflow/lite/micro/examples/image_recognition_experimental/ |
| D | util.h | 30 int guess = 0; in get_top_prediction() local
37 guess = category_index; in get_top_prediction()
41 return guess; in get_top_prediction()
|
| /external/scapy/scapy/modules/ |
| D | nmap.py | 181 guess = 0, []
188 if score > guess[0]:
189 guess = score, [osval]
190 elif score == guess[0]:
191 guess[1].append(osval)
192 return guess
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | atomic-ops.ll | 24 ; w0 below is a reasonable guess but could change: it certainly comes into the
44 ; w0 below is a reasonable guess but could change: it certainly comes into the
64 ; w0 below is a reasonable guess but could change: it certainly comes into the
84 ; x0 below is a reasonable guess but could change: it certainly comes into the
104 ; w0 below is a reasonable guess but could change: it certainly comes into the
124 ; w0 below is a reasonable guess but could change: it certainly comes into the
144 ; w0 below is a reasonable guess but could change: it certainly comes into the
164 ; x0 below is a reasonable guess but could change: it certainly comes into the
184 ; w0 below is a reasonable guess but could change: it certainly comes into the
204 ; w0 below is a reasonable guess but could change: it certainly comes into the
[all …]
|
| /external/crcalc/src/com/hp/creals/ |
| D | UnaryCRFunction.java | 449 BigInteger guess; in approximate() local
456 guess = l.add(h).shiftRight(1); in approximate()
484 guess = (adj.signum() <= 0? l.add(big2) : l.add(adj)); in approximate()
490 CR guess_cr = CR.valueOf(guess) in approximate()
532 BigInteger new_guess = guess.add(tweak); in approximate()
534 guess = guess.subtract(tweak); in approximate()
536 guess = new_guess; in approximate()
545 h = guess; in approximate()
549 l = guess; in approximate()
|
| /external/python/cpython3/Lib/ |
| D | mimetypes.py | 604 guess = guess_extension(gtype, strict)
605 if not guess: print("I don't know anything about type", gtype)
606 else: print(guess)
608 guess, encoding = guess_type(gtype, strict)
609 if not guess: print("I don't know anything about type", gtype)
610 else: print('type:', guess, 'encoding:', encoding)
|
| /external/python/cpython2/Lib/ |
| D | mimetypes.py | 593 guess = guess_extension(gtype, strict) variable
594 if not guess: print "I don't know anything about type", gtype
595 else: print guess
597 guess, encoding = guess_type(gtype, strict) variable
598 if not guess: print "I don't know anything about type", gtype
599 else: print 'type:', guess, 'encoding:', encoding
|
| /external/ipsec-tools/src/racoon/ |
| D | TODO | 28 how to guess a reasonable phase 1 SA lifetime
29 (hardcoded default? guess from phase 2 lifetime?)
30 guess what kind of ID payload to use
31 guess what kind of authentication to be used
32 guess phase 1 DH group (for aggressive mode, we cannot negotiate it)
33 guess if we need phase 2 PFS or not (we cannot negotiate it. so
35 guess how we should negotiate lifetime
37 guess which mode to use for phase 1 negotiation (is main mode useful?
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | 2005-12-03-IncorrectPHIFold.ll | 36 %guess = alloca %struct.anon* ; <%struct.anon**> [#uses=7]
74 call void @init_num( %struct.anon** %guess )
85 store %struct.anon* %tmp42, %struct.anon** %guess
88 call void @int2num( %struct.anon** %guess, i32 10 )
99 %tmp53 = load %struct.anon*, %struct.anon** %guess ; <%struct.anon*> [#uses=1]
101 call void @bc_raise( %struct.anon* %tmp53, %struct.anon* %tmp54, %struct.anon** %guess, i32 %max )
116 %tmp88 = load %struct.anon*, %struct.anon** %guess ; <%struct.anon*> [#uses=1]
119 call void @free_num( %struct.anon** %guess )
|
| /external/llvm-project/llvm/test/Transforms/SimplifyCFG/ |
| D | 2005-12-03-IncorrectPHIFold.ll | 36 %guess = alloca %struct.anon* ; <%struct.anon**> [#uses=7]
74 call void @init_num( %struct.anon** %guess )
85 store %struct.anon* %tmp42, %struct.anon** %guess
88 call void @int2num( %struct.anon** %guess, i32 10 )
99 %tmp53 = load %struct.anon*, %struct.anon** %guess ; <%struct.anon*> [#uses=1]
101 call void @bc_raise( %struct.anon* %tmp53, %struct.anon* %tmp54, %struct.anon** %guess, i32 %max )
116 %tmp88 = load %struct.anon*, %struct.anon** %guess ; <%struct.anon*> [#uses=1]
119 call void @free_num( %struct.anon** %guess )
|
| /external/llvm-project/llvm/test/CodeGen/ARM/ |
| D | atomic-ops-v8.ll | 21 ; r0 below is a reasonable guess but could change: it certainly comes into the
44 ; r0 below is a reasonable guess but could change: it certainly comes into the
67 ; r0 below is a reasonable guess but could change: it certainly comes into the
90 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
117 ; r0 below is a reasonable guess but could change: it certainly comes into the
140 ; r0 below is a reasonable guess but could change: it certainly comes into the
163 ; r0 below is a reasonable guess but could change: it certainly comes into the
186 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
213 ; r0 below is a reasonable guess but could change: it certainly comes into the
236 ; r0 below is a reasonable guess but could change: it certainly comes into the
[all …]
|
| /external/llvm/test/CodeGen/ARM/ |
| D | atomic-ops-v8.ll | 21 ; r0 below is a reasonable guess but could change: it certainly comes into the
44 ; r0 below is a reasonable guess but could change: it certainly comes into the
67 ; r0 below is a reasonable guess but could change: it certainly comes into the
90 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
117 ; r0 below is a reasonable guess but could change: it certainly comes into the
140 ; r0 below is a reasonable guess but could change: it certainly comes into the
163 ; r0 below is a reasonable guess but could change: it certainly comes into the
186 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
213 ; r0 below is a reasonable guess but could change: it certainly comes into the
236 ; r0 below is a reasonable guess but could change: it certainly comes into the
[all …]
|
| /external/e2fsprogs/e2fsck/ |
| D | readahead.c | 239 unsigned long long guess; in e2fsck_guess_readahead() local
247 guess = 2ULL * fs->blocksize * fs->inode_blocks_per_group; in e2fsck_guess_readahead()
250 if (get_memory_size() > (guess * 50)) in e2fsck_guess_readahead()
251 return guess / 1024; in e2fsck_guess_readahead()
|
| /external/guava/android/guava/src/com/google/common/math/ |
| D | LongMath.java | 333 long guess = (long) Math.sqrt(x); in sqrt() local
335 long guessSquared = guess * guess; in sqrt()
341 return guess; in sqrt()
345 return guess - 1; in sqrt()
347 return guess; in sqrt()
351 return guess + 1; in sqrt()
353 return guess; in sqrt()
357 long sqrtFloor = guess - ((x < guessSquared) ? 1 : 0); in sqrt()
|
| /external/guava/guava/src/com/google/common/math/ |
| D | LongMath.java | 333 long guess = (long) Math.sqrt(x); in sqrt() local
335 long guessSquared = guess * guess; in sqrt()
341 return guess; in sqrt()
345 return guess - 1; in sqrt()
347 return guess; in sqrt()
351 return guess + 1; in sqrt()
353 return guess; in sqrt()
357 long sqrtFloor = guess - ((x < guessSquared) ? 1 : 0); in sqrt()
|
| /external/llvm/cmake/modules/ |
| D | GetHostTriple.cmake | 2 # Invokes config.guess
18 set(config_guess ${LLVM_MAIN_SRC_DIR}/cmake/config.guess)
|