/* * Copyright 2006-2012 Amazon Technologies, Inc. or its affiliates. * Amazon, Amazon.com and Carbonado are trademarks or registered trademarks * of Amazon Technologies, Inc. or its affiliates. All rights reserved. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.amazon.carbonado.cursor; import java.util.Comparator; import java.util.NoSuchElementException; import com.amazon.carbonado.FetchException; import com.amazon.carbonado.Cursor; /** * Wraps two Cursors and performs an asymmetric set difference * operation. * *

Both cursors must return results in the same order. Ordering is preserved * by the difference. * * @author Brian S O'Neill * @see UnionCursor * @see IntersectionCursor * @see SymmetricDifferenceCursor */ public class DifferenceCursor extends AbstractCursor { private final Cursor mLeftCursor; private final Cursor mRightCursor; private final Comparator mOrder; private S mNext; private S mNextRight; /** * @param left cursor to wrap * @param right cursor to wrap whose results are completely discarded * @param order describes sort ordering of wrapped cursors, which must be * a total ordering */ public DifferenceCursor(Cursor left, Cursor right, Comparator order) { if (left == null || right == null || order == null) { throw new IllegalArgumentException(); } mLeftCursor = left; mRightCursor = right; mOrder = order; } public void close() throws FetchException { mLeftCursor.close(); mRightCursor.close(); mNext = null; mNextRight = null; } public boolean hasNext() throws FetchException { if (mNext != null) { return true; } S nextLeft; try { while (true) { if (mLeftCursor.hasNext()) { nextLeft = mLeftCursor.next(); } else { close(); return false; } if (mNextRight == null) { if (mRightCursor.hasNext()) { mNextRight = mRightCursor.next(); } else { mNext = nextLeft; return true; } } while (true) { int result = mOrder.compare(nextLeft, mNextRight); if (result < 0) { mNext = nextLeft; return true; } else if (result > 0) { if (mRightCursor.hasNext()) { mNextRight = mRightCursor.next(); } else { mNextRight = null; mNext = nextLeft; return true; } } else { break; } } } } catch (NoSuchElementException e) { return false; } catch (FetchException e) { try { close(); } catch (Exception e2) { // Don't care. } throw e; } } public S next() throws FetchException { try { if (hasNext()) { S next = mNext; mNext = null; return next; } } catch (FetchException e) { try { close(); } catch (Exception e2) { // Don't care. } throw e; } throw new NoSuchElementException(); } }