@Override public void doClose() throws HyracksDataException { super.doClose(); canCallProceed = true; }
@Override public void doDestroy() throws HyracksDataException { try { super.doDestroy(); } finally { if (deletedKeysBTreeCursors != null) { for (int i = 0; i < deletedKeysBTreeCursors.length; i++) { deletedKeysBTreeCursors[i].destroy(); } deletedKeysBTreeCursors = null; } } }
@Override public boolean doHasNext() throws HyracksDataException { hasNextCallCount++; checkPriorityQueue(); return !outputPriorityQueue.isEmpty(); }
@Override public boolean doHasNext() throws HyracksDataException { if (foundNext) { return true; } while (super.doHasNext()) { super.doNext(); LSMBTreeTupleReference diskTuple = (LSMBTreeTupleReference) super.doGetTuple(); if (diskTuple.isAntimatter()) { if (setAntiMatterTuple(diskTuple, outputElement.getCursorIndex())) { foundNext = true; return true; } } else { //matter tuple setMatterTuple(diskTuple, outputElement.getCursorIndex()); foundNext = true; return true; } } return false; }
if (isDeleted(checkElement) && !returnDeletedTuples) { if (compare(cmp, outputElement.getTuple(), checkElement.getTuple()) == 0) { pushIntoQueueFromCursorAndReplaceThisElement(e); } else { pushIntoQueueFromCursorAndReplaceThisElement(outputElement); needPushElementIntoQueue = false; pushIntoQueueFromCursorAndReplaceThisElement(outputElement); needPushElementIntoQueue = false; outputElement = null;
IIndexCursor cursor = mergeOp.getCursor(); ISearchPredicate rtreeSearchPred = new SearchPredicate(null, null); ILSMIndexOperationContext opCtx = ((LSMIndexSearchCursor) cursor).getOpCtx(); search(opCtx, cursor, rtreeSearchPred);
searchNextCursor(); while (super.doHasNext()) { super.doNext(); ITupleReference diskRTreeTuple = super.doGetTuple(); if (super.doHasNext()) { super.doNext(); ITupleReference diskRTreeTuple = super.doGetTuple();
@Override public void doClose() throws HyracksDataException { try { super.doClose(); } finally { if (deletedKeysBTreeCursors != null) { for (int i = 0; i < deletedKeysBTreeCursors.length; i++) { deletedKeysBTreeCursors[i].close(); } } } }
@Override public void doDestroy() throws HyracksDataException { if (!open) { return; } if (numMemoryComponents > 0) { for (int i = 0; i < numMemoryComponents; i++) { mutableRTreeCursors[i].destroy(); btreeCursors[i].destroy(); } } currentCursor = 0; open = false; super.doDestroy(); }
@Override public void doClose() throws HyracksDataException { if (!open) { return; } currentCursor = 0; foundNext = false; if (numMemoryComponents > 0) { for (int i = 0; i < numMemoryComponents; i++) { mutableRTreeCursors[i].close(); btreeCursors[i].close(); } } super.doClose(); }