You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
63 lines
2.9 KiB
63 lines
2.9 KiB
// ObjectIndex.java
|
|
// ------------------
|
|
// part of the Kelondro Database
|
|
// (C) by Michael Peter Christen; mc@yacy.net
|
|
// first published on http://www.anomic.de
|
|
// Frankfurt, Germany, 2005
|
|
// created: 26.10.2005
|
|
//
|
|
// This program is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program 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 General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program; if not, write to the Free Software
|
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
/* A kelondroIndex is a table with indexed access on the first column
|
|
Elements may be selected from the table with logarithmic computation time
|
|
using the get-method. Inserts have also the same computation order and
|
|
can be done with the put-method.
|
|
|
|
The kelondro Database provides two implementations of this interface:
|
|
kelondroTree and kelondroHashtable
|
|
*/
|
|
|
|
package net.yacy.kelondro.index;
|
|
|
|
import java.io.IOException;
|
|
import java.util.ArrayList;
|
|
import java.util.Iterator;
|
|
|
|
import net.yacy.kelondro.order.CloneableIterator;
|
|
|
|
|
|
public interface ObjectIndex {
|
|
|
|
public String filename(); // returns a unique identified for this index; can be a real or artificial file name
|
|
public int size();
|
|
public boolean isEmpty();
|
|
public Row row();
|
|
public boolean has(byte[] key); // use this only if there is no get in case that has returns true
|
|
public Row.Entry get(byte[] key) throws IOException;
|
|
public Row.Entry replace(Row.Entry row) throws IOException, RowSpaceExceededException;
|
|
public void put(Row.Entry row) throws IOException, RowSpaceExceededException;
|
|
public void addUnique(Row.Entry row) throws IOException, RowSpaceExceededException; // no double-check
|
|
public ArrayList<RowCollection> removeDoubles() throws IOException, RowSpaceExceededException; // removes all elements that are double (to be used after all addUnique)
|
|
public Row.Entry remove(byte[] key) throws IOException;
|
|
public Row.Entry removeOne() throws IOException;
|
|
public CloneableIterator<byte[]> keys(boolean up, byte[] firstKey) throws IOException; // iterates only the key
|
|
public CloneableIterator<Row.Entry> rows(boolean up, byte[] firstKey) throws IOException; // iterates the whole row using the order of the keys
|
|
public CloneableIterator<Row.Entry> rows() throws IOException; // iterates the whole row without any order
|
|
public Iterator<Row.Entry> iterator();
|
|
public void deleteOnExit();
|
|
public void clear() throws IOException;
|
|
public void close();
|
|
}
|