1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* 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);
}
}
|
