Java tutorial
/* Copyright 2008 Flaptor (flaptor.com) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */ package com.flaptor.hounder.searcher.query; import java.io.Serializable; import org.apache.lucene.search.BooleanClause; import org.apache.lucene.search.BooleanQuery; /** * @author Flaptor Development Team */ public final class AndQuery extends ABinaryOperator implements Serializable { private static final long serialVersionUID = 1L; public AndQuery(final AQuery lt, final AQuery rt) { super(lt, rt); } public AndQuery(final float boost, final AQuery lt, final AQuery rt) { super(boost, lt, rt); } @Override public org.apache.lucene.search.Query getLuceneQuery() { BooleanQuery bq = new BooleanQuery(); if (leftTerm instanceof AndQuery) { for (BooleanClause bc : ((BooleanQuery) leftTerm.getLuceneQuery()).getClauses()) { bq.add(bc); } } else { bq.add(leftTerm.getLuceneQuery(), BooleanClause.Occur.MUST); } if (rightTerm instanceof AndQuery) { for (BooleanClause bc : ((BooleanQuery) rightTerm.getLuceneQuery()).getClauses()) { bq.add(bc); } } else { bq.add(rightTerm.getLuceneQuery(), BooleanClause.Occur.MUST); } bq.setBoost(boost); return bq; } @Override public String toString() { return "( " + leftTerm.toString() + " ) AND ( " + rightTerm.toString() + " );boost: " + boost; } /** * Implements a very simple equality that considers a AND b = b AND a */ @Override public boolean equals(final Object obj) { if (!super.equals(obj)) { return false; } ABinaryOperator bq = (ABinaryOperator) obj; if (leftTerm.equals(bq.leftTerm) && rightTerm.equals(bq.rightTerm)) { return true; } else if (leftTerm.equals(bq.rightTerm) && rightTerm.equals(bq.leftTerm)) { return true; } else { return false; } } @Override public int hashCode() { int hash = super.hashCode() ^ leftTerm.hashCode() ^ rightTerm.hashCode(); return hash; } }