Package org.apache.lucene.search

Examples of org.apache.lucene.search.BooleanClause

96
97
98
99
100
101
102
103
104
105
106
    if(strict) {
      super.addClause(clauses, conj, mods, q);
      return;
    }
    if(clauses.size() == 0) {
      clauses.add(new BooleanClause(new BooleanQuery(), BooleanClause.Occur.SHOULD));
    }
    if(q instanceof TermQuery) {
      Term t = ((TermQuery)q).getTerm();
      if(t.field().equals("txt")) {
        String queryText = t.text();
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
  }
 
  private Query mergeQueries(Query q1, Query q2) {
    if(q2 != null) {
      BooleanQuery bq = new BooleanQuery();
      bq.add(new BooleanClause(q2, Occur.SHOULD));
      bq.add(new BooleanClause(q1, Occur.SHOULD));
      q1 = bq;
    }
    return q1;
  }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
  private Query expandTerm(String term) {
    BooleanQuery bq = new BooleanQuery();
    Set<String> myOntIDs = OBOOntology.getInstance().getIdsForTermWithDescendants(term);
    if(myOntIDs != null && myOntIDs.size() > 0) {
      OntologyQuery oq = new OntologyQuery(myOntIDs);
      bq.add(new BooleanClause(oq.getLuceneQuery(), Occur.SHOULD));
    }
    Matcher m = similarPattern.matcher(term);
    try {
      if(m.matches()) {
        String name = m.group(3);
        String smiles = lis.getSmilesFromName(name);
        ChemQuery cq = lis.makeChemQueryFromSMILES(smiles, "similarity", m.group(1));
        bq.add(new BooleanClause(cq.getLuceneQuery(), BooleanClause.Occur.SHOULD));
      } else {
        String inchi = lis.getInchiFromName(term);
        if(inchi != null) {
          bq.add(new BooleanClause(new TermQuery(new Term("InChI", inchi)), BooleanClause.Occur.SHOULD));
        }
      }     
    } catch (Exception e) {
      e.printStackTrace();
      return null;
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
    setToSearch();
    VectorCollector vc = new VectorCollector();
    BitSet fp = fingerprinter.getFingerprint(queryMol);
    BooleanQuery bq = new BooleanQuery();
    for(int i=fp.nextSetBit(0); i>=0; i=fp.nextSetBit(i+1)) {
      bq.add(new BooleanClause(new TermQuery(new Term("FP", Integer.toString(i))), BooleanClause.Occur.MUST));
    }
    indexSearcher.search(bq, vc);
    List<Integer> bestResults = vc.hitsByScore();
    VectorCollector newVc = new VectorCollector();
    IndexReader ir = indexSearcher.getIndexReader();
View Full Code Here
235
236
237
238
239
240
241
242
243
244
245
    setToSearch();
    VectorCollector vc = new VectorCollector();
    BitSet fp = fingerprinter.getFingerprint(queryMol);
    BooleanQuery bq = new BooleanQuery();
    for(int i=fp.nextSetBit(0); i>=0; i=fp.nextSetBit(i+1)) {
      bq.add(new BooleanClause(new TermQuery(new Term("FP", Integer.toString(i))), BooleanClause.Occur.MUST));
    }
    indexSearcher.search(bq, vc);
    List<Integer> bestResults = vc.hitsByScore();
    VectorCollector newVc = new VectorCollector();
    IndexReader ir = indexSearcher.getIndexReader();
View Full Code Here
265
266
267
268
269
270
271
272
273
274
275
    setToSearch();
    VectorCollector vc = new VectorCollector();
    BitSet fp = fingerprinter.getFingerprint(queryMol);
    BooleanQuery bq = new BooleanQuery();
    for(int i=fp.nextSetBit(0); i>=0; i=fp.nextSetBit(i+1)) {
      bq.add(new BooleanClause(new TermQuery(new Term("FP", Integer.toString(i))), BooleanClause.Occur.SHOULD));
    }
    indexSearcher.search(bq, vc);
    List<Integer> bestResults = vc.hitsByScore();
    VectorCollector newVc = new VectorCollector();
    for(Integer i : bestResults) {
View Full Code Here
27
28
29
30
31
32
33
34
    bq = new BooleanQuery();
    for(String inchi : inchis.keySet()) {
      TermQuery tq = new TermQuery(new Term("InChI", inchi));
      tq.setBoost(inchis.get(inchi));
      /* We need *at least one of* these */
      bq.add(new BooleanClause(tq, BooleanClause.Occur.SHOULD));
    }
  }
View Full Code Here
127
128
129
130
131
132
133
134
135
      }
      else {
        this.exclude = new BooleanClause[exclude.size()];
        for( int i=0; i<exclude.size(); i++ ) {
          TermQuery tq = new TermQuery( new Term( idField, exclude.get(i) ) );
          this.exclude[i] = new BooleanClause( tq, BooleanClause.Occur.MUST_NOT );
        }
      }
    }
View Full Code Here
264
265
266
267
268
269
270
     * Add a clause to a boolean query.
     */
    private static void add(BooleanQuery q, String name, String value, float boost) {
        Query tq = new TermQuery(new Term(name, value));
        tq.setBoost(boost);
        q.add(new BooleanClause(tq, BooleanClause.Occur.SHOULD));
    }
View Full Code Here
268
269
270
271
272
273
274
        tq.setBoost(boost);
        q.add(new BooleanClause(tq, BooleanClause.Occur.SHOULD));
    }

    private static void add(BooleanQuery q, String name, String value, Occur occur) {
        q.add(new BooleanClause(new TermQuery(new Term(name, value)), occur));
    }
View Full Code Here
TOP

Related Classes of org.apache.lucene.search.BooleanClause

  • com.browseengine.bobo.test.ProtoBufConvertTest
  • com.esri.gpt.catalog.lucene.QueryProvider
  • com.flaptor.hounder.searcher.spell.SpellChecker
  • com.gentics.cr.lucene.search.query.BooleanQueryRewriter
  • com.thinkgem.jeesite.modules.cms.service.ArticleService
  • com.thinkgem.jeesite.modules.cms.service.GuestbookService
  • in.partake.service.impl.LuceneService
  • net.nutch.searcher.LuceneQueryOptimizer
  • org.apache.blur.lucene.search.SuperParserTest
  • org.apache.blur.lucene.serializer.BooleanClauseWritable
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.