/
TreeStateSet.java
120 lines (98 loc) · 2.76 KB
/
TreeStateSet.java
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
/*
* Copyright (c) 2010-2013 Evolveum
*
* 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.evolveum.midpoint.web.page.admin.users.dto;
import org.apache.commons.lang.NotImplementedException;
import java.io.Serializable;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
/**
* @author lazyman
*/
public class TreeStateSet<T extends Serializable> implements Set<T>, Serializable {
private Set<T> set = new HashSet<T>();
private boolean inverse;
public void expandAll() {
set.clear();
inverse = true;
}
public void collapseAll() {
set.clear();
inverse = false;
}
@Override
public boolean add(T t) {
return inverse ? set.remove(t) : set.add(t);
}
@Override
public int size() {
return set.size();
}
@Override
public boolean isEmpty() {
return set.isEmpty();
}
@Override
public boolean contains(Object o) {
T t = (T) o;
return inverse ? !set.contains(t) : set.contains(t);
}
@Override
public Iterator<T> iterator() {
return set.iterator();
}
@Override
public Object[] toArray() {
return set.toArray();
}
@Override
public <T1> T1[] toArray(T1[] a) {
return set.toArray(a);
}
@Override
public boolean remove(Object o) {
T t = (T) o;
return inverse ? set.add(t) : set.remove(t);
}
@Override
public boolean containsAll(Collection<?> c) {
return inverse ? !set.containsAll(c) : set.containsAll(c);
}
@Override
public boolean addAll(Collection<? extends T> c) {
return inverse ? set.removeAll(c) : set.addAll(c);
}
@Override
public boolean retainAll(Collection<?> c) {
throw new NotImplementedException("Not yet implemented.");
}
@Override
public boolean removeAll(Collection<?> c) {
return inverse ? set.addAll((Collection<? extends T>) c) : set.removeAll(c);
}
@Override
public void clear() {
set.clear();
}
@Override
public TreeStateSet clone() {
TreeStateSet set = new TreeStateSet();
set.inverse = this.inverse;
set.set.addAll(this.set);
return set;
}
}