How to use

next

method

in

org.apache.lucene.util.automaton.Operations$PointTransitionSet

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;
 }
}

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;
 }
}