il.ac.bgu.cs.bp.bpjs.validation.eventpattern.EventPattern Maven / Gradle / Ivy

Go to download
package il.ac.bgu.cs.bp.bpjs.validation.eventpattern;

import java.util.ArrayList;
import java.util.List;

import il.ac.bgu.cs.bp.bpjs.events.BEvent;
import il.ac.bgu.cs.bp.bpjs.eventsets.EventSet;
import il.ac.bgu.cs.bp.bpjs.eventsets.ExplicitEventSet;

/**
 * Matches a list of events against a
 * glob-like pattern.
 * 
 * @author michaelbar-sinai
 */
public class EventPattern {
	
	/** Must be an array list, as we may do lots of random access. */
	private final List glob = new ArrayList<>();
	
	public boolean matches( List eventList ) {
		return matches( eventList, 0 );
	}
	
	private boolean matches( List eventList, int globIdx) {
		// See if we're at the end of the glob or the list.
		if ( globIdx==glob.size() ) { 
			return eventList.isEmpty();
		}
		if ( eventList.isEmpty() ) {
			// see that the end of the glob may match an empty list.
			for ( ; globIdx < glob.size(); globIdx++ ) {
				if ( glob.get(globIdx).getMinRepeats() != 0 ) return false;
			}
			return true;
		}
		
		EventPatternPart curPart = glob.get(globIdx);
		if ( curPart.isMultiChar() ) {
			for ( int groupSize=curPart.getMinRepeats()
					; (groupSize<=eventList.size())
					  && (curPart.getMaxRepeats()==null || groupSize < curPart.getMaxRepeats() ) 
					; groupSize++ ) {
				if ( matches(eventList.subList(groupSize, eventList.size()), globIdx+1 ) ) {
					return true;
				}
			}
			return false;
			
		} else {
			if ( curPart.matches(eventList.get(0)) ) {
				return matches( eventList.subList(1, eventList.size()), globIdx+1);
			} else {
				return false;
			}
		}
		
	}
	
	/**
	 * Appends a single occurrence of {@code esi} to the pattern.
	 * 
	 * Convenience call to {@code append(esi,1,1)}.
	 * @param esi the EventSet that should occur.
	 * @return {@code this}, to allow call chaining.
	 * @see #append(EventSet, int, Integer)
	 */
	public EventPattern append( EventSet esi ) {
		return append( esi, 1, 1);
	}
	public EventPattern append( BEvent evt ) {
        return append( ExplicitEventSet.of(evt) );
    }
	
	/**
	 * Appends a zero-or-more occurrence of {@code esi} to the pattern.
	 * (Kleene's star).
	 * 
	 * Convenience call to {@code append(esi,0,null)}.
	 * @param esi the EventSet that should occur.
	 * @return {@code this}, to allow call chaining.
	 * @see #append(EventSet, int, Integer)
	 */
	public EventPattern appendStar( EventSet esi ) {
		return append( esi, 0, null );
	}
	
    public EventPattern appendStar( BEvent evt ) {
        return appendStar( ExplicitEventSet.of(evt) );
    }
    
	/**
	 * Appends possible occurrence(s) of {@code esi} to the pattern.
	 * 
	 * @param minRepeats minimum number of repeats.
	 * @param maxRepeats maximum number of repeats, or {@code null} if unlimited.
	 * @param esi the EventSet, that one if its members should occur (really, an OR).
	 * @return {@code this}, to allow call chaining.
	 */
	public EventPattern append( EventSet esi, int minRepeats, Integer maxRepeats ) {
		glob.add( new EventPatternPart( esi, minRepeats, maxRepeats) );
		return this;
	}
	
    public EventPattern append( BEvent evt, int minRepeats, Integer maxRepeats ) {
        return append( ExplicitEventSet.of(evt), minRepeats, maxRepeats );
    }
    
	/**
	 * Clears the pattern.
	 */
	public void clear() {
		glob.clear();
	}
	
	public List getPatternParts() {
		return glob;
	}
	
	@Override
	public String toString() {
		StringBuilder sb = new StringBuilder();
		sb.append("EventPattern [");
		for ( EventPatternPart gpp : glob ) {
			sb.append(gpp.getEventSet().toString());
			if ( gpp.getMaxRepeats() == null ) {
				 if ( gpp.getMinRepeats()==0 ) {
					 sb.append("*");
				 } else {
					 sb.append("{").append(gpp.getMinRepeats()).append(",*}");
				 }
			} else {
				if ( gpp.getMinRepeats() != 1 || gpp.getMaxRepeats() != 1 ) {
					sb.append("{").append(gpp.getMinRepeats()).append(",").append(gpp.getMaxRepeats()).append("}");
				}
			}
			sb.append(" ");
		}
		sb.append("]");
		return sb.toString();
	
	}
	
}