Loading src/libnptm/Configuration.cpp +3 −3 Original line number Original line Diff line number Diff line Loading @@ -1598,8 +1598,8 @@ int *check_overlaps( } } } } } } int *vec_overlaps = new int[1 + num_overlaps]; int *vec_overlaps = new int[1 + 2 * num_overlaps]; vec_overlaps[0] = num_overlaps / 2; // we do not count symmetric overlaps vec_overlaps[0] = num_overlaps; int last_index = 1; int last_index = 1; for (int si = 0; si < nn; si++) { for (int si = 0; si < nn; si++) { if (index_matrix[si] != 0) { if (index_matrix[si] != 0) { Loading @@ -1608,7 +1608,7 @@ int *check_overlaps( if (i0 != i1) { if (i0 != i1) { vec_overlaps[last_index++] = i0 + 1; vec_overlaps[last_index++] = i0 + 1; vec_overlaps[last_index++] = i1 + 1; vec_overlaps[last_index++] = i1 + 1; if (last_index > num_overlaps) break; // for loop if (last_index > 2 * num_overlaps) break; // for loop } } } } } } Loading Loading
src/libnptm/Configuration.cpp +3 −3 Original line number Original line Diff line number Diff line Loading @@ -1598,8 +1598,8 @@ int *check_overlaps( } } } } } } int *vec_overlaps = new int[1 + num_overlaps]; int *vec_overlaps = new int[1 + 2 * num_overlaps]; vec_overlaps[0] = num_overlaps / 2; // we do not count symmetric overlaps vec_overlaps[0] = num_overlaps; int last_index = 1; int last_index = 1; for (int si = 0; si < nn; si++) { for (int si = 0; si < nn; si++) { if (index_matrix[si] != 0) { if (index_matrix[si] != 0) { Loading @@ -1608,7 +1608,7 @@ int *check_overlaps( if (i0 != i1) { if (i0 != i1) { vec_overlaps[last_index++] = i0 + 1; vec_overlaps[last_index++] = i0 + 1; vec_overlaps[last_index++] = i1 + 1; vec_overlaps[last_index++] = i1 + 1; if (last_index > num_overlaps) break; // for loop if (last_index > 2 * num_overlaps) break; // for loop } } } } } } Loading