static LS reTok_multi(LS tok, L<IntRange> places) {

  if (empty(places)) ret tok;

  if (l(places) == 1) ret reTok(tok, first(places));

  L<S> orig = cloneList(tok); // copy to orig

  // sort, extend & merge ranges

  sortIntRangesInPlace(places);

  new L<IntRange> places2;

  for (IntRange p : places) {

    p = intRange(p.start & ~1, p.end | 1); // extend to N-to-N

    if (nempty(places2) && p.start <= last(places2).end)

      last(places2).end = p.end; // merge if overlapping

    else

      places2.add(p);

  }

  ifdef reTok_multi_debug

    printStruct("places: ", places2);

  endifdef

  int iPlace = 0, n = l(orig);

  IntRange p = get(places2, iPlace);

  int next = p.start, i = next;

  tok.subList(next, tok.size()).clear();

  while (i < n)

    if (i < next)

      tok.add(orig.get(i++));

    else {

      int j = p.end;

      S s = joinSubList(orig, i, j);

      ifdef reTok_multi_debug

        printStruct("retokking: ", s);

      endifdef

      tok.addAll(javaTok(s));

      i = j;

      p = get(places2, ++iPlace);

      if (p == null) break;

      next = p.start;

    }

  while (i < n)

    tok.add(orig.get(i++));

  ifdef reTok_multi_check

    LS correct = javaTok(join(orig));

    if (neq(correct, tok)) {

      n = min(l(correct), l(tok));

      if (l(correct) != l(tok)) print("reTok_multi_check: size difference " + l(correct) + " / " + l(tok));

      for ii to n:

        if (!eq(tok.get(ii), correct.get(ii))) {

          for (int j = max(0, ii-1); j < min(n, ii+1); j++)

            print("reTok_multi_check diff @ " + j + "/" + n + ": " + quote(correct.get(j)) + " / " + quote(tok.get(j)));

          break;

        }

      fail("reTok_multi_check");

    }

  endifdef

  ret tok;

}