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 org.apache.lucene.util.PriorityQueue.insertWithOverflow()

          while((facet = iter.next(minHits)) != null)
          {
            // check with the top of min heap
            browseFacet.setHitCount(iter.count);
            browseFacet.setValue(String.valueOf(facet));
            browseFacet = (BrowseFacet)queue.insertWithOverflow(browseFacet);
          }
        }
        // remove from queue and add to the list
        while(qsize-- > 0)
          list.addFirst((BrowseFacet)queue.pop());

View Full Code Here

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

          while((facet = iter.next(minHits)) != null)
          {
            // check with the top of min heap
            browseFacet.setHitCount(iter.count);
            browseFacet.setValue(String.valueOf(facet));
            browseFacet = (BrowseFacet)queue.insertWithOverflow(browseFacet);
          }
        }
        // remove from queue and add to the list
        while(qsize-- > 0)
          list.addFirst((BrowseFacet)queue.pop());

View Full Code Here

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

        if (facet != null) {
          while ((facet = iter.next(minHits)) != null) {
            // check with the top of min heap
            browseFacet.setFacetValueHitCount(iter.count);
            browseFacet.setValue(String.valueOf(facet));
            browseFacet = (BrowseFacet) queue.insertWithOverflow(browseFacet);
          }
        }
        // remove from queue and add to the list
        while (qsize-- > 0)
          list.addFirst((BrowseFacet) queue.pop());

View Full Code Here

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

               if (!fi.add(offsets[j], text))
               {
                  break;
               }
            }
            bestFragments.insertWithOverflow(fi);
         }
      }


      if (bestFragments.size() == 0)
      {

View Full Code Here

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

          while((facet = iter.next(minHits)) != null)
          {
            // check with the top of min heap
            browseFacet.setHitCount(iter.count);
            browseFacet.setValue(String.valueOf(facet));
            browseFacet = (BrowseFacet)queue.insertWithOverflow(browseFacet);
          }
        }
        // remove from queue and add to the list
        while(qsize-- > 0)
          list.addFirst((BrowseFacet)queue.pop());

View Full Code Here

Examples of org.elasticsearch.search.aggregations.bucket.terms.support.BucketPriorityQueue.insertWithOverflow()

            spare.term = bucketOrds.get(i);
            spare.docCount = bucketDocCount(i);
            otherDocCount += spare.docCount;
            spare.bucketOrd = i;
            if (bucketCountThresholds.getShardMinDocCount() <= spare.docCount) {
                spare = (LongTerms.Bucket) ordered.insertWithOverflow(spare);
            }
        }


        // Get the top buckets
        final InternalTerms.Bucket[] list = new InternalTerms.Bucket[ordered.size()];

View Full Code Here

Examples of org.elasticsearch.search.aggregations.bucket.terms.support.BucketPriorityQueue.insertWithOverflow()

            otherDocCount += bucketDocCount;
            spare.globalOrd = globalTermOrd;
            spare.bucketOrd = bucketOrd;
            spare.docCount = bucketDocCount;
            if (bucketCountThresholds.getShardMinDocCount() <= spare.docCount) {
                spare = (OrdBucket) ordered.insertWithOverflow(spare);
                if (spare == null) {
                    spare = new OrdBucket(-1, 0, null, showTermDocCountError, 0);
                }
            }
        }

View Full Code Here

Examples of org.elasticsearch.search.aggregations.bucket.terms.support.BucketPriorityQueue.insertWithOverflow()

            bucketOrds.get(i, spare.termBytes);
            spare.docCount = bucketDocCount(i);
            otherDocCount += spare.docCount;
            spare.bucketOrd = i;
            if (bucketCountThresholds.getShardMinDocCount() <= spare.docCount) {
                spare = (StringTerms.Bucket) ordered.insertWithOverflow(spare);
            }
        }


        // Get the top buckets
        final InternalTerms.Bucket[] list = new InternalTerms.Bucket[ordered.size()];

View Full Code Here

Examples of org.elasticsearch.search.aggregations.bucket.terms.support.BucketPriorityQueue.insertWithOverflow()

                } else {
                    b.docCountError = sumDocCountError - b.docCountError;
                }
            }
            if (b.docCount >= minDocCount) {
                Terms.Bucket removed = ordered.insertWithOverflow(b);
                if (removed != null) {
                    otherDocCount += removed.getDocCount();
                }
            }
        }

View Full Code Here

Examples of org.elasticsearch.search.facet.terms.support.EntryPriorityQueue.insertWithOverflow()

                } while (agg != null && value == agg.current);


                if (count > minCount) {
                    if (excluded == null || !excluded.contains(value)) {
                        InternalShortTermsFacet.ShortEntry entry = new InternalShortTermsFacet.ShortEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalShortTermsFacet.ShortEntry[] list = new InternalShortTermsFacet.ShortEntry[ordered.size()];
            for (int i = ordered.size() - 1; i >= 0; i--) {

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.