eu.interedition.text.util.OverlapAnalyzer.java Source code

Introduction

Here is the source code for eu.interedition.text.util.OverlapAnalyzer.java

Source

/*
 * #%L
 * Text: A text model with range-based markup via standoff annotations.
 * %%
 * Copyright (C) 2010 - 2011 The Interedition Development Group
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *      http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */
package eu.interedition.text.util;

import com.google.common.collect.Iterables;
import com.google.common.collect.Sets;
import eu.interedition.text.Annotation;
import eu.interedition.text.Name;
import eu.interedition.text.Text;
import eu.interedition.text.TextTarget;
import eu.interedition.text.query.AnnotationListenerAdapter;
import eu.interedition.text.query.QueryCriteria;
import org.hibernate.Session;

import java.io.IOException;
import java.util.Set;
import java.util.SortedSet;

/**
 * @author <a href="http://gregor.middell.net/" title="Homepage">Gregor Middell</a>
 */
public class OverlapAnalyzer extends AnnotationListenerAdapter {
    protected Set<Name> selfOverlapping;
    protected Set<SortedSet<Name>> overlapping;
    protected Set<Annotation> started;

    public OverlapAnalyzer analyze(Session session, Text text) throws IOException {
        QueryCriteria.any().listen(session, text, this);
        return this;
    }

    public Set<Name> getSelfOverlapping() {
        return selfOverlapping;
    }

    public Set<SortedSet<Name>> getOverlapping() {
        return overlapping;
    }

    @Override
    public void start(long contentLength) {
        selfOverlapping = Sets.newHashSet();
        overlapping = Sets.newHashSet();
        started = Sets.newHashSet();
    }

    @Override
    public void start(long offset, Iterable<Annotation> annotations) {
        Iterables.addAll(started, annotations);
    }

    @Override
    public void end(long offset, Iterable<Annotation> annotations) {
        for (Annotation ending : annotations) {
            started.remove(ending);
        }

        for (Annotation ending : annotations) {
            final Name endingName = ending.getName();
            for (TextTarget endingTarget : ending.getTargets()) {
                for (Annotation started : this.started) {
                    final Name startedName = started.getName();
                    for (TextTarget startedTarget : started.getTargets()) {
                        if (!startedTarget.encloses(endingTarget)) {
                            if (startedName.equals(endingName)) {
                                selfOverlapping.add(endingName);
                            } else {
                                overlapping.add(Sets.newTreeSet(Sets.newHashSet(startedName, endingName)));
                            }
                        }
                    }
                }
            }
        }
    }
}