KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > myoodb > collectable > TreeSetDbImpl


1 ///////////////////////////////////////////////////////////////////////////////
2
//
3
// Copyright (C) 2003-@year@ by Thomas M. Hazel, MyOODB (www.myoodb.org)
4
//
5
// All Rights Reserved
6
//
7
// This program is free software; you can redistribute it and/or modify
8
// it under the terms of the GNU General Public License and GNU Library
9
// General Public License as published by the Free Software Foundation;
10
// either version 2, or (at your option) any later version.
11
//
12
// This program is distributed in the hope that it will be useful,
13
// but WITHOUT ANY WARRANTY; without even the implied warranty of
14
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
// GNU General Public License and GNU Library General Public License
16
// for more details.
17
//
18
// You should have received a copy of the GNU General Public License
19
// and GNU Library General Public License along with this program; if
20
// not, write to the Free Software Foundation, 675 Mass Ave, Cambridge,
21
// MA 02139, USA.
22
//
23
///////////////////////////////////////////////////////////////////////////////
24
package org.myoodb.collectable;
25
26 public class TreeSetDbImpl extends CollectableDbImpl implements TreeSet
27 {
28     private java.util.TreeSet JavaDoc m_treeSet;
29
30     public TreeSetDbImpl()
31     {
32         m_treeSet = new java.util.TreeSet JavaDoc();
33     }
34
35     public TreeSetDbImpl(java.util.Comparator JavaDoc cmp)
36     {
37         m_treeSet = new java.util.TreeSet JavaDoc(cmp);
38     }
39
40     public void fixUpReference(long fixUpTime)
41     {
42         if (referenceHasBeenFixedUp(fixUpTime) == true)
43         {
44             return;
45         }
46
47         super.fixUpReference(fixUpTime);
48
49         synchronized(m_treeSet)
50         {
51             CollectableDbImpl.fixUpReference(m_treeSet, fixUpTime);
52         }
53     }
54
55     public boolean add(Object JavaDoc o)
56     {
57         boolean retval = false;
58
59         synchronized(m_treeSet)
60         {
61             retval = m_treeSet.add(o);
62         }
63
64         return retval;
65     }
66
67     public boolean addAll(java.util.Collection JavaDoc c)
68     {
69         boolean retval = false;
70
71         synchronized(m_treeSet)
72         {
73             retval = m_treeSet.addAll(c);
74         }
75
76         return retval;
77     }
78
79     public boolean contains(Object JavaDoc o)
80     {
81         boolean retval = false;
82
83         synchronized(m_treeSet)
84         {
85             retval = m_treeSet.contains(o);
86         }
87
88         return retval;
89     }
90
91     public boolean remove(Object JavaDoc o)
92     {
93         boolean retval = false;
94
95         synchronized(m_treeSet)
96         {
97             retval = m_treeSet.remove(o);
98         }
99
100         return retval;
101     }
102
103     public boolean removeAll(java.util.Collection JavaDoc c)
104     {
105         boolean retval = false;
106
107         synchronized(m_treeSet)
108         {
109             retval = m_treeSet.removeAll(c);
110         }
111
112         return retval;
113     }
114
115     public Object JavaDoc first()
116     {
117         Object JavaDoc retval = null;
118
119         synchronized(m_treeSet)
120         {
121             retval = m_treeSet.first();
122         }
123
124         return retval;
125     }
126
127     public Object JavaDoc last()
128     {
129         Object JavaDoc retval = null;
130
131         synchronized(m_treeSet)
132         {
133             retval = m_treeSet.last();
134         }
135
136         return retval;
137     }
138
139     public void clear()
140     {
141         synchronized(m_treeSet)
142         {
143             m_treeSet.clear();
144         }
145     }
146     public int size()
147     {
148         int retval = -1;
149
150         synchronized(m_treeSet)
151         {
152             retval = m_treeSet.size();
153         }
154
155         return retval;
156     }
157
158     public String JavaDoc toString()
159     {
160         String JavaDoc retval = null;
161
162         synchronized(m_treeSet)
163         {
164             retval = m_treeSet.toString();
165         }
166
167         return retval;
168     }
169
170     public boolean equals(Object JavaDoc obj)
171     {
172         boolean retval = false;
173
174         synchronized(m_treeSet)
175         {
176             retval = m_treeSet.equals(obj);
177         }
178
179         return retval;
180     }
181
182     public java.util.TreeSet JavaDoc collection()
183     {
184         return m_treeSet;
185     }
186
187     public java.util.ArrayList JavaDoc toArrayList()
188     {
189         java.util.ArrayList JavaDoc retval = null;
190
191         synchronized(m_treeSet)
192         {
193             retval = new java.util.ArrayList JavaDoc(m_treeSet);
194         }
195
196         return retval;
197     }
198
199     public Iterator iterator()
200     {
201         return (Iterator) getDatabase().createObject(IteratorDbImpl.class.getName(), "java.util.Collection", new Object JavaDoc[] {m_treeSet});
202     }
203
204     public java.util.SortedSet JavaDoc headSet(Object JavaDoc toElement)
205     {
206         synchronized(m_treeSet)
207         {
208             return m_treeSet.headSet(toElement);
209         }
210     }
211
212     public java.util.SortedSet JavaDoc subSet(Object JavaDoc fromElement, Object JavaDoc toElement)
213     {
214         synchronized(m_treeSet)
215         {
216             return m_treeSet.subSet(fromElement, toElement);
217         }
218     }
219
220     public java.util.SortedSet JavaDoc tailSet(Object JavaDoc fromElement)
221     {
222         synchronized(m_treeSet)
223         {
224             return m_treeSet.tailSet(fromElement);
225         }
226     }
227 }
228
Popular Tags