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.fieldindex;
22:
23: import com.db4o.foundation.*;
24: import com.db4o.internal.*;
25: import com.db4o.internal.btree.*;
26: import com.db4o.internal.query.processor.*;
27:
28: public class JoinedLeaf implements IndexedNodeWithRange {
29:
30: private final QCon _constraint;
31: private final IndexedNodeWithRange _leaf1;
32: private final BTreeRange _range;
33:
34: public JoinedLeaf(final QCon constraint,
35: final IndexedNodeWithRange leaf1, final BTreeRange range) {
36: if (null == constraint || null == leaf1 || null == range) {
37: throw new ArgumentNullException();
38: }
39: _constraint = constraint;
40: _leaf1 = leaf1;
41: _range = range;
42: }
43:
44: public QCon getConstraint() {
45: return _constraint;
46: }
47:
48: public BTreeRange getRange() {
49: return _range;
50: }
51:
52: public Iterator4 iterator() {
53: return _range.keys();
54: }
55:
56: public TreeInt toTreeInt() {
57: return IndexedNodeBase.addToTree(null, this );
58: }
59:
60: public BTree getIndex() {
61: return _leaf1.getIndex();
62: }
63:
64: public boolean isResolved() {
65: return _leaf1.isResolved();
66: }
67:
68: public IndexedNode resolve() {
69: return IndexedPath.newParentPath(this , _constraint);
70: }
71:
72: public int resultSize() {
73: return _range.size();
74: }
75: }
|