public void clear() { for (ObjectArrayList<Block> channel : channels) { channel.clear(); channel.trim(); } valueAddresses.clear(); valueAddresses.trim(); positionCount = 0; nextBlockToCompact = 0; pagesMemorySize = 0; estimatedSize = calculateEstimatedSize(); }
@Override public void clear() { super.clear(); this.isIndel = false; this.lastBaseLocation = 0; this.lastGapLocation = 0; this.noAnchorBeforeGap = false; }
public void clear() { records.clear(); }
public QueryBuilderVisitor<Set<String>> prepare() { currentIndex.clear(); currentIndex.push( defaultIndex ); return this; }
public IntervalIterator reset() { cachedIntervals.clear(); restart(); return this; }
public void reset() { cachedIntervals.clear(); restart(); }
public void reset() { cachedIntervals.clear(); restart(); }
public QueryBuilderVisitor<Set<String>> prepare() { currentIndex.clear(); currentIndex.push( defaultIndex ); return this; }
public QueryBuilderVisitor<Set<String>> prepare() { currentIndex.clear(); currentIndex.push( defaultIndex ); return this; }
public IntervalIterator reset() { cachedIntervals.clear(); restart(); return this; }
public QueryBuilderVisitor<Set<String>> prepare() { currentIndex.clear(); currentIndex.push( defaultIndex ); return this; }
public void close() throws IOException { if(closed) return; super.close(); if(executors != null) executors.close(); executors = null; hitsOnCurrentDocument.clear(); }
public void clear() { for (ObjectArrayList<Block> channel : channels) { channel.clear(); } valueAddresses.clear(); positionCount = 0; pagesMemorySize = 0; estimatedSize = calculateEstimatedSize(); }
void clear() { for (int index = 1; index < this.group_max; ++index) { this.groups[index].clear(); } this.group_max = 1; this.instances.clear(); this.instances_sorted.clear(); }
public void clear() { for (ObjectArrayList<Block> channel : channels) { channel.clear(); channel.trim(); } valueAddresses.clear(); valueAddresses.trim(); positionCount = 0; nextBlockToCompact = 0; pagesMemorySize = 0; estimatedSize = calculateEstimatedSize(); }
public void clear() { for (ObjectArrayList<Block> channel : channels) { channel.clear(); channel.trim(); } valueAddresses.clear(); valueAddresses.trim(); positionCount = 0; nextBlockToCompact = 0; pagesMemorySize = 0; estimatedSize = calculateEstimatedSize(); }
@Override public synchronized void reset() { // numDevices = Nd4j.getAffinityManager().getNumberOfDevices(); index = -1; // force traversal and caching of iterator if reset is called before a full traversal: if (!sourceIsComplete) { cache.clear(); if (source.resetSupported()) { source.reset(); } while (hasNext()) { next(); } sourceIsComplete = true; reset(); } // System.out.println("Memory cache size="+cache.size()); }
@Override public Object content( final int field ) throws IOException { switch( field ) { case 0: return new FastBufferedReader( (MutableString)metadata.get( PropertyBasedDocumentFactory.MetadataKeys.TITLE ) ); case 1: return metadata.get( MetadataKeys.ID ); case 2: return metadata.get( MetadataKeys.LASTEDIT ); case 3: return new FastBufferedReader( (MutableString)metadata.get( MetadataKeys.CATEGORY ) ); case 4: return new FastBufferedReader( (MutableString)metadata.get( MetadataKeys.FIRSTPAR ) ); case 5: @SuppressWarnings("unchecked") final ObjectArrayList<Anchor> redirectAnchors = (ObjectArrayList<Anchor>)metadata.get( MetadataKeys.REDIRECT ); ImmutableList<Anchor> result; synchronized( redirectAnchors ) { redirectAnchors.add( new Anchor( (MutableString)metadata.get( PropertyBasedDocumentFactory.MetadataKeys.URI ), (MutableString)metadata.get( PropertyBasedDocumentFactory.MetadataKeys.TITLE ) ) ); result = ImmutableList.copyOf( redirectAnchors ); redirectAnchors.clear(); } return result; default: throw new IllegalArgumentException(); } } };
public long nextDocument(long greaterThan) throws IOException { if(closed || queue.isEmpty()) return latestDocument = -1; if(latestDocument == -1) return latestDocument; // advance int first = queue.first(); while(currentDoc[first] == latestDocument || currentDoc[first] <= greaterThan) { currentDoc[first] = executors.nextDocument(first, greaterThan); if(currentDoc[first] < 0) { queue.dequeue(); if(queue.isEmpty()) return latestDocument = -1; } else { queue.changed(); } first = queue.first(); } latestDocument = currentDoc[first]; // collect all the hits from the current document frontSize = queue.front(front); hitsOnCurrentDocument.clear(); hitsObtained = false; return latestDocument; }