com.sun.hotspot.igv.layout.Link Java Examples

The following examples show how to use com.sun.hotspot.igv.layout.Link. You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example #1
Source File: ClusterNode.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #2
Source File: ClusterNode.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #3
Source File: ClusterNode.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #4
Source File: ClusterNode.java    From openjdk-jdk9 with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>(arr.size());
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #5
Source File: ClusterNode.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #6
Source File: ClusterNode.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #7
Source File: ClusterNode.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
public void setPosition(Point pos) {

        this.position = pos;
        for (Vertex n : subNodes) {
            Point cur = new Point(n.getPosition());
            cur.translate(pos.x + BORDER, pos.y + BORDER);
            n.setPosition(cur);
        }

        for (Link e : subEdges) {
            List<Point> arr = e.getControlPoints();
            ArrayList<Point> newArr = new ArrayList<Point>();
            for (Point p : arr) {
                if (p != null) {
                    Point p2 = new Point(p);
                    p2.translate(pos.x + BORDER, pos.y + BORDER);
                    newArr.add(p2);
                } else {
                    newArr.add(null);
                }
            }

            e.setControlPoints(newArr);
        }
    }
Example #8
Source File: OldHierarchicalLayoutManager.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
public NodeData(Link edge) {
    layer = -1;
    this.edge = edge;
    assert edge != null;

    if (VERTICAL_LAYOUT) {
        width = DUMMY_WIDTH;
    } else {
        width = DUMMY_HEIGHT;
    }
}
Example #9
Source File: HierarchicalLayoutManager.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
public HierarchicalLayoutManager(Combine b) {
    this.combine = b;
    this.dummyWidth = DUMMY_WIDTH;
    this.dummyHeight = DUMMY_HEIGHT;
    this.xOffset = X_OFFSET;
    this.layerOffset = LAYER_OFFSET;
    this.maxLayerLength = MAX_LAYER_LENGTH;
    this.minLayerDifference = MIN_LAYER_DIFFERENCE;
    this.linksToFollow = new HashSet<Link>();
}
Example #10
Source File: ClusterIngoingConnection.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterIngoingConnection(ClusterInputSlotNode inputSlotNode, Link c) {
    this.inputSlotNode = inputSlotNode;
    this.connection = c;
    this.controlPoints = new ArrayList<Point>();

    inputSlot = c.getTo();
    outputSlot = inputSlotNode.getOutputSlot();
}
Example #11
Source File: ClusterOutgoingConnection.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}
Example #12
Source File: ClusterIngoingConnection.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterIngoingConnection(ClusterInputSlotNode inputSlotNode, Link c) {
    this.inputSlotNode = inputSlotNode;
    this.connection = c;
    this.controlPoints = new ArrayList<Point>();

    inputSlot = c.getTo();
    outputSlot = inputSlotNode.getOutputSlot();
}
Example #13
Source File: ClusterNode.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterNode(Cluster cluster, String name) {
    this.subNodes = new HashSet<Vertex>();
    this.subEdges = new HashSet<Link>();
    this.cluster = cluster;
    position = new Point(0, 0);
    this.name = name;
}
Example #14
Source File: ClusterNode.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterNode(Cluster cluster, String name) {
    this.subNodes = new HashSet<Vertex>();
    this.subEdges = new HashSet<Link>();
    this.cluster = cluster;
    position = new Point(0, 0);
    this.name = name;
}
Example #15
Source File: ClusterIngoingConnection.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterIngoingConnection(ClusterInputSlotNode inputSlotNode, Link c) {
    this.inputSlotNode = inputSlotNode;
    this.connection = c;
    this.controlPoints = new ArrayList<Point>();

    inputSlot = c.getTo();
    outputSlot = inputSlotNode.getOutputSlot();
}
Example #16
Source File: ClusterNode.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterNode(Cluster cluster, String name) {
    this.subNodes = new HashSet<Vertex>();
    this.subEdges = new HashSet<Link>();
    this.cluster = cluster;
    position = new Point(0, 0);
    this.name = name;
}
Example #17
Source File: OldHierarchicalLayoutManager.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
public NodeData(Link edge) {
    layer = -1;
    this.edge = edge;
    assert edge != null;

    if (VERTICAL_LAYOUT) {
        width = DUMMY_WIDTH;
    } else {
        width = DUMMY_HEIGHT;
    }
}
Example #18
Source File: ClusterOutgoingConnection.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}
Example #19
Source File: ClusterOutgoingConnection.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}
Example #20
Source File: OldHierarchicalLayoutManager.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
public EdgeData(Link edge, boolean rev) {
    this.edge = edge;
    reversed = rev;
    relativeStart = edge.getFrom().getRelativePosition();
    relativeEnd = edge.getTo().getRelativePosition();
    assert relativeStart.x >= 0 && relativeStart.x <= edge.getFrom().getVertex().getSize().width;
    assert relativeStart.y >= 0 && relativeStart.y <= edge.getFrom().getVertex().getSize().height;
    assert relativeEnd.x >= 0 && relativeEnd.x <= edge.getTo().getVertex().getSize().width;
    assert relativeEnd.y >= 0 && relativeEnd.y <= edge.getTo().getVertex().getSize().height;
    startPoints = new ArrayList<Point>();
    endPoints = new ArrayList<Point>();
    this.important = true;
}
Example #21
Source File: ClusterOutgoingConnection.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}
Example #22
Source File: ClusterOutgoingConnection.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}
Example #23
Source File: HierarchicalLayoutManager.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
public HierarchicalLayoutManager(Combine b) {
    this.combine = b;
    this.dummyWidth = DUMMY_WIDTH;
    this.dummyHeight = DUMMY_HEIGHT;
    this.xOffset = X_OFFSET;
    this.layerOffset = LAYER_OFFSET;
    this.maxLayerLength = MAX_LAYER_LENGTH;
    this.minLayerDifference = MIN_LAYER_DIFFERENCE;
    this.linksToFollow = new HashSet<Link>();
}
Example #24
Source File: ClusterNode.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterNode(Cluster cluster, String name) {
    this.subNodes = new HashSet<Vertex>();
    this.subEdges = new HashSet<Link>();
    this.cluster = cluster;
    position = new Point(0, 0);
    this.name = name;
}
Example #25
Source File: OldHierarchicalLayoutManager.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
public NodeData(Link edge) {
    layer = -1;
    this.edge = edge;
    assert edge != null;

    if (VERTICAL_LAYOUT) {
        width = DUMMY_WIDTH;
    } else {
        width = DUMMY_HEIGHT;
    }
}
Example #26
Source File: OldHierarchicalLayoutManager.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
public NodeData(Link edge) {
    layer = -1;
    this.edge = edge;
    assert edge != null;

    if (VERTICAL_LAYOUT) {
        width = DUMMY_WIDTH;
    } else {
        width = DUMMY_HEIGHT;
    }
}
Example #27
Source File: ClusterNode.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterNode(Cluster cluster, String name) {
    this.subNodes = new HashSet<Vertex>();
    this.subEdges = new HashSet<Link>();
    this.cluster = cluster;
    position = new Point(0, 0);
    this.name = name;
}
Example #28
Source File: HierarchicalLayoutManager.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
public HierarchicalLayoutManager(Combine b) {
    this.combine = b;
    this.dummyWidth = DUMMY_WIDTH;
    this.dummyHeight = DUMMY_HEIGHT;
    this.xOffset = X_OFFSET;
    this.layerOffset = LAYER_OFFSET;
    this.maxLayerLength = MAX_LAYER_LENGTH;
    this.minLayerDifference = MIN_LAYER_DIFFERENCE;
    this.linksToFollow = new HashSet<Link>();
}
Example #29
Source File: ClusterIngoingConnection.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterIngoingConnection(ClusterInputSlotNode inputSlotNode, Link c) {
    this.inputSlotNode = inputSlotNode;
    this.connection = c;
    this.controlPoints = new ArrayList<Point>();

    inputSlot = c.getTo();
    outputSlot = inputSlotNode.getOutputSlot();
}
Example #30
Source File: ClusterOutgoingConnection.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
public ClusterOutgoingConnection(ClusterOutputSlotNode outputSlotNode, Link c) {
    this.outputSlotNode = outputSlotNode;
    this.connection = c;
    this.intermediatePoints = new ArrayList<Point>();

    outputSlot = c.getFrom();
    inputSlot = outputSlotNode.getInputSlot();
}