/external/python/cpython3/Lib/test/ |
test_hashlib.py | 96 algorithms = set() 98 algorithms.add(algorithm.lower()) 102 algorithms.update({'blake2b', 'blake2s'}) 105 for algorithm in algorithms: 120 # These two algorithms should always be present when this module [all...] |
/frameworks/base/services/core/java/com/android/server/locksettings/recoverablekeystore/ |
RecoverableKeyStoreManager.java | 121 // Impossible: all algorithms must be supported by AOSP 689 // Impossible: all algorithms must be supported by AOSP [all...] |
/prebuilts/go/darwin-x86/src/crypto/tls/ |
common.go | 130 // Signature algorithms for TLS 1.2 (See RFC 5246, section A.4.1) 136 // supportedSignatureAlgorithms contains the signature and hash algorithms that 139 // Note that in TLS 1.2, the ECDSA algorithms are not constrained to P-256, etc. 229 // Legacy signature and hash algorithms for TLS 1.2. 260 // Algorithms Extension is being used (see [all...] |
/prebuilts/go/linux-x86/src/crypto/tls/ |
common.go | 130 // Signature algorithms for TLS 1.2 (See RFC 5246, section A.4.1) 136 // supportedSignatureAlgorithms contains the signature and hash algorithms that 139 // Note that in TLS 1.2, the ECDSA algorithms are not constrained to P-256, etc. 229 // Legacy signature and hash algorithms for TLS 1.2. 260 // Algorithms Extension is being used (see [all...] |
/external/tensorflow/tensorflow/core/kernels/ |
conv_grad_ops_3d.cc | 663 std::vector<AlgorithmDesc> algorithms; variable 1030 std::vector<AlgorithmDesc> algorithms; variable [all...] |
/libcore/ojluni/src/main/java/java/util/ |
Random.java | 48 * guarantee this property, particular algorithms are specified for the 49 * class {@code Random}. Java implementations must use all the algorithms 52 * are permitted to use other algorithms, so long as they adhere to the 55 * The algorithms implemented by class {@code Random} use a 191 * <i>Seminumerical Algorithms</i>, section 3.2.1. 573 * Computer Programming</i>, Volume 3: <i>Seminumerical Algorithms</i>, [all...] |
/compatibility/cdd/9_security-model/ |
9_11_keys-and-credentials.md | 19 algorithms and MD5, SHA1, and SHA-2 family hash functions to properly support 20 the Android Keystore system's supported algorithms in an area that is securely
|
/external/ImageMagick/ImageMagick/api/ |
magick++-classes.html | 58 <p>The core class in Magick++ is the <a href="Image.php">Image</a> class. The Image class provides methods to manipulate a single image frame (e.g. a JPEG image). Standard Template Library (STL)<span lang="en-US">compatible</span> <a href="http://nextgen.imagemagick.org/api/STL.html">algorithms and function objects</a> are provided in order to manipulate multiple image frames or to read and write file formats which support multiple image frames (e.g. GIF animations, MPEG animations, and Postscript files).</p> 100 <td>STL algorithms and function objects for operating on
|
/external/ImageMagick/ImageMagick/script/ |
color-management.html | 60 <p>ImageMagick supports color profiles, however, for images without a profile or a declaration of colorspace, ImageMagick assumes non-linear sRGB. Most image processing algorithms assume a linear colorspace, therefore it might be prudent to convert to linear color or remove the gamma function before certain image processing algorithms are applied. For example,</p>
|
/external/ImageMagick/www/api/ |
magick++-classes.html | 62 <p>The core class in Magick++ is the <a href="Image++.html">Image</a> class. The Image class provides methods to manipulate a single image frame (e.g. a JPEG image). Standard Template Library (STL)<span lang="en-US">compatible</span> <a href="http://www.imagemagick.org/api/STL.html">algorithms and function objects</a> are provided in order to manipulate multiple image frames or to read and write file formats which support multiple image frames (e.g. GIF animations, MPEG animations, and Postscript files).</p> 104 <td>STL algorithms and function objects for operating on
|
/external/ImageMagick/www/ |
color-management.html | 64 <p>ImageMagick supports color profiles, however, for images without a profile or a declaration of colorspace, ImageMagick assumes non-linear sRGB. Most image processing algorithms assume a linear colorspace, therefore it might be prudent to convert to linear color or remove the gamma function before certain image processing algorithms are applied. For example,</p>
|
/external/eigen/unsupported/Eigen/CXX11/src/TensorSymmetry/util/ |
TemplateGroupTheory.h | 21 * This file contains C++ templates that implement group theory algorithms. 23 * The algorithms allow for a compile-time analysis of finite groups.
|
/external/libcxx/docs/ |
TestingLibcxx.rst | 263 $ ./algorithms.libcxx.out # Runs all the benchmarks 264 $ ./algorithms.libcxx.out --benchmark_filter=BM_Sort.* # Only runs the sort benchmarks
|
/external/libjpeg-turbo/java/ |
TJExample.java | 90 System.out.println("-fastdct = Use the fastest DCT/IDCT algorithms available in the underlying"); 92 System.out.println("-accuratedct = Use the most accurate DCT/IDCT algorithms available in the");
|
/external/libjpeg-turbo/ |
jfdctint.c | 15 * on each column. Direct algorithms are also available, but they are 20 * Algorithms with 11 Multiplications", Proc. Int'l. Conf. on Acoustics,
|
/external/libmicrohttpd/doc/chapters/ |
tlsauthentication.inc | 348 contains a list with server?s acceptable signature algorithms. The certificate returned should support the server?s given algorithms.
|
/external/llvm/docs/ |
GarbageCollection.rst | 103 use of compacting and generational GC algorithms) and it can occasionally suffer 221 programs that use different garbage collection algorithms (or none at all). 368 Many important algorithms require write barriers, including generational and 384 Read barriers are needed by fewer algorithms than write barriers, and may have a 405 Unlike many GC algorithms which rely on a cooperative code generator to compile 593 infrastructure provides access to several important algorithms. For an 673 work. Some of these are callbacks, some are algorithms that can be enabled, [all...] |
/external/llvm/lib/Analysis/ |
CFLSteensAliasAnalysis.cpp | 13 // algorithms for Dyck-CFL-reachability with applications to Alias Analysis" by 26 // algorithm outlined in "Fast algorithms..." (mentioned above)
|
/external/python/cpython2/Doc/library/ |
heapq.rst | 27 The API below differs from textbook heap algorithms in two aspects: (a) We use 301 .. [#] The disk balancing algorithms which are current, nowadays, are more annoying
|
/external/python/cpython3/Doc/library/ |
heapq.rst | 26 The API below differs from textbook heap algorithms in two aspects: (a) We use 300 .. [#] The disk balancing algorithms which are current, nowadays, are more annoying
|
/external/python/cpython3/Objects/stringlib/ |
transmogrify.h | 233 /* Algorithms for different cases of string replacement */ 690 /* Otherwise use the more generic algorithms */
|
/external/swiftshader/third_party/LLVM/docs/ |
GarbageCollection.html | 112 use of compacting and generational GC algorithms) and it can occasionally suffer
350 <p>Unlike many GC algorithms which rely on a cooperative code generator to
414 programs that use different garbage collection algorithms (or none at all).</p>
551 <p>Many important algorithms require write barriers, including generational
573 <p>Read barriers are needed by fewer algorithms than write barriers, and may
598 algorithms. For an uncontroversial collector, all that remains may be to
677 may do useful work. Some of these are callbacks, some are algorithms that can
[all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
PathNumbering.cpp | 70 // Gets the NodeColor used in graph algorithms. 75 // Sets the NodeColor used in graph algorithms.
|
/external/tensorflow/tensorflow/compiler/tf2xla/ |
xla_compiler.h | 260 // For example, the compiler may want to try out different algorithms and 261 // choose the fastest one, and it might run those algorithms over buffers
|
/external/tensorflow/tensorflow/contrib/opt/python/training/ |
external_optimizer.py | 33 """Base class for interfaces with external optimization algorithms. 68 algorithms support general inequality constraints, e.g. L-BFGS-B. Both
|