-
Notifications
You must be signed in to change notification settings - Fork 14
/
IndirectSet.java
175 lines (145 loc) · 4.06 KB
/
IndirectSet.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
/**
* Copyright (C) 2020 Czech Technical University in Prague
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* This program 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 for more
* details. You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package cz.cvut.kbss.jopa.adapters;
import cz.cvut.kbss.jopa.sessions.UnitOfWorkImpl;
import java.lang.reflect.Field;
import java.util.*;
public class IndirectSet<E> extends IndirectCollection<Set<E>> implements Set<E> {
private final Set<E> internalSet;
/**
* No-arg constructor to allow clone building.
*/
IndirectSet() {
this.internalSet = new HashSet<>();
}
public IndirectSet(Object owner, Field f, UnitOfWorkImpl uow, Set<E> referencedSet) {
super(owner, f, uow);
this.internalSet = Objects.requireNonNull(referencedSet);
}
@Override
public int size() {
return internalSet.size();
}
@Override
public boolean isEmpty() {
return internalSet.isEmpty();
}
@Override
public boolean contains(Object o) {
return internalSet.contains(o);
}
@Override
public Iterator<E> iterator() {
return new IndirectSetIterator<>(internalSet.iterator());
}
@Override
public Object[] toArray() {
return internalSet.toArray();
}
@Override
public <T> T[] toArray(T[] a) {
return internalSet.toArray(a);
}
@Override
public boolean add(E e) {
boolean res = internalSet.add(e);
if (res) {
persistChange();
}
return res;
}
@Override
public boolean remove(Object o) {
boolean res = internalSet.remove(o);
if (res) {
persistChange();
}
return res;
}
@Override
public boolean containsAll(Collection<?> c) {
return internalSet.containsAll(c);
}
@Override
public boolean addAll(Collection<? extends E> c) {
boolean res = internalSet.addAll(c);
if (res) {
persistChange();
}
return res;
}
@Override
public boolean retainAll(Collection<?> c) {
boolean res = internalSet.retainAll(c);
if (res) {
persistChange();
}
return res;
}
@Override
public boolean removeAll(Collection<?> c) {
boolean res = internalSet.removeAll(c);
if (res) {
persistChange();
}
return res;
}
@Override
public void clear() {
internalSet.clear();
persistChange();
}
private class IndirectSetIterator<T> implements Iterator<T> {
private final Iterator<T> iterator;
private IndirectSetIterator(Iterator<T> iterator) {
this.iterator = iterator;
}
@Override
public boolean hasNext() {
return iterator.hasNext();
}
@Override
public T next() {
return iterator.next();
}
@Override
public void remove() {
iterator.remove();
IndirectSet.this.persistChange();
}
}
@Override
public Set<E> unwrap() {
return internalSet;
}
@Override
public boolean equals(Object o) {
if (o instanceof Set) {
if (o instanceof IndirectSet) {
return internalSet.equals(((IndirectSet) o).internalSet);
}
return internalSet.equals(o);
}
return false;
}
@Override
public int hashCode() {
return internalSet.hashCode();
}
@Override
public String toString() {
return internalSet.toString();
}
}