140 lines
3.3 KiB
Java
140 lines
3.3 KiB
Java
/*
|
|
* Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*/
|
|
|
|
import java.util.*;
|
|
|
|
/**
|
|
* A SortedSet implementation that does not implement NavigableSet. Useful for
|
|
* testing ReverseOrderSortedSetView. Underlying implementation provided by TreeSet.
|
|
*/
|
|
public class SimpleSortedSet<E> implements SortedSet<E> {
|
|
|
|
final SortedSet<E> set;
|
|
|
|
public SimpleSortedSet() {
|
|
set = new TreeSet<E>();
|
|
}
|
|
|
|
public SimpleSortedSet(Collection<? extends E> c) {
|
|
set = new TreeSet<>(c);
|
|
}
|
|
|
|
public SimpleSortedSet(Comparator<? super E> comparator) {
|
|
set = new TreeSet<>(comparator);
|
|
}
|
|
|
|
// ========== Object ==========
|
|
|
|
public boolean equals(Object o) {
|
|
return set.equals(o);
|
|
}
|
|
|
|
public int hashCode() {
|
|
return set.hashCode();
|
|
}
|
|
|
|
public String toString() {
|
|
return set.toString();
|
|
}
|
|
|
|
// ========== Collection ==========
|
|
|
|
public boolean add(E e) {
|
|
return set.add(e);
|
|
}
|
|
|
|
public boolean addAll(Collection<? extends E> c) {
|
|
return set.addAll(c);
|
|
}
|
|
|
|
public void clear() {
|
|
set.clear();
|
|
}
|
|
|
|
public boolean contains(Object o) {
|
|
return set.contains(o);
|
|
}
|
|
|
|
public boolean containsAll(Collection<?> c) {
|
|
return set.containsAll(c);
|
|
}
|
|
|
|
public boolean isEmpty() {
|
|
return set.isEmpty();
|
|
}
|
|
|
|
public Iterator<E> iterator() {
|
|
return set.iterator();
|
|
}
|
|
|
|
public boolean remove(Object o) {
|
|
return set.remove(o);
|
|
}
|
|
|
|
public boolean removeAll(Collection<?> c) {
|
|
return set.removeAll(c);
|
|
}
|
|
|
|
public boolean retainAll(Collection<?> c) {
|
|
return set.retainAll(c);
|
|
}
|
|
|
|
public int size() {
|
|
return set.size();
|
|
}
|
|
|
|
public Object[] toArray() {
|
|
return set.toArray();
|
|
}
|
|
|
|
public <T> T[] toArray(T[] a) {
|
|
return set.toArray(a);
|
|
}
|
|
|
|
// ========== SortedSet ==========
|
|
|
|
public Comparator<? super E> comparator() {
|
|
return set.comparator();
|
|
}
|
|
|
|
public E first() {
|
|
return set.first();
|
|
}
|
|
|
|
public SortedSet<E> headSet(E toElement) {
|
|
return set.headSet(toElement);
|
|
}
|
|
|
|
public E last() {
|
|
return set.last();
|
|
}
|
|
|
|
public SortedSet<E> subSet(E fromElement, E toElement) {
|
|
return set.subSet(fromElement, toElement);
|
|
}
|
|
|
|
public SortedSet<E> tailSet(E fromElement) {
|
|
return set.tailSet(fromElement);
|
|
}
|
|
}
|