Home
last modified time | relevance | path

Searched refs:nodeTo (Results 1 – 20 of 20) sorted by relevance

/dports/editors/ted/Ted-2.23/docEdit/
H A DdocEditCopyProperties.c118 BufferItem * nodeTo, in docCopyNodeProperties() argument
121 switch( nodeTo->biLevel ) in docCopyNodeProperties()
129 { LDEB(nodeTo->biLevel); return -1; } in docCopyNodeProperties()
133 if ( docIsRowNode( nodeTo->biParent ) ) in docCopyNodeProperties()
147 nodeTo, cpFrom ) ) in docCopyNodeProperties()
148 { LDEB(nodeTo->biLevel); return -1; } in docCopyNodeProperties()
153 if ( docIsRowNode( nodeTo ) ) in docCopyNodeProperties()
157 if ( docEditChangeRowProperties( setProps, dsTo, nodeTo, in docCopyNodeProperties()
159 { LDEB(nodeTo->biLevel); return -1; } in docCopyNodeProperties()
168 nodeTo, setProps->sp_spSetMask, in docCopyNodeProperties()
[all …]
H A DdocEditParagraph.c496 BufferItem * nodeTo= dpTo.dpNode; in docParaInsertTail() local
588 const TextParticule * const tpTo= nodeTo->biParaParticules+ partTo; in docParaInsertTail()
594 if ( partTo < nodeTo->biParaParticuleCount && in docParaInsertTail()
608 if ( docCopyParticules( dcj, nodeTo, nodeFrom, partTo, partFrom, in docParaInsertTail()
/dports/java/jgraph/jgraph-java-5.13.0.4/src/org/jgraph/util/
H A DParallelEdgeRouter.java65 CellView nodeTo = edge.getTarget(); in routeEdge() local
70 if (null == nodeTo) { in routeEdge()
71 nodeTo = edge.getTargetParentView(); in routeEdge()
73 if ((null == nodeFrom) || (null == nodeTo)) { in routeEdge()
78 if (nodeFrom == nodeTo) { in routeEdge()
95 Object[] edges = getParallelEdges(cache, edge, nodeFrom, nodeTo); in routeEdge()
127 .getCenterPoint(nodeTo); in routeEdge()
129 perimeterPoint = AbstractCellView.getCenterPoint(nodeTo); in routeEdge()
141 AbstractCellView.getCenterPoint(nodeTo)); in routeEdge()
146 to = nodeTo.getPerimeterPoint(edge, AbstractCellView.getCenterPoint(nodeTo), from); in routeEdge()
[all …]
/dports/audio/praat/praat-6.2.03/gram/
H A DNetwork.cpp203 NetworkNode nodeTo = & my nodes [connection -> nodeTo]; in Network_spreadActivities() local
206 nodeFrom -> excitation += my spreadingRate * nodeTo -> activity * in Network_spreadActivities()
208 if (! nodeTo -> clamped) in Network_spreadActivities()
270 NetworkNode nodeTo = & my nodes [connection -> nodeTo]; in Network_updateWeights() local
272 (nodeFrom -> activity * nodeTo -> activity - in Network_updateWeights()
329 conn -> nodeTo = conn -> nodeFrom + 1; in Network_create_rectangle()
338 conn -> nodeTo = conn -> nodeFrom + numberOfColumns; in Network_create_rectangle()
380 conn -> nodeTo = irow * numberOfColumns + jcol; in Network_create_rectangle_vertical()
408 NetworkNode nodeTo = & my nodes [conn -> nodeTo]; in Network_draw() local
411 Graphics_line (graphics, nodeFrom -> x, nodeFrom -> y, nodeTo -> x, nodeTo -> y); in Network_draw()
[all …]
H A DNetwork_def.h40 oo_INTEGER (nodeTo)
/dports/editors/ted/Ted-2.23/ind/
H A Dindnode.c425 TrieNode * nodeTo= NODE(ind,tnTo); in indINDaddSuffix() local
432 if ( nodeTo->tn_flags & TNfREAD_ONLY ) in indINDaddSuffix()
433 { XXDEB(nodeTo->tn_flags,TNfREAD_ONLY); return -1; } in indINDaddSuffix()
435 { nodeTo->tn_flags |= TNfACCEPTS; } in indINDaddSuffix()
450 tlTo= indAddLinkToNode( ind, nodeTo, m, linkSuf->tl_key, tnSuf ); in indINDaddSuffix()
464 nodeTo= NODE(ind,tnTo); in indINDaddSuffix()
468 if ( nodeTo->tn_flags & TNfREAD_ONLY ) in indINDaddSuffix()
469 { XXDEB(nodeTo->tn_flags,TNfREAD_ONLY); return -1; } in indINDaddSuffix()
471 { nodeTo->tn_flags |= TNfACCEPTS; } in indINDaddSuffix()
/dports/devel/upp/upp/bazaar/Surface/
H A DSurface.cpp966 Vector<int> nodeFrom, nodeTo; in CutZ() local
1017 nFrom = nodeTo[i]; in CutZ()
1024 nodeTo << nTo; in CutZ()
1027 nodeTo.Insert(pos, nTo); in CutZ()
1082 Vector<int> nodeFrom, nodeTo; in CutX() local
1124 nFrom = nodeTo[i]; in CutX()
1131 nodeTo << nTo; in CutX()
1134 nodeTo.Insert(pos, nTo); in CutX()
1228 nFrom = nodeTo[i]; in CutY()
1235 nodeTo << nTo; in CutY()
[all …]
/dports/polish/kadu/kadu-4.3/kadu-core/misc/graph/
H A Dgraph.h68 auto nodeTo = addNode(to); in addEdge() local
70 nodeFrom->template addSuccessor<SuccessorTypeTag>(nodeTo); in addEdge()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/Difference/src/main/java/com/sun/hotspot/igv/difference/
H A DDifference.java207 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
211 if (nodeFrom == null || nodeTo == null) { in createDiff()
214 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
227 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
231 if (nodeFrom == null || nodeTo == null) { in createDiff()
234 …InputEdge newEdge = new InputEdge(fromIndex, toIndex, nodeFrom.getId(), nodeTo.getId(), e.getLabel… in createDiff()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java137 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
140 InputEdge newEdge = new InputEdge(index, nodeFrom.getId(), nodeTo.getId()); in createDiff()
152 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
155 InputEdge newEdge = new InputEdge(index, nodeFrom.getId(), nodeTo.getId()); in createDiff()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java137 InputNode nodeTo = inputNodeMap.get(a.getNode(to)); in createDiff() local
140 InputEdge newEdge = new InputEdge(index, nodeFrom.getId(), nodeTo.getId()); in createDiff()
152 InputNode nodeTo = inputNodeMap.get(b.getNode(to)); in createDiff() local
155 InputEdge newEdge = new InputEdge(index, nodeFrom.getId(), nodeTo.getId()); in createDiff()
/dports/biology/ugene/ugene-40.1/src/corelibs/U2View/src/ov_phyltree/
H A DGraphicsRectangularBranchItem.cpp210 PhyNode *nodeTo = phyBranch->node2; in swapSiblings() local
211 int branchCount = nodeTo->branchCount(); in swapSiblings()
213 nodeTo->swapBranches(0, 2); in swapSiblings()
/dports/science/v_sim/v_sim-3.8.0/src/
H A Dvisu_nodes.c1121 VisuNode *nodeFrom, *nodeTo; in visu_node_array_switchNumber() local
1129 nodeTo = _getFromId(&priv->nodeTable, to); in visu_node_array_switchNumber()
1130 _setAtId(&priv->nodeTable, from, nodeTo); in visu_node_array_switchNumber()
1133 nodeTo->number = from; in visu_node_array_switchNumber()