public AndTerm(SearchTerm[] terms) 
{
        this.terms = terms;
}

Constructor for performing and AND across an arbitraty number of terms.

Parameters:

terms - the terms to AND together

 public AndTerm(SearchTerm a,
    SearchTerm b) 
{
        terms = new SearchTerm[]{a, b};
}

Constructor for performing a binary AND.

Parameters:

a - the first term

b - the second ter,

 public boolean equals(Object other) 
{
        if (other == this) return true;
        if (other instanceof AndTerm == false) return false;
        return Arrays.equals(terms, ((AndTerm) other).terms);
}

 public SearchTerm[] getTerms() 
{
        return terms;
}

Return the terms.

 public int hashCode() 
{
        int hash = 0;
        for (int i = 0; i <  terms.length; i++) {
            hash = hash * 37 + terms[i].hashCode();
        }
        return hash;
}

 public boolean match(Message message) 
{
        for (int i = 0; i <  terms.length; i++) {
            SearchTerm term = terms[i];
            if (!term.match(message)) {
                return false;
            }
        }
        return true;
}

Match by applying the terms, in order, to the Message and performing an AND operation to the result. Comparision will stop immediately if one of the terms returns false.