net.java.textilej.validation.MarkupValidator Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of textile-j
The newest version!
package net.java.textilej.validation;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

import org.eclipse.core.runtime.IProgressMonitor;

/**
 * validate markup given a set of rules
 * 
 * @author dgreen
 */
public class MarkupValidator {

	private static final Comparator PROBLEM_COMPARATOR = new Comparator() {
		public int compare(ValidationProblem o1,ValidationProblem o2) {
			if (o1 == o2) {
				return 0;
			}
			int offset1 = o1.getOffset();
			int offset2 = o2.getOffset();
			if (offset1 < offset2) {
				return -1;
			} else if (offset2 < offset1) {
				return 1;
			} else {
				int length1 = o1.getLength();
				int length2 = o2.getLength();
				if (length1 > length2) {
					return -1;
				} else if (length2 > length1) {
					return 1;
				} else {
					int i = o1.getMessage().compareTo(o2.getMessage());
					if (i == 0) {
						i = o1.getMarkerId().compareTo(o2.getMarkerId());
					}
					return i;
				}
			}
		}
	};
	
	private List rules = new ArrayList();
	
	public List validate(IProgressMonitor monitor,String markup) {
		return validate(monitor,markup,0,markup.length());
	}
	
	public List validate(IProgressMonitor monitor,String markup,int offset,int length) {
		final int totalWork = length == 0?1:length*rules.size();
		monitor.beginTask("Markup Validation", totalWork);
		try {
			if (length == 0 || rules.isEmpty()) {
				return Collections.emptyList();
			}
			int end = offset+length;
			if (end > markup.length()) {
				end = markup.length();
			}
			List problems = new ArrayList();
			
			for (ValidationRule rule: rules) {
				int o = offset;
				while (o < end) {
					ValidationProblem problem = rule.findProblem(markup, o, length - (o-offset));
					if (problem == null) {
						break;
					}
					problems.add(problem);
					int newO = problem.getOffset()+problem.getLength();
					if (newO <= o) {
						break;
					}
					monitor.worked(newO-o);
					o = newO;
				}
			}
			if (!problems.isEmpty()) {
				Collections.sort(problems,PROBLEM_COMPARATOR);
			}
			return problems;
		} finally {
			monitor.done();
		}
	}

	public List getRules() {
		return rules;
	}
	
}