All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.intellij.openapi.diff.impl.splitter.Interval Maven / Gradle / Ivy

/*
 * Copyright 2000-2009 JetBrains s.r.o.
 *
 * 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.
 */
package com.intellij.openapi.diff.impl.splitter;

import java.util.Comparator;

public class Interval {
  public static final Comparator START_COMPARATOR = new Comparator() {
    public int compare(Object o1, Object o2) {
      if (o1 instanceof Interval) return ((Interval) o1).compareToStart((Integer) o2);
      return -((Interval) o2).compareToStart((Integer) o1);
    }
  };

  public static final Comparator END_COMPARATOR = new Comparator() {
    public int compare(Object o1, Object o2) {
      if (o1 instanceof Interval) return ((Interval) o1).compareToEnd((Integer) o2);
      return -((Interval)o2).compareToEnd((Integer) o1);
    }
  };
  private final int myStart;
  private final int myLength;

  public Interval(int start, int length) {
    myStart = start;
    myLength = length;
  }

  public int getEnd() {
    return myStart + myLength;
  }

  public int getStart() {
    return myStart;
  }

  private int compareToStart(Integer start) {
    return myStart - start.intValue();
  }

  private int compareToEnd(Integer end) {
    return getEnd() - end.intValue();
  }

  public boolean equals(Object obj) {
    if (!(obj instanceof Interval)) return false;
    Interval other = (Interval) obj;
    return myStart == other.myStart && myLength == other.myLength;
  }

  public int hashCode() {
    return myStart ^ (myLength << 20);
  }

  public String toString() {
    return "[" + myStart + ", " + getEnd() + ")";
  }

  public static Interval fromTo(int start, int end) {
    return new Interval(start, end - start);
  }

  public int getLength() {
    return myLength;
  }

  public static Interval toInf(int start) {
    return Interval.fromTo(start, Integer.MAX_VALUE);
  }

  public boolean contains(int location) {
    return (location > myStart && location < getEnd()) || location == myStart;
  }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy