forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathIdentityHashSet.java
More file actions
150 lines (134 loc) · 3.22 KB
/
IdentityHashSet.java
File metadata and controls
150 lines (134 loc) · 3.22 KB
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
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2004 Ondrej Lhotak
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 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 Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/lgpl-2.1.html>.
* #L%
*/
import java.util.AbstractSet;
import java.util.Collection;
import java.util.IdentityHashMap;
import java.util.Iterator;
import java.util.Set;
/**
* Implements a hashset with comparison over identity.
*
* @author Eric Bodden
* @deprecated can be replaced with
* <code>java.util.Collections.newSetFromMap(new java.util.IdentityHashMap<E,Boolean>())</code>
*/
@Deprecated
public class IdentityHashSet<E> extends AbstractSet<E> implements Set<E> {
protected IdentityHashMap<E, E> delegate;
/**
* Creates a new, empty IdentityHashSet.
*/
public IdentityHashSet() {
delegate = new IdentityHashMap<E, E>();
}
/**
* Creates a new IdentityHashSet containing the same elements as the given collection.
*
* @param original
* The original collection whose elements to inherit
*/
public IdentityHashSet(Collection<E> original) {
delegate = new IdentityHashMap<E, E>();
addAll(original);
}
/**
* {@inheritDoc}
*/
@Override
public int size() {
return delegate.size();
}
/**
* {@inheritDoc}
*/
@Override
public boolean contains(Object o) {
return delegate.containsKey(o);
}
/**
* {@inheritDoc}
*/
@Override
public Iterator<E> iterator() {
return delegate.keySet().iterator();
}
/**
* {@inheritDoc}
*/
@Override
public boolean add(E o) {
return delegate.put(o, o) == null;
}
/**
* {@inheritDoc}
*/
@Override
public boolean remove(Object o) {
return delegate.remove(o) != null;
}
/**
* {@inheritDoc}
*/
@Override
public void clear() {
delegate.entrySet().clear();
}
/*
* Equality based on identity.
*/
@Override
public int hashCode() {
final int PRIME = 31;
int result = 1;
result = PRIME * result + ((delegate == null) ? 0 : delegate.hashCode());
return result;
}
/*
* Hash code based on identity.
*/
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if ((obj == null) || (getClass() != obj.getClass())) {
return false;
}
final IdentityHashSet<?> other = (IdentityHashSet<?>) obj;
if (delegate == null) {
if (other.delegate != null) {
return false;
}
} else if (!delegate.equals(other.delegate)) {
return false;
}
return true;
}
/**
* {@inheritDoc}
*/
@Override
public String toString() {
return delegate.keySet().toString();
}
}