Examples of com.persistit.Exchange.traverse()

com.persistit.Exchange.traverse()

Performs generalized tree traversal. The direction value indicates whether to traverse forward or backward in collation sequence, whether to descend to child nodes, and whether the key being sought must be strictly greater than or less then the supplied key.

The direction value must be one of:

Key.GT:

Find the next key that is strictly greater than the supplied key. If there is none, return false.

Key.GTEQ:

If the supplied key exists in the database, return that key; otherwise find the next greater key and return it.

Key.EQ:

Return true iff the specified key exists in the database. Does not update the Key.

Key.LT:

Find the next key that is strictly less than the supplied key. If there is none, return false.

Key.LTEQ:

If the supplied key exists in the database, return that key; otherwise find the next smaller key and return it.

@param direction One of Key.GT, Key.GTEQ, Key.EQ, Key.LT or Key.LTEQ. @param deep Determines whether the result should represent the next (or previous) physical key in the Tree or should be restricted to just the logical siblings of the current key. (See Logical Key Children and Siblings). @return true if there is a key to traverse to, elsefalse. @throws PersistitException

        }


        private Row getNextRow(final boolean forward) throws PersistitException {
            final Exchange ex = setupExchange();
            final boolean expanded = (isExpanded());
            if (!ex.traverse(forward ? Key.GT : Key.LT, expanded)) {
                return null;
            }
            final Key key = ex.getKey();
            if (key.compareKeyFragment(_rootKey, 0, _rootKey.getEncodedSize()) != 0) {
                return null;

View Full Code Here

        }


        private Row getNextRow(boolean forward) throws PersistitException {
            Exchange ex = setupExchange();
            boolean expanded = (isExpanded());
            if (!ex.traverse(forward ? Key.GT : Key.LT, expanded)) {
                return null;
            }
            Key key = ex.getKey();
            if (key.compareKeyFragment(_rootKey, 0, _rootKey.getEncodedSize()) != 0) {
                return null;

View Full Code Here

        }


        private Row getNextRow(final boolean forward) throws PersistitException {
            final Exchange ex = setupExchange();
            final boolean expanded = (isExpanded());
            if (!ex.traverse(forward ? Key.GT : Key.LT, expanded)) {
                return null;
            }
            final Key key = ex.getKey();
            if (key.compareKeyFragment(_rootKey, 0, _rootKey.getEncodedSize()) != 0) {
                return null;

View Full Code Here

            .append((long)index.getIndexId());
        if (!exchange.fetch().getValue().isDefined()) {
            return null;
        }
        IndexStatistics result = decodeHeader(session, exchange, indexStatisticsRowDef, index);
        while (exchange.traverse(Key.GT, true)) {
            if (exchange.getKey().getDepth() <= indexStatisticsRowDef.getHKeyDepth()) {
                break;          // End of children.
            }
            decodeEntry(session, exchange, indexStatisticsEntryRowDef, result);
        }

View Full Code Here

            }


            @Override
            public byte[] next() {
                try {
                    if(!ex.traverse(dir, true)) {
                        return null;
                    }
                    dir = Direction.GT;
                    return ex.getKey().decodeByteArray();
                } catch(PersistitException | RollbackException e) {

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.