public boolean isEmpty() { return elementSet.isEmpty(); } }
public boolean isEmpty() { return elementSet.isEmpty(); } }
@Override public ElementIterable get(Interval interval) { readLock(); ObjectSet<Element> elements = new ObjectOpenHashSet<Element>(); Interval2IntTreeMap sortedMap = (Interval2IntTreeMap) timestampIndexStore.timeSortedMap; if (!sortedMap.isEmpty()) { for (Integer index : sortedMap.values(interval)) { if (index < timestamps.length) { TimeIndexEntry ts = timestamps[index]; if (ts != null) { elements.addAll(ts.elementSet); } } } } if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator())); } readUnlock(); return ElementIterable.EMPTY; } }
@Override public ElementIterable get(Interval interval) { readLock(); ObjectSet<Element> elements = new ObjectOpenHashSet<Element>(); Interval2IntTreeMap sortedMap = (Interval2IntTreeMap) timestampIndexStore.timeSortedMap; if (!sortedMap.isEmpty()) { for (Integer index : sortedMap.values(interval)) { if (index < timestamps.length) { TimeIndexEntry ts = timestamps[index]; if (ts != null) { elements.addAll(ts.elementSet); } } } } if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator())); } readUnlock(); return ElementIterable.EMPTY; } }
@Override public ElementIterable get(double timestamp) { checkDouble(timestamp); readLock(); ObjectSet<Element> elements = new ObjectOpenHashSet<Element>(); Interval2IntTreeMap sortedMap = (Interval2IntTreeMap) timestampIndexStore.timeSortedMap; if (!sortedMap.isEmpty()) { for (Integer index : sortedMap.values(timestamp)) { if (index < timestamps.length) { TimeIndexEntry ts = timestamps[index]; if (ts != null) { elements.addAll(ts.elementSet); } } } } if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator())); } readUnlock(); return ElementIterable.EMPTY; }
@Override public ElementIterable get(double timestamp) { checkDouble(timestamp); readLock(); ObjectSet<Element> elements = new ObjectOpenHashSet<Element>(); Interval2IntTreeMap sortedMap = (Interval2IntTreeMap) timestampIndexStore.timeSortedMap; if (!sortedMap.isEmpty()) { for (Integer index : sortedMap.values(timestamp)) { if (index < timestamps.length) { TimeIndexEntry ts = timestamps[index]; if (ts != null) { elements.addAll(ts.elementSet); } } } } if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator())); } readUnlock(); return ElementIterable.EMPTY; }
if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator()));
if (!elements.isEmpty()) { return new ElementIterableImpl(new ElementIteratorImpl(elements.iterator()));