Searched refs:getVertex (Results 1 - 15 of 15) sorted by relevance

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Layout/src/com/sun/hotspot/igv/layout/
H A DPort.java34 public Vertex getVertex(); method in interface:Port
H A DLayoutGraph.java60 Vertex v1 = p.getVertex();
61 Vertex v2 = p2.getVertex();
141 Vertex otherVertex = other.getVertex();
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DConnection.java105 return "Connection(" + getFrom().getVertex() + " to " + getTo().getVertex() + ")";
H A DSlot.java118 public Vertex getVertex() { method in class:Slot
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DClusterInputSlotNode.java76 public Vertex getVertex() {
95 public Vertex getVertex() {
H A DClusterOutputSlotNode.java76 public Vertex getVertex() {
95 public Vertex getVertex() {
H A DOldHierarchicalLayoutManager.java240 assert relativeStart.x >= 0 && relativeStart.x <= edge.getFrom().getVertex().getSize().width;
241 assert relativeStart.y >= 0 && relativeStart.y <= edge.getFrom().getVertex().getSize().height;
242 assert relativeEnd.x >= 0 && relativeEnd.x <= edge.getTo().getVertex().getSize().width;
243 assert relativeEnd.y >= 0 && relativeEnd.y <= edge.getTo().getVertex().getSize().height;
271 Point point = edge.getTo().getVertex().getPosition();
286 Point point = edge.getFrom().getVertex().getPosition();
419 int result = o1.getFrom().getVertex().compareTo(o2.getFrom().getVertex());
421 return o1.getTo().getVertex().compareTo(o2.getTo().getVertex());
[all...]
H A DClusterNode.java88 public Vertex getVertex() {
99 public Vertex getVertex() {
H A DHierarchicalClusterLayoutManager.java127 Vertex fromVertex = fromPort.getVertex();
128 Vertex toVertex = toPort.getVertex();
H A DHierarchicalLayoutManager.java2018 int result = l1.getFrom().getVertex().compareTo(l2.getFrom().getVertex());
2022 result = l1.getTo().getVertex().compareTo(l2.getTo().getVertex());
2057 assert vertexToLayoutNode.containsKey(l.getFrom().getVertex());
2058 assert vertexToLayoutNode.containsKey(l.getTo().getVertex());
2059 edge.from = vertexToLayoutNode.get(l.getFrom().getVertex());
2060 edge.to = vertexToLayoutNode.get(l.getTo().getVertex());
2070 if (!vertexToLayoutNode.containsKey(l.getFrom().getVertex()) ||
2071 vertexToLayoutNode.containsKey(l.getTo().getVertex())) {
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/
H A DBlockWidget.java74 public Vertex getVertex() {
85 public Vertex getVertex() {
H A DHierarchicalGraphLayout.java94 public Vertex getVertex() {
/openjdk7/jdk/src/share/classes/sun/security/provider/certpath/
H A DAdjacencyList.java165 mStepList.add(new BuildStep(follow.getVertex(),
233 mStepList.add(new BuildStep(follow.getVertex(),
H A DBuildStep.java100 public Vertex getVertex() { method in class:BuildStep
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/
H A DDiagramScene.java666 FigureWidget w1 = figureWidgets.get((Figure) c.getTo().getVertex());
667 FigureWidget w2 = figureWidgets.get((Figure) c.getFrom().getVertex());

Completed in 2524 milliseconds