com.sindicetech.siren.qparser.keyword.builders.AnyQueryNodeBuilder.java Source code

Introduction

Here is the source code for com.sindicetech.siren.qparser.keyword.builders.AnyQueryNodeBuilder.java

Source

/**
 * Copyright (c) 2014, Sindice Limited. All Rights Reserved.
 *
 * This file is part of the SIREn project.
 *
 * SIREn is a free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of
 * the License, or (at your option) any later version.
 *
 * SIREn is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public
 * License along with this program. If not, see <http://www.gnu.org/licenses/>.
 */
package com.sindicetech.siren.qparser.keyword.builders;

import java.util.List;

import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
import org.apache.lucene.queryparser.flexible.core.nodes.AnyQueryNode;
import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
import org.apache.lucene.search.BooleanClause;
import org.apache.lucene.search.BooleanQuery;
import org.apache.lucene.search.BooleanQuery.TooManyClauses;
import org.apache.lucene.search.Query;

/**
 * Builds a {@link BooleanQuery} of SHOULD clauses, possibly with
 * some minimum number to match.
 * 
 * @see BooleanQuery#setMinimumNumberShouldMatch(int)
 */
public class AnyQueryNodeBuilder implements KeywordQueryBuilder {

    public AnyQueryNodeBuilder() {
        // empty constructor
    }

    public BooleanQuery build(QueryNode queryNode) throws QueryNodeException {
        AnyQueryNode andNode = (AnyQueryNode) queryNode;

        BooleanQuery bQuery = new BooleanQuery();
        List<QueryNode> children = andNode.getChildren();

        if (children != null) {

            for (QueryNode child : children) {
                Object obj = child.getTag(QueryTreeBuilder.QUERY_TREE_BUILDER_TAGID);

                if (obj != null) {
                    Query query = (Query) obj;

                    try {
                        bQuery.add(query, BooleanClause.Occur.SHOULD);
                    } catch (TooManyClauses ex) {

                        throw new QueryNodeException(new MessageImpl(
                                /*
                                 * IQQQ.Q0028E_TOO_MANY_BOOLEAN_CLAUSES,
                                 * BooleanQuery.getMaxClauseCount()
                                 */
                                QueryParserMessages.EMPTY_MESSAGE), ex);

                    }

                }

            }

        }

        bQuery.setMinimumNumberShouldMatch(andNode.getMinimumMatchingElements());

        return bQuery;

    }

}