Home
last modified time | relevance | path

Searched refs:newNodes (Results 1 – 25 of 450) sorted by relevance

12345678910>>...18

/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq.Expressions/src/System/Dynamic/Utils/
H A DExpressionVisitorUtils.cs13 Expression[] newNodes = null; in VisitBlockExpressions()
19 if (newNodes != null) in VisitBlockExpressions()
21 newNodes[i] = node; in VisitBlockExpressions()
30 newNodes[i] = node; in VisitBlockExpressions()
33 return newNodes; in VisitBlockExpressions()
44 if (newNodes != null) in VisitParameters()
46 newNodes[i] = node; in VisitParameters()
55 newNodes[i] = node; in VisitParameters()
58 return newNodes; in VisitParameters()
69 if (newNodes != null) in VisitArguments()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.Core/Microsoft/Scripting/Ast/
H A DExpressionVisitor.cs73 if (newNodes != null) { in Visit()
74 newNodes[i] = node; in Visit()
80 newNodes[i] = node; in Visit()
83 if (newNodes == null) { in Visit()
95 if (newNodes != null) { in VisitArguments()
96 newNodes[i] = node; in VisitArguments()
105 return newNodes; in VisitArguments()
118 T[] newNodes = null; in Visit()
131 if (newNodes == null) { in Visit()
167 T[] newNodes = null;
[all …]
/dports/devel/hadoop/hadoop-1.2.1/src/hdfs/org/apache/hadoop/hdfs/server/namenode/
H A DHost2NodesMap.java65 DatanodeDescriptor[] newNodes; in add() local
67 newNodes = new DatanodeDescriptor[1]; in add()
68 newNodes[0]=node; in add()
70 newNodes = new DatanodeDescriptor[nodes.length+1]; in add()
71 System.arraycopy(nodes, 0, newNodes, 0, nodes.length); in add()
72 newNodes[nodes.length] = node; in add()
74 map.put(host, newNodes); in add()
115 DatanodeDescriptor[] newNodes; in remove() local
116 newNodes = new DatanodeDescriptor[nodes.length-1]; in remove()
117 System.arraycopy(nodes, 0, newNodes, 0, i); in remove()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq.Expressions/src/System/Linq/Expressions/
H A DExpressionVisitor.cs50 if (newNodes != null) in Visit()
52 newNodes[i] = node; in Visit()
61 newNodes[i] = node; in Visit()
64 if (newNodes == null) in Visit()
94 T[] newNodes = null; in Visit()
98 if (newNodes != null) in Visit()
100 newNodes[i] = node; in Visit()
112 if (newNodes == null) in Visit()
154 T[] newNodes = null;
163 if (newNodes != null)
[all …]
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-hdfs-project/hadoop-hdfs/src/main/java/org/apache/hadoop/hdfs/server/blockmanagement/
H A DHost2NodesMap.java78 DatanodeDescriptor[] newNodes; in add() local
80 newNodes = new DatanodeDescriptor[1]; in add()
81 newNodes[0]=node; in add()
83 newNodes = new DatanodeDescriptor[nodes.length+1]; in add()
84 System.arraycopy(nodes, 0, newNodes, 0, nodes.length); in add()
85 newNodes[nodes.length] = node; in add()
87 map.put(ipAddr, newNodes); in add()
131 DatanodeDescriptor[] newNodes; in remove() local
132 newNodes = new DatanodeDescriptor[nodes.length-1]; in remove()
133 System.arraycopy(nodes, 0, newNodes, 0, i); in remove()
[all …]
/dports/net/storj/storj-1.45.3/satellite/nodeselection/uploadselection/
H A Dstate.go56 func NewState(reputableNodes, newNodes []*Node) *State {
63 for _, node := range newNodes {
68 state.nonDistinct.New = SelectByID(newNodes)
71 state.distinct.New = SelectBySubnetFromNodes(newNodes)
106 var newNodes Selector
124 newNodes = state.distinct.New
127 newNodes = state.nonDistinct.New
133 newNodes.Select(newCount, criteria)...)
H A Dstate_test.go27 newNodes := joinNodes(
32 state := uploadselection.NewState(reputableNodes, newNodes)
88 require.Len(t, intersectLists(selected, newNodes), selectCount*newFraction)
103 require.Len(t, intersectLists(selected, newNodes), selectCount*newFraction)
118 require.Len(t, intersectLists(selected, newNodes), 5)
130 newNodes := joinNodes(
135 state := uploadselection.NewState(reputableNodes, newNodes)
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/bundles/org.eclipse.core.resources/src/org/eclipse/core/internal/dtree/
H A DAbstractDataTreeNode.java85 if (newNodes.length == 0) in assembleWith()
97 while (oldIndex < oldNodes.length && newIndex < newNodes.length) { in assembleWith()
105 String key = newNodes[newIndex].name; in assembleWith()
133 AbstractDataTreeNode node = newNodes[newIndex++]; in assembleWith()
140 int compare = oldNodes[oldIndex].name.compareTo(newNodes[newIndex].name); in assembleWith()
149 AbstractDataTreeNode node = newNodes[newIndex++]; in assembleWith()
159 while (newIndex < newNodes.length) { in assembleWith()
160 AbstractDataTreeNode resultNode = newNodes[newIndex++]; in assembleWith()
286 int newLen = newNodes.length; in compareWith()
294 DataTreeNode newNode = (DataTreeNode) newNodes[newIndex]; in compareWith()
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/meshgen2d/src/include/
H A DElement.h38 void upgrade(std::vector<Node *> &newNodes) in upgrade() argument
40 Node **n = new Node*[sz+newNodes.size()]; in upgrade()
45 for (i = 0; i < newNodes.size(); i++) in upgrade()
46 n[sz+i] = newNodes[i]; in upgrade()
51 sz += newNodes.size(); in upgrade()
/dports/cad/openroad/OpenROAD-2.0/src/mpl/src/ParquetFP/src/
H A DClusterDB.cxx175 Nodes* newNodes = _newDB->getNodes(); in cluster1Layer() local
354 newNodes->putNewNode(tempNode); in cluster1Layer()
384 newNodes->putNewNode(tempNode); in cluster1Layer()
390 newNodes->putNewTerm(*node); in cluster1Layer()
525 Nodes* newNodes = _newDB->getNodes(); in addWSPerNode() local
526 for (itNode node = newNodes->nodesBegin(); node != newNodes->nodesEnd(); in addWSPerNode()
630 newNodes->updatePinsInfo(*newNets); in addNetsToNewDB()
661 Nodes* newNodes = _newDB->getNodes(); in clusterMultiPhysical() local
739 newNodes->putNewNode(tempNode); in clusterMultiPhysical()
760 newNodes->putNewNode(tempNode); in clusterMultiPhysical()
[all …]
/dports/cad/digital/Digital-0.27/src/main/java/de/neemann/digital/hdl/model2/optimizations/
H A DReplaceOneToMany.java22 ArrayList<HDLNodeAssignment> newNodes = new ArrayList<>(); in optimize() local
29 replace((HDLNodeSplitterOneToMany) n, newNodes); in optimize()
33 circuit.getNodes().addAll(newNodes); in optimize()
36 …private void replace(HDLNodeSplitterOneToMany n, ArrayList<HDLNodeAssignment> newNodes) throws HDL… in replace() argument
51 newNodes.add(node); in replace()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/xml/
H A DXPathPath.cpp64 NodeSet newNodes; in evaluate() local
75 newNodes.append(node); in evaluate()
77 nodes.swap(newNodes); in evaluate()
118 NodeSet newNodes; in evaluate() local
129 newNodes.markSubtreesDisjoint(true); in evaluate()
141 newNodes.append(node); in evaluate()
145 nodes.swap(newNodes); in evaluate()
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.debug/org.eclipse.debug.ui/ui/org/eclipse/debug/internal/ui/viewers/
H A DModelNode.java134 ModelNode[] newNodes= new ModelNode[fChildren.length - 1]; in removeChild() local
135 System.arraycopy(fChildren, 0, newNodes, 0, i); in removeChild()
136 if (i < newNodes.length) { in removeChild()
137 System.arraycopy(fChildren, i + 1, newNodes, i, newNodes.length - i); in removeChild()
139 fChildren = newNodes; in removeChild()
/dports/www/matomo/piwik/vendor/wikimedia/less.php/lib/Less/
H A DVisitorReplacing.php37 $newNodes = array();
42 self::flatten( $evald, $newNodes );
44 $newNodes[] = $evald;
48 return $newNodes;
/dports/www/mediawiki136/mediawiki-1.36.3/vendor/wikimedia/less.php/lib/Less/
H A DVisitorReplacing.php37 $newNodes = array();
42 self::flatten( $evald, $newNodes );
44 $newNodes[] = $evald;
48 return $newNodes;
/dports/www/mediawiki135/mediawiki-1.35.5/vendor/wikimedia/less.php/lib/Less/
H A DVisitorReplacing.php37 $newNodes = array();
42 self::flatten( $evald, $newNodes );
44 $newNodes[] = $evald;
48 return $newNodes;
/dports/www/mediawiki137/mediawiki-1.37.1/vendor/wikimedia/less.php/lib/Less/
H A DVisitorReplacing.php37 $newNodes = array();
42 self::flatten( $evald, $newNodes );
44 $newNodes[] = $evald;
48 return $newNodes;
/dports/net-mgmt/icingaweb2-module-businessprocess/icingaweb2-module-businessprocess-2.2.0/library/Businessprocess/Modification/
H A DNodeMoveAction.php163 $newNodes = $config->getBpNode($this->newParent)->getChildren();
165 $newNodes = $config->getRootNodes();
168 $newNodes = array_merge(
169 array_slice($newNodes, 0, $this->to, true),
171 array_slice($newNodes, $this->to, null, true)
175 $config->getBpNode($this->newParent)->setChildNames(array_keys($newNodes));
180 foreach ($newNodes as $newName => $newNode) {
/dports/www/kf5-kjs/kjs-5.89.0/src/kjs/
H A Dnodes.cpp77 if (!newNodes) { in Node()
80 newNodes->add(this); in Node()
93 if (newNodes) { in ref()
102 ASSERT(!newNodes || !newNodes->contains(this)); in ref()
112 ASSERT(!newNodes || !newNodes->contains(this)); in deref()
129 if (newNodes && newNodes->contains(this)) { in refcount()
134 ASSERT(!newNodes || !newNodes->contains(this)); in refcount()
145 if (!newNodes) { in clearNewNodes()
155 deleteAllValues(*newNodes); in clearNewNodes()
156 delete newNodes; in clearNewNodes()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llgo/third_party/gotools/go/pointer/
H A Dopt.go37 newNodes := make([]*node, N, N)
43 newNodes[j] = a.nodes[i]
58 newNodes[j] = a.nodes[i]
74 newNodes[j] = a.nodes[i]
124 a.nodes = newNodes
/dports/graphics/krita/krita-4.4.8/libs/ui/tests/
H A DKisDocumentReplaceTest.cpp56 QList<KisNodeSP> oldNodes, newNodes; in testCopyFromDocument() local
58 …Utils::recursiveApplyNodes(anotherDoc->image()->root(), [&newNodes](KisNodeSP node) { newNodes << … in testCopyFromDocument()
59 QCOMPARE(oldNodes.size(), newNodes.size()); in testCopyFromDocument()
/dports/net/evans/evans-0.9.1/vendor/golang.org/x/tools/go/pointer/
H A Dopt.go37 newNodes := make([]*node, N)
43 newNodes[j] = a.nodes[i]
58 newNodes[j] = a.nodes[i]
74 newNodes[j] = a.nodes[i]
131 a.nodes = newNodes
/dports/www/bugzilla2atom/bugzilla2atom-56126912bf314a80744827758d582e5e60e7178c/vendor/golang.org/x/tools/go/pointer/
H A Dopt.go37 newNodes := make([]*node, N, N)
43 newNodes[j] = a.nodes[i]
58 newNodes[j] = a.nodes[i]
74 newNodes[j] = a.nodes[i]
131 a.nodes = newNodes
/dports/security/vault/vault-1.8.2/vendor/golang.org/x/tools/go/pointer/
H A Dopt.go37 newNodes := make([]*node, N)
43 newNodes[j] = a.nodes[i]
58 newNodes[j] = a.nodes[i]
74 newNodes[j] = a.nodes[i]
131 a.nodes = newNodes
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/golang.org/x/tools/go/pointer/
H A Dopt.go37 newNodes := make([]*node, N)
43 newNodes[j] = a.nodes[i]
58 newNodes[j] = a.nodes[i]
74 newNodes[j] = a.nodes[i]
131 a.nodes = newNodes

12345678910>>...18