List of insertWithOverflow() Examples

Examples of insertWithOverflow()

com.tamingtext.tagrecommender.TagRecommenderClient.ScoreTagQueue.insertWithOverflow()
org.apache.lucene.facet.TopOrdAndFloatQueue.insertWithOverflow()
org.apache.lucene.facet.TopOrdAndIntQueue.insertWithOverflow()
org.apache.lucene.search.spell.SuggestWordQueue.insertWithOverflow()
org.apache.lucene.util.PriorityQueue.insertWithOverflow()
Adds an Object to a PriorityQueue in log(size) time. It returns the object (if any) that was dropped off the heap because it was full. This can be the given parameter (in case it is smaller than the full heap's minimum, and couldn't be added), or another object that was previously the smallest value in the heap and now has been replaced by a larger one, or null if the queue wasn't yet full with maxSize elements.
org.elasticsearch.search.aggregations.bucket.terms.support.BucketPriorityQueue.insertWithOverflow()
org.elasticsearch.search.facet.terms.support.EntryPriorityQueue.insertWithOverflow()

Examples of com.tamingtext.tagrecommender.TagRecommenderClient.ScoreTagQueue.insertWithOverflow()

    final ScoreTagQueue queue = new ScoreTagQueue(maxTags);
    tagCounts.forEachPair(new ObjectIntProcedure<String> () {
      @Override
      public boolean apply(String first, int second) {
        if (second >= cutoff) {
          queue.insertWithOverflow(new ScoreTag(first, second));
        }
        return true;
      }
    });

View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndFloatQueue.insertWithOverflow()

          if (reuse == null) {
            reuse = new TopOrdAndFloatQueue.OrdAndValue();
          }
          reuse.ord = ord;
          reuse.value = values[ord];
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomValue = q.top().value;
          }
        }
      }

View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.insertWithOverflow()

          if (q == null) {
            // Lazy init, so we don't create this for the
            // sparse case unnecessarily
            q = new TopOrdAndIntQueue(topN);
          }
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomCount = q.top().value;
          }
        }
      }

View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.insertWithOverflow()

          if (q == null) {
            // Lazy init, so we don't create this for the
            // sparse case unnecessarily
            q = new TopOrdAndIntQueue(topN);
          }
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomCount = q.top().value;
          }
        }
      }

View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.insertWithOverflow()

          if (reuse == null) {
            reuse = new TopOrdAndIntQueue.OrdAndValue();
          }
          reuse.ord = ord;
          reuse.value = values[ord];
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomValue = q.top().value;
          }
        }
      }

View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.insertWithOverflow()

          if (q == null) {
            // Lazy init, so we don't create this for the
            // sparse case unnecessarily
            q = new TopOrdAndIntQueue(topN);
          }
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomCount = q.top().value;
          }
        }
      }

View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.insertWithOverflow()

      SuggestWordQueue sugQueue = new SuggestWordQueue(numSug);
      for (String suggestion : suggested) {
        SuggestWord sug = suggestedVsWord.get(suggestion);
        sug.score = sd.getDistance(original, sug.string);
        if (sug.score < min) continue;
        sugQueue.insertWithOverflow(sug);
        if (sugQueue.size() == numSug) {
          // if queue full, maintain the minScore score
          min = sugQueue.top().score;
        }
      }

View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.insertWithOverflow()

      SuggestWordQueue sugQueue = new SuggestWordQueue(numSug);
      for (String suggestion : suggested) {
        SuggestWord sug = suggestedVsWord.get(suggestion);
        sug.score = sd.getDistance(original, sug.string);
        if (sug.score < min) continue;
        sugQueue.insertWithOverflow(sug);
        if (sugQueue.size() == numSug) {
          // if queue full, maintain the minScore score
          min = sugQueue.top().score;
        }
      }

View Full Code Here

Examples of org.apache.lucene.util.PriorityQueue.insertWithOverflow()

                QuerySearchResult result = resultProvider.queryResult();
                ScoreDoc[] scoreDocs = result.topDocs().scoreDocs;
                totalNumDocs += scoreDocs.length;
                for (ScoreDoc doc : scoreDocs) {
                    ShardFieldDoc nodeFieldDoc = new ShardFieldDoc(result.shardTarget(), doc.doc, doc.score, ((FieldDoc) doc).fields);
                    if (queue.insertWithOverflow(nodeFieldDoc) == nodeFieldDoc) {
                        // filled the queue, break
                        break;
                    }
                }
            }

View Full Code Here

Examples of org.apache.lucene.util.PriorityQueue.insertWithOverflow()

                QuerySearchResult result = resultProvider.queryResult();
                ScoreDoc[] scoreDocs = result.topDocs().scoreDocs;
                totalNumDocs += scoreDocs.length;
                for (ScoreDoc doc : scoreDocs) {
                    ShardScoreDoc nodeScoreDoc = new ShardScoreDoc(result.shardTarget(), doc.doc, doc.score);
                    if (queue.insertWithOverflow(nodeScoreDoc) == nodeScoreDoc) {
                        // filled the queue, break
                        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.