| /external/boringssl/src/crypto/fipsmodule/bn/test/ |
| D | shift_tests.txt | 3 # These test vectors satisfy A * 2 = LShift1
6 A = 0
9 A = 988b0905e52efb2709f98a12a
11 LShift1 = -13116120bca5df64e13f314254
12 A = -988b0905e52efb2709f98a12a
15 A = 13116120bca5df64e13f314254
17 LShift1 = -2622c241794bbec9c27e6284a8
18 A = -13116120bca5df64e13f314254
21 A = 2622c241794bbec9c27e6284a8
23 LShift1 = -4c458482f2977d9384fcc50950
[all …]
|
| D | sum_tests.txt | 3 # These test vectors satisfy A + B = Sum.
6 A = 0
10 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
13 Sum = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccc…
14 A = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…
18 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
19 B = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…
22 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
26 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
27 B = -4b5b16252ba2355e0b87f01baa721783c403607a4c1b5652c09a68e96926c8e314fa580bf0ad3f8f59bd70f14df86a…
[all …]
|
| D | product_tests.txt | 3 # These test vectors satisfy A^2 = Square.
5 # Regression test for a BN_sqr overflow bug.
7 A = 80000000000000008000000000000001fffffffffffffffe0000000000000000
9 # Regression test for a BN_sqr overflow bug.
11 A = 80000000000000000000000080000001fffffffe000000000000000000000000
14 A = -df6a253c3f
17 A = 21f253ddb5a6d
20 A = -95fbaee5a09c86d
23 A = -3e71292dd4ad3ed3b4
26 A = 9b45cf6c7a43d910dcff
[all …]
|
| D | quotient_tests.txt | 3 # These test vectors satisfy Quotient = A / B, rounded towards zero, and
4 # Remainder = A - B * Quotient.
8 A = 8cdaaa7c422f3c2bb0ace2da7d7ff151e5bdefb23e6426cf3e6b21491e6e80e977bfa6c65931a8dee31fc7992c0c801…
11 Quotient = -2
13 A = 107f0e6cebfe22ac11294a06fed2b994d01c9b3610d50bdd254adafd08c93be8ebdd1e85e1286fe9c9e682a90cbbd63…
14 B = -83f873675ff11560894a5037f695cca680e4d9b086a85ee92a56d7e84649df475ee8f42f09437f4e4f34154865deb1…
16 Quotient = -4
17 Remainder = -2
18 A = -3d8746ae2123c2d3f1d35910b42af1f86f5e81f8e98986cea20b2a1bdb8af6cf111f1258f112c837accdf4868463fe…
22 Remainder = -3
[all …]
|
| D | mod_mul_tests.txt | 3 # These test vectors satisfy A * B = ModMul (mod M) and 0 <= ModMul < M.
6 A = 6b18497fed9befdf22a01d988d34213f6687d8a96e86c188dea4172e7c6095a0d18d3c86c0f5a1af9c6e3aaeb6baac2…
11 A = 16c92f77c139706430f396f72ec7adb045745cd9f5899b0074d9955bd32de66f57c05c7929b575312a7f1c04f19e724…
12 B = -8734c4a2361fc530f60b28a5f1c7e93136c5ff6bfc7553965eaca54c61e6befb3c0f8cef4280e780cc5940d21a740d…
16 A = -6715098ab2ba3ea1e6341e89936e3ae913cdd450dc831c8534071f3c362841e47d88f2cd29c0d1239aa0949f3685f1…
21 A = -11fec955948e007b59fc50e729941ee9d43d552b9411510b73f6b4faafc0465f261f8381d96f647267f72175883172…
22 B = -2b3792f39499767e0a8b7a6a406e470a78f97ebb36765beab5fe52e95abf7582736db72a2ebfdb2405e3954c968b35…
26 A = 7713413d87f1e50840255927ff27bad79e5de5898725a876e4647913158cda9f5fa031dd7fc11d2e8130a0ba99e8706…
31 A = 17d806d7c76aa8acb051fd9c0c782443f1b1b6387455f7cfb737c41658d0459bda5d13587055eafb87ad8d209bccac1…
32 B = -d7c9b6574354e131de4b8643d766641e98554a03238ebfce1112c3da5f049d6c410a7f05758571aa2625f7190b936a…
[all …]
|
| /external/cronet/third_party/boringssl/src/crypto/fipsmodule/bn/test/ |
| D | shift_tests.txt | 3 # These test vectors satisfy A * 2 = LShift1
6 A = 0
9 A = 988b0905e52efb2709f98a12a
11 LShift1 = -13116120bca5df64e13f314254
12 A = -988b0905e52efb2709f98a12a
15 A = 13116120bca5df64e13f314254
17 LShift1 = -2622c241794bbec9c27e6284a8
18 A = -13116120bca5df64e13f314254
21 A = 2622c241794bbec9c27e6284a8
23 LShift1 = -4c458482f2977d9384fcc50950
[all …]
|
| D | sum_tests.txt | 3 # These test vectors satisfy A + B = Sum.
6 A = 0
10 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
13 Sum = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccc…
14 A = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…
18 A = c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce12…
19 B = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…
22 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
26 A = c590e57ee64fced18aff6e2f0c6ac05625b1e94f394f42470cae14d12cadea4f5ab6b9d77225fe3b4903825966c7875…
27 B = -4b5b16252ba2355e0b87f01baa721783c403607a4c1b5652c09a68e96926c8e314fa580bf0ad3f8f59bd70f14df86a…
[all …]
|
| D | product_tests.txt | 3 # These test vectors satisfy A^2 = Square.
5 # Regression test for a BN_sqr overflow bug.
7 A = 80000000000000008000000000000001fffffffffffffffe0000000000000000
9 # Regression test for a BN_sqr overflow bug.
11 A = 80000000000000000000000080000001fffffffe000000000000000000000000
14 A = -df6a253c3f
17 A = 21f253ddb5a6d
20 A = -95fbaee5a09c86d
23 A = -3e71292dd4ad3ed3b4
26 A = 9b45cf6c7a43d910dcff
[all …]
|
| D | quotient_tests.txt | 3 # These test vectors satisfy Quotient = A / B, rounded towards zero, and
4 # Remainder = A - B * Quotient.
8 A = 8cdaaa7c422f3c2bb0ace2da7d7ff151e5bdefb23e6426cf3e6b21491e6e80e977bfa6c65931a8dee31fc7992c0c801…
11 Quotient = -2
13 A = 107f0e6cebfe22ac11294a06fed2b994d01c9b3610d50bdd254adafd08c93be8ebdd1e85e1286fe9c9e682a90cbbd63…
14 B = -83f873675ff11560894a5037f695cca680e4d9b086a85ee92a56d7e84649df475ee8f42f09437f4e4f34154865deb1…
16 Quotient = -4
17 Remainder = -2
18 A = -3d8746ae2123c2d3f1d35910b42af1f86f5e81f8e98986cea20b2a1bdb8af6cf111f1258f112c837accdf4868463fe…
22 Remainder = -3
[all …]
|
| D | mod_mul_tests.txt | 3 # These test vectors satisfy A * B = ModMul (mod M) and 0 <= ModMul < M.
6 A = 6b18497fed9befdf22a01d988d34213f6687d8a96e86c188dea4172e7c6095a0d18d3c86c0f5a1af9c6e3aaeb6baac2…
11 A = 16c92f77c139706430f396f72ec7adb045745cd9f5899b0074d9955bd32de66f57c05c7929b575312a7f1c04f19e724…
12 B = -8734c4a2361fc530f60b28a5f1c7e93136c5ff6bfc7553965eaca54c61e6befb3c0f8cef4280e780cc5940d21a740d…
16 A = -6715098ab2ba3ea1e6341e89936e3ae913cdd450dc831c8534071f3c362841e47d88f2cd29c0d1239aa0949f3685f1…
21 A = -11fec955948e007b59fc50e729941ee9d43d552b9411510b73f6b4faafc0465f261f8381d96f647267f72175883172…
22 B = -2b3792f39499767e0a8b7a6a406e470a78f97ebb36765beab5fe52e95abf7582736db72a2ebfdb2405e3954c968b35…
26 A = 7713413d87f1e50840255927ff27bad79e5de5898725a876e4647913158cda9f5fa031dd7fc11d2e8130a0ba99e8706…
31 A = 17d806d7c76aa8acb051fd9c0c782443f1b1b6387455f7cfb737c41658d0459bda5d13587055eafb87ad8d209bccac1…
32 B = -d7c9b6574354e131de4b8643d766641e98554a03238ebfce1112c3da5f049d6c410a7f05758571aa2625f7190b936a…
[all …]
|
| /external/fft2d/src/fft2d/fft2d/ |
| D | fftsg.f | 5 ! radix :split-radix
14 ! dfst: Sine Transform of RDFT (Real Anti-symmetric DFT)
17 ! -------- Complex DFT (Discrete Fourier Transform) --------
20 ! X(k) = sum_j=0^n-1 x(j)*exp(2*pi*i*j*k/n), 0<=k<n
22 ! X(k) = sum_j=0^n-1 x(j)*exp(-2*pi*i*j*k/n), 0<=k<n
23 ! (notes: sum_j=0^n-1 is a summation from j=0 to n-1)
27 ! call cdft(2*n, 1, a, ip, w)
30 ! call cdft(2*n, -1, a, ip, w)
34 ! a(0:2*n-1) :input/output data (real*8)
36 ! a(2*j) = Re(x(j)),
[all …]
|
| D | fftsg.c | 6 radix :split-radix
15 dfst: Sine Transform of RDFT (Real Anti-symmetric DFT)
32 -------- Complex DFT (Discrete Fourier Transform) --------
35 X[k] = sum_j=0^n-1 x[j]*exp(2*pi*i*j*k/n), 0<=k<n
37 X[k] = sum_j=0^n-1 x[j]*exp(-2*pi*i*j*k/n), 0<=k<n
38 (notes: sum_j=0^n-1 is a summation from j=0 to n-1)
42 cdft(2*n, 1, a, ip, w);
45 cdft(2*n, -1, a, ip, w);
49 a[0...2*n-1] :input/output data (double *)
51 a[2*j] = Re(x[j]),
[all …]
|
| /external/bazelbuild-rules_license/docs/ |
| D | latest.md | 1 <!-- Generated with Stardoc: http://skydoc.bazel.build -->
3 Rules for declaring the compliance licenses used by a package.
7 <a id="license"></a>
12 …a href="#license-name">name</a>, <a href="#license-copyright_notice">copyright_notice</a>, <a href…
13 <a href="#license-package_version">package_version</a>)
22 | :------------- | :------------- | :------------- | :------------- | :------------- |
23 | <a id="license-name"></a>name | A unique name for this target. | <a href="https://bazel.build/…
24 | <a id="license-copyright_notice"></a>copyright_notice | Copyright notice. | String | optional …
25 …a id="license-license_kinds"></a>license_kinds | License kind(s) of this license. If multiple lic…
26 | <a id="license-license_text"></a>license_text | The license file. | <a href="https://bazel.bui…
[all …]
|
| /external/bazel-skylib/docs/ |
| D | new_sets_doc.md | 1 <!-- Generated with Stardoc: http://skydoc.bazel.build -->
3 Skylib module containing common hash-set algorithms.
6 if you pass it an sequence: `sets.make([1, 2, 3])`. This returns a struct containing all of the
7 values as keys in a dictionary - this means that all passed in values must be hashable. The
10 An arbitrary object can be tested whether it is a set generated by `sets.make()` or not with the
14 <a id="#sets.make"></a>
19 sets.make(<a href="#sets.make-elements">elements</a>)
22 Creates a new set.
31 | :------------- | :------------- | :------------- |
32 | <a id="sets.make-elements"></a>elements | Optional sequence to construct the set out of. | <c…
[all …]
|
| D | unittest_doc.md | 1 <!-- Generated with Stardoc: http://skydoc.bazel.build -->
10 <a id="#unittest_toolchain"></a>
15 …a href="#unittest_toolchain-name">name</a>, <a href="#unittest_toolchain-escape_chars_with">escape…
16 …<a href="#unittest_toolchain-join_on">join_on</a>, <a href="#unittest_toolchain-success_templ">suc…
25 | :------------- | :------------- | :------------- | :------------- | :------------- |
26 | <a id="unittest_toolchain-name"></a>name | A unique name for this target. | <a href="https://b…
27 …a id="unittest_toolchain-escape_chars_with"></a>escape_chars_with | Dictionary of characters that…
28 …a id="unittest_toolchain-escape_other_chars_with"></a>escape_other_chars_with | String to prefix …
29 …a id="unittest_toolchain-failure_templ"></a>failure_templ | Test script template with a single <c…
30 | <a id="unittest_toolchain-file_ext"></a>file_ext | File extension for test script, including lea…
[all …]
|
| /external/python/cpython2/Tools/pybench/ |
| D | Arithmetic.py | 13 a = 2
17 c = a + b
19 c = c + a
20 c = a + b
23 c = c - a
24 c = a - b
25 c = b - c
26 c = c - a
27 c = b - c
29 c = a / b
[all …]
|
| /external/bc/tests/bc/errors/ |
| D | 01.txt | 1 a(s691027461l[ ba])
3 a
4 a
9 a
13 a
18 a
22 a
25 a
26 a
32 a(s691027461l[ ba])
[all …]
|
| /external/llvm/test/MC/Sparc/ |
| D | sparc-ctrl-instructions.s | 1 ! RUN: llvm-mc %s -arch=sparc -show-encoding | FileCheck %s
2 ! RUN: llvm-mc %s -arch=sparcv9 -show-encoding | FileCheck %s
4 ! CHECK: call foo ! encoding: [0b01AAAAAA,A,A,A]
5 ! CHECK: ! fixup A - offset: 0, value: foo, kind: fixup_sparc_call30
17 ! CHECK: call %g1+%lo(sym) ! encoding: [0x9f,0xc0,0b011000AA,A]
18 ! CHECK-NEXT: ! fixup A - offset: 0, value: %lo(sym), kind: fixup_sparc_lo10
30 ! CHECK: jmp %g1+%lo(sym) ! encoding: [0x81,0xc0,0b011000AA,A]
31 ! CHECK-NEXT: ! fixup A - offset: 0, value: %lo(sym), kind: fixup_sparc_lo10
43 ! CHECK: jmpl %g1+%lo(sym), %g2 ! encoding: [0x85,0xc0,0b011000AA,A]
44 … ! CHECK-NEXT: ! fixup A - offset: 0, value: %lo(sym), kind: fixup_sparc_lo10
[all …]
|
| /external/stardoc/test/testdata/attribute_defaults_test/ |
| D | golden.md | 1 <!-- Generated with Stardoc: http://skydoc.bazel.build -->
3 A golden test to verify attribute default values.
5 <a id="my_rule"></a>
10 …a href="#my_rule-name">name</a>, <a href="#my_rule-a">a</a>, <a href="#my_rule-b">b</a>, <a href="…
19 | :------------- | :------------- | :------------- | :------------- | :------------- |
20 | <a id="my_rule-name"></a>name | A unique name for this target. | <a href="https://bazel.build/…
21 | <a id="my_rule-a"></a>a | Some bool | Boolean | optional | <code>False</code> |
22 | <a id="my_rule-b"></a>b | Some int | Integer | optional | <code>2</code> |
23 | <a id="my_rule-c"></a>c | Some int_list | List of integers | optional | <code>[0, 1]</code> |
24 | <a id="my_rule-d"></a>d | Some label | <a href="https://bazel.build/concepts/labels">Label</a>…
[all …]
|
| /external/libcups/vcnet/regex/ |
| D | tests | 9 # expected to fail. If there is a fourth field, it is the substring that
10 # the RE is expected to match. If there is a fifth field, it is a comma-
11 # separated list of what the subexpressions should match, with - indicating
12 # no match for that one. In both the fourth and fifth fields, a (sub)field
14 # a null string followed by the stuff after the @; this provides a way to
19 # - placeholder, does nothing
20 # b RE is a BRE, not an ERE
21 # & try it as both an ERE and a BRE
36 a & a a
38 abc|de - abc abc
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
36 int a[] = {0}; in test() local
37 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
38 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
43 int a[] = {0, 0}; in test() local
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
|
| /external/cronet/third_party/icu/source/test/intltest/ |
| D | v32test.cpp | 5 * Copyright (c) 2002-2007, International Business Machines Corporation and
25 //---------------------------------------------------------------------------
29 //---------------------------------------------------------------------------
55 //---------------------------------------------------------------------------
59 //---------------------------------------------------------------------------
73 //---------------------------------------------------------------------------
77 //---------------------------------------------------------------------------
81 UVector32 *a; in UVector32_API() local
84 a = new UVector32(status); in UVector32_API()
86 delete a; in UVector32_API()
[all …]
|
| /external/icu/icu4c/source/test/intltest/ |
| D | v32test.cpp | 5 * Copyright (c) 2002-2007, International Business Machines Corporation and
25 //---------------------------------------------------------------------------
29 //---------------------------------------------------------------------------
55 //---------------------------------------------------------------------------
59 //---------------------------------------------------------------------------
73 //---------------------------------------------------------------------------
77 //---------------------------------------------------------------------------
81 UVector32 *a; in UVector32_API() local
84 a = new UVector32(status); in UVector32_API()
86 delete a; in UVector32_API()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
36 int a[] = {0}; in test() local
37 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
38 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
43 int a[] = {0, 0}; in test() local
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test()
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
48 int a[] = {0, 1}; in test() local
[all …]
|
| /external/abseil-cpp/absl/container/internal/ |
| D | inlined_vector.h | 5 // You may obtain a copy of the License at
7 // https://www.apache.org/licenses/LICENSE-2.0
42 #pragma GCC diagnostic ignored "-Warray-bounds"
45 template <typename A>
46 using AllocatorTraits = std::allocator_traits<A>;
47 template <typename A>
48 using ValueType = typename AllocatorTraits<A>::value_type;
49 template <typename A>
50 using SizeType = typename AllocatorTraits<A>::size_type;
51 template <typename A>
[all …]
|