001    /*
002     * Copyright (c) Andrey Kuznetsov. All Rights Reserved.
003     *
004     * http://uio.imagero.com
005     *
006     * Redistribution and use in source and binary forms, with or without
007     * modification, are permitted provided that the following conditions are met:
008     *
009     *  o Redistributions of source code must retain the above copyright notice,
010     *    this list of conditions and the following disclaimer.
011     *
012     *  o Redistributions in binary form must reproduce the above copyright notice,
013     *    this list of conditions and the following disclaimer in the documentation
014     *    and/or other materials provided with the distribution.
015     *
016     *  o Neither the name of Andrey Kuznetsov nor the names of
017     *    its contributors may be used to endorse or promote products derived
018     *    from this software without specific prior written permission.
019     *
020     * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
021     * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
022     * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
023     * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
024     * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
025     * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
026     * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
027     * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
028     * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
029     * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
030     * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
031     */
032    package com.imagero.uio.bio.content;
033    
034    /**
035     * This class helps to track which interval was already filed with data.
036     * @author Andrey Kuznetsov
037     */
038    public class Range {
039        long first;
040        long last;
041    
042        public Range(long first, long last) {
043            if(first == last) {
044                throw new IllegalArgumentException("Empty range");
045            }
046            this.first = Math.min(first, last);
047            this.last = Math.max(first, last);
048        }
049    
050        public boolean contains(Range r) {
051            return (r.first >= first && r.last <= last);
052        }
053    
054        public boolean isOverlap(Range r) {
055            return ((r.first >= first && r.first <= last) || (r.last >= first && r.last <= last));
056        }
057    
058        public boolean isNeighbor(Range r) {
059            return ((r.last + 1 == first) || (r.first - 1 == last));
060        }
061    
062        public boolean canJoin(Range r) {
063            return isOverlap(r) || isNeighbor(r);
064        }
065    
066        public void join(Range r) {
067            if(canJoin(r)) {
068                this.first = Math.min(first, r.first);
069                this.last = Math.max(last, r.last);
070            }
071        }
072    }