mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
dc26d6262b
- added new data structure 'eco' for an index file that should use only 50% of write-IO compared to kelondroFlex The new eco index is not used yet, but already successfully tested with the collectionIndex The main purpose is to replace the kelondroFlex at every point when enough RAM is available. Othervise, the kelondroFlex stays as option in case of low memory (which then can even use a file-index) git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@4337 6c8d7289-2bf4-0310-a012-ef5d649a1542
112 lines
3.9 KiB
Java
112 lines
3.9 KiB
Java
// kelondroBytesIntMap.java
|
|
// (C) 2006 by Michael Peter Christen; mc@anomic.de, Frankfurt a. M., Germany
|
|
// first published 18.06.2006 on http://www.anomic.de
|
|
//
|
|
// $LastChangedDate: 2006-04-02 22:40:07 +0200 (So, 02 Apr 2006) $
|
|
// $LastChangedRevision: 1986 $
|
|
// $LastChangedBy: orbiter $
|
|
//
|
|
// LICENSE
|
|
//
|
|
// 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
|
|
|
|
package de.anomic.kelondro;
|
|
|
|
import java.io.IOException;
|
|
|
|
public class kelondroBytesIntMap {
|
|
|
|
private kelondroRow rowdef;
|
|
private kelondroIndex index;
|
|
|
|
public kelondroBytesIntMap(kelondroIndex ki) {
|
|
assert (ki.row().columns() == 2); // must be a key/index relation
|
|
assert (ki.row().width(1) == 4); // the value must be a b256-encoded int, 4 bytes long
|
|
this.index = ki;
|
|
this.rowdef = ki.row();
|
|
}
|
|
|
|
public kelondroBytesIntMap(int keylength, kelondroByteOrder objectOrder, int space) {
|
|
this.rowdef = new kelondroRow(new kelondroColumn[]{new kelondroColumn("key", kelondroColumn.celltype_binary, kelondroColumn.encoder_bytes, keylength, "key"), new kelondroColumn("int c-4 {b256}")}, objectOrder, 0);
|
|
this.index = new kelondroRAMIndex(rowdef, space);
|
|
}
|
|
|
|
public kelondroRow row() {
|
|
return index.row();
|
|
}
|
|
|
|
public synchronized int geti(byte[] key) throws IOException {
|
|
assert (key != null);
|
|
kelondroRow.Entry indexentry = index.get(key);
|
|
if (indexentry == null) return -1;
|
|
return (int) indexentry.getColLong(1);
|
|
}
|
|
|
|
public synchronized int puti(byte[] key, int i) throws IOException {
|
|
assert i >= 0 : "i = " + i;
|
|
assert (key != null);
|
|
kelondroRow.Entry newentry = index.row().newEntry();
|
|
newentry.setCol(0, key);
|
|
newentry.setCol(1, i);
|
|
kelondroRow.Entry oldentry = index.put(newentry);
|
|
if (oldentry == null) return -1;
|
|
return (int) oldentry.getColLong(1);
|
|
}
|
|
|
|
public synchronized void addi(byte[] key, int i) throws IOException {
|
|
assert i >= 0 : "i = " + i;
|
|
assert (key != null);
|
|
kelondroRow.Entry newentry = this.rowdef.newEntry();
|
|
newentry.setCol(0, key);
|
|
newentry.setCol(1, i);
|
|
index.addUnique(newentry);
|
|
}
|
|
|
|
public synchronized int removei(byte[] key) throws IOException {
|
|
assert (key != null);
|
|
kelondroRow.Entry indexentry = index.remove(key, false);
|
|
if (indexentry == null) return -1;
|
|
return (int) indexentry.getColLong(1);
|
|
}
|
|
|
|
public synchronized int removeonei() throws IOException {
|
|
kelondroRow.Entry indexentry = index.removeOne();
|
|
if (indexentry == null) return -1;
|
|
return (int) indexentry.getColLong(1);
|
|
}
|
|
|
|
public synchronized int size() {
|
|
return index.size();
|
|
}
|
|
|
|
public synchronized kelondroCloneableIterator<byte[]> keys(boolean up, byte[] firstKey) throws IOException {
|
|
return index.keys(up, firstKey);
|
|
}
|
|
|
|
public synchronized kelondroCloneableIterator<kelondroRow.Entry> rows(boolean up, byte[] firstKey) throws IOException {
|
|
return index.rows(up, firstKey);
|
|
}
|
|
|
|
public kelondroProfile profile() {
|
|
return index.profile();
|
|
}
|
|
|
|
public synchronized void close() {
|
|
index.close();
|
|
index = null;
|
|
}
|
|
|
|
}
|