View Javadoc

1   /*
2    * Licensed to the Apache Software Foundation (ASF) under one
3    * or more contributor license agreements.  See the NOTICE file
4    * distributed with this work for additional information
5    * regarding copyright ownership.  The ASF licenses this file
6    * to you under the Apache License, Version 2.0 (the
7    * "License"); you may not use this file except in compliance
8    * with the License.  You may obtain a copy of the License at
9    *
10   *  http://www.apache.org/licenses/LICENSE-2.0
11   *
12   * Unless required by applicable law or agreed to in writing,
13   * software distributed under the License is distributed on an
14   * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15   * KIND, either express or implied.  See the License for the
16   * specific language governing permissions and limitations
17   * under the License.
18   */
19  
20  package javax.mail.search;
21  
22  import java.util.Arrays;
23  import javax.mail.Message;
24  
25  /**
26   * @version $Rev: 467553 $ $Date: 2006-10-25 00:01:51 -0400 (Wed, 25 Oct 2006) $
27   */
28  public final class OrTerm extends SearchTerm {
29      protected SearchTerm[] terms;
30  
31      public OrTerm(SearchTerm a, SearchTerm b) {
32          terms = new SearchTerm[]{a, b};
33      }
34  
35      public OrTerm(SearchTerm[] terms) {
36          this.terms = terms;
37      }
38  
39      public SearchTerm[] getTerms() {
40          return terms;
41      }
42  
43      public boolean match(Message message) {
44          for (int i = 0; i < terms.length; i++) {
45              SearchTerm term = terms[i];
46              if (term.match(message)) {
47                  return true;
48              }
49          }
50          return false;
51      }
52  
53      public boolean equals(Object other) {
54          if (other == this) return true;
55          if (other instanceof OrTerm == false) return false;
56          return Arrays.equals(terms, ((OrTerm) other).terms);
57      }
58  
59      public int hashCode() {
60          int hash = 0;
61          for (int i = 0; i < terms.length; i++) {
62              hash = hash * 37 + terms[i].hashCode();
63          }
64          return hash;
65      }
66  }