Differential D3878 Diff 13691 java/src/main/java/org/softwareheritage/graph/benchmark/utils/Random.java

Changeset View

Standalone View

java/src/main/java/org/softwareheritage/graph/benchmark/utils/Random.java

Show All 33 Lines	public class Random {
/**		/**
* Generates random node ids.		* Generates random node ids.
*		*
* @param graph graph used to pick node ids		* @param graph graph used to pick node ids
* @param nbNodes number of node ids to generate		* @param nbNodes number of node ids to generate
* @return an array of random node ids		* @return an array of random node ids
*/		*/
public long[] generateNodeIds(Graph graph, int nbNodes) {		public long[] generateNodeIds(Graph graph, int nbNodes) {
return random.longs(nbNodes, 0, graph.getNbNodes()).toArray();		return random.longs(nbNodes, 0, graph.numNodes()).toArray();
}		}

/**		/**
* Generates random node ids with a specific type.		* Generates random node ids with a specific type.
*		*
* @param graph graph used to pick node ids		* @param graph graph used to pick node ids
* @param nbNodes number of node ids to generate		* @param nbNodes number of node ids to generate
* @param expectedType specific node type to pick		* @param expectedType specific node type to pick
* @return an array of random node ids		* @return an array of random node ids
*/		*/
public long[] generateNodeIdsOfType(Graph graph, int nbNodes, Node.Type expectedType) {		public long[] generateNodeIdsOfType(Graph graph, int nbNodes, Node.Type expectedType) {
PrimitiveIterator.OfLong nodes = random.longs(0, graph.getNbNodes()).iterator();		PrimitiveIterator.OfLong nodes = random.longs(0, graph.numNodes()).iterator();
long[] nodeIds = new long[nbNodes];		long[] nodeIds = new long[nbNodes];

long nextId;		long nextId;
for (int i = 0; i < nbNodes; i++) {		for (int i = 0; i < nbNodes; i++) {
do {		do {
nextId = nodes.nextLong();		nextId = nodes.nextLong();
} while (graph.getNodeType(nextId) != expectedType);		} while (graph.getNodeType(nextId) != expectedType);
nodeIds[i] = nextId;		nodeIds[i] = nextId;
}		}

return nodeIds;		return nodeIds;
}		}
}		}