How to use

EmptyContiguousSet

in

com.google.common.collect

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return range.isConnected(other)
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}

@Override
public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) <= 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}

@Override
ContiguousSet<C> subSetImpl(
  C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
 if (fromElement.compareTo(toElement) == 0 && !fromInclusive && !toInclusive) {
  // Range would reject our attempt to create (x, x).
  return new EmptyContiguousSet<C>(domain);
 }
 return intersectionInCurrentDomain(
   Range.range(
     fromElement, BoundType.forBoolean(fromInclusive),
     toElement, BoundType.forBoolean(toInclusive)));
}

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);

? new EmptyContiguousSet<C>(domain)
: new RegularContiguousSet<C>(effectiveRange, domain);

private Object readResolve() {
 return new EmptyContiguousSet<C>(domain);
}

private Object readResolve() {
  return new EmptyContiguousSet<C>(domain);
}

@Override public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) < 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}

@Override public ContiguousSet<C> intersection(ContiguousSet<C> other) {
 checkNotNull(other);
 checkArgument(this.domain.equals(other.domain));
 if (other.isEmpty()) {
  return other;
 } else {
  C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
  C upperEndpoint = Ordering.natural().min(this.last(), other.last());
  return (lowerEndpoint.compareTo(upperEndpoint) < 0)
    ? ContiguousSet.create(Range.closed(lowerEndpoint, upperEndpoint), domain)
    : new EmptyContiguousSet<C>(domain);
 }
}

private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
 return (range.isConnected(other))
   ? ContiguousSet.create(range.intersection(other), domain)
   : new EmptyContiguousSet<C>(domain);
}