1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 1997-2007 Sun Microsystems, Inc. All rights reserved.
5 *
6 * The contents of this file are subject to the terms of either the GNU
7 * General Public License Version 2 only ("GPL") or the Common Development
8 * and Distribution License("CDDL") (collectively, the "License"). You
9 * may not use this file except in compliance with the License. You can obtain
10 * a copy of the License at https://glassfish.dev.java.net/public/CDDL+GPL.html
11 * or glassfish/bootstrap/legal/LICENSE.txt. See the License for the specific
12 * language governing permissions and limitations under the License.
13 *
14 * When distributing the software, include this License Header Notice in each
15 * file and include the License file at glassfish/bootstrap/legal/LICENSE.txt.
16 * Sun designates this particular file as subject to the "Classpath" exception
17 * as provided by Sun in the GPL Version 2 section of the License file that
18 * accompanied this code. If applicable, add the following below the License
19 * Header, with the fields enclosed by brackets [] replaced by your own
20 * identifying information: "Portions Copyrighted [year]
21 * [name of copyright owner]"
22 *
23 * Contributor(s):
24 *
25 * If you wish your version of this file to be governed by only the CDDL or
26 * only the GPL Version 2, indicate your decision by adding "[Contributor]
27 * elects to include this software in this distribution under the [CDDL or GPL
28 * Version 2] license." If you don't indicate a single choice of license, a
29 * recipient has the option to distribute your version of this file under
30 * either the CDDL, the GPL Version 2 or to extend the choice of license to
31 * its licensees as provided above. However, if you add GPL Version 2 code
32 * and therefore, elected the GPL Version 2 license, then the option applies
33 * only if the new code is made subject to such option by the copyright
34 * holder.
35 */
36
37 /*
38 * @(#)AndTerm.java 1.10 07/05/04
39 */
40
41 package javax.mail.search;
42
43 import javax.mail.Message;
44
45 /**
46 * This class implements the logical AND operator on individual
47 * SearchTerms.
48 *
49 * @author Bill Shannon
50 * @author John Mani
51 */
52 public final class AndTerm extends SearchTerm {
53
54 /**
55 * The array of terms on which the AND operator should be
56 * applied.
57 *
58 * @serial
59 */
60 protected SearchTerm[] terms;
61
62 private static final long serialVersionUID = -3583274505380989582L;
63
64 /**
65 * Constructor that takes two terms.
66 *
67 * @param t1 first term
68 * @param t2 second term
69 */
70 public AndTerm(SearchTerm t1, SearchTerm t2) {
71 terms = new SearchTerm[2];
72 terms[0] = t1;
73 terms[1] = t2;
74 }
75
76 /**
77 * Constructor that takes an array of SearchTerms.
78 *
79 * @param t array of terms
80 */
81 public AndTerm(SearchTerm[] t) {
82 terms = new SearchTerm[t.length]; // clone the array
83 for (int i = 0; i < t.length; i++)
84 terms[i] = t[i];
85 }
86
87 /**
88 * Return the search terms.
89 */
90 public SearchTerm[] getTerms() {
91 return (SearchTerm[])terms.clone();
92 }
93
94 /**
95 * The AND operation. <p>
96 *
97 * The terms specified in the constructor are applied to
98 * the given object and the AND operator is applied to their results.
99 *
100 * @param msg The specified SearchTerms are applied to this Message
101 * and the AND operator is applied to their results.
102 * @return true if the AND succeds, otherwise false
103 */
104 public boolean match(Message msg) {
105 for (int i=0; i < terms.length; i++)
106 if (!terms[i].match(msg))
107 return false;
108 return true;
109 }
110
111 /**
112 * Equality comparison.
113 */
114 public boolean equals(Object obj) {
115 if (!(obj instanceof AndTerm))
116 return false;
117 AndTerm at = (AndTerm)obj;
118 if (at.terms.length != terms.length)
119 return false;
120 for (int i=0; i < terms.length; i++)
121 if (!terms[i].equals(at.terms[i]))
122 return false;
123 return true;
124 }
125
126 /**
127 * Compute a hashCode for this object.
128 */
129 public int hashCode() {
130 int hash = 0;
131 for (int i=0; i < terms.length; i++)
132 hash += terms[i].hashCode();
133 return hash;
134 }
135 }
Save This Page