Tabnine Logo
Operations$PointTransitionSet
Code IndexAdd Tabnine to your IDE (free)

How to use
Operations$PointTransitionSet
in
org.apache.lucene.util.automaton

Best Java code snippets using org.apache.lucene.util.automaton.Operations$PointTransitionSet (Showing top 12 results out of 315)

origin: org.apache.lucene/lucene-core

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;
origin: org.apache.lucene/lucene-core

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;
 }
}
origin: harbby/presto-connectors

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;
origin: org.infinispan/infinispan-embedded-query

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;
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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;
origin: harbby/presto-connectors

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;
 }
}
origin: org.infinispan/infinispan-embedded-query

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;
 }
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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;
 }
}
origin: org.infinispan/infinispan-embedded-query

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}
origin: harbby/presto-connectors

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}
origin: org.apache.lucene/lucene-core

public void add(Transition t) {
 find(t.min).starts.add(t);
 find(1+t.max).ends.add(t);
}
org.apache.lucene.util.automatonOperations$PointTransitionSet

Most used methods

  • <init>
  • add
  • find
  • next
  • reset
  • sort

Popular in Java

  • Reading from database using SQL prepared statement
  • addToBackStack (FragmentTransaction)
  • startActivity (Activity)
  • onCreateOptionsMenu (Activity)
  • Menu (java.awt)
  • ByteBuffer (java.nio)
    A buffer for bytes. A byte buffer can be created in either one of the following ways: * #allocate
  • MessageFormat (java.text)
    Produces concatenated messages in language-neutral way. New code should probably use java.util.Forma
  • Vector (java.util)
    Vector is an implementation of List, backed by an array and synchronized. All optional operations in
  • Callable (java.util.concurrent)
    A task that returns a result and may throw an exception. Implementors define a single method with no
  • Collectors (java.util.stream)
  • CodeWhisperer alternatives
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now