Home
last modified time | relevance | path

Searched refs:nodeB (Results 1 – 25 of 326) sorted by relevance

12345678910>>...14

/dports/editors/kile/kile-09ee4ef0417165b93da82c1fc057b9e1713a0c05/src/data/complete/tex/
H A Dpst-node.cwl45 \ncangle{nodeA}{nodeB}
46 \ncangle*{nodeA}{nodeB}
65 \ncarc{nodeA}{nodeB}
66 \ncarc*{nodeA}{nodeB}
73 \ncbar{nodeA}{nodeB}
74 \ncbar*{nodeA}{nodeB}
79 \ncbox{nodeA}{nodeB}
80 \ncbox*{nodeA}{nodeB}
93 \nccoil{nodeA}{nodeB}
117 \ncdiag{nodeA}{nodeB}
[all …]
/dports/editors/texstudio/texstudio-4.1.2/completion/
H A Dpst-node.cwl45 \ncangle{nodeA}{nodeB}
46 \ncangle*{nodeA}{nodeB}
65 \ncarc{nodeA}{nodeB}
66 \ncarc*{nodeA}{nodeB}
73 \ncbar{nodeA}{nodeB}
74 \ncbar*{nodeA}{nodeB}
79 \ncbox{nodeA}{nodeB}
80 \ncbox*{nodeA}{nodeB}
93 \nccoil{nodeA}{nodeB}
117 \ncdiag{nodeA}{nodeB}
[all …]
/dports/textproc/jaxup/jaxup/src/java/samples/org/jaxup/tests/
H A DXMLComparator.java27 if (!navigator.isDocument(nodeB)) in compare()
32 return compareDocuments(nodeA, nodeB); in compare()
37 if (!navigator.isElement(nodeB)) in compare()
42 return compareElements(nodeA, nodeB); in compare()
47 if (!navigator.isAttribute(nodeB)) in compare()
52 return compareAttributes(nodeA, nodeB); in compare()
57 if (!navigator.isComment(nodeB)) in compare()
62 return compareComments(nodeA, nodeB); in compare()
67 if (!navigator.isText(nodeB)) in compare()
72 return compareTexts(nodeA, nodeB); in compare()
[all …]
/dports/misc/gedkeeper/GEDKeeper-2.19.1/projects/GKv2/GWTreePlugin/GWTree/
H A DPair.cs43 var nodeB = NodeB; in GetLeftEdge()
46 return nodeB; in GetLeftEdge()
47 } else if (nodeB == null) { in GetLeftEdge()
50 return nodeA.Order < nodeB.Order ? nodeA : nodeB; in GetLeftEdge()
57 var nodeB = NodeB; in GetRightEdge()
60 return nodeB; in GetRightEdge()
61 } else if (nodeB == null) { in GetRightEdge()
64 return nodeA.Order < nodeB.Order ? nodeB : nodeA; in GetRightEdge()
91 var nodeB = NodeB; in DrawLinks()
92 if (nodeA == null || nodeB == null) return; in DrawLinks()
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/p2p/discover/v5wire/
H A Dencoding_test.go91 net.nodeB.expectDecode(t, FindnodeMsg, findnode)
92 if len(net.nodeB.c.sc.handshakes) > 0 {
170 net.nodeA.c.sc.storeNewSession(net.nodeB.id(), net.nodeB.addr(), session)
182 sa := net.nodeA.c.sc.session(net.nodeB.id(), net.nodeB.addr())
213 net.nodeA.c.sc.storeNewSession(net.nodeB.id(), net.nodeB.addr(), initKeysA)
307 challenge0B.Node = net.nodeB.n()
414 …fmt.Fprintf(o, "read-key = %#x\n", net.nodeA.c.sc.session(net.nodeB.id(), net.nodeB.addr()).writeK…
437 challenge = &Whoareyou{Node: net.nodeB.n()}
467 net.nodeA.c.sc.storeNewSession(net.nodeB.id(), net.nodeB.addr(), session)
490 nodeA, nodeB handshakeTestNode member
[all …]
/dports/www/mediawiki136/mediawiki-1.36.3/vendor/wikimedia/parsoid/src/Html2Wt/
H A DDOMDiff.php104 * @param DOMElement $nodeB
117 DOMCompat::getOuterHTML( $nodeB );
133 * @param DOMNode $nodeB
154 * @param DOMNode $nodeB
222 DOMUtils::assertElt( $nodeB ) && DOMCompat::getOuterHTML( $nodeB )
251 $nodeB,
272 * @param DOMNode $nodeB
283 Assert::invariant( $nodeB->nodeValue === (string)$nodeB->nodeValue, '' );
301 $nodeB,
577 * @param DOMNode $nodeB
[all …]
H A DSeparators.php121 * @param DOMNode $nodeB
145 $nodeB->nodeName,
162 $nodeB->nodeName,
361 * @param DOMNode $nodeB
415 'nodeB' => $nodeB,
444 $origNodeB = $nodeB;
485 if ( $nodeB && WTSUtils::precedingSpaceSuppressesIndentPre( $nodeB, $origNodeB ) ) {
494 while ( $nodeB &&
497 $nodeB = $nodeB->nextSibling;
505 if ( $nodeB && !$isIndentPreSafe && !DOMUtils::atTheTop( $nodeB ) ) {
[all …]
/dports/www/mediawiki137/mediawiki-1.37.1/vendor/wikimedia/parsoid/src/Html2Wt/
H A DDOMDiff.php103 * @param Element $nodeB
116 DOMCompat::getOuterHTML( $nodeB );
132 * @param Node $nodeB
153 * @param Node $nodeB
221 DOMUtils::assertElt( $nodeB ) && DOMCompat::getOuterHTML( $nodeB )
250 $nodeB,
271 * @param Node $nodeB
282 Assert::invariant( $nodeB->nodeValue === (string)$nodeB->nodeValue, '' );
300 $nodeB,
576 * @param Node $nodeB
[all …]
H A DSeparators.php115 * @param Node $nodeB
369 * @param Node $nodeB
382 $bCons = $nodeB instanceof Element ? $sepHandlerB->before( $nodeB, $nodeA, $state ) : [];
393 $bCons = $nodeB instanceof Element ? $sepHandlerB->before( $nodeB, $nodeA, $state ) : [];
425 'nodeB' => $nodeB,
452 $origNodeB = $nodeB;
494 if ( $nodeB && WTSUtils::precedingSpaceSuppressesIndentPre( $nodeB, $origNodeB ) ) {
503 while ( $nodeB &&
506 $nodeB = $nodeB->nextSibling;
514 if ( $nodeB && !$isIndentPreSafe && !DOMUtils::atTheTop( $nodeB ) ) {
[all …]
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-v0.3.1/src/
H A DconcatenatedGraph.c80 Node *twinB = getTwinNode(nodeB); in concatenateNodes()
103 getNodeLength(nodeB)); in concatenateNodes()
127 appendDescriptors(nodeA, nodeB); in concatenateNodes()
141 (nodeB, cat)); in concatenateNodes()
144 destroyNode(nodeB, graph); in concatenateNodes()
152 Node * nodeB = nodeA; in concatenateStringOfNodes() local
160 while (simpleArcCount(nodeB) == 1 in concatenateStringOfNodes()
165 && getDestination(getArc(nodeB)) != getTwinNode(nodeB) in concatenateStringOfNodes()
168 nodeB = getDestination(getArc(nodeB)); in concatenateStringOfNodes()
170 twinB = getTwinNode(nodeB); in concatenateStringOfNodes()
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/yggdrasil-network/yggdrasil-go/src/core/
H A Dcore_test.go48 nodeB = new(Core)
57 err = nodeB.CallPeer(u, "")
71 return nodeA, nodeB
127 defer nodeB.Stop()
132 if !WaitConnected(nodeA, nodeB) {
140 copy(msg[8:24], nodeB.Address())
147 _, _, err = nodeB.ReadFrom(buf)
164 if !WaitConnected(nodeA, nodeB) {
172 copy(msg[8:24], nodeB.Address())
182 _, err := nodeB.WriteTo(msg, addr)
[all …]
/dports/editors/hnb/hnb-1.9.18/src/
H A Dtree_sort.c69 return nodeB; in merge()
70 if (!nodeB) in merge()
79 thead = nodeB; in merge()
80 nodeB = nodeB->down; in merge()
94 tnode->down = nodeB; in merge()
95 nodeB->up = tnode; in merge()
96 tnode = nodeB; in merge()
97 nodeB = nodeB->down; in merge()
105 } else if (nodeB) { in merge()
106 tnode->down = nodeB; in merge()
[all …]
H A Dtree.c390 if (nodeB == nodeA) in node_swap()
393 if (nodeB->right == nodeA || nodeA->right == nodeB) { in node_swap()
400 nodeA = nodeB; in node_swap()
401 nodeB = tnode; in node_swap()
415 Aup->down = nodeB; in node_swap()
416 nodeB->up = Aup; in node_swap()
420 nodeA->up = nodeB; in node_swap()
429 Aup->down = nodeB; in node_swap()
430 nodeB->up = Aup; in node_swap()
432 Adown->up = nodeB; in node_swap()
[all …]
/dports/www/mediawiki135/mediawiki-1.35.5/vendor/wikimedia/parsoid/src/Html2Wt/
H A DDOMDiff.php98 * @param DOMElement $nodeB
103 $this->domB = $nodeB->ownerDocument;
125 * @param DOMNode $nodeB
146 * @param DOMNode $nodeB
211 DOMUtils::assertElt( $nodeB ) && DOMCompat::getOuterHTML( $nodeB )
236 $nodeB,
257 * @param DOMNode $nodeB
268 Assert::invariant( $nodeB->nodeValue === (string)$nodeB->nodeValue, '' );
280 $nodeB,
549 * @param DOMNode $nodeB
[all …]
H A DSeparators.php121 * @param DOMNode $nodeB
145 $nodeB->nodeName,
162 $nodeB->nodeName,
364 * @param DOMNode $nodeB
421 'nodeB' => $nodeB,
450 $origNodeB = $nodeB;
491 if ( $nodeB && WTSUtils::precedingSpaceSuppressesIndentPre( $nodeB, $origNodeB ) ) {
500 while ( $nodeB &&
503 $nodeB = $nodeB->nextSibling;
522 if ( $nodeB && !DOMUtils::atTheTop( $nodeB ) ) {
[all …]
/dports/net/cjdns/cjdns-cjdns-v21.1/test/
H A DBeacon_test.c49 struct TestFramework* nodeB; member
178 out->nodeB = b; in start()
220 } else if (from == tn->nodeB) { in sendMessage()
231 } else if (to == tn->nodeB) { in sendMessage()
247 sendMessage(tn, "send", tn->nodeA, tn->nodeB); in runTest()
248 sendMessage(tn, "a", tn->nodeB, tn->nodeA); in runTest()
249 sendMessage(tn, "few", tn->nodeA, tn->nodeB); in runTest()
251 sendMessage(tn, "to", tn->nodeA, tn->nodeB); in runTest()
252 sendMessage(tn, "make", tn->nodeB, tn->nodeA); in runTest()
254 sendMessage(tn, "the", tn->nodeB, tn->nodeA); in runTest()
[all …]
/dports/www/h2o-devel/h2o-dcc7134/t/00unit/lib/http2/
H A Dscheduler.c86 node_t nodeB = {{{NULL}}, "B", 1, 0}; in test_round_robin() local
126 nodeB.still_is_active = 0; in test_round_robin()
143 h2o_http2_scheduler_close(&nodeB.ref); in test_round_robin()
151 node_t nodeB = {{{NULL}}, "B", 1, 0}; in test_priority() local
176 nodeB.still_is_active = 0; in test_priority()
183 h2o_http2_scheduler_close(&nodeB.ref); in test_priority()
192 node_t nodeB = {{{NULL}}, "B", 1, 0}; in test_dependency() local
228 nodeB.still_is_active = 0; in test_dependency()
237 nodeB.still_is_active = 1; in test_dependency()
253 node_t nodeB = {{{NULL}}, "B", 1, 0}; in test_exclusive() local
[all …]
/dports/audio/gonic/gonic-0.8.4/vendor/github.com/josephburnett/jd/lib/
H A Dcommon_test.go23 nodeB, err := unmarshal([]byte(b))
27 if !nodeA.Equals(nodeB, ctx.metadata...) {
30 if !nodeB.Equals(nodeA, ctx.metadata...) {
36 if !nodeB.Equals(nodeB, ctx.metadata...) {
46 nodeB, err := unmarshal([]byte(b))
50 if nodeA.Equals(nodeB, ctx.metadata...) {
53 if nodeB.Equals(nodeA, ctx.metadata...) {
63 nodeB, err := unmarshal([]byte(b))
68 hashB := nodeB.hashCode(ctx.metadata)
84 nodeB, err := ReadJsonString(b)
[all …]
/dports/net/yggdrasil/yggdrasil-go-0.3.11/src/yggdrasil/
H A Dcore_test.go47 nodeB = new(Core)
53 err = nodeB.AddPeer("tcp://"+nodeA.link.tcp.getAddr().String(), "")
61 if l := len(nodeB.GetPeers()); l != 1 {
65 return nodeA, nodeB
69 func WaitConnected(nodeA, nodeB *Core) bool {
129 nodeA, nodeB := CreateAndConnectTwo(t, true)
134 if !WaitConnected(nodeA, nodeB) {
139 dialer, err := nodeB.ConnDialer()
167 nodeA, nodeB := CreateAndConnectTwo(b, false)
172 if !WaitConnected(nodeA, nodeB) {
[all …]
/dports/x11-toolkits/open-motif/motif-2.3.8/lib/Xm/
H A DTraversalI.c1804 (nodeB->any.rect.x + nodeB->any.rect.width)) in CompareNodesHorizRT()
1806 (nodeB->any.rect.x + nodeB->any.rect.width)) ? -1 : 1; in CompareNodesHorizRT()
1832 (nodeB->any.rect.y + nodeB->any.rect.height)) in CompareNodesHorizLB()
1854 (nodeB->any.rect.x + nodeB->any.rect.width)) in CompareNodesHorizRB()
1856 (nodeB->any.rect.x + nodeB->any.rect.width)) ? -1 : 1; in CompareNodesHorizRB()
1859 (nodeB->any.rect.y + nodeB->any.rect.height)) in CompareNodesHorizRB()
1927 (nodeB->any.rect.x + nodeB->any.rect.width)) in CompareNodesVertRT()
1929 (nodeB->any.rect.x + nodeB->any.rect.width)) ? -1 : 1; in CompareNodesVertRT()
1949 (nodeB->any.rect.y + nodeB->any.rect.height)) in CompareNodesVertLB()
1974 (nodeB->any.rect.y + nodeB->any.rect.height)) in CompareNodesVertRB()
[all …]
/dports/biology/velvet/velvet_1.2.10/src/
H A DconcatenatedGraph.c87 Node * nodeB = nodeA; in concatenateStringOfNodes() local
94 while (simpleArcCount(nodeB) == 1 in concatenateStringOfNodes()
97 (getDestination(getArc(nodeB)))) == in concatenateStringOfNodes()
99 && getDestination(getArc(nodeB)) != getTwinNode(nodeB) in concatenateStringOfNodes()
100 && getDestination(getArc(nodeB)) != nodeA) { in concatenateStringOfNodes()
101 totalLength += getNodeLength(nodeB); in concatenateStringOfNodes()
102 nodeB = getDestination(getArc(nodeB)); in concatenateStringOfNodes()
104 twinB = getTwinNode(nodeB); in concatenateStringOfNodes()
105 totalLength += getNodeLength(nodeB); in concatenateStringOfNodes()
109 while (currentNode != nodeB) { in concatenateStringOfNodes()
[all …]
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-1.2.01/Velvet-1.1.06/
H A DconcatenatedGraph.c87 Node * nodeB = nodeA; in concatenateStringOfNodes() local
94 while (simpleArcCount(nodeB) == 1 in concatenateStringOfNodes()
97 (getDestination(getArc(nodeB)))) == in concatenateStringOfNodes()
99 && getDestination(getArc(nodeB)) != getTwinNode(nodeB) in concatenateStringOfNodes()
100 && getDestination(getArc(nodeB)) != nodeA) { in concatenateStringOfNodes()
101 totalLength += getNodeLength(nodeB); in concatenateStringOfNodes()
102 nodeB = getDestination(getArc(nodeB)); in concatenateStringOfNodes()
104 twinB = getTwinNode(nodeB); in concatenateStringOfNodes()
105 totalLength += getNodeLength(nodeB); in concatenateStringOfNodes()
109 while (currentNode != nodeB) { in concatenateStringOfNodes()
[all …]
/dports/math/rocs/rocs-21.12.3/libgraphtheory/autotests/
H A Dtest_graphoperations.cpp33 NodePtr nodeA, nodeB; in testDocumentCreateDelete() local
43 nodeB = Node::create(document); in testDocumentCreateDelete()
44 edge = Edge::create(nodeA, nodeB); in testDocumentCreateDelete()
49 nodeB.reset(); in testDocumentCreateDelete()
59 NodePtr nodeA, nodeB; in testNodeCreateDelete() local
69 nodeB = Node::create(document); in testNodeCreateDelete()
70 edge = Edge::create(nodeA, nodeB); in testNodeCreateDelete()
85 NodePtr nodeA, nodeB; in testEdgeCreateDelete() local
95 nodeB = Node::create(document); in testEdgeCreateDelete()
96 edge = Edge::create(nodeA, nodeB); in testEdgeCreateDelete()
[all …]
H A Dtest_kernel.cpp34 NodePtr nodeA, nodeB; in engineSetup() local
44 nodeB = Node::create(document); in engineSetup()
45 edge = Edge::create(nodeA, nodeB); in engineSetup()
56 nodeB.reset(); in engineSetup()
67 NodePtr nodeB = Node::create(document); in graphObjectAccess() local
68 EdgePtr edge = Edge::create(nodeA, nodeB); in graphObjectAccess()
93 NodePtr nodeB = Node::create(document); in graphObjectAccessWithTypes() local
143 NodePtr nodeB = Node::create(document); in edgeAccessMethods() local
172 NodePtr nodeB = Node::create(document); in edgeAccessMethodsWithTypes() local
278 NodePtr nodeB = Node::create(document); in edgeProperties() local
[all …]
/dports/www/grafana8/grafana-8.3.6/public/app/core/utils/
H A Ddag.test.ts7 const nodeB = dag.createNode('B'); constant
15 dag.link([nodeB, nodeC, nodeD, nodeE, nodeF, nodeG, nodeH], nodeA);
16 dag.link([nodeC, nodeD, nodeE, nodeF, nodeI], nodeB);
27 expect(nodeB.inputEdges).toHaveLength(5);
28 expect(nodeB.outputEdges).toHaveLength(1);
29 expect(nodeB.edges).toHaveLength(6);
59 expect(nodeA.getEdgeFrom(nodeB)).not.toBeUndefined();
60 expect(nodeB.getEdgeTo(nodeA)).not.toBeUndefined();
66 expect(actual).toEqual(expect.arrayContaining([nodeB, nodeH]));
70 const actual = nodeB.getOptimizedInputEdges().map((e) => e.inputNode);

12345678910>>...14