Lines Matching defs:to
16 * 2 along with this work; if not, write to the Free Software Foundation,
110 public LayoutNode to;
219 e.to.preds.remove(e);
244 // STEP 8: Write back to interface
269 Point p = new Point(e.to.x + e.relativeTo, e.to.y + e.to.yOffset + e.link.getTo().getRelativePosition().y);
271 if (e.to.inOffsets.containsKey(e.relativeTo)) {
272 points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosition().y));
276 LayoutNode other = e.to;
304 points.add(new Point(p1.x + e.to.x, p1.y + e.to.y));
357 LayoutNode cur = e.to;
374 cur = curEdge.to;
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) {
380 points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == null) ? 0 : curEdge.link.getTo().getRelativePosition().y)));
691 values[i] = e.to.x + e.relativeTo - e.relativeFrom;
706 values[i] = e.to.x + e.relativeTo - e.relativeFrom;
850 if (!visited.contains(e.to)) {
851 visited.add(e.to);
852 layers[i + 1].add(e.to);
981 int cur = e.to.x + e.relativeTo;
1052 int curXOffset = Math.abs(n.x - e.to.x);
1073 assert e.from.layer < e.to.layer;
1077 assert e.to != null;
1078 assert e.to == n;
1093 return e1.to.layer - e2.to.layer;
1105 assert e.from.layer < e.to.layer;
1106 if (e.from.layer != e.to.layer - 1) {
1107 if (maxLayerLength != -1 && e.to.layer - e.from.layer > maxLayerLength/* && e.to.preds.size() > 1 && e.from.succs.size() > 1*/) {
1109 e.to.preds.remove(e);
1120 topEdge.to = topNode;
1136 topEdge.to = topNode;
1148 if (hash.containsKey(e.to.layer)) {
1149 bottomNode = hash.get(e.to.layer);
1153 bottomNode.layer = e.to.layer - 1;
1157 hash.put(e.to.layer, bottomNode);
1162 bottomEdge.to = e.to;
1167 e.to.preds.add(bottomEdge);
1194 int maxLayer = list.get(0).to.layer;
1196 maxLayer = Math.max(maxLayer, curEdge.to.layer);
1213 edges[0].to = nodes[0];
1226 edges[j].to = nodes[j];
1231 assert curEdge.to.layer - n.layer - 2 >= 0;
1232 assert curEdge.to.layer - n.layer - 2 < cnt;
1233 LayoutNode anchor = nodes[curEdge.to.layer - n.layer - 2];
1260 if (e.to.layer > n.layer + 1) {
1262 for (int i = n.layer + 1; i < last.to.layer; i++) {
1280 result.to = e.to;
1283 e.to.preds.remove(e);
1284 e.to.preds.add(result);
1285 e.to = n;
1299 assert e.from.layer == e.to.layer - 1;
1341 LayoutNode s = se.to;
1397 LayoutNode p = pe.to;
1435 assert e.from.layer < e.to.layer;
1454 if (e.to == node) {
1621 // Repush immediately to know when no longer active
1628 if (active.contains(e.to)) {
1629 assert visited.contains(e.to);
1632 } else if (!visited.contains(e.to) && (linksToFollow.size() == 0 || linksToFollow.contains(e.link))) {
1633 stack.push(e.to);
1648 e.to = e.from;
1661 LayoutNode oldTo = e.to;
1666 e.to = oldFrom;
1684 LayoutNode s = e.to;
1693 assert e.to != n;
1694 if (!curVisited.contains(e.to)) {
1695 queue.add(e.to);
1696 curVisited.add(e.to);
1758 edge.to = vertexToLayoutNode.get(l.getTo().getVertex());
1764 edge.to.preds.add(edge);
1765 //assert edge.from != edge.to; // No self-loops allowed
1774 LayoutNode to = vertexToLayoutNode.get(l.getTo().getVertex());
1776 if (e.to == to) {
1799 assert e.to == node;