Match match(aRule, aInstantiation); if (mMatches) { return PL_HashTableLookup(mMatches, &match) != 0; } else { ConstIterator last = Last(); for (ConstIterator i = First(); i != last; ++i) { if (*i == match) return PR_TRUE; }
for (PRInt32 i = mCount - 1; i >= 0; --i) { if (mProperties[i] == aProperty) return PR_TRUE;
MatchSet::Contains(const Rule* aRule, const Instantiation& aInstantiation) const{    Match match(aRule, aInstantiation);    if (mMatches) {        return PL_HashTableLookup(mMatches, &match) != 0;    }    else {        ConstIterator last = Last();        for (ConstIterator i = First(); i != last; ++i) {            if (*i == match)                return PR_TRUE;        }    }    return PR_FALSE;}