/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 D | AbstractDataTreeNode.java | 86 return oldNodes; in assembleWith() 97 while (oldIndex < oldNodes.length && newIndex < newNodes.length) { in assembleWith() 108 int right = oldNodes.length - 1; in assembleWith() 112 int compare = key.compareTo(oldNodes[mid].name); in assembleWith() 125 System.arraycopy(oldNodes, oldIndex, resultNodes, resultIndex, toCopy); in assembleWith() 147 resultNodes[resultIndex++] = oldNodes[oldIndex++]; in assembleWith() 156 while (oldIndex < oldNodes.length) { in assembleWith() 157 resultNodes[resultIndex++] = oldNodes[oldIndex++]; in assembleWith() 285 int oldLen = oldNodes.length; in compareWith() 293 DataTreeNode oldNode = (DataTreeNode) oldNodes[oldIndex]; in compareWith() [all …]
|
H A D | DataTreeNode.java | 201 …protected static AbstractDataTreeNode[] forwardDeltaWith(AbstractDataTreeNode[] oldNodes, Abstract… in forwardDeltaWith() argument 202 if (oldNodes.length == 0 && newNodes.length == 0) { in forwardDeltaWith() 213 while (oldIndex < oldNodes.length && newIndex < newNodes.length) { in forwardDeltaWith() 214 String oldName = oldNodes[oldIndex].name; in forwardDeltaWith() 218 …AbstractDataTreeNode deltaNode = forwardDeltaWithOrNullIfEqual(oldNodes[oldIndex++], newNodes[newI… in forwardDeltaWith() 247 while (oldIndex < oldNodes.length) { in forwardDeltaWith() 254 childDeltas[numChildDeltas++] = new DeletedNode(oldNodes[oldIndex++].name); in forwardDeltaWith()
|
/dports/graphics/krita/krita-4.4.8/libs/ui/tests/ |
H A D | KisDocumentReplaceTest.cpp | 56 QList<KisNodeSP> oldNodes, newNodes; in testCopyFromDocument() local 57 …rUtils::recursiveApplyNodes(clonedDoc->image()->root(), [&oldNodes](KisNodeSP node) { oldNodes << … in testCopyFromDocument() 59 QCOMPARE(oldNodes.size(), newNodes.size()); in testCopyFromDocument()
|
/dports/math/ogdf/OGDF/src/ogdf/energybased/multilevel_mixer/ |
H A D | CirclePlacer.cpp | 67 std::map<node, bool> oldNodes; in placeOneLevel() local 72 oldNodes[v] = true; in placeOneLevel() 93 || (m_nodeSelection == NodeSelection::New && oldNodes[v]) in placeOneLevel() 94 || (m_nodeSelection == NodeSelection::Old && !oldNodes[v])) in placeOneLevel()
|
/dports/deskutils/treeline/TreeLine/source/ |
H A D | undo.py | 216 oldNodes = set() 221 oldNodes = oldNodes | (origChildren - children) 225 for oldNode in oldNodes: 284 oldNodes = set() 289 oldNodes = oldNodes | (origChildren - children) 297 for oldNode in oldNodes:
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.debug/org.eclipse.debug.ui/ui/org/eclipse/debug/internal/ui/viewers/model/provisional/ |
H A D | ModelDelta.java | 190 ModelDelta[] oldNodes = (ModelDelta[])oldValue; in mapNode() local 191 ModelDelta[] newNodes = new ModelDelta[oldNodes.length + 1]; in mapNode() 192 System.arraycopy(oldNodes, 0, newNodes, 0, oldNodes.length); in mapNode()
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dsc/ |
H A D | dsc.c | 317 Dsc_node_t *oldNodes[DSC_MAX_VAR]; in Dsc_Decompose() local 390 nj = oldNodes[j]; in Dsc_Decompose() 401 oldNodes[j] = oldNodes[--o]; in Dsc_Decompose() 410 oldNodes[o++] = ni; in Dsc_Decompose() 416 Dsc_node_t * solution = oldNodes[0]; in Dsc_Decompose()
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 610 List<Node> oldNodes = this.nodes; in writeObject() local 612 if (oldNodes != null) { in writeObject() 614 this.nodes = new Vector<>(oldNodes); in writeObject() 621 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 616 List oldNodes = this.nodes; in writeObject() local 618 if (oldNodes != null) { in writeObject() 619 this.nodes = new Vector(oldNodes); in writeObject() 626 this.nodes = oldNodes; in writeObject()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | NamedNodeMapImpl.java | 616 List oldNodes = this.nodes; in writeObject() local 618 if (oldNodes != null) { in writeObject() 619 this.nodes = new Vector(oldNodes); in writeObject() 626 this.nodes = oldNodes; in writeObject()
|
/dports/misc/usd/USD-21.11/pxr/usd/pcp/ |
H A D | primIndex_Graph.cpp | 356 _NodePool& oldNodes = _data->nodes; in _ApplyNodeIndexMapping() local 359 TF_VERIFY(oldNodes.size() == oldSitePaths.size() && in _ApplyNodeIndexMapping() 360 oldNodes.size() == oldHasSpecs.size()); in _ApplyNodeIndexMapping() 361 TF_VERIFY(nodeIndexMap.size() == oldNodes.size()); in _ApplyNodeIndexMapping() 367 const size_t oldNumNodes = oldNodes.size(); in _ApplyNodeIndexMapping() 451 _Node& oldNode = oldNodes[oldNodeIndex]; in _ApplyNodeIndexMapping()
|
/dports/devel/upp/upp/uppsrc/plugin/box2d/ |
H A D | b2DynamicTree.cpp | 60 b2DynamicTreeNode* oldNodes = m_nodes; in AllocateNode() local 63 memcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2DynamicTreeNode)); in AllocateNode() 64 b2Free(oldNodes); in AllocateNode()
|
/dports/devel/hadoop/hadoop-1.2.1/src/test/org/apache/hadoop/hdfs/server/datanode/ |
H A D | TestBlockReplacement.java | 116 DatanodeInfo[] oldNodes = block.getLocations(); in testBlockReplacement() local 117 assertEquals(oldNodes.length, 3); in testBlockReplacement() 130 for(DatanodeInfo oldNode:oldNodes) { in testBlockReplacement()
|
/dports/net/rclone-browser/RcloneBrowser-1.8.0/src/ |
H A D | item_model.cpp | 561 QVector<QPair<Item *, int>> oldNodes; in sort() local 562 oldNodes.reserve(oldList.count()); in sort() 564 oldNodes.append(qMakePair(get(index), index.column())); in sort() 571 newList.reserve(oldNodes.size()); in sort() 572 for (const auto &node : oldNodes) { in sort()
|
/dports/games/kolf/kolf-21.12.3/external/Box2D/Collision/ |
H A D | b2DynamicTree.cpp | 61 b2DynamicTreeNode* oldNodes = m_nodes; in AllocateNode() local 64 memcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2DynamicTreeNode)); in AllocateNode() 65 b2Free(oldNodes); in AllocateNode()
|
/dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/ |
H A D | AnimatedCycle.cpp | 697 QList<AnimatedCycleNode *> oldNodes; in replaceInbetweenEdge() local 700 oldNodes << oldNode; in replaceInbetweenEdge() 704 int n = oldNodes.size(); in replaceInbetweenEdge() 729 newNodesBefore[i]->setBefore(oldNodes[i]->before()); in replaceInbetweenEdge() 740 newNodesAfter[i]->setAfter(oldNodes[i]->after()); in replaceInbetweenEdge() 746 AnimatedCycleNode * nse = oldNodes[i]; in replaceInbetweenEdge() 773 delete oldNodes[i]; in replaceInbetweenEdge()
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/bundles/org.eclipse.jface.databinding/src/org/eclipse/jface/internal/databinding/viewers/ |
H A D | ObservableCollectionTreeContentProvider.java | 133 TreeNode[] oldNodes = new ObservableCollectionTreeContentProvider.TreeNode[elementNodes.size()]; in inputChanged() local 134 elementNodes.values().toArray(oldNodes); in inputChanged() 135 for (TreeNode oldNode : oldNodes) in inputChanged()
|
/dports/science/v_sim/v_sim-3.8.0/src/extensions/ |
H A D | infos.c | 132 static void onPopulationDecrease(VisuNodeArrayRenderer *renderer, GArray *oldNodes, gpointer user_d… 631 static void onPopulationDecrease(VisuNodeArrayRenderer *renderer _U_, GArray *oldNodes, gpointer us… in onPopulationDecrease() argument 643 for (i = 0; i < oldNodes->len; i++) in onPopulationDecrease() 644 g_array_remove_index_fast(infos->priv->nodes, g_array_index(oldNodes, guint, i)); in onPopulationDecrease()
|