How to use

SortedIntSet

in

org.apache.lucene.util.automaton

final SortedIntSet statesSet = new SortedIntSet(5);
   assert lastPoint != -1;
   statesSet.computeHash();
     throw new TooComplexToDeterminizeException(a, maxDeterminizedStates);
    final SortedIntSet.FrozenIntSet p = statesSet.freeze(q);
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.decr(dest);
   accCount -= a.isAccept(dest) ? 1:0;
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.incr(dest);
   accCount += a.isAccept(dest) ? 1:0;

final SortedIntSet statesSet = new SortedIntSet(5);
   assert lastPoint != -1;
   statesSet.computeHash();
     throw new TooComplexToDeterminizeException(a, maxDeterminizedStates);
    final SortedIntSet.FrozenIntSet p = statesSet.freeze(q);
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.decr(dest);
   accCount -= a.isAccept(dest) ? 1:0;
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.incr(dest);
   accCount += a.isAccept(dest) ? 1:0;

final SortedIntSet statesSet = new SortedIntSet(5);
   assert lastPoint != -1;
   statesSet.computeHash();
     throw new TooComplexToDeterminizeException(a, maxDeterminizedStates);
    final SortedIntSet.FrozenIntSet p = statesSet.freeze(q);
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.decr(dest);
   accCount -= a.isAccept(dest) ? 1:0;
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.incr(dest);
   accCount += a.isAccept(dest) ? 1:0;

final SortedIntSet statesSet = new SortedIntSet(5);
   assert lastPoint != -1;
   statesSet.computeHash();
     throw new TooComplexToDeterminizeException(a, maxDeterminizedStates);
    final SortedIntSet.FrozenIntSet p = statesSet.freeze(q);
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.decr(dest);
   accCount -= a.isAccept(dest) ? 1:0;
  for(int j=0;j<limit;j+=3) {
   int dest = transitions[j];
   statesSet.incr(dest);
   accCount += a.isAccept(dest) ? 1:0;