Searched
full:repeatedly (Results
751 -
775 of
1551) sorted by null
<<31323334353637383940>>
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
BlowfishEngine.java | 453 * (up to P[17]). Repeatedly cycle through the key bits until the
|
/external/dnsmasq/src/ |
dhcp.c | 527 on us repeatedly. As a final check, if we did more
|
/external/fio/ |
diskutil.c | 454 * for an fs without a device, we will repeatedly stat through
|
/external/google-breakpad/src/client/linux/handler/ |
exception_handler.cc | 196 // signal is repeatedly sent to breakpad's signal handler.
|
/external/guava/guava-tests/test/com/google/common/cache/ |
CacheBuilderTest.java | 521 * Calls get() repeatedly from many different threads, and tests that all of the removed entries
|
/external/libchrome/base/numerics/ |
safe_math_impl.h | 446 // A macro isn't the nicest solution, but it beats rewriting these repeatedly.
|
/external/libchrome/base/ |
observer_list_unittest.cc | 106 // list repeatedly.
|
/external/libjpeg-turbo/ |
jcparam.c | 494 * leak if jpeg_simple_progression is called repeatedly for the same JPEG
|
/external/libunwind/doc/ |
libunwind.tex | 76 \Func{unw\_step}(). By repeatedly calling this routine, you can
|
/external/libxkbcommon/xkbcommon/src/xkbcomp/ |
parser.y | 235 * then call it repeatedly until we find the map we need. Once we find it,
|
/external/libxml2/doc/ |
xmlreader.html | 73 Read() function repeatedly to progress to each node in sequence in document
|
/external/llvm/cmake/modules/ |
HandleLLVMOptions.cmake | 483 # Check that we can build code with modules enabled, and that repeatedly
|
/external/llvm/lib/CodeGen/ |
LiveDebugValues.cpp | 89 /// The value location. Stored separately to avoid repeatedly
|
/external/llvm/utils/ |
extract_symbols.py | 289 # Repeatedly parse names from the string until we reach the end of the
|
/external/mesa3d/src/gallium/auxiliary/gallivm/ |
lp_bld_format_aos.c | 193 /* Need to repeatedly copy src bits to fill remainder in dst */
|
/external/nanopb-c/docs/ |
concepts.rst | 179 The actual behavior of the callback function is different in encoding and decoding modes. In encoding mode, the callback is called once and should write out everything, including field tags. In decoding mode, the callback is called repeatedly for every data item.
|
/external/nanopb-c/generator/proto/google/protobuf/ |
descriptor.proto | 355 // a more efficient representation on the wire. Rather than repeatedly
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ |
PipelinedMsgParser.java | 393 * Repeatedly starting/stopping the stack then gives hanging threads
|
/external/pcre/dist2/doc/html/ |
pcre2callout.html | 124 again, repeatedly, until a+ itself fails.
|
/external/pcre/dist2/doc/ |
pcre2build.3 | 274 repeatedly (sometimes recursively) when matching a pattern with the
|
/external/pdfium/third_party/base/numerics/ |
safe_math_impl.h | 447 // A macro isn't the nicest solution, but it beats rewriting these repeatedly.
|
/external/protobuf/java/core/src/test/java/com/google/protobuf/ |
ByteStringTest.java | 464 // and sizes, and in which we repeatedly call toByteString() in the middle.
|
/external/protobuf/src/google/protobuf/io/ |
zero_copy_stream_impl_lite.h | 215 // The default implementation just repeatedly calls Read() into a scratch
|
/external/python/cpython2/Doc/tutorial/ |
stdlib2.rst | 339 is useful for applications which repeatedly access the smallest element but do
|
/external/python/cpython2/Lib/lib2to3/pgen2/ |
tokenize.py | 8 repeatedly to get the next line of input (or "" for EOF). It generates
|
Completed in 1009 milliseconds
<<31323334353637383940>>