elk-benchmark/src/main/java/org/semanticweb/elk/benchmark/reasoning/IncrementalClassificationTask.java
protected Set<ElkAxiom> getRandomSubset(List<ElkAxiom> axioms, Random rnd) {
		int size = axiomsToChange > 0 ? axiomsToChange : Math.max(1,
				axioms.size() / 100);
		Set<ElkAxiom> subset = new ArrayHashSet<ElkAxiom>(size);

		if (size >= axioms.size()) {
			subset.addAll(axioms);
		} else {
			for (int i = 0; i < size; i++) {
				ElkAxiom axiom = axioms.get(rnd.nextInt(size));

				subset.add(axiom);
			}
		}

		return subset;
	}
protected Set<ElkAxiom> getRandomSubset(List<ElkAxiom> axioms, Random rnd) {
		int size = axiomsToChange > 0 ? axiomsToChange : Math.max(1,
				axioms.size() / 100);
		Set<ElkAxiom> subset = new ArrayHashSet<ElkAxiom>(size);

		if (size >= axioms.size()) {
			subset.addAll(axioms);
		} else {
			for (int i = 0; i < size; i++) {
				ElkAxiom axiom = axioms.get(rnd.nextInt(size));

				subset.add(axiom);
			}
		}

		return subset;
	}
/*
can return a smaller subset than requested because one axiom can be
randomly picked more than once