| /prebuilts/go/linux-x86/src/os/user/ |
| user.go | 5 // Package user allows user account lookups by name or id.
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| classobject.h | 61 * code, so is always "safe": all it does is dict lookups. The function
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| classobject.h | 61 * code, so is always "safe": all it does is dict lookups. The function
|
| /system/netd/server/ |
| EventReporter.cpp | 44 // boot sequence than the framework DNS listener, and we don't want to delay all DNS lookups
|
| /external/brotli/c/enc/ |
| backward_references_inc.h | 116 match lookups. Unsuccessful match lookups are very very expensive
|
| quality.h | 124 time, we can skip some match lookups. Unsuccessful match lookups are very
|
| /external/guava/guava/src/com/google/common/collect/ |
| HashBasedTable.java | 38 * <p>Lookups by row key are often faster than lookups by column key, because
|
| /external/icu/icu4c/source/common/ |
| locresdata.cpp | 33 * Regular resource bundle lookups perform fallback to parent locale bundles
40 * before root. Once a bundle is open, item lookups do not go through the
|
| /external/mdnsresponder/mDNSPosix/ |
| libnss_mdns.8 | 66 Version 0.62 of mdnsd does not support an option to force link-local multicast lookups.
68 reverse lookups for non-link-local domains will not function correctly.
|
| nss_ReadMe.txt | 12 hostname lookups using the Darwin mDNSResponder / mdnsd. This code has
28 This will cause dns lookups to be passed via mdnsd before trying the dns.
|
| /external/swiftshader/third_party/PowerVR_SDK/Tools/ |
| PVRTFixedPoint.h | 44 /* Fixed-point trig function lookups */
50 /* Floating-point trig functions lookups (needed by some tools chains that have problems with real math functions) */
|
| /external/tensorflow/tensorflow/contrib/lite/kernels/ |
| hashtable_lookup.cc | 26 // Output[0].dim[0] == Tensor[0].dim[0], num of lookups
30 // Output[1].dim = { Tensor[0].dim[0] }, num of lookups
|
| /external/tensorflow/tensorflow/core/framework/ |
| lookup_interface.h | 33 // Lookup interface for batch lookups used by table lookup ops.
36 // Performs batch lookups, for every element in the key tensor, Find returns
|
| /external/tensorflow/tensorflow/core/kernels/ |
| initializable_lookup_table.h | 30 // Performs batch lookups, for every element in the key tensor, Find returns
71 // Returns whether the table was initialized and is ready to serve lookups.
|
| /packages/apps/Gallery2/src/com/android/photos/data/ |
| GalleryBitmapPool.java | 39 // O(1) lookups for square bitmaps, and average-case - but *not* asymptotically -
40 // O(1) lookups for common photo aspect ratios and other miscellaneous aspect
|
| /toolchain/binutils/binutils-2.27/gas/ |
| hash.c | 60 unsigned long lookups; member in struct:hash_control
98 ret->lookups = 0;
146 ++table->lookups;
384 fprintf (f, "\t%lu lookups\n", table->lookups);
|
| /frameworks/base/proto/src/ |
| ipconnectivity.proto | 188 // The time it took for successful DNS lookups to complete.
224 // The id of the network on which the DNS lookups took place.
228 // The types of the DNS lookups, as defined in android.net.metrics.DnsEvent.
232 // The return values of the DNS resolver for each DNS lookups.
242 // The type of the DNS lookups, as defined in android.net.metrics.DnsEvent.
247 // The return value of the DNS resolver for the DNS lookups.
583 // A batch of DNS lookups.
|
| /device/linaro/bootloader/edk2/StdLib/Include/net/ |
| route.h | 128 u_long rt_hash; /* to speed lookups */
172 short rts_unreach; /* lookups which failed */
173 short rts_wildcard; /* lookups satisfied by a wildcard */
|
| /frameworks/base/core/java/android/util/ |
| LongSparseArray.java | 35 * HashMap, since lookups require a binary search and adds and removes require inserting
293 * Beware that this is a linear search, unlike lookups by key,
314 * <p>Beware that this is a linear search, unlike lookups by key,
|
| /bionic/libc/private/ |
| CachedProperty.h | 37 // this class helps optimize those lookups.
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| algorithm.txt | 108 will be two lookups. If you had a compression method with really long
109 symbols, you could have as many levels of lookups as is efficient. For
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
186 to one lookup for the single table, or 1.66 lookups per symbol for the
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| algorithm.txt | 108 will be two lookups. If you had a compression method with really long
109 symbols, you could have as many levels of lookups as is efficient. For
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
186 to one lookup for the single table, or 1.66 lookups per symbol for the
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/ |
| X509Principal.java | 131 * should provide a table of lookups, indexed by lowercase only strings and
|
| /external/clang/test/SemaCXX/ |
| microsoft-dtor-lookup.cpp | 8 // operator delete() lookups to be done when vtables are marked used.
|
| /external/deqp/doc/testspecs/GLES3/ |
| functional.texture.shadow.txt | 45 texture lookups.
|
