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.internal.btree;
22:
23: import com.db4o.foundation.ArgumentNullException;
24: import com.db4o.internal.*;
25:
26: /**
27: * @exclude
28: */
29: public class BTreeNodeSearchResult {
30:
31: private final Transaction _transaction;
32:
33: private final BTree _btree;
34:
35: private final BTreePointer _pointer;
36:
37: private final boolean _foundMatch;
38:
39: BTreeNodeSearchResult(Transaction transaction, BTree btree,
40: BTreePointer pointer, boolean foundMatch) {
41: if (null == transaction || null == btree) {
42: throw new ArgumentNullException();
43: }
44: _transaction = transaction;
45: _btree = btree;
46: _pointer = pointer;
47: _foundMatch = foundMatch;
48: }
49:
50: BTreeNodeSearchResult(Transaction trans, Buffer nodeReader,
51: BTree btree, BTreeNode node, int cursor, boolean foundMatch) {
52: this (trans, btree, pointerOrNull(trans, nodeReader, node,
53: cursor), foundMatch);
54: }
55:
56: BTreeNodeSearchResult(Transaction trans, Buffer nodeReader,
57: BTree btree, Searcher searcher, BTreeNode node) {
58: this (trans, btree, nextPointerIf(pointerOrNull(trans,
59: nodeReader, node, searcher.cursor()), searcher
60: .isGreater()), searcher.foundMatch());
61: }
62:
63: private static BTreePointer nextPointerIf(BTreePointer pointer,
64: boolean condition) {
65: if (null == pointer) {
66: return null;
67: }
68: if (condition) {
69: return pointer.next();
70: }
71: return pointer;
72: }
73:
74: private static BTreePointer pointerOrNull(Transaction trans,
75: Buffer nodeReader, BTreeNode node, int cursor) {
76: return node == null ? null : new BTreePointer(trans,
77: nodeReader, node, cursor);
78: }
79:
80: public BTreeRange createIncludingRange(BTreeNodeSearchResult end) {
81: BTreePointer firstPointer = firstValidPointer();
82: BTreePointer endPointer = end._foundMatch ? end._pointer.next()
83: : end.firstValidPointer();
84: return new BTreeRangeSingle(_transaction, _btree, firstPointer,
85: endPointer);
86: }
87:
88: public BTreePointer firstValidPointer() {
89: if (null == _pointer) {
90: return null;
91: }
92: if (_pointer.isValid()) {
93: return _pointer;
94: }
95: return _pointer.next();
96: }
97:
98: }
|