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.btree;
22:
23: import com.db4o.foundation.*;
24: import com.db4o.internal.*;
25: import com.db4o.internal.btree.*;
26:
27: import db4ounit.*;
28:
29: public class BTreeNodeTestCase extends BTreeTestCaseBase {
30:
31: public static void main(String[] args) {
32: new BTreeNodeTestCase().runSolo();
33: }
34:
35: private final int[] keys = new int[] { -5, -4, -3, -2, -1, 0, 1, 2,
36: 3, 4, 7, 9 };
37:
38: protected void db4oSetupAfterStore() throws Exception {
39: super .db4oSetupAfterStore();
40: add(keys);
41: commit();
42: }
43:
44: public void testLastKeyIndex() {
45: BTreeNode node = node(3);
46: Assert.areEqual(1, node.lastKeyIndex(trans()));
47: Transaction trans = newTransaction();
48: _btree.add(trans, new Integer(5));
49: Assert.areEqual(1, node.lastKeyIndex(trans()));
50: _btree.commit(trans);
51: Assert.areEqual(2, node.lastKeyIndex(trans()));
52: }
53:
54: private BTreeNode node(final int value) {
55: BTreeRange range = search(value);
56: Iterator4 i = range.pointers();
57: i.moveNext();
58: BTreePointer firstPointer = (BTreePointer) i.current();
59: BTreeNode node = firstPointer.node();
60: node.debugLoadFully(systemTrans());
61: return node;
62: }
63:
64: public void testLastPointer() {
65: BTreeNode node = node(3);
66: BTreePointer lastPointer = node.lastPointer(trans());
67: assertPointerKey(4, lastPointer);
68: }
69:
70: }
|