01: /* Copyright (C) 2004 - 2007 db4objects Inc. http://www.db4o.com
02:
03: This file is part of the db4o open source object database.
04:
05: db4o is free software; you can redistribute it and/or modify it under
06: the terms of version 2 of the GNU General Public License as published
07: by the Free Software Foundation and as clarified by db4objects' GPL
08: interpretation policy, available at
09: 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.db4ounit.common.assorted;
22:
23: import com.db4o.ObjectSet;
24: import com.db4o.query.Query;
25:
26: import db4ounit.Assert;
27: import db4ounit.extensions.AbstractDb4oTestCase;
28:
29: public class LongLinkedListTestCase extends AbstractDb4oTestCase {
30:
31: private static final int COUNT = 1000;
32:
33: public static class LinkedList {
34:
35: public LinkedList _next;
36:
37: public int _depth;
38:
39: }
40:
41: private static LinkedList newLongCircularList() {
42: LinkedList head = new LinkedList();
43: LinkedList tail = head;
44: for (int i = 1; i < COUNT; i++) {
45: tail._next = new LinkedList();
46: tail = tail._next;
47: tail._depth = i;
48: }
49: tail._next = head;
50: return head;
51: }
52:
53: public static void main(String[] args) throws Exception {
54: new LongLinkedListTestCase().runSolo();
55: }
56:
57: protected void store() throws Exception {
58: store(newLongCircularList());
59: }
60:
61: public void test() {
62: Query q = newQuery(LinkedList.class);
63: q.descend("_depth").constrain(new Integer(0));
64: ObjectSet objectSet = q.execute();
65: Assert.areEqual(1, objectSet.size());
66: LinkedList head = (LinkedList) objectSet.next();
67: db().activate(head, Integer.MAX_VALUE);
68: assertListIsComplete(head);
69: db().deactivate(head, Integer.MAX_VALUE);
70: db().activate(head, Integer.MAX_VALUE);
71: assertListIsComplete(head);
72: db().deactivate(head, Integer.MAX_VALUE);
73: db().refresh(head, Integer.MAX_VALUE);
74: assertListIsComplete(head);
75:
76: // TODO: The following produces a stack overflow. That's OK for now, peekPersisted is rarely
77: // used and users can control behaviour with the depth parameter.
78: //
79: // LinkedList peeked = (LinkedList) db().ext().peekPersisted(head, Integer.MAX_VALUE, true);
80: // assertListIsComplete(peeked);
81:
82: }
83:
84: private void assertListIsComplete(LinkedList head) {
85: int count = 1;
86: LinkedList tail = head._next;
87: while (tail != head) {
88: count++;
89: tail = tail._next;
90: }
91: Assert.areEqual(COUNT, count);
92: }
93:
94: }
|