/** * DOCUMENT ME! * * @param evt DOCUMENT ME! */ public void graphPerspectiveChanged(GraphPerspectiveChangeEvent evt) { a.graphPerspectiveChanged(evt); b.graphPerspectiveChanged(evt); }
/** * DOCUMENT ME! * * @param rootGraphEdgeInx DOCUMENT ME! * * @return DOCUMENT ME! */ public int restoreEdge(int rootGraphEdgeInx) { final int returnThis = _restoreEdge(rootGraphEdgeInx); if (returnThis != 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { listener.graphPerspectiveChanged(new GraphPerspectiveEdgesRestoredEvent(this, new int[] { rootGraphEdgeInx })); } } return returnThis; }
/** * DOCUMENT ME! * * @param rootGraphNodeInx DOCUMENT ME! * * @return DOCUMENT ME! */ public int restoreNode(int rootGraphNodeInx) { final int returnThis; if (_restoreNode(rootGraphNodeInx) != 0) { returnThis = rootGraphNodeInx; } else { returnThis = 0; } if (returnThis != 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { listener.graphPerspectiveChanged(new GraphPerspectiveNodesRestoredEvent(this, new int[] { rootGraphNodeInx })); } } return returnThis; }
private final int hideNode(GraphPerspective source, int rootGraphNodeInx) { // first see if we can hide the node final int returnThis = canHideNode(rootGraphNodeInx); // then notify everyone that we will be hiding nodes if (returnThis != 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { final Node removedNode = m_root.getNode(rootGraphNodeInx); listener.graphPerspectiveChanged(new GraphPerspectiveNodesHiddenEvent(source, new Node[] { removedNode })); } // now actually hide it actuallyHideNode(source, rootGraphNodeInx); } return returnThis; }
private final int hideEdge(GraphPerspective source, int rootGraphEdgeInx) { // see if we can hide the edge final int returnThis = canHideEdge(rootGraphEdgeInx); if (returnThis != 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; // notify listeners of edge about to be hidden if (listener != null) { final Edge removedEdge = m_root.getEdge(rootGraphEdgeInx); listener.graphPerspectiveChanged(new GraphPerspectiveEdgesHiddenEvent(source, new Edge[] { removedEdge })); } // hide the edge actuallyHideEdge(rootGraphEdgeInx); } return returnThis; }
/** * DOCUMENT ME! * * @param rootGraphNodeInx DOCUMENT ME! * * @return DOCUMENT ME! */ public int[] restoreNodes(int[] rootGraphNodeInx) { m_heap.empty(); final MinIntHeap successes = m_heap; final int[] returnThis = new int[rootGraphNodeInx.length]; for (int i = 0; i < rootGraphNodeInx.length; i++) if (_restoreNode(rootGraphNodeInx[i]) != 0) { returnThis[i] = rootGraphNodeInx[i]; successes.toss(returnThis[i]); } if (successes.size() > 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { final int[] successArr = new int[successes.size()]; successes.copyInto(successArr, 0); listener.graphPerspectiveChanged(new GraphPerspectiveNodesRestoredEvent(this, successArr)); } } return returnThis; }
/** * DOCUMENT ME! * * @param rootGraphEdgeInx DOCUMENT ME! * * @return DOCUMENT ME! */ public int[] restoreEdges(int[] rootGraphEdgeInx) { m_heap.empty(); final MinIntHeap successes = m_heap; final int[] returnThis = new int[rootGraphEdgeInx.length]; for (int i = 0; i < rootGraphEdgeInx.length; i++) { returnThis[i] = _restoreEdge(rootGraphEdgeInx[i]); if (returnThis[i] != 0) { successes.toss(returnThis[i]); } } if (successes.size() > 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { final int[] successArr = new int[successes.size()]; successes.copyInto(successArr, 0); listener.graphPerspectiveChanged(new GraphPerspectiveEdgesRestoredEvent(this, successArr)); } } return returnThis; }
successArr[++index] = m_root.getNode(rootNodeInx[enumx.nextInt()]); listener.graphPerspectiveChanged(new GraphPerspectiveNodesHiddenEvent(source, successArr));
private final int[] hideEdges(GraphPerspective source, int[] rootEdgeInx) { m_heap.empty(); final MinIntHeap successes = m_heap; final int[] returnThis = new int[rootEdgeInx.length]; // see if we can hide the edge for (int i = 0; i < rootEdgeInx.length; i++) { returnThis[i] = canHideEdge(rootEdgeInx[i]); if (returnThis[i] != 0) { successes.toss(i); } } if (successes.size() > 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; // notify listeners of the edges about to be hidden if (listener != null) { final Edge[] successArr = new Edge[successes.size()]; final IntEnumerator enumx = successes.elements(); int index = -1; while (enumx.numRemaining() > 0) successArr[++index] = m_root.getEdge(rootEdgeInx[enumx.nextInt()]); listener.graphPerspectiveChanged(new GraphPerspectiveEdgesHiddenEvent(source, successArr)); } // actually hide edges final IntEnumerator successEnum = successes.elements(); while (successEnum.numRemaining() > 0) actuallyHideEdge(rootEdgeInx[successEnum.nextInt()]); } return returnThis; }
private final void hideEdges(Object source, Edge[] edges) { m_heap.empty(); final MinIntHeap successes = m_heap; // check to see if we can hide edges for (int i = 0; i < edges.length; i++) { if (edges[i] == null) continue; if (canHideEdge(edges[i].getRootGraphIndex()) != 0) successes.toss(i); } if (successes.size() > 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; // notify listeners if (listener != null) { final Edge[] successArr = new Edge[successes.size()]; final IntEnumerator enumx = successes.elements(); int index = -1; while (enumx.numRemaining() > 0) successArr[++index] = edges[enumx.nextInt()]; listener.graphPerspectiveChanged(new GraphPerspectiveEdgesHiddenEvent(source, successArr)); } // now actually hide edges final IntEnumerator successEnum = successes.elements(); while (successEnum.numRemaining() > 0) actuallyHideEdge(edges[successEnum.nextInt()].getRootGraphIndex()); } } }
private final void hideNodes(Object source, Node[] nodes) { // We can't use m_heap here because it's potentially used by every // actuallyHideNode() during hiding of edges. m_heap_hideNodes.empty(); final MinIntHeap successes = m_heap_hideNodes; // check to see if we can hide the nodes for (int i = 0; i < nodes.length; i++) { if (canHideNode(nodes[i].getRootGraphIndex()) != 0) { successes.toss(i); } } // notify everyone of the nodes about to be hidden if (successes.size() > 0) { final GraphPerspectiveChangeListener listener = m_lis[0]; if (listener != null) { final Node[] successArr = new Node[successes.size()]; final IntEnumerator enumx = successes.elements(); int index = -1; while (enumx.numRemaining() > 0) successArr[++index] = nodes[enumx.nextInt()]; listener.graphPerspectiveChanged(new GraphPerspectiveNodesHiddenEvent(source, successArr)); } // now actually hide the nodes final IntEnumerator successEnum = successes.elements(); while (successEnum.numRemaining() > 0) actuallyHideNode(source, nodes[successEnum.nextInt()].getRootGraphIndex()); } }
final int[] restoredNodesArr = new int[restoredNodeRootInx.size()]; restoredNodeRootInx.copyInto(restoredNodesArr, 0); listener.graphPerspectiveChanged(new GraphPerspectiveNodesRestoredEvent(this, restoredNodesArr));