eu.interedition.text.TextRanges Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of text-core Show documentation
Stand-off Markup/Annotation Text Model
The newest version!
/*
 * #%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;

import com.google.common.collect.Ordering;
import com.google.common.collect.Sets;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.SortedSet;

public class TextRanges {
    private static final Ordering START_ORDERING = Ordering.from(new Comparator() {

        public int compare(TextRange o1, TextRange o2) {
            final long result = o1.getStart() - o2.getStart();
            return (result < 0 ? -1 : (result > 0 ? 1 : 0));
        }
    });

    public static final Ordering END_ORDERING = Ordering.from(new Comparator() {

        public int compare(TextRange o1, TextRange o2) {
            final long result = o2.getEnd() - o1.getEnd();
            return (result < 0 ? -1 : (result > 0 ? 1 : 0));
        }
    });

    public static final Ordering NATURAL_ORDERING = Ordering.natural();

    public static Ordering> orderingByTarget(final Layer target) {
        return Ordering.from(new Comparator>() {
            @Override
            public int compare(Layer o1, Layer o2) {
                for (Anchor o1Anchor : o1.getAnchors()) {
                    if (o1Anchor.getText().equals(target)) {
                        for (Anchor o2Anchor : o2.getAnchors()) {
                            if (o2Anchor.getText().equals(target)) {
                                return o1Anchor.getRange().compareTo(o2Anchor.getRange());
                            }
                        }
                    }
                }
                return 0;
            }
        });
    }
    public static SortedSet compressAdjacent(SortedSet ranges) {
        final SortedSet compressed = Sets.newTreeSet();

        TextRange current = null;
        for (Iterator rangeIt = ranges.iterator(); rangeIt.hasNext(); ) {
            final TextRange range = rangeIt.next();
            if (current == null) {
                current = new TextRange(range);
            } else {
                if (current.getEnd() == range.getStart()) {
                    current = new TextRange(current.getStart(), range.getEnd());
                } else {
                    compressed.add(current);
                    current = new TextRange(range);
                }
            }
            if (!rangeIt.hasNext()) {
                compressed.add(current);
            }
        }

        return compressed;
    }

    public static SortedSet compress(SortedSet ranges) {
        final SortedSet compressed = Sets.newTreeSet();

        TextRange current = null;
        for (Iterator rangeIt = ranges.iterator(); rangeIt.hasNext(); ) {
            final TextRange range = rangeIt.next();
            if (current == null) {
                current = new TextRange(range);
            } else {
                if (current.getEnd() >= range.getStart()) {
                    current = new TextRange(current.getStart(), Math.max(current.getEnd(), range.getEnd()));
                } else {
                    compressed.add(current);
                    current = new TextRange(range);
                }
            }
            if (!rangeIt.hasNext()) {
                compressed.add(current);
            }
        }

        return compressed;
    }

    public static int length(SortedSet anchors) {
        int length = 0;
        for (Anchor r : anchors) {
            length += r.getRange().length();
        }
        return length;
    }

    public static List exclude(Iterable ranges, List excluded) {
        excluded = START_ORDERING.sortedCopy(excluded);

        final List result = START_ORDERING.sortedCopy(ranges);
        for (ListIterator it = result.listIterator(); it.hasNext(); ) {
            final TextRange r = it.next();
            it.remove();

            for (Iterator exIt = excluded.iterator(); exIt.hasNext(); ) {
                final TextRange ex = exIt.next();
                if (ex.precedes(r)) {
                    exIt.remove();
                } else if (r.precedes(ex)) {
                    continue;
                }
                for (TextRange remainder : r.substract(ex)) {
                    it.add(remainder);
                }

            }
        }
        return result;
    }
}