void print(InMemEntry e, StringBuilder sb, long key, int depth) { if (e.isLeaf()) { InMemLeafEntry leaf = (InMemLeafEntry) e; int bits = keyAlgo.getBits(); // print reverse keys sb.append(BitUtil.BIG.toBitString(BitUtil.BIG.reverse(key, bits), bits)).append(" "); IntArrayList entries = leaf.getResults(); for (int i = 0; i < entries.size(); i++) { sb.append(leaf.get(i)).append(','); } sb.append('\n'); } else { InMemTreeEntry tree = (InMemTreeEntry) e; key = key << shifts[depth]; for (int counter = 0; counter < tree.subEntries.length; counter++) { InMemEntry sube = tree.subEntries[counter]; if (sube != null) { print(sube, sb, key | counter, depth + 1); } } } }
public ShardFetchRequest(long id, IntArrayList list, ScoreDoc lastEmittedDoc) { this.id = id; this.docIds = list.buffer; this.size = list.size(); this.lastEmittedDoc = lastEmittedDoc; }
/** * {@inheritDoc} */ @Override public int remove(int index) { assert (index >= 0 && index < size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + ")."; final int v = buffer[index]; if (index + 1 < elementsCount) { System.arraycopy(buffer, index + 1, buffer, index, elementsCount - index - 1); } elementsCount--; buffer[elementsCount] = 0; return v; }
boardEdge.setName(getRouteName(feed, trip.trip)); setEdgeTypeAndClearDistance(boardEdge, GtfsStorage.EdgeType.BOARD); while (boardEdges.size() < stopTime.stop_sequence) { boardEdges.add(-1); // Padding, so that index == stop_sequence alightEdge.setName(getRouteName(feed, trip.trip)); setEdgeTypeAndClearDistance(alightEdge, GtfsStorage.EdgeType.ALIGHT); while (alightEdges.size() < stopTime.stop_sequence) { alightEdges.add(-1);
/** * {@inheritDoc} */ @Override public void insert(int index, int e1) { assert (index >= 0 && index <= size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + "]."; ensureBufferSpace(1); System.arraycopy(buffer, index, buffer, index + 1, elementsCount - index); buffer[index] = e1; elementsCount++; }
program.createBasicBlock(); while (depthsByBlock.size() < program.basicBlockCount()) { depthsByBlock.add(planEntry.depth + 1);
InMemLeafEntry leaf = ((InMemLeafEntry) entry); IntArrayList entries = leaf.getResults(); int len = entries.size(); if (len == 0) { return intIndex;
/** * {@inheritDoc} */ @Override public <T extends IntPredicate> T forEach(T predicate) { return forEach(predicate, 0, size()); }
/** * Trim the internal buffer to the current size. */ public void trimToSize() { if (size() != this.buffer.length) { this.buffer = toArray(); } }
/** * {@inheritDoc} */ @Override public Iterator<IntCursor> iterator() { return new ValueIterator( buffer, size()); }
/** * {@inheritDoc} */ @Override public <T extends IntProcedure> T forEach(T procedure) { return forEach(procedure, 0, size()); }
@Override public void onResponse(MultiTermVectorsShardResponse response) { for (int i = 0; i < response.locations.size(); i++) { responses.set(response.locations.get(i), new MultiTermVectorsItemResponse(response.responses.get(i), response.failures.get(i))); } if (counter.decrementAndGet() == 0) { finishHim(); } }
@Override public void onResponse(MultiGetShardResponse response) { for (int i = 0; i < response.locations.size(); i++) { MultiGetItemResponse itemResponse = new MultiGetItemResponse(response.responses.get(i), response.failures.get(i)); responses.set(response.locations.get(i), itemResponse); } if (counter.decrementAndGet() == 0) { finishHim(); } }
@Override public void writeTo(StreamOutput out) throws IOException { super.writeTo(out); out.writeVInt(locations.size()); for (int i = 0; i < locations.size(); i++) { out.writeVInt(locations.get(i)); items.get(i).writeTo(out); } out.writeOptionalString(preference); out.writeBoolean(refresh); out.writeBoolean(realtime); } }
@Override public void onFailure(Exception e) { // create failures for all relevant requests for (int i = 0; i < shardRequest.locations.size(); i++) { MultiGetRequest.Item item = shardRequest.items.get(i); responses.set(shardRequest.locations.get(i), newItemFailure(shardRequest.index(), item.type(), item.id(), e)); } if (counter.decrementAndGet() == 0) { finishHim(); } }
@Override public void onFailure(Exception e) { // create failures for all relevant requests for (int i = 0; i < shardRequest.locations.size(); i++) { TermVectorsRequest termVectorsRequest = shardRequest.requests.get(i); responses.set(shardRequest.locations.get(i), new MultiTermVectorsItemResponse(null, new MultiTermVectorsResponse.Failure(shardRequest.index(), termVectorsRequest.type(), termVectorsRequest.id(), e))); } if (counter.decrementAndGet() == 0) { finishHim(); } }