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