How to use

firstPosition

method

in

org.apache.lucene.search.PhrasePositions

/** move all PPs to their first position */
private void placeFirstPositions() throws IOException {
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
 }
}

/** no repeats: simplest case, and most common. It is important to keep this piece of the code simple and efficient */
private void initSimple() throws IOException {
 //System.err.println("initSimple: doc: "+min.doc);
 pq.clear();
 // position pps and build queue from list
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
  if (pp.position > end) {
   end = pp.position;
  }
  pq.add(pp);
 }
}

/** move all PPs to their first position */
private void placeFirstPositions() throws IOException {
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
 }
}

/** move all PPs to their first position */
private void placeFirstPositions() throws IOException {
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
 }
}

/** move all PPs to their first position */
private void placeFirstPositions() throws IOException {
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
 }
}

/** no repeats: simplest case, and most common. It is important to keep this piece of the code simple and efficient */
private void initSimple() throws IOException {
 //System.err.println("initSimple: doc: "+min.doc);
 pq.clear();
 // position pps and build queue from list
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
  if (pp.position > end) {
   end = pp.position;
  }
  pq.add(pp);
 }
}

/** no repeats: simplest case, and most common. It is important to keep this piece of the code simple and efficient */
private void initSimple() throws IOException {
 //System.err.println("initSimple: doc: "+min.doc);
 pq.clear();
 // position pps and build queue from list
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
  if (pp.position > end) {
   end = pp.position;
  }
  pq.add(pp);
 }
}

/** no repeats: simplest case, and most common. It is important to keep this piece of the code simple and efficient */
private void initSimple() throws IOException {
 //System.err.println("initSimple: doc: "+min.doc);
 pq.clear();
 // position pps and build queue from list
 for (PhrasePositions pp : phrasePositions) {
  pp.firstPosition();
  if (pp.position > end) {
   end = pp.position;
  }
  pq.add(pp);
 }
}

  pp.firstPosition();
  if (pp.position > end)
    end = pp.position;
pp.firstPosition();

  pp.firstPosition();
  if (pp.position > end)
    end = pp.position;
pp.firstPosition();

 protected final float phraseFreq() throws IOException {
  // sort list with pq
  for (PhrasePositions pp = first; pp != null; pp = pp.next) {
   pp.firstPosition();
   pq.put(pp);                  // build pq from list
  }
  pqToList();                      // rebuild list from pq

  int freq = 0;
  do {					  // find position w/ all terms
   while (first.position < last.position) {	  // scan forward in first
  do {
   if (!first.nextPosition())
    return (float)freq;
  } while (first.position < last.position);
  firstToLast();
   }
   freq++;                      // all equal: a match
  } while (last.nextPosition());
 
  return (float)freq;
 }
}

 protected final float phraseFreq() throws IOException {
  // sort list with pq
  pq.clear();
  for (PhrasePositions pp = first; pp != null; pp = pp.next) {
   pp.firstPosition();
   pq.put(pp);                  // build pq from list
  }
  pqToList();                      // rebuild list from pq

  // for counting how many times the exact phrase is found in current document,
  // just count how many times all PhrasePosition's have exactly the same position.   
  int freq = 0;
  do {					  // find position w/ all terms
   while (first.position < last.position) {	  // scan forward in first
    do {
     if (!first.nextPosition())
      return (float)freq;
    } while (first.position < last.position);
     firstToLast();
   }
   freq++;                      // all equal: a match
  } while (last.nextPosition());
 
  return (float)freq;
 }
}

 protected final float phraseFreq() throws IOException {
  // sort list with pq
  pq.clear();
  for (PhrasePositions pp = first; pp != null; pp = pp.next) {
   pp.firstPosition();
   pq.put(pp);                  // build pq from list
  }
  pqToList();                      // rebuild list from pq

  // for counting how many times the exact phrase is found in current document,
  // just count how many times all PhrasePosition's have exactly the same position.   
  int freq = 0;
  do {					  // find position w/ all terms
   while (first.position < last.position) {	  // scan forward in first
    do {
     if (!first.nextPosition())
      return (float)freq;
    } while (first.position < last.position);
     firstToLast();
   }
   freq++;                      // all equal: a match
  } while (last.nextPosition());
 
  return (float)freq;
 }
}

int end = 0;
for (PhrasePositions pp = first; pp != null; pp = pp.next) {
  pp.firstPosition();
  if (pp.position > end)
    end = pp.position;