Exercise32_3.java

public static int[][] computeLevenshtein(List<String> wordList, boolean parallel) {
  final int LIST_SIZE = wordList.size();
  int[][] distances = new int[LIST_SIZE][LIST_SIZE];

  IntStream range = range(0, LIST_SIZE * LIST_SIZE);

  if (parallel) {
      range.parallel();
  }

  range.forEach(value -> {
      int i = value % LIST_SIZE;
      int j = value / LIST_SIZE;
      distances[i][j] = lev(wordList.get(i), wordList.get(j));
  });

  return distances;
}

Exercise32_3_orig.java

public static int[][] computeLevenshtein(List<String> wordList, boolean parallel) {
  final int LIST_SIZE = wordList.size();
  int[][] distances = new int[LIST_SIZE][LIST_SIZE];

  IntStream iRange = range(0, LIST_SIZE);

  if (parallel) {
      iRange.parallel();
  }

  iRange.forEach(i -> {
      IntStream range = range(0, LIST_SIZE);
      if (parallel) {
          range.parallel();
      }
      range.forEach(j -> distances[i][j] = lev(wordList.get(i), wordList.get(j)));
  });

  return distances;
}