public  void add(FilterClause filterClause) 
{
		if (filterClause.getOccur().equals(Occur.MUST))
		{
			if(mustFilters==null)
			{
				mustFilters=new ArrayList();
			}
			mustFilters.add(filterClause.getFilter());
		}
		if (filterClause.getOccur().equals(Occur.SHOULD))
		{
			if(shouldFilters==null)
			{
				shouldFilters=new ArrayList();
			}
			shouldFilters.add(filterClause.getFilter());
		}
		if (filterClause.getOccur().equals(Occur.MUST_NOT))
		{
			if(notFilters==null)
			{
				notFilters=new ArrayList();
			}
			notFilters.add(filterClause.getFilter());
		}
}

Adds a new FilterClause to the Boolean Filter container

 public BitSet bits(IndexReader reader) throws IOException 
{
	               	 
		//create a new bitSet
		BitSet returnBits = null;
		//SHOULD filters
		if (shouldFilters!=null)
		{
			returnBits = ((Filter)shouldFilters.get(0)).bits(reader);
//			avoid changing the original bitset - it may be cached
			returnBits=(BitSet) returnBits.clone(); 
			if (shouldFilters.size()  > 1)
			{
				for (int i = 1; i <  shouldFilters.size(); i++)
				{
					returnBits.or(((Filter)shouldFilters.get(i)).bits(reader));
				}
			}
		}
		//NOT filters
		if (notFilters!=null)
		{
			for (int i = 0; i <  notFilters.size(); i++)
			{
				BitSet notBits=((Filter)notFilters.get(i)).bits(reader);
				if(returnBits==null)
				{
					returnBits=(BitSet) notBits.clone();					
					returnBits.flip(0,reader.maxDoc());
				}
				else
				{
					returnBits.andNot(notBits);
				}
			}
		}
		//MUST filters
		if (mustFilters!=null)
		{
			for (int i = 0; i <  mustFilters.size(); i++)
			{
				BitSet mustBits=((Filter)mustFilters.get(i)).bits(reader);
				if(returnBits==null)
				{
					if(mustFilters.size()==1)
					{
						returnBits=mustBits;
					}
					else
					{
						//don't mangle the bitset
						returnBits=(BitSet) mustBits.clone();						
					}
				}
				else
				{
					returnBits.and(mustBits);
				}
			}
		}
		if(returnBits==null)
		{
			returnBits=new BitSet(reader.maxDoc());
		}
		return returnBits;
}

Returns the a BitSet representing the Boolean composition of the filters that have been added.

 public boolean equals(Object obj) 
{
		if(this == obj)
			return true;
		if((obj == null) || (obj.getClass() != this.getClass()))
				return false;
		BooleanFilter test = (BooleanFilter)obj;
		return (notFilters == test.notFilters|| 
					 (notFilters!= null && notFilters.equals(test.notFilters)))
				&&
			   (mustFilters == test.mustFilters|| 
					 (mustFilters!= null && mustFilters.equals(test.mustFilters)))				 
					 &&
			   (shouldFilters == test.shouldFilters|| 
					 (shouldFilters!= null && shouldFilters.equals(test.shouldFilters)));
}

 public int hashCode() 
{
		int hash=7;
		hash = 31 * hash + (null == mustFilters ? 0 : mustFilters.hashCode());
		hash = 31 * hash + (null == notFilters ? 0 : notFilters.hashCode());
		hash = 31 * hash + (null == shouldFilters ? 0 : shouldFilters.hashCode());
		return hash;
}

 public String toString() 
{
		StringBuffer buffer = new StringBuffer();
		buffer.append("BooleanFilter(");
		appendFilters(shouldFilters, null, buffer);
		appendFilters(mustFilters, "+", buffer);
		appendFilters(notFilters, "-", buffer);
		buffer.append(")");
		return buffer.toString();
}

Prints a user-readable version of this query.