/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public int getIndex(Edge edge) { if (edge.getRootGraph() == this) return edge.getRootGraphIndex(); else return 0; }
public int nextInt() { if ((edgeArr[index] == null) || (edgeArr[index].getRootGraph() != root)) throw new IllegalArgumentException(); return edgeArr[index++].getRootGraphIndex(); } });
public int nextInt() { if ((edgeArr[index] == null) || (edgeArr[index].getRootGraph() != root)) throw new IllegalArgumentException(); return edgeArr[index++].getRootGraphIndex(); } });
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public int getIndex(Edge edge) { if ((edge.getRootGraph() == m_root) && (getRootGraphEdgeIndex(edge.getRootGraphIndex()) == edge.getRootGraphIndex())) { return edge.getRootGraphIndex(); } else { return 0; } }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean containsEdge(Edge edge) { return (edge.getRootGraph() == this) && (getEdge(edge.getRootGraphIndex()) != null); }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public java.util.List metaParentsList(Edge edge) { if (!(edge.getRootGraph() == m_root)) { return null; } return edgeMetaParentsList(edge.getRootGraphIndex()); }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public Edge hideEdge(Edge edge) { if ((edge.getRootGraph() == m_root) && (hideEdge(edge.getRootGraphIndex()) != 0)) { return edge; } else { return null; } }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public java.util.List metaParentsList(Edge edge) { if (edge.getRootGraph() != this) return null; return edgeMetaParentsList(edge.getRootGraphIndex()); }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean containsEdge(Edge edge) { int nativeInx; return (edge.getRootGraph() == m_root) && ((nativeInx = m_rootToNativeEdgeInxMap.get(~(edge.getRootGraphIndex()))) >= 0) && (nativeInx != Integer.MAX_VALUE); }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public Edge removeEdge(Edge edge) { if ((edge.getRootGraph() == this) && (removeEdge(edge.getRootGraphIndex()) != 0)) return edge; else return null; }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * * @return DOCUMENT ME! */ public Edge restoreEdge(Edge edge) { if ((edge.getRootGraph() == m_root) && (restoreEdge(edge.getRootGraphIndex()) != 0)) { return edge; } else { return null; } }
/** * DOCUMENT ME! * * @param parent DOCUMENT ME! * @param child DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean addMetaChild(Node parent, Edge child) { if ((parent.getRootGraph() != this) || (child.getRootGraph() != this)) return false; return addEdgeMetaChild(parent.getRootGraphIndex(), child.getRootGraphIndex()); }
/** * DOCUMENT ME! * * @param child DOCUMENT ME! * @param parent DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean isMetaParent(Edge child, Node parent) { if ((child.getRootGraph() != this) || (parent.getRootGraph() != this)) return false; return isEdgeMetaParent(child.getRootGraphIndex(), parent.getRootGraphIndex()); }
/** * DOCUMENT ME! * * @param child DOCUMENT ME! * @param parent DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean isMetaParent(Edge child, Node parent) { if (!((child.getRootGraph() == m_root) && (parent.getRootGraph() == m_root))) { return false; } return isEdgeMetaParent(child.getRootGraphIndex(), parent.getRootGraphIndex()); }
/** * DOCUMENT ME! * * @param edge DOCUMENT ME! * @param recurse DOCUMENT ME! * * @return DOCUMENT ME! */ public boolean containsEdge(Edge edge, boolean recurse) { if (edge.getRootGraph() != m_root) { return false; } final int nativeInx = m_rootToNativeEdgeInxMap.get(~(edge.getRootGraphIndex())); if ((nativeInx >= 0) && (nativeInx != Integer.MAX_VALUE)) { return true; } if (!recurse) { return false; } final int[] recursiveChildEdges = m_root.getEdgeMetaChildIndicesArray(getNodeIndicesArray()); for (int i = 0; i < recursiveChildEdges.length; i++) if (recursiveChildEdges[i] == edge.getRootGraphIndex()) { return true; } return false; }