Examples of dequeueLong()

Examples of it.unimi.dsi.fastutil.longs.LongArrayFIFOQueue.dequeueLong()

290
291
292
293
294
295
296
297
298
299
300
        // P2 check same as above but shorter and slower (and invoked rarely)
        LongArrayFIFOQueue q = new LongArrayFIFOQueue();
        q.enqueue(seedNode);
        while (!q.isEmpty())
        {
            long node = q.dequeueLong();
            long atNode = get(node);
            long atSibling = get(sibling(node));
            if (atNode == 0 && atSibling == 0)
            {
                continue;
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongArrayFIFOQueue.dequeueLong()

294
295
296
297
298
299
300
301
302
303
304
        // P2 check same as above but shorter and slower (and invoked rarely)
        LongArrayFIFOQueue q = new LongArrayFIFOQueue();
        q.enqueue(seedNode);
        while (!q.isEmpty())
        {
            long node = q.dequeueLong();
            long atNode = get(node);
            long atSibling = get(sibling(node));
            if (atNode == 0 && atSibling == 0)
            {
                continue;
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongArrayFIFOQueue.dequeueLong()

258
259
260
261
262
263
264
265
266
267
268
        double threshold = Math.floor(size / compressionFactor);
        // P2 check same as above but shorter and slower (and invoked rarely)
        LongArrayFIFOQueue q = new LongArrayFIFOQueue();
        q.enqueue(seedNode);
        while (!q.isEmpty()) {
            long node = q.dequeueLong();
            long atNode = get(node);
            long atSibling = get(sibling(node));
            if (atNode == 0 && atSibling == 0) {
                continue;
            }
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongArrayFIFOQueue.dequeueLong()

294
295
296
297
298
299
300
301
302
303
304
        // P2 check same as above but shorter and slower (and invoked rarely)
        LongArrayFIFOQueue q = new LongArrayFIFOQueue();
        q.enqueue(seedNode);
        while (!q.isEmpty())
        {
            long node = q.dequeueLong();
            long atNode = get(node);
            long atSibling = get(sibling(node));
            if (atNode == 0 && atSibling == 0)
            {
                continue;
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongHeapPriorityQueue.dequeueLong()

118
119
120
121
122
123
124
125
126
127
128
            //scored++;
            do {
              assignScore(currentPostingListIndex, currentCandidate);
              //assignScore(currentPostingListIndex, wm[currentPostingListIndex], currentCandidate, currentPosting);
              long newDocid = currentPosting.next();
              postingHeap.dequeueLong();
                if (newDocid != IterablePosting.EOL)
                    postingHeap.enqueue((newDocid << 32) + currentPostingListIndex);
                else if (postingHeap.isEmpty())
                    break;
                long elem = postingHeap.firstLong();
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongHeapPriorityQueue.dequeueLong()

116
117
118
119
120
121
122
123
124
125
126
            currentPosting = postingListArray[currentPostingListIndex];
            //scored++;
            do {
              assignScore(currentPostingListIndex, wm[currentPostingListIndex], currentCandidate, currentPosting);
              long newDocid = postingListArray[currentPostingListIndex].next();
              postingHeap.dequeueLong();
                if (newDocid != IterablePosting.EOL)
                    postingHeap.enqueue((newDocid << 32) + currentPostingListIndex);
                else if (postingHeap.isEmpty())
                    break;
                long elem = postingHeap.firstLong();
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongPriorityQueue.dequeueLong()

118
119
120
121
122
123
124
125
126
127
128
            //scored++;
            do {
              assignScore(currentPostingListIndex, currentCandidate);
              //assignScore(currentPostingListIndex, wm[currentPostingListIndex], currentCandidate, currentPosting);
              long newDocid = currentPosting.next();
              postingHeap.dequeueLong();
                if (newDocid != IterablePosting.EOL)
                    postingHeap.enqueue((newDocid << 32) + currentPostingListIndex);
                else if (postingHeap.isEmpty())
                    break;
                long elem = postingHeap.firstLong();
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongPriorityQueue.dequeueLong()

116
117
118
119
120
121
122
123
124
125
126
            currentPosting = postingListArray[currentPostingListIndex];
            //scored++;
            do {
              assignScore(currentPostingListIndex, wm[currentPostingListIndex], currentCandidate, currentPosting);
              long newDocid = postingListArray[currentPostingListIndex].next();
              postingHeap.dequeueLong();
                if (newDocid != IterablePosting.EOL)
                    postingHeap.enqueue((newDocid << 32) + currentPostingListIndex);
                else if (postingHeap.isEmpty())
                    break;
                long elem = postingHeap.firstLong();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.