Home
last modified time | relevance | path

Searched refs:nodeD (Results 1 – 25 of 64) sorted by relevance

123

/dports/www/grafana8/grafana-8.3.6/public/app/core/utils/
H A Ddag.test.ts9 const nodeD = dag.createNode('D'); constant
15 dag.link([nodeB, nodeC, nodeD, nodeE, nodeF, nodeG, nodeH], nodeA);
16 dag.link([nodeC, nodeD, nodeE, nodeF, nodeI], nodeB);
17 dag.link([nodeD, nodeE, nodeF, nodeG], nodeC);
18 dag.link([nodeE, nodeF], nodeD);
35 expect(nodeD.inputEdges).toHaveLength(2);
36 expect(nodeD.outputEdges).toHaveLength(3);
37 expect(nodeD.edges).toHaveLength(5);
78 expect(actual).toEqual(expect.arrayContaining([nodeD]));
82 const actual = nodeD.getOptimizedInputEdges().map((e) => e.inputNode);
/dports/www/firefox-esr/firefox-91.8.0/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp34 FakeNode nodeD;
39 nodeD.compartment = nullptr;
43 AddEdge(nodeB, nodeD);
60 ExpectWriteNode(writer, nodeD);
/dports/mail/thunderbird/thunderbird-91.8.0/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp34 FakeNode nodeD;
39 nodeD.compartment = nullptr;
43 AddEdge(nodeB, nodeD);
60 ExpectWriteNode(writer, nodeD);
/dports/lang/spidermonkey78/firefox-78.9.0/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp34 FakeNode nodeD;
39 nodeD.compartment = nullptr;
43 AddEdge(nodeB, nodeD);
60 ExpectWriteNode(writer, nodeD);
/dports/www/firefox/firefox-99.0/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp34 FakeNode nodeD;
39 nodeD.compartment = nullptr;
43 AddEdge(nodeB, nodeD);
60 ExpectWriteNode(writer, nodeD);
/dports/lang/spidermonkey60/firefox-60.9.0/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp35 FakeNode nodeD;
40 nodeD.compartment = nullptr;
44 AddEdge(nodeB, nodeD);
61 ExpectWriteNode(writer, nodeD);
/dports/www/firefox-legacy/firefox-52.8.0esr/devtools/shared/heapsnapshot/tests/gtest/
H A DSerializesEverythingInHeapGraphOnce.cpp14 FakeNode nodeD;
18 AddEdge(nodeC, nodeD);
19 AddEdge(nodeD, nodeA);
27 ExpectWriteNode(writer, nodeD);
H A DDoesCrossCompartmentBoundaries.cpp37 FakeNode nodeD;
42 nodeD.compartment = nullptr;
46 AddEdge(nodeB, nodeD);
63 ExpectWriteNode(writer, nodeD);
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/tests/
H A Dexpert_test.cpp151 % nodeD.get() % (nodeD.is_dirty() ? "*" : "") % nodeE.get() \
159 BOOST_CHECK(!nodeD.is_dirty()); \
164 BOOST_CHECK(nodeE.get() == nodeC.get() * nodeD.get()); \
208 data_node_t<int>& nodeD = *(const_cast<data_node_t<int>*>( in BOOST_AUTO_TEST_CASE() local
223 BOOST_CHECK(nodeD.is_dirty()); in BOOST_AUTO_TEST_CASE()
238 nodeD.set(2); // Hack for testing in BOOST_AUTO_TEST_CASE()
243 BOOST_CHECK(nodeE.get() == nodeC.get() * nodeD.get()); in BOOST_AUTO_TEST_CASE()
254 BOOST_CHECK(nodeE.get() == nodeC.get() * nodeD.get()); in BOOST_AUTO_TEST_CASE()
/dports/lang/spidermonkey60/firefox-60.9.0/testing/mozharness/test/
H A Dtest_mozilla_merkle.py40 nodeD = '380d0dc6fd7d4f37859a12dbfc7171b3cce29ab0688c6cffd2b15f3e0b21af49'.decode('hex') variable
49 [leaves[5], leaves[6], nodeD],
50 [leaves[4], leaves[6], nodeD],
51 [nodeC, nodeD],
59 '20' + nodeD.encode('hex')).decode('hex')
/dports/www/firefox-esr/firefox-91.8.0/testing/mozharness/test/
H A Dtest_mozilla_merkle.py52 nodeD = decode_hex("380d0dc6fd7d4f37859a12dbfc7171b3cce29ab0688c6cffd2b15f3e0b21af49")[ variable
67 [leaves[5], leaves[6], nodeD],
68 [leaves[4], leaves[6], nodeD],
69 [nodeC, nodeD],
82 + encode_hex(nodeD)[0].decode()
/dports/www/firefox/firefox-99.0/testing/mozharness/test/
H A Dtest_mozilla_merkle.py52 nodeD = decode_hex("380d0dc6fd7d4f37859a12dbfc7171b3cce29ab0688c6cffd2b15f3e0b21af49")[ variable
67 [leaves[5], leaves[6], nodeD],
68 [leaves[4], leaves[6], nodeD],
69 [nodeC, nodeD],
82 + encode_hex(nodeD)[0].decode()
/dports/mail/thunderbird/thunderbird-91.8.0/testing/mozharness/test/
H A Dtest_mozilla_merkle.py52 nodeD = decode_hex("380d0dc6fd7d4f37859a12dbfc7171b3cce29ab0688c6cffd2b15f3e0b21af49")[ variable
67 [leaves[5], leaves[6], nodeD],
68 [leaves[4], leaves[6], nodeD],
69 [nodeC, nodeD],
82 + encode_hex(nodeD)[0].decode()
/dports/lang/spidermonkey78/firefox-78.9.0/testing/mozharness/test/
H A Dtest_mozilla_merkle.py51 nodeD = decode_hex("380d0dc6fd7d4f37859a12dbfc7171b3cce29ab0688c6cffd2b15f3e0b21af49")[ variable
66 [leaves[5], leaves[6], nodeD],
67 [leaves[4], leaves[6], nodeD],
68 [nodeC, nodeD],
81 + encode_hex(nodeD)[0].decode()
/dports/science/chrono/chrono-7.0.1/src/tests/unit_tests/fea/
H A Dutest_FEA_ANCFshell_3423_Formulation.cpp148 nodeD->SetFixed(true); in AxialDisplacementCheck()
149 mesh->AddNode(nodeD); in AxialDisplacementCheck()
168 nodeD = nodeC; in AxialDisplacementCheck()
317 nodeD->SetFixed(true); in CantileverTipLoadCheck()
318 mesh->AddNode(nodeD); in CantileverTipLoadCheck()
337 nodeD = nodeC; in CantileverTipLoadCheck()
492 nodeD->SetFixed(true); in CantileverGravityCheck()
493 mesh->AddNode(nodeD); in CantileverGravityCheck()
512 nodeD = nodeC; in CantileverGravityCheck()
627 mesh->AddNode(nodeD); in AxialTwistCheck()
[all …]
H A Dutest_FEA_ANCFhexa_3843_Formulation.cpp179 mesh->AddNode(nodeD); in ANCFBrickTest()
1281 auto nodeD = in AxialDisplacementCheck() local
1283 mesh->AddNode(nodeD); in AxialDisplacementCheck()
1324 nodeD = nodeC; in AxialDisplacementCheck()
1479 auto nodeD = in CantileverTipLoadCheck() local
1481 mesh->AddNode(nodeD); in CantileverTipLoadCheck()
1522 nodeD = nodeC; in CantileverTipLoadCheck()
1682 auto nodeD = in CantileverGravityCheck() local
1725 nodeD = nodeC; in CantileverGravityCheck()
1843 auto nodeD = in AxialTwistCheck() local
[all …]
/dports/net/nncp/nncp-8.0.2/doc/
H A Dmulticast.texi89 nodeA -> subs: ["nodeB", "nodeD"]
90 nodeB -> subs: ["nodeC", "nodeD", "nodeA"], no keys
92 nodeD -> subs: ["nodeA", "nodeB"]
117 outgoing packets in @file{SPOOL/nodeB/tx} and @file{SPOOL/nodeD/tx}
119 @file{SPOOL/nodeD/area/AREA/MsgHash} files. Because we already have
124 inside. It copies/relays it to the @code{nodeC} and @code{nodeD}. It can
132 @code{nodeD} receives packets from both @code{nodeA} and @code{nodeB}.
136 If @code{nodeD} will receive packet from the @code{nodeB} first, it will
142 receive it twice from @code{nodeB} and @code{nodeD}, ignoring one of
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/tests/
H A DIncrTopoSortTest.cpp329 Node* nodeD = g.addNode('d'); in test_1() local
334 g.addEdge(nodeD, nodeR); in test_1()
421 Node* nodeD = g.addNode('d'); in test_diamond() local
430 g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D in test_diamond()
466 Node* nodeD = g.addNode('d'); in test_lopsided_binary_tree() local
474 g.addEdge(nodeC, nodeD); in test_lopsided_binary_tree()
/dports/science/chrono/chrono-7.0.1/src/tests/benchmark_tests/fea/
H A Dbtest_FEA_sparse_solver.cpp79 … auto nodeD = chrono_types::make_shared<ChNodeFEAxyzD>(ChVector<>(i * dx, 0, +width / 2), dir); in SetUp() local
81 mesh->AddNode(nodeD); in SetUp()
84 element->SetNodes(nodeA, nodeB, nodeD, nodeC); in SetUp()
91 nodeB = nodeD; in SetUp()
H A Dbtest_FEA_ANCFshell.cpp225 … auto nodeD = chrono_types::make_shared<ChNodeFEAxyzD>(ChVector<>(i * dx, 0, +width / 2), dir); in ANCFshell() local
227 mesh->AddNode(nodeD); in ANCFshell()
230 element->SetNodes(nodeA, nodeB, nodeD, nodeC); in ANCFshell()
237 nodeB = nodeD; in ANCFshell()

123