queue.offer(new ObjIntPair<T>(element, filled++)); } else { ObjIntPair<T> head = queue.element(); if (comp.compare(element, head.t) <= 0) { ObjIntPair<T> item = new ObjIntPair<T>(element, filled++);
@Override public E element() throws NoSuchElementException { try { return queue.element().object; } catch (NoSuchElementException nsee) { counter = 0; throw nsee; } }
@Override public TermEnum termEnum() { sanityCheck(); return prefixQueue.element().termEnum; }
@Override public long term() { sanityCheck(); return prefixQueue.element().val; }
public void testMe(PriorityQueue<Integer> integerQueue) { integerQueue.element(); } }
@Override public Object element() { if (!_directAccess && isDelayLoad()) { load(); } return super.element(); }
@Override public Object element() { if (!_directAccess && isDelayLoad()) { load(); } return super.element(); }
@Override public Object element() { if (!_directAccess && isDelayLoad()) { load(); } return super.element(); }
@Override public Object element() { if (!_directAccess && isDelayLoad()) { load(); } return super.element(); }
@Override public int docFreq() { sanityCheck(); return prefixQueue.element().termEnum.docFreq(); }
private void initialize(final long term) { if (prefixes == null) { prefixes = determineAppropriatePrefixes(); } else { for (final Prefix prefix : prefixes) { prefix.reset(); } } if (prefixes.isEmpty()) { prefixQueue = new PriorityQueue<Prefix>(1); return; } prefixQueue = new PriorityQueue<Prefix>(prefixes.size()); for (final Prefix prefix : prefixes) { if (prefix.next()) { prefixQueue.add(prefix); } } while (!prefixQueue.isEmpty()) { if (prefixQueue.element().val >= term) break; final Prefix prefix = prefixQueue.remove(); if (prefix.next()) { prefixQueue.add(prefix); } } }
while (!pSecond.isEmpty() && ((pSecond.element().max) < i + 1)) { top = pSecond.remove().index;
while (!pSecond.isEmpty() && ((pSecond.element().max) < i + 1)) { top = pSecond.remove().index;
DelayedCommit fired = delayedOnFile.element(); if(fired.fOffset > committedOffset) break;
tau = heap.element().dist;
tau = heap.element().dist;
return; } else { currentTrajectoryWithFittness = trajectoiresToExplore.element(); if (logger.isDebugEnabled()) { logger.debug("New trajectory is chosen: " + currentTrajectoryWithFittness);