001    /*
002     * Licensed to the Apache Software Foundation (ASF) under one
003     * or more contributor license agreements.  See the NOTICE file
004     * distributed with this work for additional information
005     * regarding copyright ownership.  The ASF licenses this file
006     * to you under the Apache License, Version 2.0 (the
007     * "License"); you may not use this file except in compliance
008     * with the License.  You may obtain a copy of the License at
009     *
010     *  http://www.apache.org/licenses/LICENSE-2.0
011     *
012     * Unless required by applicable law or agreed to in writing,
013     * software distributed under the License is distributed on an
014     * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
015     * KIND, either express or implied.  See the License for the
016     * specific language governing permissions and limitations
017     * under the License.
018     */
019    
020    package javax.mail.search;
021    
022    import java.util.Arrays;
023    import javax.mail.Message;
024    
025    /**
026     * Term that implements a logical AND across terms.
027     *
028     * @version $Rev: 467553 $ $Date: 2006-10-25 00:01:51 -0400 (Wed, 25 Oct 2006) $
029     */
030    public final class AndTerm extends SearchTerm {
031        /**
032         * Terms to which the AND operator should be applied.
033         */
034        protected SearchTerm[] terms;
035    
036        /**
037         * Constructor for performing a binary AND.
038         *
039         * @param a the first term
040         * @param b the second ter,
041         */
042        public AndTerm(SearchTerm a, SearchTerm b) {
043            terms = new SearchTerm[]{a, b};
044        }
045    
046        /**
047         * Constructor for performing and AND across an arbitraty number of terms.
048         * @param terms the terms to AND together
049         */
050        public AndTerm(SearchTerm[] terms) {
051            this.terms = terms;
052        }
053    
054        /**
055         * Return the terms.
056         * @return the terms
057         */
058        public SearchTerm[] getTerms() {
059            return terms;
060        }
061    
062        /**
063         * Match by applying the terms, in order, to the Message and performing an AND operation
064         * to the result. Comparision will stop immediately if one of the terms returns false.
065         *
066         * @param message the Message to apply the terms to
067         * @return true if all terms match
068         */
069        public boolean match(Message message) {
070            for (int i = 0; i < terms.length; i++) {
071                SearchTerm term = terms[i];
072                if (!term.match(message)) {
073                    return false;
074                }
075            }
076            return true;
077        }
078    
079        public boolean equals(Object other) {
080            if (other == this) return true;
081            if (other instanceof AndTerm == false) return false;
082            return Arrays.equals(terms, ((AndTerm) other).terms);
083        }
084    
085        public int hashCode() {
086            int hash = 0;
087            for (int i = 0; i < terms.length; i++) {
088                hash = hash * 37 + terms[i].hashCode();
089            }
090            return hash;
091        }
092    }