HomeSort by relevance Sort by last modified time
    Searched full:tries (Results 76 - 100 of 2577) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/chromium_org/net/quic/crypto/
common_cert_set.h 35 // MatchCert tries to find |cert| in one of the common certificate sets
  /external/chromium_org/ppapi/native_client/tests/ppapi_browser/bad/
ppapi_bad.html 60 // 'cross_origin' loads a manifest, then tries to load a cross-origin nexe.
68 // 'cross_manifest' tries to load a cross-origin manifest.
76 // 'nonexistent_nexe' loads a manifest, then tries to load a nonexistent nexe.
84 // 'nonexistent_manifest' tries to load a nonexistent manifest.
  /external/chromium_org/rlz/lib/
recursive_cross_process_lock_posix.h 22 // Tries to acquire a recursive cross-process lock. Note that this _always_
  /external/chromium_org/third_party/skia/include/ports/
SkTypeface_win.h 33 * This will get called if Skia tries to access the data but hits a failure.
  /external/droiddriver/src/com/google/android/droiddriver/scroll/
SentinelStrategy.java 27 * Tries to scroll {@code parentFinder} in {@code direction}. Returns whether
  /external/llvm/test/CodeGen/ARM/
2012-03-26-FoldImmBug.ll 4 ; produces a 32-bit immediate which is consumed by the use. It tries to
  /external/llvm/test/CodeGen/X86/
lsr-nonaffine.ll 4 ; doesn't know how to do anything with them, and when it tries, it
  /external/marisa-trie/
README 16 This project *marisa-trie* provides a C++ library *libmarisa* and command line tools *`marisa-*`* for building and operating nesting patricia tries. The brand-new dictionary structure is designed to be static and space efficient. Also, *marisa-trie* enables not only simple lookups but also prefix searches and predictive searches.
  /external/skia/include/ports/
SkTypeface_win.h 33 * This will get called if Skia tries to access the data but hits a failure.
  /external/valgrind/main/gdbserver_tests/
filter_memcheck_monitor 16 # gdb 7.2 sometimes tries to access address 0x0 (same as with standard gdbserver)
  /external/valgrind/main/none/tests/
pth_once.c 14 * A program spawns multiple threads and each one tries to
  /external/webrtc/src/system_wrappers/interface/
critical_section_wrapper.h 28 // Tries to grab lock, beginning of a critical section. Will wait for the
  /frameworks/base/core/tests/coretests/res/layout/
brightness_limit.xml 21 <!-- Tries to set brightness to 0. See corresponding Java code. -->
  /frameworks/base/core/tests/hosttests/test-apps/ExternalSharedPermsBT/src/com/android/framework/externalsharedpermsbttestapp/
ExternalSharedPermsBTTest.java 26 /** The use of bluetooth below is simply to simulate an activity that tries to use bluetooth
  /frameworks/base/core/tests/hosttests/test-apps/ExternalSharedPermsFL/src/com/android/framework/externalsharedpermsfltestapp/
ExternalSharedPermsFLTest.java 29 * tries to use it, so we can verify whether permissions are granted and accessible.
  /frameworks/base/tests/BandwidthTests/res/values/
strings.xml 18 <string name="app_desc">Tries several tricks to get Internet access.</string>
  /libcore/luni/src/main/java/java/lang/
IllegalAccessError.java 21 * Thrown when the VM notices that a program tries access a field
NoSuchFieldError.java 21 * Thrown when the VM notices that a program tries to reference,
NoSuchFieldException.java 21 * Thrown when the VM notices that a program tries to reference,
NoSuchMethodError.java 21 * Thrown when the VM notices that a program tries to reference,
NoSuchMethodException.java 21 * Thrown when the VM notices that a program tries to reference,
  /system/extras/tests/bionic/libc/common/
bench_pthread.c 141 int tries = SUBCOUNT; \
143 count -= tries; \
144 for ( ; tries > 0; tries-- ) {\
  /external/chromium_org/build/android/pylib/base/
test_dispatcher.py 55 def __init__(self, test, tries=0):
60 tries: Number of tries so far.
63 self.tries = tries
174 test.tries += 1
175 if retry and test.tries <= num_retries:
180 logging.warning('Will retry test, try #%s.' % test.tries)
181 test_collection.add(_Test(test=retry, tries=test.tries))
    [all...]
  /external/eigen/bench/
bench_gemm.cpp 129 int tries = 2; // number of tries, we keep the best local
142 tries = atoi(argv[i]+1);
151 std::cout << argv[0] << " s<matrix size> c<cache size> t<nb tries> p<nb repeats>\n";
201 BENCH(tblas, tries, rep, blas_gemm(a,b,c));
208 BENCH(tmt, tries, rep, gemm(a,b,c));
219 BENCH(tmono, tries, rep, gemm(a,b,c));
237 BENCH(t, tries, rep, matlab_cplx_cplx(ar,ai,br,bi,cr,ci));
250 BENCH(t, tries, rep, matlab_real_cplx(a,br,bi,cr,ci));
263 BENCH(t, tries, rep, matlab_cplx_real(ar,ai,b,cr,ci))
    [all...]
  /external/marisa-trie/tools/
marisa-benchmark.cc 46 " -N, --min-num-tries=[N] limits the number of tries to N"
48 " -n, --max-num-tries=[N] limits the number of tries to N"
50 " -P, --patricia-trie build patricia tries (default)\n"
51 " -p, --prefix-trie build prefix tries\n"
66 std::cout << "#tries: " << param_min_num_tries
295 "#tries", "#nodes", "size",
327 { "min-num-tries", 1, NULL, 'N' },
328 { "max-num-tries", 1, NULL, 'n' }
    [all...]

Completed in 539 milliseconds

1 2 34 5 6 7 8 91011>>