package it.unimi.dsi.mg4j.query.nodes;/*		  * MG4J: Managing Gigabytes for Java * * Copyright (C) 2006-2007 Sebastiano Vigna  * *  This library is free software; you can redistribute it and/or modify it *  under the terms of the GNU Lesser General Public License as published by the Free *  Software Foundation; either version 2.1 of the License, or (at your option) *  any later version. * *  This library is distributed in the hope that it will be useful, but *  WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *  or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License *  for more details. * *  You should have received a copy of the GNU Lesser General Public License *  along with this program; if not, write to the Free Software *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * */import java.util.Arrays;import it.unimi.dsi.mg4j.search.ConsecutiveDocumentIterator;/** A node representing the consecutive composition of the underlying queries. *  * @author Sebastiano Vigna */public class Consecutive extends Composite {	/** The gap array for this consecutive composition, or <code>null</code> for no gaps (see {@link ConsecutiveDocumentIterator}). */	public final int[] gap;		public Consecutive( final Query... query ) {		super( query );		gap = null;	}	public Consecutive( final Query[] query, final int[] gap ) {		super( query );		this.gap = gap;	}	public String toString() {		return super.toString( "\"", "\"", " " ) + ( gap == null ? "" : Arrays.toString( gap ) );	}		public <T> T accept( final QueryBuilderVisitor<T> visitor ) throws QueryBuilderVisitorException {		if ( ! visitor.visitPre( this ) ) return null;		final T[] result = visitor.newArray( query.length );		for( int i = 0; i < query.length; i++ ) if ( ( result[ i ] = query[ i ].accept( visitor ) ) == null ) return null;		return visitor.visitPost( this, result );	}	public boolean equals( final Object o ) {		if ( ! ( o instanceof Consecutive ) ) return false;		return Arrays.equals( query, ((Consecutive)o).query );	}		public int hashCode() {		return Arrays.hashCode( query ) ^ getClass().hashCode();	}}