List of containsDuplicates() Examples

Examples of containsDuplicates()

com.sleepycat.je.tree.BIN.containsDuplicates()
com.sleepycat.je.tree.IN.containsDuplicates()
com.sleepycat.je.tree.LN.containsDuplicates()
com.sleepycat.je.tree.Node.containsDuplicates()
Since DIN/DBIN/DupCountLN are no longer used in the Btree, this method should normally only be used by dup conversion or entities that do not access records via the Btree. @return true if this node is a duplicate-bearing node type, falseif otherwise.

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                    Node n = null;
                    if (!bin.isEntryKnownDeleted(index)) {
                        n = bin.fetchTarget(index);
                    }
                    if (n != null) {
                        containsDuplicates = n.containsDuplicates();
                        if (searchMode.isDataSearch()) {
                            if (foundExactKey) {
                                /* If the key matches, try the data. */
                                int searchResult = searchAndPositionBoth
                                    (containsDuplicates, n, matchData,

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

         * Note that since we have the BIN/DBIN latched, we can safely check
         * the node type. Any conversions from an LN to a dup tree must have
         * the bin latched.
         */
        addCursor(targetBin);
        if (n.containsDuplicates()) {
            assert !duplicateFetch;
            /* Descend down duplicate tree, doing latch coupling. */
            DIN duplicateRoot = (DIN) n;
            duplicateRoot.latch();
            targetBin.releaseLatch();

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

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

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                         * entry so some insertion happened.
                         */
                        for (int i = 0; i < origCursor.getIndex(); i++) {
                            if (!origBIN.isEntryKnownDeleted(i)) {
                                Node n = origBIN.fetchTarget(i);
                                if (n != null && !n.containsDuplicates()) {
                                    LN ln = (LN) n;
                                    /* See comment above about locking. */
                                    if (!ln.isDeleted()) {
                                        ret = true;
                                        break;

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                return 0;
            }


            /* If fetchTarget returns null, a deleted LN was cleaned. */
            Node n = bin.fetchTarget(index);
            if (n != null && n.containsDuplicates()) {
                DIN dupRoot = (DIN) n;


                /* Latch couple down the tree. */
                dupRoot.latch(cacheMode);
                releaseBIN();

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                            duplicateRoot == null &&
                            databaseImpl.getSortedDuplicates()) {
                            n = bin.fetchTarget(index);
                        }


                        if (n != null && n.containsDuplicates()) {
                            DIN dupRoot = (DIN) n;
                            dupRoot.latch(cacheMode);
                            in.releaseLatch();
                            in = null;
                            found = positionFirstOrLast(first, dupRoot);

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                if (node == null) {
                    bin.releaseLatch();
                    binIsLatched = false;
                    return null;
                }
                if (node.containsDuplicates()) {
                    /* It's a duplicate tree. */
                    duplicateRoot = (DIN) node;
                    duplicateRoot.latch(CacheMode.UNCHANGED);
                    duplicateRootIsLatched = true;
                    bin.releaseLatch();

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

                         * If fetchTarget returns null, a deleted LN was
                         * cleaned.
                         */
                        Node n = bin.fetchTarget(index);
                        if (n != null) {
                            containsDuplicates = n.containsDuplicates();
                            if (searchMode.isDataSearch()) {
                                if (foundExactKey) {
                                    /* If the key matches, try the data. */
                                    int searchResult = searchAndPositionBoth
                                        (containsDuplicates, n, matchData,

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

         * Note that since we have the BIN/DBIN latched, we can safely check
         * the node type. Any conversions from an LN to a dup tree must have
         * the bin latched.
         */
        addCursor(targetBin);
        if (n.containsDuplicates()) {
            assert !duplicateFetch;
            /* Descend down duplicate tree, doing latch coupling. */
            DIN duplicateRoot = (DIN) n;
            duplicateRoot.latch(cacheMode);
            targetBin.releaseLatch();

View Full Code Here

Examples of com.sleepycat.je.tree.Node.containsDuplicates()

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

View Full Code Here

0 1 2 3

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.