KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > db4o > test > legacy > soda > collections > STTreeSetU


1 /* Copyright (C) 2004 - 2006 db4objects Inc. http://www.db4o.com
2
3 This file is part of the db4o open source object database.
4
5 db4o is free software; you can redistribute it and/or modify it under
6 the terms of version 2 of the GNU General Public License as published
7 by the Free Software Foundation and as clarified by db4objects' GPL
8 interpretation policy, available at
9 http://www.db4o.com/about/company/legalpolicies/gplinterpretation/
10 Alternatively you can write to db4objects, Inc., 1900 S Norfolk Street,
11 Suite 350, San Mateo, CA 94403, USA.
12
13 db4o is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
17
18 You should have received a copy of the GNU General Public License along
19 with this program; if not, write to the Free Software Foundation, Inc.,
20 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */

21 package com.db4o.test.legacy.soda.collections;
22
23 import java.util.*;
24
25 import com.db4o.query.*;
26 import com.db4o.test.legacy.soda.*;
27
28 public class STTreeSetU implements STClass {
29
30     public static transient SodaTest st;
31     
32     Object JavaDoc col;
33
34     public STTreeSetU() {
35     }
36
37     public STTreeSetU(Object JavaDoc[] arr) {
38         col = new TreeSet();
39         for (int i = 0; i < arr.length; i++) {
40             ((TreeSet)col).add(arr[i]);
41         }
42     }
43
44     public Object JavaDoc[] store() {
45         return new Object JavaDoc[] {
46             new STTreeSetU(),
47             new STTreeSetU(new Object JavaDoc[0]),
48             new STTreeSetU(new Object JavaDoc[] { new Integer JavaDoc(0), new Integer JavaDoc(0)}),
49             new STTreeSetU(
50                 new Object JavaDoc[] {
51                     new Integer JavaDoc(1),
52                     new Integer JavaDoc(17),
53                     new Integer JavaDoc(Integer.MAX_VALUE - 1)}),
54             new STTreeSetU(
55                 new Object JavaDoc[] {
56                     new Integer JavaDoc(3),
57                     new Integer JavaDoc(17),
58                     new Integer JavaDoc(25),
59                     new Integer JavaDoc(Integer.MAX_VALUE - 2)})
60         };
61     }
62
63     public void testDefaultContainsInteger() {
64         Query q = st.query();
65         Object JavaDoc[] r = store();
66         q.constrain(new STTreeSetU(new Object JavaDoc[] { new Integer JavaDoc(17)}));
67         st.expect(q, new Object JavaDoc[] { r[3], r[4] });
68     }
69
70     public void testDefaultContainsTwo() {
71         Query q = st.query();
72         Object JavaDoc[] r = store();
73         q.constrain(new STTreeSetU(new Object JavaDoc[] { new Integer JavaDoc(17), new Integer JavaDoc(25)}));
74         st.expect(q, new Object JavaDoc[] { r[4] });
75     }
76
77     public void testDescendOne() {
78         Query q = st.query();
79         Object JavaDoc[] r = store();
80         q.constrain(STTreeSetU.class);
81         q.descend("col").constrain(new Integer JavaDoc(17));
82         st.expect(q, new Object JavaDoc[] { r[3], r[4] });
83     }
84
85     public void testDescendTwo() {
86         Query q = st.query();
87         Object JavaDoc[] r = store();
88         q.constrain(STTreeSetU.class);
89         Query qElements = q.descend("col");
90         qElements.constrain(new Integer JavaDoc(17));
91         qElements.constrain(new Integer JavaDoc(25));
92         st.expect(q, new Object JavaDoc[] { r[4] });
93     }
94
95     public void testDescendSmaller() {
96         Query q = st.query();
97         Object JavaDoc[] r = store();
98         q.constrain(STTreeSetU.class);
99         Query qElements = q.descend("col");
100         qElements.constrain(new Integer JavaDoc(3)).smaller();
101         st.expect(q, new Object JavaDoc[] { r[2], r[3] });
102     }
103     
104
105 }
Popular Tags