List of fetchTarget() Examples

Examples of fetchTarget()

com.sleepycat.je.tree.BIN.fetchTarget()
We require exclusive latches on a BIN, so this method does not need to declare that it throws RelatchRequiredException.
com.sleepycat.je.tree.ChildReference.fetchTarget()
Fetch the target object that this ChildReference refers to. If the object is already in VM, then just return the reference to it. If the object is not in VM, then read the object from the log. If the object has been faulted in and the in arg is supplied, then the total memory size cache in the IN is invalidated. @param database The database that this ChildReference resides in. @param in The IN that this ChildReference lives in. Ifthe target is fetched (i.e. it is null on entry), then the total in memory count is invalidated in the IN. May be null. For example, the root is a ChildReference and there is no parent IN when the rootIN is fetched in. @return the Node object representing the target node in the tree, ornull if there is no target of this ChildReference, or null if a pendingDelete or knownDeleted entry has been cleaned.
com.sleepycat.je.tree.DBIN.fetchTarget()
com.sleepycat.je.tree.IN.fetchTarget()
Returns the target of the idx'th entry or null if a pendingDeleted or knownDeleted entry has been cleaned. Note that null can only be returned for a slot that could contain a deleted LN, not other node types and not a DupCountLN since DupCountLNs are never deleted. Null is also returned for a KnownDeleted slot with a NULL_LSN. @return the target node or null.

Examples of com.sleepycat.je.tree.DBIN.fetchTarget()

                     * We were adjusted to something other than the first entry
                     * so some insertion happened.
                     */
                    for (int i = 0; i < origCursor.getDupIndex(); i++) {
                        if (!origDBIN.isEntryKnownDeleted(i)) {
                            Node n = origDBIN.fetchTarget(i);
                            LN ln = (LN) n;
                            /* See comment above about locking. */
                            if (n != null && !ln.isDeleted()) {
                                ret = true;
                                break;

View Full Code Here

Examples of com.sleepycat.je.tree.DBIN.fetchTarget()

                         */
                        for (int i = origCursor.getDupIndex() + 1;
                             i < origDBIN.getNEntries();
                             i++) {
                            if (!origDBIN.isEntryKnownDeleted(i)) {
                                final Node n = origDBIN.fetchTarget(i);
                                final LN ln = (LN) n;
                                /* See comment above about locking. */
                                if (n != null && !ln.isDeleted()) {
                                    ret = true;
                                    break;

View Full Code Here

Examples of com.sleepycat.je.tree.DBIN.fetchTarget()

                         * We were adjusted to something other than the first
                         * entry so some insertion happened.
                         */
                        for (int i = 0; i < origCursor.getDupIndex(); i++) {
                            if (!origDBIN.isEntryKnownDeleted(i)) {
                                final Node n = origDBIN.fetchTarget(i);
                                final LN ln = (LN) n;
                                /* See comment above about locking. */
                                if (n != null && !ln.isDeleted()) {
                                    ret = true;
                                    break;

View Full Code Here

Examples of com.sleepycat.je.tree.IN.fetchTarget()

                         * See if we need to descend further.  If fetchTarget
                         * returns null, a deleted LN was cleaned.
                         */
                        Node n = null;
                        if (!in.isEntryKnownDeleted(index)) {
                            n = in.fetchTarget(index);
                        }


                        if (n != null && n.containsDuplicates()) {
                            DIN dupRoot = (DIN) n;
                            dupRoot.latch();

View Full Code Here

Examples of com.sleepycat.je.tree.IN.fetchTarget()

                         * See if we need to descend further.  If fetchTarget
                         * returns null, a deleted LN was cleaned.
                         */
                        Node n = null;
                        if (!in.isEntryKnownDeleted(index)) {
                            n = in.fetchTarget(index);
                        }


                        if (n != null && n.containsDuplicates()) {
                            DIN dupRoot = (DIN) n;
                            dupRoot.latch();

View Full Code Here

Examples of com.sleepycat.je.tree.IN.fetchTarget()

    int index = inEntry.index;
    if (in.isEntryKnownDeleted(index) ||
        in.getLsn(index) != lsn) {
        return null;
    }
    return in.fetchTarget(index);
      } finally {
    in.releaseLatch();
      }
  }
    }

View Full Code Here

0 1 2

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.