public void setMaxSize(int max) { maxSize = max; adjust(); } private void adjust() {
public BoundedTreeSet(int maxSize, Collection<? extends E> c) { super(c); this.setMaxSize(maxSize); } public BoundedTreeSet(int maxSize, Comparator<? super E> c) {
int maxsize = limit>0 ? offset+limit : Integer.MAX_VALUE-1; maxsize = Math.min(maxsize, nTerms); final BoundedTreeSet<CountPair<String,Integer>> queue = new BoundedTreeSet<CountPair<String,Integer>>(maxsize); int min=mincount-1; // the smallest value in the top 'N' values for (int i=0; i<nTerms; i++) { queue.add(new CountPair<String,Integer>(terms[startTermIndex+i], c)); if (queue.size()>=maxsize) min=queue.last().val;
BoundedTreeSet<CountPair<String, Integer>> queue = (sort ? new BoundedTreeSet<CountPair<String, Integer>>(limit) : null); NamedList fieldTerms = new NamedList(); terms.add(field, fieldTerms); queue.add(new CountPair<String, Integer>(label, docFreq)); } else { fieldTerms.add(label, docFreq);
final BoundedTreeSet<CountPair<String,Integer>> queue = (sort.equals("count") || sort.equals("true")) ? new BoundedTreeSet<CountPair<String,Integer>>(maxsize) : null; final NamedList res = new NamedList(); queue.add(new CountPair<String,Integer>(t.text(), c)); if (queue.size()>=maxsize) min=queue.last().val;
int maxsize = limit>0 ? offset+limit : Integer.MAX_VALUE-1; maxsize = Math.min(maxsize, numTermsInField); final BoundedTreeSet<Long> queue = new BoundedTreeSet<Long>(maxsize); int min=mincount-1; // the smallest value in the top 'N' values for (int i=startTerm; i<endTerm; i++) { queue.add(new Long(pair)); if (queue.size()>=maxsize) min=-(int)(queue.last().longValue() >>> 32);
public BoundedTreeSet(int maxSize, SortedSet<E> s) { super(s); this.setMaxSize(maxSize); } public int getMaxSize() {
public boolean addAll(Collection<? extends E> c) { boolean out = super.addAll(c); adjust(); return out; } }
public BoundedTreeSet(int maxSize) { super(); this.setMaxSize(maxSize); } public BoundedTreeSet(int maxSize, Collection<? extends E> c) {
public boolean add(E item) { boolean out = super.add(item); adjust(); return out; } public boolean addAll(Collection<? extends E> c) {
public BoundedTreeSet(int maxSize, Comparator<? super E> c) { super(c); this.setMaxSize(maxSize); } public BoundedTreeSet(int maxSize, SortedSet<E> s) {