Examples of org.apache.lucene.queryParser.core.nodes.TokenizedPhraseQueryNode

Package org.apache.lucene.queryParser.core.nodes

Examples of org.apache.lucene.queryParser.core.nodes.TokenizedPhraseQueryNode

org.apache.lucene.queryParser.core.nodes.TokenizedPhraseQueryNode
A {@link TokenizedPhraseQueryNode} represents a node created by a code thattokenizes/lemmatizes/analyzes.


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.term();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.toString();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.toString();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.toString();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here

  public PhraseQueryNodeBuilder() {
    // empty constructor
  }


  public PhraseQuery build(QueryNode queryNode) throws QueryNodeException {
    TokenizedPhraseQueryNode phraseNode = (TokenizedPhraseQueryNode) queryNode;


    PhraseQuery phraseQuery = new PhraseQuery();


    List<QueryNode> children = phraseNode.getChildren();


    if (children != null) {


      for (QueryNode child : children) {
        TermQuery termQuery = (TermQuery) child

View Full Code Here


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.term();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here


        }


      } else {


        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();


        int position = -1;


        for (int i = 0; i < numTokens; i++) {
          String term = null;
          int positionIncrement = 1;


          try {
            boolean hasNext = buffer.incrementToken();
            assert hasNext == true;
            term = termAtt.toString();


            if (posIncrAtt != null) {
              positionIncrement = posIncrAtt.getPositionIncrement();
            }


          } catch (IOException e) {
            // safe to ignore, because we know the number of tokens
          }


          FieldQueryNode newFieldNode = new FieldQueryNode(field, term, -1, -1);


          if (this.positionIncrementsEnabled) {
            position += positionIncrement;
            newFieldNode.setPositionIncrement(position);


          } else {
            newFieldNode.setPositionIncrement(i);
          }


          pq.add(newFieldNode);


        }


        return pq;

View Full Code Here

TOP

Related Classes of org.apache.lucene.queryParser.core.nodes.TokenizedPhraseQueryNode

org.apache.lucene.queryParser.standard.builders.PhraseQueryNodeBuilder

org.apache.lucene.queryParser.standard.processors.AnalyzerQueryNodeProcessor

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.