src.org.neodatis.btree.impl.singlevalue.BTreeSingleValuePerKey Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of neodatis-odb Show documentation

The NeoDatis Object Database

There is a newer version: 1.9.30.689

/*
 NeoDatis ODB : Native Object Database ([email protected])
 Copyright (C) 2007 NeoDatis Inc. http://www.neodatis.org

 "This file is part of the NeoDatis ODB open source object database".

 NeoDatis ODB is free software; you can redistribute it and/or
 modify it under the terms of the GNU Lesser General Public
 License as published by the Free Software Foundation; either
 version 2.1 of the License, or (at your option) any later version.

 NeoDatis ODB is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 Lesser General Public License for more details.

 You should have received a copy of the GNU Lesser General Public
 License along with this library; if not, write to the Free Software
 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 */
package org.neodatis.btree.impl.singlevalue;

import java.util.Iterator;

import org.neodatis.btree.BTreeIteratorSingleValuePerKey;
import org.neodatis.btree.IBTreeNodeOneValuePerKey;
import org.neodatis.btree.IBTreePersister;
import org.neodatis.btree.IBTreeSingleValuePerKey;
import org.neodatis.btree.impl.AbstractBTree;
import org.neodatis.odb.core.OrderByConstants;

public abstract class BTreeSingleValuePerKey extends AbstractBTree implements IBTreeSingleValuePerKey{

	public BTreeSingleValuePerKey() {
	}

	public BTreeSingleValuePerKey(String name, int degree, IBTreePersister persister) {
		super(name, degree, persister);
	}

	public Object search(Comparable key) {
		IBTreeNodeOneValuePerKey theRoot = (IBTreeNodeOneValuePerKey) getRoot();
		return theRoot.search(key);
	}
	
	public Iterator iterator(OrderByConstants orderBy) {
		return new BTreeIteratorSingleValuePerKey(this,orderBy);
	}

}