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
140
141
142
143
|
/*
* Copyright 2000-2014 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.util.containers;
import com.intellij.util.IncorrectOperationException;
import gnu.trove.TObjectHashingStrategy;
import org.jetbrains.annotations.NotNull;
import java.util.*;
// have to extend ArrayList because otherwise the spliterator() methods declared in Set and List are in conflict
public class OrderedSet<T> extends ArrayList<T> implements Set<T>, RandomAccess {
private final OpenTHashSet<T> myHashSet;
public OrderedSet() {
this(ContainerUtil.<T>canonicalStrategy());
}
public OrderedSet(@NotNull TObjectHashingStrategy<T> hashingStrategy) {
this(hashingStrategy, 4);
}
public OrderedSet(@NotNull TObjectHashingStrategy<T> hashingStrategy, int capacity) {
super(capacity);
myHashSet = new OpenTHashSet<T>(capacity, hashingStrategy);
}
@Override
public boolean removeAll(@NotNull Collection<?> c) {
boolean removed = false;
for (Object o : c) {
removed |= remove(o);
}
return removed;
}
@Override
public boolean retainAll(@NotNull Collection<?> c) {
boolean removed = false;
for (int i = size() - 1; i >= 0; i--) {
Object o = get(i);
if (!c.contains(o)) {
removed |= remove(o);
}
}
return removed;
}
@NotNull
@Override
public List<T> subList(int fromIndex, int toIndex) {
throw new IncorrectOperationException();
}
@Override
public boolean contains(Object o) {
return myHashSet.contains(o);
}
@Override
public boolean addAll(@NotNull Collection<? extends T> c) {
boolean result = false;
for (T t : c) {
result |= add(t);
}
return result;
}
@Override
public boolean add(T o) {
if (myHashSet.add(o)){
super.add(o);
return true;
}
return false;
}
@Override
public boolean remove(Object o) {
if (myHashSet.remove(o)){
super.remove(o);
return true;
}
return false;
}
@Override
public void clear() {
myHashSet.clear();
super.clear();
}
@Override
public boolean addAll(final int index, @NotNull final Collection<? extends T> c) {
throw new UnsupportedOperationException();
}
@Override
public T set(final int index, @NotNull final T element) {
final T removed = remove(index);
add(index, element);
return removed;
}
@Override
public void add(final int index, @NotNull final T element) {
if (myHashSet.add(element)){
super.add(index, element);
}
}
@Override
public T remove(final int index) {
final T t = super.remove(index);
myHashSet.remove(t);
return t;
}
@Override
public int indexOf(final Object o) {
final int index = myHashSet.index((T)o);
return index >= 0? super.indexOf(myHashSet.get(index)) : -1;
}
@Override
public int lastIndexOf(final Object o) {
final int index = myHashSet.index((T)o);
return index >= 0 ? super.lastIndexOf(myHashSet.get(index)) : -1;
}
}
|
