/*
* Copyright (C) 2008 Google Inc.
*
* 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.google.common.collect;
import com.google.common.annotations.Beta;
import com.google.common.annotations.GwtCompatible;
import java.io.InvalidObjectException;
import java.io.ObjectInputStream;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.SortedSet;
import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
/**
* An immutable {@code SortedSet} that stores its elements in a sorted array.
* Some instances are ordered by an explicit comparator, while others follow the
* natural sort ordering of their elements. Either way, null elements are not
* supported.
*
* Unlike {@link Collections#unmodifiableSortedSet}, which is a view
* of a separate collection that can still change, an instance of {@code
* ImmutableSortedSet} contains its own private data and will never
* change. This class is convenient for {@code public static final} sets
* ("constant sets") and also lets you easily make a "defensive copy" of a set
* provided to your class by a caller.
*
*
The sets returned by {@link #headSet}, {@link #tailSet}, and
* {@link #subSet} methods share the same array as the original set, preventing
* that array from being garbage collected. If this is a concern, the data may
* be copied into a correctly-sized array by calling {@link #copyOfSorted}.
*
*
Note on element equivalence: The {@link #contains(Object)},
* {@link #containsAll(Collection)}, and {@link #equals(Object)}
* implementations must check whether a provided object is equivalent to an
* element in the collection. Unlike most collections, an
* {@code ImmutableSortedSet} doesn't use {@link Object#equals} to determine if
* two elements are equivalent. Instead, with an explicit comparator, the
* following relation determines whether elements {@code x} and {@code y} are
* equivalent:
{@code
*
* {(x, y) | comparator.compare(x, y) == 0}}
*
* With natural ordering of elements, the following relation determines whether
* two elements are equivalent: {@code
*
* {(x, y) | x.compareTo(y) == 0}}
*
* Warning: Like most sets, an {@code ImmutableSortedSet} will not
* function correctly if an element is modified after being placed in the set.
* For this reason, and to avoid general confusion, it is strongly recommended
* to place only immutable objects into this collection.
*
* Note : Although this class is not final, it cannot be subclassed as
* it has no public or protected constructors. Thus, instances of this type are
* guaranteed to be immutable.
*
* @see ImmutableSet
* @author Jared Levy
* @since 2 (imported from Google Collections Library)
*/
// TODO: benchmark and optimize all creation paths, which are a mess right now
@GwtCompatible(serializable = true, emulated = true)
@SuppressWarnings("serial") // we're overriding default serialization
public abstract class ImmutableSortedSet
extends ImmutableSortedSetFauxverideShim implements SortedSet {
// TODO: Can we find a way to remove this @SuppressWarnings even for eclipse?
@SuppressWarnings("unchecked")
private static final Comparator NATURAL_ORDER = Ordering.natural();
@SuppressWarnings("unchecked")
private static final ImmutableSortedSet NATURAL_EMPTY_SET =
new EmptyImmutableSortedSet(NATURAL_ORDER);
@SuppressWarnings("unchecked")
private static ImmutableSortedSet emptySet() {
return (ImmutableSortedSet) NATURAL_EMPTY_SET;
}
static ImmutableSortedSet emptySet(
Comparator comparator) {
if (NATURAL_ORDER.equals(comparator)) {
return emptySet();
} else {
return new EmptyImmutableSortedSet(comparator);
}
}
/**
* Returns the empty immutable sorted set.
*/
public static ImmutableSortedSet of() {
return emptySet();
}
/**
* Returns an immutable sorted set containing a single element.
*/
public static > ImmutableSortedSet of(
E element) {
Object[] array = { checkNotNull(element) };
return new RegularImmutableSortedSet(array, Ordering.natural());
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any element is null
*/
@SuppressWarnings("unchecked")
public static > ImmutableSortedSet of(
E e1, E e2) {
return ofInternal(Ordering.natural(), e1, e2);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any element is null
*/
@SuppressWarnings("unchecked")
public static > ImmutableSortedSet of(
E e1, E e2, E e3) {
return ofInternal(Ordering.natural(), e1, e2, e3);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any element is null
*/
@SuppressWarnings("unchecked")
public static > ImmutableSortedSet of(
E e1, E e2, E e3, E e4) {
return ofInternal(Ordering.natural(), e1, e2, e3, e4);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any element is null
*/
@SuppressWarnings("unchecked")
public static > ImmutableSortedSet of(
E e1, E e2, E e3, E e4, E e5) {
return ofInternal(Ordering.natural(), e1, e2, e3, e4, e5);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any element is null
*/
@SuppressWarnings("unchecked")
public static > ImmutableSortedSet of(
E e1, E e2, E e3, E e4, E e5, E e6, E... remaining) {
int size = remaining.length + 6;
List all = new ArrayList(size);
Collections.addAll(all, e1, e2, e3, e4, e5, e6);
Collections.addAll(all, remaining);
// This is a mess (see TODO at top of file)
return ofInternal(Ordering.natural(),
(Object[]) all.toArray(new Comparable[0]));
}
// TODO: Consider adding factory methods that throw an exception when given
// duplicate elements.
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any of {@code elements} is null
* @deprecated use {@link #copyOf(Comparable[])}.
*/
@Deprecated
public static > ImmutableSortedSet of(
E[] elements) {
return copyOf(elements);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@link Comparable#compareTo}, only the first one specified is included.
*
* @throws NullPointerException if any of {@code elements} is null
*/
public static > ImmutableSortedSet copyOf(
E[] elements) {
return ofInternal(Ordering.natural(), (Object[]) elements);
}
private static ImmutableSortedSet ofInternal(
Comparator comparator, Object... elements) {
switch (elements.length) {
case 0:
return emptySet(comparator);
default:
/*
* We can't use Platform.clone() because of GWT bug 3621. See our GWT
* ImmutableSortedSetTest.testOf_gwtArraycopyBug() for details. We can't
* use System.arraycopy() here for the same reason.
*/
Object[] array = new Object[elements.length];
for (int i = 0; i < elements.length; i++) {
array[i] = checkNotNull(elements[i]);
}
sort(array, comparator);
array = removeDupes(array, comparator);
return new RegularImmutableSortedSet(array, comparator);
}
}
/** Sort the array, according to the comparator. */
@SuppressWarnings("unchecked") // E comparator with Object array
private static void sort(
Object[] array, Comparator comparator) {
Arrays.sort(array, (Comparator) comparator);
}
/**
* Returns an array that removes duplicate consecutive elements, according to
* the provided comparator. Note that the input array is modified. This method
* does not support empty arrays.
*/
private static Object[] removeDupes(Object[] array,
Comparator comparator) {
int size = 1;
for (int i = 1; i < array.length; i++) {
Object element = array[i];
if (unsafeCompare(comparator, array[size - 1], element) != 0) {
array[size] = element;
size++;
}
}
// TODO: Move to ObjectArrays?
if (size == array.length) {
return array;
} else {
Object[] copy = new Object[size];
Platform.unsafeArrayCopy(array, 0, copy, 0, size);
return copy;
}
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@code compareTo()}, only the first one specified is included. To create a
* copy of a {@code SortedSet} that preserves the comparator, call
* {@link #copyOfSorted} instead. This method iterates over {@code elements}
* at most once.
*
* Note that if {@code s} is a {@code Set}, then
* {@code ImmutableSortedSet.copyOf(s)} returns an
* {@code ImmutableSortedSet} containing each of the strings in
* {@code s}, while {@code ImmutableSortedSet.of(s)} returns an
* {@code ImmutableSortedSet>} containing one element (the given
* set itself).
*
* Note: Despite what the method name suggests, if {@code elements}
* is an {@code ImmutableSortedSet}, it may be returned instead of a copy.
*
*
This method is not type-safe, as it may be called on elements that are
* not mutually comparable.
*
* @throws ClassCastException if the elements are not mutually comparable
* @throws NullPointerException if any of {@code elements} is null
*/
public static ImmutableSortedSet copyOf(
Iterable elements) {
// Hack around K not being a subtype of Comparable.
// Unsafe, see ImmutableSortedSetFauxverideShim.
@SuppressWarnings("unchecked")
Ordering naturalOrder = (Ordering) Ordering.natural();
return copyOfInternal(naturalOrder, elements, false);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* their natural ordering. When multiple elements are equivalent according to
* {@code compareTo()}, only the first one specified is included.
*
* This method is not type-safe, as it may be called on elements that are
* not mutually comparable.
*
* @throws ClassCastException if the elements are not mutually comparable
* @throws NullPointerException if any of {@code elements} is null
*/
public static ImmutableSortedSet copyOf(
Iterator elements) {
// Hack around K not being a subtype of Comparable.
// Unsafe, see ImmutableSortedSetFauxverideShim.
@SuppressWarnings("unchecked")
Ordering naturalOrder = (Ordering) Ordering.natural();
return copyOfInternal(naturalOrder, elements);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* the given {@code Comparator}. When multiple elements are equivalent
* according to {@code compare()}, only the first one specified is
* included. This method iterates over {@code elements} at most once.
*
* Note: Despite what the method name suggests, if {@code elements}
* is an {@code ImmutableSortedSet}, it may be returned instead of a copy.
*
* @throws NullPointerException if {@code comparator} or any of
* {@code elements} is null
*/
public static ImmutableSortedSet copyOf(
Comparator comparator, Iterable elements) {
checkNotNull(comparator);
return copyOfInternal(comparator, elements, false);
}
/**
* Returns an immutable sorted set containing the given elements sorted by
* the given {@code Comparator}. When multiple elements are equivalent
* according to {@code compareTo()}, only the first one specified is
* included.
*
* @throws NullPointerException if {@code comparator} or any of
* {@code elements} is null
*/
public static ImmutableSortedSet copyOf(
Comparator comparator, Iterator elements) {
checkNotNull(comparator);
return copyOfInternal(comparator, elements);
}
/**
* Returns an immutable sorted set containing the elements of a sorted set,
* sorted by the same {@code Comparator}. That behavior differs from
* {@link #copyOf(Iterable)}, which always uses the natural ordering of the
* elements.
*
* Note: Despite what the method name suggests, if {@code sortedSet}
* is an {@code ImmutableSortedSet}, it may be returned instead of a copy.
*
* @throws NullPointerException if {@code sortedSet} or any of its elements
* is null
*/
@SuppressWarnings("unchecked")
public static ImmutableSortedSet copyOfSorted(SortedSet sortedSet) {
Comparator comparator = sortedSet.comparator();
if (comparator == null) {
comparator = NATURAL_ORDER;
}
return copyOfInternal(comparator, sortedSet, true);
}
private static ImmutableSortedSet copyOfInternal(
Comparator comparator, Iterable elements,
boolean fromSortedSet) {
boolean hasSameComparator
= fromSortedSet || hasSameComparator(elements, comparator);
if (hasSameComparator && (elements instanceof ImmutableSortedSet)) {
@SuppressWarnings("unchecked")
ImmutableSortedSet result = (ImmutableSortedSet) elements;
if (!result.hasPartialArray()) {
return result;
}
}
Object[] array = newObjectArray(elements);
if (array.length == 0) {
return emptySet(comparator);
}
for (Object e : array) {
checkNotNull(e);
}
if (!hasSameComparator) {
sort(array, comparator);
array = removeDupes(array, comparator);
}
return new RegularImmutableSortedSet(array, comparator);
}
/** Simplified version of {@link Iterables#toArray} that is GWT safe. */
private static Object[] newObjectArray(Iterable iterable) {
Collection collection = Collections2.toCollection(iterable);
Object[] array = new Object[collection.size()];
return collection.toArray(array);
}
private static ImmutableSortedSet copyOfInternal(
Comparator comparator, Iterator elements) {
if (!elements.hasNext()) {
return emptySet(comparator);
}
List list = Lists.newArrayList();
while (elements.hasNext()) {
list.add(checkNotNull(elements.next()));
}
Object[] array = list.toArray();
sort(array, comparator);
array = removeDupes(array, comparator);
return new RegularImmutableSortedSet(array, comparator);
}
/**
* Returns {@code true} if {@code elements} is a {@code SortedSet} that uses
* {@code comparator} to order its elements. Note that equivalent comparators
* may still return {@code false}, if {@code equals} doesn't consider them
* equal. If one comparator is {@code null} and the other is
* {@link Ordering#natural()}, this method returns {@code true}.
*/
static boolean hasSameComparator(
Iterable elements, Comparator comparator) {
if (elements instanceof SortedSet) {
SortedSet sortedSet = (SortedSet) elements;
Comparator comparator2 = sortedSet.comparator();
return (comparator2 == null)
? comparator == Ordering.natural()
: comparator.equals(comparator2);
}
return false;
}
/**
* Returns an immutable sorted set containing the elements in the given list
* in the same order. It is useful when the elements already have the desired
* order but constructing the appropriate comparator is difficult.
*
* @throws NullPointerException if any of the elements is null
* @throws IllegalArgumentException if {@code elements} contains any
* duplicate values (according to {@link Object#equals})
* @since 3
*/
@Beta
public static ImmutableSortedSet withExplicitOrder(List elements) {
return ExplicitOrderedImmutableSortedSet.create(elements);
}
/**
* Returns an immutable sorted set containing the provided elements in the
* same order. It is useful when the elements already have the desired order
* but constructing the appropriate comparator is difficult.
*
* @param firstElement the value which should appear first in the generated
* set
* @param remainingElementsInOrder the rest of the values in the generated
* set, in the order they should appear
* @throws NullPointerException if any of the elements is null
* @throws IllegalArgumentException if any duplicate values (according to
* {@link Object#equals(Object)}) are present among the method arguments
* @since 3
*/
@Beta
public static ImmutableSortedSet withExplicitOrder(
E firstElement, E... remainingElementsInOrder) {
return withExplicitOrder(
Lists.asList(firstElement, remainingElementsInOrder));
}
/**
* Returns a builder that creates immutable sorted sets with an explicit
* comparator. If the comparator has a more general type than the set being
* generated, such as creating a {@code SortedSet} with a
* {@code Comparator}, use the {@link Builder} constructor instead.
*
* @throws NullPointerException if {@code comparator} is null
*/
public static Builder orderedBy(Comparator comparator) {
return new Builder(comparator);
}
/**
* Returns a builder that creates immutable sorted sets whose elements are
* ordered by the reverse of their natural ordering.
*
* Note: the type parameter {@code E} extends {@code Comparable} rather
* than {@code Comparable} as a workaround for javac bug
* 6468354 .
*/
public static > Builder reverseOrder() {
return new Builder(Ordering.natural().reverse());
}
/**
* Returns a builder that creates immutable sorted sets whose elements are
* ordered by their natural ordering. The sorted sets use {@link
* Ordering#natural()} as the comparator. This method provides more
* type-safety than {@link #builder}, as it can be called only for classes
* that implement {@link Comparable}.
*
* Note: the type parameter {@code E} extends {@code Comparable} rather
* than {@code Comparable} as a workaround for javac bug
* 6468354 .
*/
public static > Builder naturalOrder() {
return new Builder(Ordering.natural());
}
/**
* A builder for creating immutable sorted set instances, especially
* {@code public static final} sets ("constant sets"), with a given
* comparator.
*
* Example:
*
{@code
* public static final ImmutableSortedSet LUCKY_NUMBERS
* = new ImmutableSortedSet.Builder(ODDS_FIRST_COMPARATOR)
* .addAll(SINGLE_DIGIT_PRIMES)
* .add(42)
* .build();}
*
* Builder instances can be reused - it is safe to call {@link #build}
* multiple times to build multiple sets in series. Each set
* is a superset of the set created before it.
*/
public static final class Builder extends ImmutableSet.Builder {
private final Comparator comparator;
/**
* Creates a new builder. The returned builder is equivalent to the builder
* generated by {@link ImmutableSortedSet#orderedBy}.
*/
public Builder(Comparator comparator) {
this.comparator = checkNotNull(comparator);
}
/**
* Adds {@code element} to the {@code ImmutableSortedSet}. If the
* {@code ImmutableSortedSet} already contains {@code element}, then
* {@code add} has no effect. (only the previously added element
* is retained).
*
* @param element the element to add
* @return this {@code Builder} object
* @throws NullPointerException if {@code element} is null
*/
@Override public Builder add(E element) {
super.add(element);
return this;
}
/**
* Adds each element of {@code elements} to the {@code ImmutableSortedSet},
* ignoring duplicate elements (only the first duplicate element is added).
*
* @param elements the elements to add
* @return this {@code Builder} object
* @throws NullPointerException if {@code elements} contains a null element
*/
@Override public Builder add(E... elements) {
super.add(elements);
return this;
}
/**
* Adds each element of {@code elements} to the {@code ImmutableSortedSet},
* ignoring duplicate elements (only the first duplicate element is added).
*
* @param elements the elements to add to the {@code ImmutableSortedSet}
* @return this {@code Builder} object
* @throws NullPointerException if {@code elements} contains a null element
*/
@Override public Builder addAll(Iterable elements) {
super.addAll(elements);
return this;
}
/**
* Adds each element of {@code elements} to the {@code ImmutableSortedSet},
* ignoring duplicate elements (only the first duplicate element is added).
*
* @param elements the elements to add to the {@code ImmutableSortedSet}
* @return this {@code Builder} object
* @throws NullPointerException if {@code elements} contains a null element
*/
@Override public Builder addAll(Iterator elements) {
super.addAll(elements);
return this;
}
/**
* Returns a newly-created {@code ImmutableSortedSet} based on the contents
* of the {@code Builder} and its comparator.
*/
@Override public ImmutableSortedSet build() {
return copyOfInternal(comparator, contents.iterator());
}
}
int unsafeCompare(Object a, Object b) {
return unsafeCompare(comparator, a, b);
}
static int unsafeCompare(
Comparator comparator, Object a, Object b) {
// Pretend the comparator can compare anything. If it turns out it can't
// compare a and b, we should get a CCE on the subsequent line. Only methods
// that are spec'd to throw CCE should call this.
@SuppressWarnings("unchecked")
Comparator unsafeComparator = (Comparator) comparator;
return unsafeComparator.compare(a, b);
}
final transient Comparator comparator;
ImmutableSortedSet(Comparator comparator) {
this.comparator = comparator;
}
/**
* Returns the comparator that orders the elements, which is
* {@link Ordering#natural()} when the natural ordering of the
* elements is used. Note that its behavior is not consistent with
* {@link SortedSet#comparator()}, which returns {@code null} to indicate
* natural ordering.
*/
public Comparator comparator() {
return comparator;
}
/**
* {@inheritDoc}
*
* This method returns a serializable {@code ImmutableSortedSet}.
*
*
The {@link SortedSet#headSet} documentation states that a subset of a
* subset throws an {@link IllegalArgumentException} if passed a
* {@code toElement} greater than an earlier {@code toElement}. However, this
* method doesn't throw an exception in that situation, but instead keeps the
* original {@code toElement}.
*/
public ImmutableSortedSet headSet(E toElement) {
return headSetImpl(checkNotNull(toElement));
}
/**
* {@inheritDoc}
*
* This method returns a serializable {@code ImmutableSortedSet}.
*
*
The {@link SortedSet#subSet} documentation states that a subset of a
* subset throws an {@link IllegalArgumentException} if passed a
* {@code fromElement} smaller than an earlier {@code fromElement}. However,
* this method doesn't throw an exception in that situation, but instead keeps
* the original {@code fromElement}. Similarly, this method keeps the
* original {@code toElement}, instead of throwing an exception, if passed a
* {@code toElement} greater than an earlier {@code toElement}.
*/
public ImmutableSortedSet subSet(E fromElement, E toElement) {
checkNotNull(fromElement);
checkNotNull(toElement);
checkArgument(comparator.compare(fromElement, toElement) <= 0);
return subSetImpl(fromElement, toElement);
}
/**
* {@inheritDoc}
*
* This method returns a serializable {@code ImmutableSortedSet}.
*
*
The {@link SortedSet#tailSet} documentation states that a subset of a
* subset throws an {@link IllegalArgumentException} if passed a
* {@code fromElement} smaller than an earlier {@code fromElement}. However,
* this method doesn't throw an exception in that situation, but instead keeps
* the original {@code fromElement}.
*/
public ImmutableSortedSet tailSet(E fromElement) {
return tailSetImpl(checkNotNull(fromElement));
}
/*
* These methods perform most headSet, subSet, and tailSet logic, besides
* parameter validation.
*/
abstract ImmutableSortedSet headSetImpl(E toElement);
abstract ImmutableSortedSet subSetImpl(E fromElement, E toElement);
abstract ImmutableSortedSet tailSetImpl(E fromElement);
/** Returns whether the elements are stored in a subset of a larger array. */
abstract boolean hasPartialArray();
/**
* Returns the position of an element within the set, or -1 if not present.
*/
abstract int indexOf(Object target);
/*
* This class is used to serialize all ImmutableSortedSet instances,
* regardless of implementation type. It captures their "logical contents"
* only. This is necessary to ensure that the existence of a particular
* implementation type is an implementation detail.
*/
private static class SerializedForm implements Serializable {
final Comparator comparator;
final Object[] elements;
public SerializedForm(Comparator comparator, Object[] elements) {
this.comparator = comparator;
this.elements = elements;
}
@SuppressWarnings("unchecked")
Object readResolve() {
return new Builder(comparator).add((E[]) elements).build();
}
private static final long serialVersionUID = 0;
}
private void readObject(ObjectInputStream stream)
throws InvalidObjectException {
throw new InvalidObjectException("Use SerializedForm");
}
@Override Object writeReplace() {
return new SerializedForm(comparator, toArray());
}
}
