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.elasticsearch.search.facet.terms.support.EntryPriorityQueue.insertWithOverflow()

        } else {
            if (size < EntryPriorityQueue.LIMIT) {
                EntryPriorityQueue ordered = new EntryPriorityQueue(size, comparatorType.comparator());
                for (TLongIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalIpTermsFacet.LongEntry(it.key(), it.value()));
                }
                InternalIpTermsFacet.LongEntry[] list = new InternalIpTermsFacet.LongEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalIpTermsFacet.LongEntry) ordered.pop();
                }

View Full Code Here

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

        } else {
            if (size < EntryPriorityQueue.LIMIT) {
                EntryPriorityQueue ordered = new EntryPriorityQueue(size, comparatorType.comparator());
                for (TObjectIntIterator<String> it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalStringTermsFacet.StringEntry(it.key(), it.value()));
                }
                InternalStringTermsFacet.StringEntry[] list = new InternalStringTermsFacet.StringEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = ((InternalStringTermsFacet.StringEntry) ordered.pop());
                }

View Full Code Here

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

        } else {
            if (size < EntryPriorityQueue.LIMIT) {
                EntryPriorityQueue ordered = new EntryPriorityQueue(size, comparatorType.comparator());
                for (TLongIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalLongTermsFacet.LongEntry(it.key(), it.value()));
                }
                InternalLongTermsFacet.LongEntry[] list = new InternalLongTermsFacet.LongEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalLongTermsFacet.LongEntry) ordered.pop();
                }

View Full Code Here

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

                    }
                    if (matcher != null && !matcher.reset(value).matches()) {
                        continue;
                    }
                    InternalStringTermsFacet.StringEntry entry = new InternalStringTermsFacet.StringEntry(value, count);
                    ordered.insertWithOverflow(entry);
                }
            }
            InternalStringTermsFacet.StringEntry[] list = new InternalStringTermsFacet.StringEntry[ordered.size()];
            for (int i = ordered.size() - 1; i >= 0; i--) {
                list[i] = (InternalStringTermsFacet.StringEntry) ordered.pop();

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)) {
                        InternalIpTermsFacet.LongEntry entry = new InternalIpTermsFacet.LongEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalIpTermsFacet.LongEntry[] list = new InternalIpTermsFacet.LongEntry[ordered.size()];
            for (int i = ordered.size() - 1; i >= 0; i--) {

View Full Code Here

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

        } else {
            if (size < EntryPriorityQueue.LIMIT) {
                EntryPriorityQueue ordered = new EntryPriorityQueue(size, comparatorType.comparator());
                for (TObjectIntIterator<String> it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalStringTermsFacet.StringEntry(it.key(), it.value()));
                }
                InternalStringTermsFacet.StringEntry[] list = new InternalStringTermsFacet.StringEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = ((InternalStringTermsFacet.StringEntry) ordered.pop());
                }

View Full Code Here

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

        } else {
            if (size < EntryPriorityQueue.LIMIT) {
                EntryPriorityQueue ordered = new EntryPriorityQueue(size, comparatorType.comparator());
                for (TDoubleIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalDoubleTermsFacet.DoubleEntry(it.key(), it.value()));
                }
                InternalDoubleTermsFacet.DoubleEntry[] list = new InternalDoubleTermsFacet.DoubleEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalDoubleTermsFacet.DoubleEntry) ordered.pop();
                }

View Full Code Here

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

               }
               if (included != null && !included.contains(value)) {
                  continue;
               }
               HashedStringsFacet.HashedStringEntry entry = new HashedStringsFacet.HashedStringEntry(null, value, docId, count);
               ordered.insertWithOverflow(entry);
            }
         }
         HashedStringsFacet.HashedStringEntry[] list = new HashedStringsFacet.HashedStringEntry[ordered.size()];
         for (int i = ordered.size() - 1; i >= 0; i--) {
            HashedStringsFacet.HashedStringEntry entry = (HashedStringsFacet.HashedStringEntry) ordered.pop();

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.