How to use

Operations$PointTransitionSet

in

org.apache.lucene.util.automaton

final PointTransitionSet points = new PointTransitionSet();
  for(int j=0;j<numTransitions;j++) {
   a.getNextTransition(t);
   points.add(t);
 points.sort();
  points.points[i].starts.next = 0;
 points.reset();
 assert statesSet.upto == 0: "upto=" + statesSet.upto;

private PointTransitions find(int point) {
 if (useHash) {
  final Integer pi = point;
  PointTransitions p = map.get(pi);
  if (p == null) {
   p = next(point);
   map.put(pi, p);
  }
  return p;
 } else {
  for(int i=0;i<count;i++) {
   if (points[i].point == point) {
    return points[i];
   }
  }
  final PointTransitions p = next(point);
  if (count == HASHMAP_CUTOVER) {
   // switch to HashMap on the fly
   assert map.size() == 0;
   for(int i=0;i<count;i++) {
    map.put(points[i].point, points[i]);
   }
   useHash = true;
  }
  return p;
 }
}

final PointTransitionSet points = new PointTransitionSet();
  for(int j=0;j<numTransitions;j++) {
   a.getNextTransition(t);
   points.add(t);
 points.sort();
  points.points[i].starts.next = 0;
 points.reset();
 assert statesSet.upto == 0: "upto=" + statesSet.upto;

final PointTransitionSet points = new PointTransitionSet();
  for(int j=0;j<numTransitions;j++) {
   a.getNextTransition(t);
   points.add(t);
 points.sort();
  points.points[i].starts.next = 0;
 points.reset();
 assert statesSet.upto == 0: "upto=" + statesSet.upto;

final PointTransitionSet points = new PointTransitionSet();
  for(int j=0;j<numTransitions;j++) {
   a.getNextTransition(t);
   points.add(t);
 points.sort();
  points.points[i].starts.next = 0;
 points.reset();
 assert statesSet.upto == 0: "upto=" + statesSet.upto;

private PointTransitions find(int point) {
 if (useHash) {
  final Integer pi = point;
  PointTransitions p = map.get(pi);
  if (p == null) {
   p = next(point);
   map.put(pi, p);
  }
  return p;
 } else {
  for(int i=0;i<count;i++) {
   if (points[i].point == point) {
    return points[i];
   }
  }
  final PointTransitions p = next(point);
  if (count == HASHMAP_CUTOVER) {
   // switch to HashMap on the fly
   assert map.size() == 0;
   for(int i=0;i<count;i++) {
    map.put(points[i].point, points[i]);
   }
   useHash = true;
  }
  return p;
 }
}

private PointTransitions find(int point) {
 if (useHash) {
  final Integer pi = point;
  PointTransitions p = map.get(pi);
  if (p == null) {
   p = next(point);
   map.put(pi, p);
  }
  return p;
 } else {
  for(int i=0;i<count;i++) {
   if (points[i].point == point) {
    return points[i];
   }
  }
  final PointTransitions p = next(point);
  if (count == HASHMAP_CUTOVER) {
   // switch to HashMap on the fly
   assert map.size() == 0;
   for(int i=0;i<count;i++) {
    map.put(points[i].point, points[i]);
   }
   useHash = true;
  }
  return p;
 }
}

private PointTransitions find(int point) {
 if (useHash) {
  final Integer pi = point;
  PointTransitions p = map.get(pi);
  if (p == null) {
   p = next(point);
   map.put(pi, p);
  }
  return p;
 } else {
  for(int i=0;i<count;i++) {
   if (points[i].point == point) {
    return points[i];
   }
  }
  final PointTransitions p = next(point);
  if (count == HASHMAP_CUTOVER) {
   // switch to HashMap on the fly
   assert map.size() == 0;
   for(int i=0;i<count;i++) {
    map.put(points[i].point, points[i]);
   }
   useHash = true;
  }
  return p;
 }
}

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}