forked from mongodb/mongo-java-driver
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathWeakBag.java
More file actions
128 lines (106 loc) · 3.18 KB
/
Copy pathWeakBag.java
File metadata and controls
128 lines (106 loc) · 3.18 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
/*
* Copyright (c) 2008-2014 MongoDB, Inc.
*
* 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.
*/
// WeakBag.java
package com.mongodb.util;
import java.lang.ref.WeakReference;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
/**
* if its not obvious what a weak bag should do, then, well...
* very very not thread safe
* @deprecated This class is NOT a part of public API and will be dropped in 3.x versions.
*/
@Deprecated
public class WeakBag<T> implements Iterable<T> {
/** Initializes a new weak bag. */
public WeakBag(){
}
/** Adds an element to the bag.
* @param t Element to add
*/
public void add( T t ){
_refs.add( new MyRef( t ) );
}
public boolean remove( T t ){
for ( Iterator<MyRef> i = _refs.iterator(); i.hasNext(); ){
MyRef ref = i.next();
if( ref == null )
continue;
T me = ref.get();
if ( me == null ){
// this is just here cause i'm already doing the work, so why not
i.remove();
continue;
}
if ( me == t ){
i.remove();
return true;
}
}
return false;
}
public boolean contains( T t ){
for ( Iterator<MyRef> i = _refs.iterator(); i.hasNext(); ){
MyRef ref = i.next();
T me = ref.get();
if ( me == t )
return true;
}
return false;
}
/** Returns the size of the bag.
* @return the size of the bag
*/
public int size(){
clean();
return _refs.size();
}
/** Removes all object from the bag. */
public void clear(){
_refs.clear();
}
/** Removes any null objects from the bag. */
public void clean(){
for ( Iterator<MyRef> i = _refs.iterator(); i.hasNext(); ){
MyRef ref = i.next();
if ( ref.get() == null )
i.remove();
}
}
public Iterator<T> iterator(){
return getAll().iterator();
}
public List<T> getAll(){
List<T> l = new ArrayList<T>();
for ( Iterator<MyRef> i = _refs.iterator(); i.hasNext(); ){
MyRef ref = i.next();
T t = ref.get();
if ( t == null )
i.remove();
else
l.add( t );
}
return l;
}
class MyRef extends WeakReference<T> {
MyRef( T t ){
super( t );
}
}
private final List<MyRef> _refs = new LinkedList<MyRef>();
}