Java IntArrayList类代码示例

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    int size = in.readVInt();
    locations = new IntArrayList(size);
    responses = new ArrayList<>(size);
    failures = new ArrayList<>(size);
    for (int i = 0; i < size; i++) {
        locations.add(in.readVInt());
        if (in.readBoolean()) {
            GetResponse response = new GetResponse();
            response.readFrom(in);
            responses.add(response);
        } else {
            responses.add(null);
        }
        if (in.readBoolean()) {
            failures.add(MultiGetResponse.Failure.readFailure(in));
        } else {
            failures.add(null);
        }
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    int size = in.readVInt();
    locations = new IntArrayList(size);
    items = new ArrayList<>(size);

    for (int i = 0; i < size; i++) {
        locations.add(in.readVInt());
        items.add(MultiGetRequest.Item.readItem(in));
    }

    preference = in.readOptionalString();
    refresh = in.readBoolean();
    realtime = in.readBoolean();
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    int size = in.readVInt();
    locations = new IntArrayList(size);
    responses = new ArrayList<>(size);
    failures = new ArrayList<>(size);
    for (int i = 0; i < size; i++) {
        locations.add(in.readVInt());
        if (in.readBoolean()) {
            TermVectorsResponse response = new TermVectorsResponse();
            response.readFrom(in);
            responses.add(response);
        } else {
            responses.add(null);
        }
        if (in.readBoolean()) {
            failures.add(MultiTermVectorsResponse.Failure.readFailure(in));
        } else {
            failures.add(null);
        }
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
public static void ensureStringTypesAreStrings(DataType[] dataTypes, Object[][] rows) {
    if (rows.length == 0) {
        return;
    }

    // NOTE: currently BytesRef inside Maps aren't converted here because
    // if the map is coming from a ESSearchTask/EsGetTask they already contain strings
    // and we have no case in which another Task returns a Map with ByteRefs/Strings inside.
    final IntArrayList stringColumns = new IntArrayList();
    final IntArrayList stringCollectionColumns = new IntArrayList();
    int idx = 0;
    for (DataType dataType : dataTypes) {
        if (BYTES_REF_TYPES.contains(dataType)) {
            stringColumns.add(idx);
        } else if ((DataTypes.isCollectionType(dataType)
                && (BYTES_REF_TYPES.contains(((CollectionType)dataType).innerType())))) {
            stringCollectionColumns.add(idx);
        }
        idx++;
    }

    for (Object[] row : rows) {
        convertStringColumns(row, stringColumns);
        convertStringCollectionColumns(row, stringCollectionColumns);
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    jobId = new UUID(in.readLong(), in.readLong());
    fetchPhaseId = in.readVInt();
    int numReaders = in.readVInt();
    if (numReaders > 0) {
        toFetch = new IntObjectHashMap<>(numReaders);
        for (int i = 0; i < numReaders; i++) {
            int readerId = in.readVInt();
            int numDocs = in.readVInt();
            IntArrayList docs = new IntArrayList(numDocs);
            toFetch.put(readerId, docs);
            for (int j = 0; j < numDocs; j++) {
                docs.add(in.readInt());
            }
        }
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    int size = in.readVInt();
    locations = new IntArrayList(size);
    failures = new ArrayList<>(size);
    for (int i = 0; i < size; i++) {
        locations.add(in.readVInt());
        if (in.readBoolean()) {
            failures.add(Failure.readFailure(in));
        } else {
            failures.add(null);
        }
    }
    if (in.readBoolean()) {
        failure = in.readThrowable();
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
public void readFrom(StreamInput in) throws IOException {
    super.readFrom(in);
    int size = in.readVInt();
    locations = new IntArrayList(size);
    items = new ArrayList<>(size);

    for (int i = 0; i < size; i++) {
        locations.add(in.readVInt());
        items.add(MultiGetRequest.Item.readItem(in));
    }

    preference = in.readOptionalString();
    refresh = in.readBoolean();
    byte realtime = in.readByte();
    if (realtime == 0) {
        this.realtime = false;
    } else if (realtime == 1) {
        this.realtime = true;
    }
    ignoreErrorsOnGeneratedFields = in.readBoolean();
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
/**
 * Releases shard targets that are not used in the docsIdsToLoad.
 */
protected void releaseIrrelevantSearchContexts(AtomicArray<? extends QuerySearchResultProvider> queryResults,
                                               AtomicArray<IntArrayList> docIdsToLoad) {
    if (docIdsToLoad == null) {
        return;
    }
    // we only release search context that we did not fetch from if we are not scrolling
    if (request.scroll() == null) {
        for (AtomicArray.Entry<? extends QuerySearchResultProvider> entry : queryResults.asList()) {
            final TopDocs topDocs = entry.value.queryResult().queryResult().topDocs();
            if (topDocs != null && topDocs.scoreDocs.length > 0 // the shard had matches
                    && docIdsToLoad.get(entry.index) == null) { // but none of them made it to the global top docs
                try {
                    DiscoveryNode node = nodes.get(entry.value.queryResult().shardTarget().nodeId());
                    sendReleaseSearchContext(entry.value.queryResult().id(), node);
                } catch (Throwable t1) {
                    logger.trace("failed to release context", t1);
                }
            }
        }
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
void innerExecuteFetchPhase() throws Exception {
    boolean useScroll = request.scroll() != null;
    sortedShardList = searchPhaseController.sortDocs(useScroll, queryResults);
    searchPhaseController.fillDocIdsToLoad(docIdsToLoad, sortedShardList);

    if (docIdsToLoad.asList().isEmpty()) {
        finishHim();
        return;
    }

    final ScoreDoc[] lastEmittedDocPerShard = searchPhaseController.getLastEmittedDocPerShard(
        request, sortedShardList, firstResults.length()
    );
    final AtomicInteger counter = new AtomicInteger(docIdsToLoad.asList().size());
    for (final AtomicArray.Entry<IntArrayList> entry : docIdsToLoad.asList()) {
        QuerySearchResult queryResult = queryResults.get(entry.index);
        DiscoveryNode node = nodes.get(queryResult.shardTarget().nodeId());
        ShardFetchSearchRequest fetchSearchRequest = createFetchRequest(queryResult, entry, lastEmittedDocPerShard);
        executeFetch(entry.index, queryResult.shardTarget(), counter, fetchSearchRequest, node);
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
@Override
protected void moveToSecondPhase() throws Exception {
    boolean useScroll = request.scroll() != null;
    sortedShardList = searchPhaseController.sortDocs(useScroll, firstResults);
    searchPhaseController.fillDocIdsToLoad(docIdsToLoad, sortedShardList);

    if (docIdsToLoad.asList().isEmpty()) {
        finishHim();
        return;
    }

    final ScoreDoc[] lastEmittedDocPerShard = searchPhaseController.getLastEmittedDocPerShard(
        request, sortedShardList, firstResults.length()
    );
    final AtomicInteger counter = new AtomicInteger(docIdsToLoad.asList().size());
    for (AtomicArray.Entry<IntArrayList> entry : docIdsToLoad.asList()) {
        QuerySearchResultProvider queryResult = firstResults.get(entry.index);
        DiscoveryNode node = nodes.get(queryResult.shardTarget().nodeId());
        ShardFetchSearchRequest fetchSearchRequest = createFetchRequest(queryResult.queryResult(), entry, lastEmittedDocPerShard);
        executeFetch(entry.index, queryResult.shardTarget(), counter, fetchSearchRequest, node);
    }
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
private void minimize() {
	if (graph == null || isImmutable())
		return;

	IntArrayList verticesToRemove = new IntArrayList();
	IntSet vertices = graph.getVertices();
	if (!vertices.contains(entryNode) || !vertices.contains(targetNode)) {
		graph = null;
		return;
	}

	IntArrayList visitedFromStart = getVisited(entryNode, true);
	IntArrayList visitedFromExit = getVisited(targetNode, false);

	for (IntCursor nodeCur : vertices) {
		int node = nodeCur.value;
		if (!visitedFromStart.contains(node) || !visitedFromExit.contains(node)) {
			verticesToRemove.add(node);
		}
	}
	graph.removeVertices(verticesToRemove.toArray());
	if (graph.getVertices().size() == 0 || graph.getEdges().size() == 0)
		graph = null;
	if (graph != null)
		setImmutable();
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
private IntArrayList getVisited(int source, boolean forward) {
	if (graph == null)
		return new IntArrayList();

	Queue<Integer> queue = new LinkedList<Integer>();
	queue.add(source);
	IntArrayList visited = new IntArrayList();
	while (!queue.isEmpty()) {
		Integer next = queue.poll();
		if (!visited.contains(next)) {
			visited.add(next);
			IntSet edges = forward ? graph.getOutEdges(next) : graph.getInEdges(next);
			for (IntCursor eCur : edges) {
				int e = eCur.value;
				int succNode;
				if (forward) {
					succNode = graph.getDirectedSimpleEdgeHead(e);
				} else {
					succNode = graph.getDirectedSimpleEdgeTail(e);
				}
				queue.add(succNode);
			}
		}
	}
	return visited;
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
protected static int[] convertToInt(IntArrayList[] setToSplit, int exclude) {
  int count = 0;

  for (int i = 0; i < setToSplit.length; i++) {
    if (i != exclude) {
      count += setToSplit[i].size();
    }
  }

  int[] setData = new int[count];
  int a = 0;
  for (int i = 0; i < setToSplit.length; i++) {
    if (i != exclude) {
      for (IntCursor d : setToSplit[i]) {
        setData[a++] = d.value;
      }
    }
  }

  return setData;
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
static double[][] computeScores(EnrichmentLandscape result,
                                int totalAttributes,
                                IntArrayList attributeIndexes,
                                int typeIndex) {

    ScoringFunction score = Neighborhood.getScoringFunction(typeIndex);
    List<? extends Neighborhood> neighborhoods = result.getNeighborhoods();
    int filteredAttributes = attributeIndexes.size();
    double[][] scores = new double[filteredAttributes][];
    IntStream.range(0, filteredAttributes)
             .parallel()
             .forEach(filteredIndex -> {
                 int attributeIndex = attributeIndexes.get(filteredIndex);
                 scores[filteredIndex] = neighborhoods.stream()
                                                      .mapToDouble(n -> score.get(n, attributeIndex))
                                                      .toArray();
             });
    return scores;
}
 

import com.carrotsearch.hppc.IntArrayList; //导入依赖的package包/类
public State(String input) {
	stateStack = new Stack<int[]>();
	int[] neutral = new int[alphabet.features];
	for (int i = 0; i < neutral.length; ++i)
		neutral[i] = 0;
	stateStack.push(neutral);
	outputString = new IntArrayList();
	inputString = new IntArrayList();
	outputPointer = 0;
	inputPointer = 0;
	current_weight = 0.0f;
	displayVector = new ArrayList<Result>();

	IndexString inputLine = new IndexString(input);
	while (inputLine.index < input.length()) {
		inputString.add(letterTrie.findKey(inputLine));
		if (inputString.get(inputString.size() - 1) == HfstOptimizedLookup.NO_SYMBOL_NUMBER) {
			inputString.clear();
			break;
		}
	}
	inputString.add(HfstOptimizedLookup.NO_SYMBOL_NUMBER);
}