Home
last modified time | relevance | path

Searched refs:N2 (Results 1 – 25 of 388) sorted by relevance

12345678910>>...16

/external/guava/guava-tests/test/com/google/common/graph/
DGraphsTest.java40 private static final Integer N2 = 2; field in GraphsTest
68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
77 expectedClosure.putEdge(N2, N2); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
89 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
91 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
96 expectedClosure.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
98 expectedClosure.putEdge(N2, N2); in transitiveClosure_undirectedGraph()
[all …]
DAbstractStandardUndirectedNetworkTest.java36 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
37 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
63 nodes.add(N2); in nodes_checkReturnedSetMutability()
79 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
93 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
104 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
107 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
114 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
120 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
129 addNode(N2); in edgesConnecting_checkReturnedSetMutability()
[all …]
DAbstractStandardUndirectedGraphTest.java51 nodes.add(N2); in nodes_checkReturnedSetMutability()
67 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
80 addNode(N2); in predecessors_checkReturnedSetMutability()
81 Set<Integer> predecessors = graph.predecessors(N2); in predecessors_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
87 assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); in predecessors_checkReturnedSetMutability()
99 successors.add(N2); in successors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
115 incidentEdges.add(EndpointPair.unordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
[all …]
DAbstractStandardDirectedNetworkTest.java69 nodes.add(N2); in nodes_checkReturnedSetMutability()
87 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
103 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
116 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
119 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
128 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
134 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
145 addNode(N2); in edgesConnecting_checkReturnedSetMutability()
146 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
151 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
[all …]
DAbstractStandardDirectedGraphTest.java40 nodes.add(N2); in nodes_checkReturnedSetMutability()
56 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
69 addNode(N2); in predecessors_checkReturnedSetMutability()
70 Set<Integer> predecessors = graph.predecessors(N2); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
76 assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); in predecessors_checkReturnedSetMutability()
88 successors.add(N2); in successors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
104 incidentEdges.add(EndpointPair.ordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
[all …]
DEndpointPairTest.java36 private static final Integer N2 = 2; field in EndpointPairTest
123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
129 EndpointPair.ordered(N1, N2), in endpointPair_directedGraph()
130 EndpointPair.ordered(N2, N1), in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
145 EndpointPair.unordered(N1, N2), in endpointPair_undirectedGraph()
155 directedNetwork.addEdge(N1, N2, E12); in endpointPair_directedNetwork()
156 directedNetwork.addEdge(N2, N1, E21); in endpointPair_directedNetwork()
[all …]
DDefaultNetworkImplementationsTest.java49 private static final Integer N2 = 2; field in DefaultNetworkImplementationsTest
84 network.addNode(N2); in edgesConnecting_disconnectedNodes()
85 assertThat(networkForTest.edgesConnecting(N1, N2)).isEmpty(); in edgesConnecting_disconnectedNodes()
91 network.addNode(N2); in edgesConnecting_nodesNotInGraph()
99 networkForTest.edgesConnecting(NODE_NOT_IN_GRAPH, N2); in edgesConnecting_nodesNotInGraph()
115 network.addNode(N2); in edgesConnecting_checkReturnedSetMutability()
116 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
121 network.addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
122 assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactlyElementsIn(edgesConnecting); in edgesConnecting_checkReturnedSetMutability()
128 network.addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
[all …]
DNetworkEquivalenceTest.java36 private static final Integer N2 = 2; field in NetworkEquivalenceTest
85 g2.addNode(N2); in equivalent_nodeSetsDiffer()
93 network.addEdge(N1, N2, E12); in equivalent_edgeSetsDiffer()
96 g2.addEdge(N1, N2, E13); in equivalent_edgeSetsDiffer()
104 network.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
107 g2.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
126 network.addEdge(N1, N2, E12); in equivalent_connectionsDiffer()
131 g2.addEdge(N1, N2, E13); in equivalent_connectionsDiffer()
141 network.addEdge(N1, N2, E12); in equivalent_propertiesDiffer()
148 g2.addEdge(N1, N2, E12); in equivalent_propertiesDiffer()
[all …]
/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphsTest.java40 private static final Integer N2 = 2; field in GraphsTest
68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
77 expectedClosure.putEdge(N2, N2); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
89 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
91 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
96 expectedClosure.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
98 expectedClosure.putEdge(N2, N2); in transitiveClosure_undirectedGraph()
[all …]
DAbstractStandardUndirectedNetworkTest.java35 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
36 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
62 nodes.add(N2); in nodes_checkReturnedSetMutability()
78 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
92 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
103 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
106 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
113 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
119 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
128 addNode(N2); in edgesConnecting_checkReturnedSetMutability()
[all …]
DAbstractStandardUndirectedGraphTest.java51 nodes.add(N2); in nodes_checkReturnedSetMutability()
67 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
80 addNode(N2); in predecessors_checkReturnedSetMutability()
81 Set<Integer> predecessors = graph.predecessors(N2); in predecessors_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
87 assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); in predecessors_checkReturnedSetMutability()
99 successors.add(N2); in successors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
115 incidentEdges.add(EndpointPair.unordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
[all …]
DAbstractStandardDirectedGraphTest.java40 nodes.add(N2); in nodes_checkReturnedSetMutability()
56 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
69 addNode(N2); in predecessors_checkReturnedSetMutability()
70 Set<Integer> predecessors = graph.predecessors(N2); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
76 assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); in predecessors_checkReturnedSetMutability()
88 successors.add(N2); in successors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
104 incidentEdges.add(EndpointPair.ordered(N1, N2)); in incidentEdges_checkReturnedSetMutability()
[all …]
DAbstractStandardDirectedNetworkTest.java68 nodes.add(N2); in nodes_checkReturnedSetMutability()
86 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
102 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
115 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
118 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
127 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
133 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
144 addNode(N2); in edgesConnecting_checkReturnedSetMutability()
145 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
150 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
[all …]
DEndpointPairTest.java36 private static final Integer N2 = 2; field in EndpointPairTest
123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
129 EndpointPair.ordered(N1, N2), in endpointPair_directedGraph()
130 EndpointPair.ordered(N2, N1), in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
145 EndpointPair.unordered(N1, N2), in endpointPair_undirectedGraph()
155 directedNetwork.addEdge(N1, N2, E12); in endpointPair_directedNetwork()
156 directedNetwork.addEdge(N2, N1, E21); in endpointPair_directedNetwork()
[all …]
DDefaultNetworkImplementationsTest.java49 private static final Integer N2 = 2; field in DefaultNetworkImplementationsTest
84 network.addNode(N2); in edgesConnecting_disconnectedNodes()
85 assertThat(networkForTest.edgesConnecting(N1, N2)).isEmpty(); in edgesConnecting_disconnectedNodes()
91 network.addNode(N2); in edgesConnecting_nodesNotInGraph()
99 networkForTest.edgesConnecting(NODE_NOT_IN_GRAPH, N2); in edgesConnecting_nodesNotInGraph()
115 network.addNode(N2); in edgesConnecting_checkReturnedSetMutability()
116 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
121 network.addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
122 assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactlyElementsIn(edgesConnecting); in edgesConnecting_checkReturnedSetMutability()
128 network.addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
[all …]
DNetworkEquivalenceTest.java36 private static final Integer N2 = 2; field in NetworkEquivalenceTest
85 g2.addNode(N2); in equivalent_nodeSetsDiffer()
93 network.addEdge(N1, N2, E12); in equivalent_edgeSetsDiffer()
96 g2.addEdge(N1, N2, E13); in equivalent_edgeSetsDiffer()
104 network.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
107 g2.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
126 network.addEdge(N1, N2, E12); in equivalent_connectionsDiffer()
131 g2.addEdge(N1, N2, E13); in equivalent_connectionsDiffer()
141 network.addEdge(N1, N2, E12); in equivalent_propertiesDiffer()
148 g2.addEdge(N1, N2, E12); in equivalent_propertiesDiffer()
[all …]
/external/llvm-project/llvm/unittests/ADT/
DWaymarkingTest.cpp65 const int N2 = 2 * N; in TEST() local
66 int **volatile A = createArray(N2); in TEST()
70 verifyArrayValues(A, N2); in TEST()
75 fillWaymarks(A + N, A + N2, N); in TEST()
76 verifyArrayValues(A, N2); in TEST()
80 freeArray(A, N2); in TEST()
86 const int N2 = 2 * N; in TEST() local
92 fillWaymarks(A + N, A + N2, 0); in TEST()
93 fillWaymarks(A + N2, A + N3, 0); in TEST()
97 verifyFollowWaymarks(A + N, N2 - N); in TEST()
[all …]
DDirectedGraphTest.cpp96 DGTestNode N1, N2, N3; in TEST() local
97 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
101 EXPECT_TRUE(DG.addNode(N2)); in TEST()
108 EXPECT_TRUE(DG.connect(N1, N2, E2)); in TEST()
109 EXPECT_TRUE(DG.connect(N2, N3, E3)); in TEST()
141 DGTestNode N1, N2, N3; in TEST() local
142 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
144 DG.addNode(N2); in TEST()
146 DG.connect(N1, N2, E2); in TEST()
147 DG.connect(N2, N3, E3); in TEST()
[all …]
/external/eigen/test/
Ddiagonal.cpp34 N2 = MatrixType::RowsAtCompileTime>1 ? -1 : 0 in diagonal() enumerator
41 VERIFY(m1.template diagonal<N2>().RowsAtCompileTime == m1.diagonal(N2).size()); in diagonal()
50 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); in diagonal()
51 m2.template diagonal<N2>()[0] *= 3; in diagonal()
52 …VERIFY_IS_APPROX(m2.template diagonal<N2>()[0], static_cast<Scalar>(6) * m1.template diagonal<N2>(… in diagonal()
59 m2.diagonal(N2) = 2 * m1.diagonal(N2); in diagonal()
60 VERIFY_IS_APPROX(m2.template diagonal<N2>(), static_cast<Scalar>(2) * m1.diagonal(N2)); in diagonal()
61 m2.diagonal(N2)[0] *= 3; in diagonal() local
62 VERIFY_IS_APPROX(m2.diagonal(N2)[0], static_cast<Scalar>(6) * m1.diagonal(N2)[0]); in diagonal()
64 m2.diagonal(N2).x() = s1; in diagonal()
[all …]
/external/webrtc/modules/audio_processing/aec3/
Dcomfort_noise_generator_unittest.cc28 std::array<float, kFftLengthBy2Plus1> N2; in Power() local
29 N.Spectrum(Aec3Optimization::kNone, N2); in Power()
30 return std::accumulate(N2.begin(), N2.end(), 0.f) / N2.size(); in Power()
41 std::vector<std::array<float, kFftLengthBy2Plus1>> N2(kNumChannels); in TEST() local
46 N2[ch].fill(1000.f * 1000.f / (ch + 1)); in TEST()
54 cng.Compute(false, N2, n_lower, n_upper); in TEST()
62 cng.Compute(false, N2, n_lower, n_upper); in TEST()
66 EXPECT_NEAR(2.f * N2[ch][0], Power(n_lower[ch]), N2[ch][0] / 10.f); in TEST()
67 EXPECT_NEAR(2.f * N2[ch][0], Power(n_upper[ch]), N2[ch][0] / 10.f); in TEST()
/external/llvm-project/llvm/test/Transforms/LICM/
Dargmemonly-call.ll2 …a-loop-dependency=true -verify-memoryssa %s -enable-new-pm=0 | FileCheck %s --check-prefix=ALIAS-N2
3 …cm -basic-aa -licm-n2-threshold=200 < %s -S -enable-new-pm=0 | FileCheck %s --check-prefix=ALIAS-N2
6 …evolution>,require<opt-remark-emit>,loop-mssa(licm)' < %s -S | FileCheck %s --check-prefix=ALIAS-N2
7 …alar-evolution>,require<opt-remark-emit>,loop(licm)' < %s -S | FileCheck %s --check-prefix=ALIAS-N2
17 ; ALIAS-N2-LABEL: @test
18 ; ALIAS-N2: @foo
19 ; ALIAS-N2-LABEL: loop:
33 ; ALIAS-N2-LABEL: @test_neg
34 ; ALIAS-N2-LABEL: loop:
35 ; ALIAS-N2: @foo
[all …]
Dinvariant.start.ll2 ; RUN: opt -licm -basic-aa -licm-n2-threshold=200 < %s -S | FileCheck %s --check-prefix=ALIAS-N2
4 …alar-evolution>,require<opt-remark-emit>,loop(licm)' < %s -S | FileCheck %s --check-prefix=ALIAS-N2
13 ; ALIAS-N2-LABEL: @test1(
14 ; ALIAS-N2-LABEL: entry:
15 ; ALIAS-N2: call {}* @llvm.invariant.start.p0i32(i64 4, i32* %ptr)
16 ; ALIAS-N2: %val = load i32, i32* %ptr
17 ; ALIAS-N2-LABEL: loop:
39 ; ALIAS-N2-LABEL: @test2(
40 ; ALIAS-N2-LABEL: entry:
41 ; ALIAS-N2: %val = load i32, i32* %ptr
[all …]
/external/angle/third_party/vulkan-deps/glslang/src/Test/baseResults/
Dhlsl.namespace.frag.out10 0:10 Function Definition: N2::getVec( ( temp 4-component vector of float)
15 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
20 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
34 0:22 Function Call: N2::getVec( ( temp 4-component vector of float)
35 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
37 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
38 0:22 'N2::gf' ( global float)
48 0:? 'N2::gf' ( global float)
63 0:10 Function Definition: N2::getVec( ( temp 4-component vector of float)
68 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
[all …]
/external/deqp-deps/glslang/Test/baseResults/
Dhlsl.namespace.frag.out10 0:10 Function Definition: N2::getVec( ( temp 4-component vector of float)
15 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
20 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
34 0:22 Function Call: N2::getVec( ( temp 4-component vector of float)
35 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
37 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
38 0:22 'N2::gf' ( global float)
48 0:? 'N2::gf' ( global float)
63 0:10 Function Definition: N2::getVec( ( temp 4-component vector of float)
68 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DStringSwitch.h112 template<unsigned N0, unsigned N1, unsigned N2>
115 const char (&S2)[N2], const T& Value) { in Cases() argument
119 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
122 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
127 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
130 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
135 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
139 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
145 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
149 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
[all …]

12345678910>>...16