@Override public void doClose() throws HyracksDataException { try { closeCursors(); nextHasBeenCalled = false; foundTuple = false; } finally { if (lsmHarness != null) { lsmHarness.endSearch(opCtx); } } }
@Override public void doClose() throws HyracksDataException { try { if (currentCursor != null) { currentCursor.close(); currentCursor = null; } accessorIndex = 0; } finally { if (harness != null) { harness.endSearch(opCtx); } } }
@Override public void doClose() throws HyracksDataException { outputTokenElement = null; outputKeyElement = null; needPushElementIntoKeyQueue = false; try { if (rangeCursors != null) { for (int i = 0; i < rangeCursors.length; i++) { rangeCursors[i].close(); } } } finally { if (lsmHarness != null) { lsmHarness.endSearch(opCtx); } } }
@Override public void doClose() throws HyracksDataException { if (!open) { return; } currentCursor = 0; foundNext = false; try { for (int i = 0; i < numberOfTrees; i++) { btreeCursors[i].close(); buddyBtreeCursors[i].close(); } btreeCursors = null; buddyBtreeCursors = null; } finally { lsmHarness.endSearch(opCtx); } }
@Override public void doClose() throws HyracksDataException { if (!open) { return; } currentCursor = 0; foundNext = false; try { for (int i = 0; i < numberOfTrees; i++) { rtreeCursors[i].close(); btreeCursors[i].close(); } rtreeCursors = null; btreeCursors = null; } finally { lsmHarness.endSearch(opCtx); } }
@Override public void doDestroy() throws HyracksDataException { try { if (outputPriorityQueue != null) { outputPriorityQueue.clear(); } if (rangeCursors != null) { for (int i = 0; i < rangeCursors.length; i++) { if (rangeCursors[i] != null) { rangeCursors[i].destroy(); } } rangeCursors = null; } } finally { if (lsmHarness != null) { lsmHarness.endSearch(opCtx); } } }
@Override public void doDestroy() throws HyracksDataException { if (!open) { return; } try { if (rtreeCursors != null && btreeCursors != null) { for (int i = 0; i < numberOfTrees; i++) { rtreeCursors[i].destroy(); btreeCursors[i].destroy(); } } rtreeCursors = null; btreeCursors = null; } finally { lsmHarness.endSearch(opCtx); } foundNext = false; open = false; }
@Override public void doDestroy() throws HyracksDataException { if (!open) { return; } try { if (btreeCursors != null && buddyBtreeCursors != null) { for (int i = 0; i < numberOfTrees; i++) { btreeCursors[i].destroy(); buddyBtreeCursors[i].destroy(); } } btreeCursors = null; buddyBtreeCursors = null; } finally { lsmHarness.endSearch(opCtx); } foundNext = false; open = false; }
@Override public void doClose() throws HyracksDataException { hasNextCallCount = 0; switchPossible = true; outputElement = null; needPushElementIntoQueue = false; for (int i = 0; i < switchRequest.length; i++) { switchRequest[i] = false; } try { if (outputPriorityQueue != null) { outputPriorityQueue.clear(); } if (rangeCursors != null) { for (int i = 0; i < rangeCursors.length; i++) { rangeCursors[i].close(); } } } finally { if (lsmHarness != null) { lsmHarness.endSearch(opCtx); } } }
@Override public void doDestroy() throws HyracksDataException { try { if (tokenQueue != null) { tokenQueue.clear(); } if (keyQueue != null) { keyQueue.clear(); } if (rangeCursors != null) { for (int i = 0; i < rangeCursors.length; i++) { if (rangeCursors[i] != null) { rangeCursors[i].destroy(); } } rangeCursors = null; } } finally { if (lsmHarness != null) { lsmHarness.endSearch(opCtx); } } }
@Override public void doClose() throws HyracksDataException { depletedBtreeCursors = new boolean[numberOfTrees]; foundNext = false; try { for (int i = 0; i < numberOfTrees; i++) { btreeCursors[i].close(); btreeAccessors[i].search(btreeCursors[i], btreeRangePredicate); if (btreeCursors[i].hasNext()) { btreeCursors[i].next(); } else { depletedBtreeCursors[i] = true; } } } catch (Exception e) { e.printStackTrace(); throw new HyracksDataException("error while reseting the btrees of the lsm btree with buddy btree", e); } finally { if (open) { lsmHarness.endSearch(opCtx); } } }
@Override public void doClose() throws HyracksDataException { depletedRtreeCursors = new boolean[numberOfTrees]; foundNext = false; try { for (int i = 0; i < numberOfTrees; i++) { rtreeCursors[i].close(); rtreeAccessors[i].search(rtreeCursors[i], rtreeSearchPredicate); try { if (rtreeCursors[i].hasNext()) { rtreeCursors[i].next(); } else { depletedRtreeCursors[i] = true; } } finally { rtreeCursors[i].close(); } } } finally { if (open) { lsmHarness.endSearch(opCtx); } } }