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 (TShortIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalShortTermsFacet.ShortEntry(it.key(), it.value()));
                }
                InternalShortTermsFacet.ShortEntry[] list = new InternalShortTermsFacet.ShortEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalShortTermsFacet.ShortEntry) 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)) {
                        InternalDoubleTermsFacet.DoubleEntry entry = new InternalDoubleTermsFacet.DoubleEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalDoubleTermsFacet.DoubleEntry[] list = new InternalDoubleTermsFacet.DoubleEntry[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()

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


                if (count > minCount) {
                    if (excluded == null || !excluded.contains(value)) {
                        InternalIntTermsFacet.IntEntry entry = new InternalIntTermsFacet.IntEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalIntTermsFacet.IntEntry[] list = new InternalIntTermsFacet.IntEntry[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()

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


                if (count > minCount) {
                    if (excluded == null || !excluded.contains(value)) {
                        InternalFloatTermsFacet.FloatEntry entry = new InternalFloatTermsFacet.FloatEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalFloatTermsFacet.FloatEntry[] list = new InternalFloatTermsFacet.FloatEntry[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 (TIntIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalIntTermsFacet.IntEntry(it.key(), it.value()));
                }
                InternalIntTermsFacet.IntEntry[] list = new InternalIntTermsFacet.IntEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalIntTermsFacet.IntEntry) 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)) {
                        InternalByteTermsFacet.ByteEntry entry = new InternalByteTermsFacet.ByteEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalByteTermsFacet.ByteEntry[] list = new InternalByteTermsFacet.ByteEntry[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 (TFloatIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalFloatTermsFacet.FloatEntry(it.key(), it.value()));
                }
                InternalFloatTermsFacet.FloatEntry[] list = new InternalFloatTermsFacet.FloatEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalFloatTermsFacet.FloatEntry) 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 (TByteIntIterator it = facets.iterator(); it.hasNext(); ) {
                    it.advance();
                    ordered.insertWithOverflow(new InternalByteTermsFacet.ByteEntry(it.key(), it.value()));
                }
                InternalByteTermsFacet.ByteEntry[] list = new InternalByteTermsFacet.ByteEntry[ordered.size()];
                for (int i = ordered.size() - 1; i >= 0; i--) {
                    list[i] = (InternalByteTermsFacet.ByteEntry) 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)) {
                        InternalLongTermsFacet.LongEntry entry = new InternalLongTermsFacet.LongEntry(value, count);
                        ordered.insertWithOverflow(entry);
                    }
                }
            }
            InternalLongTermsFacet.LongEntry[] list = new InternalLongTermsFacet.LongEntry[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.