Searched defs:queue (Results 1 - 11 of 11) sorted by relevance

/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/
H A DWeakIdentityMap.java48 private final ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); field in class:WeakIdentityMap
82 return backingStore.put(new IdentityWeakReference(key, queue), value);
103 while ((zombie = queue.poll()) != null) {
111 IdentityWeakReference(Object obj, ReferenceQueue<Object> queue) { argument
112 super(obj == null ? NULL : obj, queue);
/lucene-3.6.0/solr/solrj/src/java/org/apache/solr/client/solrj/impl/
H A DStreamingUpdateSolrServer.java63 final BlockingQueue<UpdateRequest> queue; field in class:StreamingUpdateSolrServer
75 * @param threadCount The number of background threads used to empty the queue
88 queue = new LinkedBlockingQueue<UpdateRequest>(queueSize);
106 while (!queue.isEmpty()) {
108 final UpdateRequest updateRequest = queue.poll(250, TimeUnit.MILLISECONDS);
142 req = queue.poll(250, TimeUnit.MILLISECONDS);
187 // remove it from the list of running things unless we are the last runner and the queue is full...
188 // in which case, the next queue.put() would block and there would be no runners to handle it.
192 if (runners.size() == 1 && queue.remainingCapacity() == 0) {
225 blockUntilFinished(); // empty the queue
[all...]
H A DConcurrentUpdateSolrServer.java67 final BlockingQueue<UpdateRequest> queue; field in class:ConcurrentUpdateSolrServer
83 * The number of background threads used to empty the queue
101 queue = new LinkedBlockingQueue<UpdateRequest>(queueSize);
120 while (!queue.isEmpty()) {
122 final UpdateRequest updateRequest = queue.poll(250,
159 req = queue.poll(250, TimeUnit.MILLISECONDS);
205 // runner and the queue is full...
206 // in which case, the next queue.put() would block and there would be no
212 if (runners.size() == 1 && queue.remainingCapacity() == 0) {
244 blockUntilFinished(); // empty the queue
[all...]
/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/
H A DSearchGroup.java197 private final SortedSet<MergedGroup<T>> queue; field in class:SearchGroup.GroupMerger
202 queue = new TreeSet<MergedGroup<T>>(groupComp);
223 queue.add(mergedGroup);
253 queue.remove(mergedGroup);
257 queue.add(mergedGroup);
267 while(queue.size() > topN) {
269 final MergedGroup<T> group = queue.last();
271 queue.remove(group);
281 // Init queue:
295 while(queue
[all...]
/lucene-3.6.0/lucene/contrib/join/src/java/org/apache/lucene/search/join/
H A DToParentBlockJoinCollector.java97 private final FieldValueHitQueue<OneGroup> queue; field in class:ToParentBlockJoinCollector
125 queue = FieldValueHitQueue.create(sort.getSort(), numParentHits);
126 comparators = queue.getComparators();
127 reverseMul = queue.getReverseMul();
186 // this doc cannot compete with any other document in the queue.
194 // This hit is competitive - replace bottom element in queue & adjustTop
206 bottom = queue.updateTop();
212 // Startup transient: queue is not yet full:
215 // Copy hit into queue
224 bottom = queue
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/
H A DSegmentMerger.java419 private SegmentMergeQueue queue = null; field in class:SegmentMerger
426 queue = new SegmentMergeQueue(readers.size());
434 if (queue != null) {
435 queue.close();
466 queue.add(smi); // initialize queue
476 while (queue.size() > 0) {
478 match[matchSize++] = queue.pop();
480 SegmentMergeInfo top = queue.top();
483 match[matchSize++] = queue
[all...]
H A DDirectoryReader.java1070 private SegmentMergeQueue queue; field in class:DirectoryReader.MultiTermEnum
1079 queue = new SegmentMergeQueue(readers.length);
1093 queue.add(smi); // initialize queue
1098 if (t != null && queue.size() > 0) {
1109 queue.add(smi);
1117 SegmentMergeInfo top = queue.top();
1129 queue.pop();
1131 top = queue.top();
1150 queue
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/
H A DTopFieldCollector.java38 // the queue with sentinel value that guaranteed to
52 public OneComparatorNonScoringCollector(FieldValueHitQueue<Entry> queue, argument
54 super(queue, numHits, fillFields);
55 comparator = queue.getComparators()[0];
56 reverseMul = queue.getReverseMul()[0];
71 // this document is larger than anything else in the queue, and
76 // This hit is competitive - replace bottom element in queue & adjustTop
81 // Startup transient: queue hasn't gathered numHits yet
83 // Copy hit into queue
113 public OutOfOrderOneComparatorNonScoringCollector(FieldValueHitQueue<Entry> queue, argument
160 OneComparatorScoringNoMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
220 OutOfOrderOneComparatorScoringNoMaxScoreCollector( FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
274 OneComparatorScoringMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
334 OutOfOrderOneComparatorScoringMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
385 MultiComparatorNonScoringCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
470 OutOfOrderMultiComparatorNonScoringCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
539 MultiComparatorScoringMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
618 OutOfOrderMultiComparatorScoringMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
691 MultiComparatorScoringNoMaxScoreCollector(FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
769 OutOfOrderMultiComparatorScoringNoMaxScoreCollector( FieldValueHitQueue<Entry> queue, int numHits, boolean fillFields) argument
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/spans/
H A DNearSpansUnordered.java48 private CellQueue queue; // sorted queue of spans field in class:NearSpansUnordered
49 private SpansCell max; // max element in queue
140 queue = new CellQueue(clauses.length);
156 listToQueue(); // initialize queue
160 queue.updateTop(); // maintain queue
187 if (queueStale) { // maintain the queue
198 queue.updateTop(); // maintain queue
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/fst/
H A DUtil.java269 // Set once the queue has filled:
272 TreeSet<FSTPath<T>> queue = null; field in class:Util.TopNSearcher
281 // If back plus this arc is competitive then add to queue:
284 assert queue != null;
287 //System.out.println(" addIfCompetitive bottom=" + bottom + " queue.size()=" + queue.size());
319 queue.add(newPath);
322 // final FSTPath removed = queue.pollLast();
323 assert !queue.isEmpty();
324 final FSTPath<T> removed = queue
[all...]
/lucene-3.6.0/solr/core/src/java/org/apache/solr/highlight/
H A DDefaultSolrHighlighter.java589 private final LinkedList<OrderedToken> queue = new LinkedList<OrderedToken>(); field in class:TokenOrderingFilter
600 while (!done && queue.size() < windowSize) {
608 ListIterator<OrderedToken> iter = queue.listIterator(queue.size());
624 if (queue.isEmpty()) {
627 restoreState(queue.removeFirst().state);

Completed in 28 milliseconds