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: 920714 $ $Date: 2010-03-09 01:55:49 -0500 (Tue, 09 Mar 2010) $
029     */
030    public final class AndTerm extends SearchTerm {
031            
032            private static final long serialVersionUID = -3583274505380989582L;
033            
034        /**
035         * Terms to which the AND operator should be applied.
036         */
037        protected SearchTerm[] terms;
038    
039        /**
040         * Constructor for performing a binary AND.
041         *
042         * @param a the first term
043         * @param b the second ter,
044         */
045        public AndTerm(SearchTerm a, SearchTerm b) {
046            terms = new SearchTerm[]{a, b};
047        }
048    
049        /**
050         * Constructor for performing and AND across an arbitraty number of terms.
051         * @param terms the terms to AND together
052         */
053        public AndTerm(SearchTerm[] terms) {
054            this.terms = terms;
055        }
056    
057        /**
058         * Return the terms.
059         * @return the terms
060         */
061        public SearchTerm[] getTerms() {
062            return terms;
063        }
064    
065        /**
066         * Match by applying the terms, in order, to the Message and performing an AND operation
067         * to the result. Comparision will stop immediately if one of the terms returns false.
068         *
069         * @param message the Message to apply the terms to
070         * @return true if all terms match
071         */
072        public boolean match(Message message) {
073            for (int i = 0; i < terms.length; i++) {
074                SearchTerm term = terms[i];
075                if (!term.match(message)) {
076                    return false;
077                }
078            }
079            return true;
080        }
081    
082        public boolean equals(Object other) {
083            if (other == this) return true;
084            if (other instanceof AndTerm == false) return false;
085            return Arrays.equals(terms, ((AndTerm) other).terms);
086        }
087    
088        public int hashCode() {
089            int hash = 0;
090            for (int i = 0; i < terms.length; i++) {
091                hash = hash * 37 + terms[i].hashCode();
092            }
093            return hash;
094        }
095    }