| /external/fft2d/src/fft2d/fft2d/ |
| D | fftsg2d.c | 6 radix :split-radix, row-column
21 fftsg.c : 1D-FFT package
31 -------- Complex DFT (Discrete Fourier Transform) --------
34 X[k1][k2] = sum_j1=0^n1-1 sum_j2=0^n2-1 x[j1][j2] *
35 exp(2*pi*i*j1*k1/n1) *
36 exp(2*pi*i*j2*k2/n2), 0<=k1<n1, 0<=k2<n2
38 X[k1][k2] = sum_j1=0^n1-1 sum_j2=0^n2-1 x[j1][j2] *
39 exp(-2*pi*i*j1*k1/n1) *
40 exp(-2*pi*i*j2*k2/n2), 0<=k1<n1, 0<=k2<n2
41 (notes: sum_j=0^n-1 is a summation from j=0 to n-1)
[all …]
|
| D | fftsg2d.f | 5 ! radix :split-radix, row-column
14 ! fftsg.f : 1D-FFT package
17 ! -------- Complex DFT (Discrete Fourier Transform) --------
20 ! X(k1,k2) = sum_j1=0^n1-1 sum_j2=0^n2-1 x(j1,j2) *
21 ! exp(2*pi*i*j1*k1/n1) *
23 ! 0<=k1<n1, 0<=k2<n2
25 ! X(k1,k2) = sum_j1=0^n1-1 sum_j2=0^n2-1 x(j1,j2) *
26 ! exp(-2*pi*i*j1*k1/n1) *
27 ! exp(-2*pi*i*j2*k2/n2),
28 ! 0<=k1<n1, 0<=k2<n2
[all …]
|
| D | fftsg3d.c | 6 radix :split-radix, row-column
21 fftsg.c : 1D-FFT package
31 -------- Complex DFT (Discrete Fourier Transform) --------
34 X[k1][k2][k3] = sum_j1=0^n1-1 sum_j2=0^n2-1 sum_j3=0^n3-1
36 exp(2*pi*i*j1*k1/n1) *
39 0<=k1<n1, 0<=k2<n2, 0<=k3<n3
41 X[k1][k2][k3] = sum_j1=0^n1-1 sum_j2=0^n2-1 sum_j3=0^n3-1
43 exp(-2*pi*i*j1*k1/n1) *
44 exp(-2*pi*i*j2*k2/n2) *
45 exp(-2*pi*i*j3*k3/n3),
[all …]
|
| D | fftsg3d.f | 5 ! radix :split-radix, row-column
14 ! fftsg.f : 1D-FFT package
17 ! -------- Complex DFT (Discrete Fourier Transform) --------
20 ! X(k1,k2,k3) = sum_j1=0^n1-1 sum_j2=0^n2-1 sum_j3=0^n3-1
22 ! exp(2*pi*i*j1*k1/n1) *
25 ! 0<=k1<n1, 0<=k2<n2, 0<=k3<n3
27 ! X(k1,k2,k3) = sum_j1=0^n1-1 sum_j2=0^n2-1 sum_j3=0^n3-1
29 ! exp(-2*pi*i*j1*k1/n1) *
30 ! exp(-2*pi*i*j2*k2/n2) *
31 ! exp(-2*pi*i*j3*k3/n3),
[all …]
|
| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | AbstractStandardUndirectedNetworkTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
38 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
39 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
64 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
65 addNode(N1); in nodes_checkReturnedSetMutability()
73 assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); in edges_checkReturnedSetMutability()
74 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
81 addNode(N1); in incidentEdges_checkReturnedSetMutability()
82 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
83 assertThrows(UnsupportedOperationException.class, () -> incidentEdges.add(E12)); in incidentEdges_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardDirectedNetworkTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
69 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
70 addNode(N1); in nodes_checkReturnedSetMutability()
80 assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); in edges_checkReturnedSetMutability()
81 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
90 addNode(N1); in incidentEdges_checkReturnedSetMutability()
91 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
92 assertThrows(UnsupportedOperationException.class, () -> incidentEdges.add(E12)); in incidentEdges_checkReturnedSetMutability()
93 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
94 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
[all …]
|
| D | GraphsTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
39 private static final Integer N1 = 1; field in GraphsTest
43 private static final String E11 = "1-1";
44 private static final String E11_A = "1-1a";
45 private static final String E12 = "1-2";
46 private static final String E12_A = "1-2a";
47 private static final String E12_B = "1-2b";
48 private static final String E21 = "2-1";
49 private static final String E13 = "1-3";
50 private static final String E31 = "3-1";
[all …]
|
| D | AbstractStandardDirectedGraphTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
39 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
40 addNode(N1); in nodes_checkReturnedSetMutability()
49 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
50 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
51 assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); in adjacentNodes_checkReturnedSetMutability()
52 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
53 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
63 assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); in predecessors_checkReturnedSetMutability()
64 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardUndirectedGraphTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
50 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
51 addNode(N1); in nodes_checkReturnedSetMutability()
60 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
61 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
62 assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); in adjacentNodes_checkReturnedSetMutability()
63 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
64 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
74 assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
[all …]
|
| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | AbstractStandardUndirectedNetworkTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
37 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
38 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
63 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
64 addNode(N1); in nodes_checkReturnedSetMutability()
72 assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); in edges_checkReturnedSetMutability()
73 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
80 addNode(N1); in incidentEdges_checkReturnedSetMutability()
81 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
82 assertThrows(UnsupportedOperationException.class, () -> incidentEdges.add(E12)); in incidentEdges_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardDirectedNetworkTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
68 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
69 addNode(N1); in nodes_checkReturnedSetMutability()
79 assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); in edges_checkReturnedSetMutability()
80 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
89 addNode(N1); in incidentEdges_checkReturnedSetMutability()
90 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
91 assertThrows(UnsupportedOperationException.class, () -> incidentEdges.add(E12)); in incidentEdges_checkReturnedSetMutability()
92 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
93 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
[all …]
|
| D | GraphsTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
39 private static final Integer N1 = 1; field in GraphsTest
43 private static final String E11 = "1-1";
44 private static final String E11_A = "1-1a";
45 private static final String E12 = "1-2";
46 private static final String E12_A = "1-2a";
47 private static final String E12_B = "1-2b";
48 private static final String E21 = "2-1";
49 private static final String E13 = "1-3";
50 private static final String E31 = "3-1";
[all …]
|
| D | AbstractStandardDirectedGraphTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
39 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
40 addNode(N1); in nodes_checkReturnedSetMutability()
49 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
50 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
51 assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); in adjacentNodes_checkReturnedSetMutability()
52 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
53 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
63 assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); in predecessors_checkReturnedSetMutability()
64 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardUndirectedGraphTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
50 assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); in nodes_checkReturnedSetMutability()
51 addNode(N1); in nodes_checkReturnedSetMutability()
60 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
61 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
62 assertThrows(UnsupportedOperationException.class, () -> adjacentNodes.add(N2)); in adjacentNodes_checkReturnedSetMutability()
63 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
64 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
74 assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
[all …]
|
| /external/rust/android-crates-io/crates/num-bigint/tests/consts/ |
| D | mod.rs | 3 pub const N1: u32 = -1i32 as u32; constant
4 pub const N2: u32 = -2i32 as u32;
11 (&[1], &[N1], &[0, 1]),
12 (&[1], &[N1, N1], &[0, 0, 1]),
13 (&[N1, N1], &[N1, N1], &[N2, N1, 1]),
14 (&[1, 1, 1], &[N1, N1], &[0, 1, 2]),
15 (&[2, 2, 1], &[N1, N2], &[1, 1, 2]),
16 (&[1, 2, 2, 1], &[N1, N2], &[0, 1, 3, 1]),
28 (&[1, 1, 1], &[N1], &[N1, N1, N1]),
29 (&[1, 2, 3], &[N1], &[N1, N2, N2, 2]),
[all …]
|
| /external/fft2d/src/fft2d/fft2d/sample2d/ |
| D | fft4f2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
23 printf("data length n1=? (n1 = power of 2) \n"); in main()
24 scanf("%d", &n1); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 t = alloc_2d_double(n1, n2); in main()
30 n = MAX(n1, n2 / 2); in main()
32 n = MAX(n1 / 2, n2 / 4) + MAX(n1, n2); in main()
37 putdata2d(n1, n2, a); in main()
[all …]
|
| D | fft4f2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
8 real*8 a(0 : nmax - 1, 0 : nmax - 1),
9 & t(0 : nmax - 1, 0 : nmax - 1), w(0 : nmax * 3 / 2 - 1),
12 write (*, *) 'data length n1=? (n1 = power of 2) '
13 read (*, *) n1
19 call putdata2d(nmax, n1, n2, a)
20 call cdft2d(nmax, n1, n2, 1, a, ip, w)
21 call cdft2d(nmax, n1, n2, -1, a, ip, w)
22 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
26 call putdata2d(nmax, n1, n2, a)
[all …]
|
| D | fftsg2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
8 real*8 a(0 : nmax - 1, 0 : nmax - 1), t(0 : 8 * nmax - 1),
9 & w(0 : nmax * 3 / 2 - 1), err, errorcheck2d
11 write (*, *) 'data length n1=? (n1 = power of 2) '
12 read (*, *) n1
18 call putdata2d(nmax, n1, n2, a)
19 call cdft2d(nmax, n1, n2, 1, a, t, ip, w)
20 call cdft2d(nmax, n1, n2, -1, a, t, ip, w)
21 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
25 call putdata2d(nmax, n1, n2, a)
[all …]
|
| D | fftsg2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
23 printf("data length n1=? (n1 = power of 2) \n"); in main()
24 scanf("%d", &n1); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 n = MAX(n1, n2 / 2); in main()
31 n = MAX(n1, n2) * 3 / 2; in main()
36 putdata2d(n1, n2, a); in main()
37 cdft2d(n1, n2, 1, a, NULL, ip, w); in main()
[all …]
|
| D | fftsg3dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, n3, i, j variable
8 real*8 a(0 : nmax - 1, 0 : nmax - 1, 0 : nmax - 1),
9 & t(0 : 8 * nmax - 1),
10 & w(0 : nmax * 3 / 2 - 1), err, errorcheck3d
12 write (*, *) 'data length n1=? (n1 = power of 2) '
13 read (*, *) n1
21 call putdata3d(nmax, nmax, n1, n2, n3, a)
22 call cdft3d(nmax, nmax, n1, n2, n3, 1, a, t, ip, w)
23 call cdft3d(nmax, nmax, n1, n2, n3, -1, a, t, ip, w)
24 err = errorcheck3d(nmax, nmax, n1, n2, n3,
[all …]
|
| /external/selinux/libsepol/src/ |
| D | ebitmap.c | 20 const ebitmap_node_t *n1, *n2; in ebitmap_or() local
25 prev = &dst->node; in ebitmap_or()
26 n1 = e1->node; in ebitmap_or()
27 n2 = e2->node; in ebitmap_or()
28 while (n1 || n2) { in ebitmap_or()
32 return -ENOMEM; in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
35 new->startbit = n1->startbit; in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
37 n1 = n1->next; in ebitmap_or()
[all …]
|
| /external/pigweed/pw_presubmit/py/ |
| D | keep_sorted_test.py | 8 # https://www.apache.org/licenses/LICENSE-2.0
31 # pylint: disable=attribute-defined-outside-init
32 # pylint: disable=too-many-public-methods
38 def _run(self, contents: str) -> None:
50 # pylint: disable=protected-access
53 # pylint: enable=protected-access
72 def test_missing_end(self) -> None:
76 def test_missing_start(self) -> None:
80 def test_repeated_start(self) -> None:
84 def test_unrecognized_directive(self) -> None:
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/numerics/numarray/template.valarray/valarray.members/ |
| D | shift.pass.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
26 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
27 std::valarray<T> v1(a1, N1); in main()
29 assert(v2.size() == N1); in main()
30 for (unsigned i = 0; i < N1; ++i) in main()
37 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
38 std::valarray<T> v1(a1, N1); in main()
40 assert(v2.size() == N1); in main()
[all …]
|
| D | cshift.pass.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
26 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
27 std::valarray<T> v1(a1, N1); in main()
29 assert(v2.size() == N1); in main()
30 for (unsigned i = 0; i < N1; ++i) in main()
37 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
38 std::valarray<T> v1(a1, N1); in main()
40 assert(v2.size() == N1); in main()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/numerics/numarray/template.valarray/valarray.members/ |
| D | shift.pass.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
26 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
27 std::valarray<T> v1(a1, N1); in main()
29 assert(v2.size() == N1); in main()
30 for (unsigned i = 0; i < N1; ++i) in main()
37 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
38 std::valarray<T> v1(a1, N1); in main()
40 assert(v2.size() == N1); in main()
[all …]
|