public void indexView(Graph graph) { TimeIndexImpl viewIndex = viewIndexes.get(graph.getView()); if (viewIndex != null) { graph.readLock(); try { Iterator<T> iterator = null; if (elementType.equals(Node.class)) { iterator = (Iterator<T>) graph.getNodes().iterator(); } else if (elementType.equals(Edge.class)) { iterator = (Iterator<T>) graph.getEdges().iterator(); } if (iterator != null) { while (iterator.hasNext()) { Element element = iterator.next(); S set = getTimeSet(element); if (set != null) { K[] ts = set.toArray(); int tsLength = ts.length; for (int i = 0; i < tsLength; i++) { int timestamp = timeSortedMap.get(ts[i]); viewIndex.add(timestamp, element); } } } } } finally { graph.readUnlock(); } } }
public void indexView(Graph graph) { TimeIndexImpl viewIndex = viewIndexes.get(graph.getView()); if (viewIndex != null) { graph.readLock(); try { Iterator<T> iterator = null; if (elementType.equals(Node.class)) { iterator = (Iterator<T>) graph.getNodes().iterator(); } else if (elementType.equals(Edge.class)) { iterator = (Iterator<T>) graph.getEdges().iterator(); } if (iterator != null) { while (iterator.hasNext()) { Element element = iterator.next(); S set = getTimeSet(element); if (set != null) { K[] ts = set.toArray(); int tsLength = ts.length; for (int i = 0; i < tsLength; i++) { int timestamp = timeSortedMap.get(ts[i]); viewIndex.add(timestamp, element); } } } } } finally { graph.readUnlock(); } } }
Iterator<T> iterator = null; if (columnStore.elementType.equals(Node.class)) { iterator = (Iterator<T>) graph.getNodes().iterator(); } else if (columnStore.elementType.equals(Edge.class)) { iterator = (Iterator<T>) graph.getEdges().iterator();
Iterator<T> iterator = null; if (columnStore.elementType.equals(Node.class)) { iterator = (Iterator<T>) graph.getNodes().iterator(); } else if (columnStore.elementType.equals(Edge.class)) { iterator = (Iterator<T>) graph.getEdges().iterator();