http://forum.yacy-websuche.de/viewtopic.php?p=20066#p20066 git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@6876 6c8d7289-2bf4-0310-a012-ef5d649a1542pull/1/head
orbiter
15 years ago
parent
734298facd
commit
118d589eff
@ -1,408 +0,0 @@
|
|||||||
// kelondroStack.java
|
|
||||||
// -----------------------
|
|
||||||
// part of The Kelondro Database
|
|
||||||
// (C) by Michael Peter Christen; mc@yacy.net
|
|
||||||
// first published on http://www.anomic.de
|
|
||||||
// Frankfurt, Germany, 2004
|
|
||||||
// last change: 11.01.2004
|
|
||||||
//
|
|
||||||
// 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
|
|
||||||
|
|
||||||
/*
|
|
||||||
This class extends the kelondroRecords and adds a stack structure
|
|
||||||
*/
|
|
||||||
|
|
||||||
package net.yacy.kelondro.table;
|
|
||||||
|
|
||||||
import java.io.BufferedReader;
|
|
||||||
import java.io.File;
|
|
||||||
import java.io.FileReader;
|
|
||||||
import java.io.IOException;
|
|
||||||
import java.io.RandomAccessFile;
|
|
||||||
import java.util.Iterator;
|
|
||||||
import java.util.StringTokenizer;
|
|
||||||
|
|
||||||
import net.yacy.kelondro.index.Row;
|
|
||||||
import net.yacy.kelondro.logging.Log;
|
|
||||||
import net.yacy.kelondro.order.NaturalOrder;
|
|
||||||
import net.yacy.kelondro.util.FileUtils;
|
|
||||||
import net.yacy.kelondro.util.kelondroException;
|
|
||||||
|
|
||||||
|
|
||||||
public final class RecordStack extends Records {
|
|
||||||
|
|
||||||
// define the Over-Head-Array
|
|
||||||
private static short thisOHBytes = 0; // our record definition does not need extra bytes
|
|
||||||
private static short thisOHHandles = 2; // and two handles overhead for a double-chained list
|
|
||||||
private static short thisFHandles = 2; // two file handles for root handle and handle to last element
|
|
||||||
|
|
||||||
// define pointers for OH array access
|
|
||||||
protected static final int left = 0; // pointer for OHHandle-array: handle()-Value of left child Node
|
|
||||||
protected static final int right = 1; // pointer for OHHandle-array: handle()-Value of right child Node
|
|
||||||
protected static final int root = 0; // pointer for FHandles-array: pointer to root node
|
|
||||||
protected static final int toor = 1; // pointer for FHandles-array: pointer to root node
|
|
||||||
|
|
||||||
public RecordStack(final File file, final Row rowdef) throws IOException {
|
|
||||||
// this creates a new stack
|
|
||||||
super(file, thisOHBytes, thisOHHandles, rowdef, thisFHandles, rowdef.columns() /* txtProps */, 80 /* txtPropWidth */);
|
|
||||||
if (super.fileExisted) {
|
|
||||||
//if ((getHandle(root) == null) && (getHandle(toor) == null)) clear();
|
|
||||||
} else {
|
|
||||||
setHandle(root, null); // define the root value
|
|
||||||
setHandle(toor, null); // define the toor value
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public static final RecordStack open(final File file, final Row rowdef) {
|
|
||||||
try {
|
|
||||||
return new RecordStack(file, rowdef);
|
|
||||||
} catch (final IOException e) {
|
|
||||||
Log.logSevere("Stack", "Stack file open failed, deleting stack file " + file.toString());
|
|
||||||
Log.logException(e);
|
|
||||||
FileUtils.deletedelete(file);
|
|
||||||
try {
|
|
||||||
return new RecordStack(file, rowdef);
|
|
||||||
} catch (final IOException ee) {
|
|
||||||
System.out.println("kelondroStack: cannot open or create file " + file.toString());
|
|
||||||
Log.logException(e);
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void clear() {
|
|
||||||
try {
|
|
||||||
super.clear();
|
|
||||||
setHandle(root, null);
|
|
||||||
setHandle(toor, null);
|
|
||||||
} catch (IOException e) {
|
|
||||||
Log.logException(e);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public Iterator<Row.Entry> stackIterator(final boolean up) {
|
|
||||||
// iterates the elements in an ordered way.
|
|
||||||
// returns kelondroRow.Entry - type Objects
|
|
||||||
return new stackIterator(up);
|
|
||||||
}
|
|
||||||
|
|
||||||
public class stackIterator implements Iterator<Row.Entry> {
|
|
||||||
Records.Handle nextHandle = null;
|
|
||||||
Records.Handle lastHandle = null;
|
|
||||||
boolean up;
|
|
||||||
|
|
||||||
public stackIterator(final boolean up) {
|
|
||||||
this.up = up;
|
|
||||||
nextHandle = getHandle((up) ? root : toor);
|
|
||||||
}
|
|
||||||
|
|
||||||
public boolean hasNext() {
|
|
||||||
return (nextHandle != null);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Row.Entry next() {
|
|
||||||
lastHandle = nextHandle;
|
|
||||||
try {
|
|
||||||
nextHandle = new Node(nextHandle).getOHHandle((up) ? right : left);
|
|
||||||
return row().newEntry(new Node(lastHandle).getValueRow());
|
|
||||||
} catch (final IOException e) {
|
|
||||||
Log.logException(e);
|
|
||||||
throw new kelondroException(filename, "IO error at stackIterator.next(): " + e.getMessage());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void remove() {
|
|
||||||
try {
|
|
||||||
unlinkNode(new Node(lastHandle));
|
|
||||||
} catch (final IOException e) {
|
|
||||||
Log.logException(e);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized int size() {
|
|
||||||
return super.size();
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized void push(final Row.Entry row) throws IOException {
|
|
||||||
// check if there is already a stack
|
|
||||||
if (getHandle(toor) == null) {
|
|
||||||
if (getHandle(root) != null) throw new RuntimeException("push: internal organisation of root and toor");
|
|
||||||
// create node
|
|
||||||
final Node n = new Node(row.bytes());
|
|
||||||
n.setOHHandle(left, null);
|
|
||||||
n.setOHHandle(right, null);
|
|
||||||
n.commit();
|
|
||||||
// assign handles
|
|
||||||
setHandle(root, n.handle());
|
|
||||||
setHandle(toor, n.handle());
|
|
||||||
// thats it
|
|
||||||
} else {
|
|
||||||
// expand the list at the end
|
|
||||||
final Node n = new Node(row.bytes());
|
|
||||||
n.setOHHandle(left, getHandle(toor));
|
|
||||||
n.setOHHandle(right, null);
|
|
||||||
final Node n1 = new Node(getHandle(toor));
|
|
||||||
n1.setOHHandle(right, n.handle());
|
|
||||||
n.commit();
|
|
||||||
n1.commit();
|
|
||||||
// assign handles
|
|
||||||
setHandle(toor, n.handle());
|
|
||||||
// thats it
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized Row.Entry pop() throws IOException {
|
|
||||||
// return row ontop of the stack and shrink stack by one
|
|
||||||
final Node n = topNode();
|
|
||||||
if (n == null) return null;
|
|
||||||
final Row.Entry ret = row().newEntry(n.getValueRow());
|
|
||||||
|
|
||||||
// remove node
|
|
||||||
unlinkNode(n);
|
|
||||||
deleteNode(n.handle());
|
|
||||||
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized Row.Entry top() throws IOException {
|
|
||||||
// return row ontop of the stack
|
|
||||||
final Node n = topNode();
|
|
||||||
if (n == null) return null;
|
|
||||||
return row().newEntry(n.getValueRow());
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized Row.Entry pot() throws IOException {
|
|
||||||
// return row on the bottom of the stack and remove record
|
|
||||||
final Node n = botNode();
|
|
||||||
if (n == null) {
|
|
||||||
Log.logInfo("Stack", "botNode() == null in " + this.filename);
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
final Row.Entry ret = row().newEntry(n.getValueRow());
|
|
||||||
|
|
||||||
// remove node
|
|
||||||
unlinkNode(n);
|
|
||||||
deleteNode(n.handle());
|
|
||||||
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
public synchronized Row.Entry bot() throws IOException {
|
|
||||||
// return row on the bottom of the stack
|
|
||||||
final Node n = botNode();
|
|
||||||
if (n == null) return null;
|
|
||||||
return row().newEntry(n.getValueRow());
|
|
||||||
}
|
|
||||||
|
|
||||||
protected void unlinkNode(final Node n) throws IOException {
|
|
||||||
// join chaines over node
|
|
||||||
final Records.Handle l = n.getOHHandle(left);
|
|
||||||
final Records.Handle r = n.getOHHandle(right);
|
|
||||||
// look left
|
|
||||||
if (l == null) {
|
|
||||||
// reached the root on left side
|
|
||||||
setHandle(root, r);
|
|
||||||
} else {
|
|
||||||
// un-link the previous record
|
|
||||||
final Node k = new Node(l);
|
|
||||||
k.setOHHandle(left, k.getOHHandle(left));
|
|
||||||
k.setOHHandle(right, r);
|
|
||||||
k.commit();
|
|
||||||
}
|
|
||||||
// look right
|
|
||||||
if (r == null) {
|
|
||||||
// reached the root on right side
|
|
||||||
setHandle(toor, l);
|
|
||||||
} else {
|
|
||||||
// un-link the following record
|
|
||||||
final Node k = new Node(r);
|
|
||||||
k.setOHHandle(left, l);
|
|
||||||
k.setOHHandle(right, k.getOHHandle(right));
|
|
||||||
k.commit();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
private Node topNode() throws IOException {
|
|
||||||
// return node ontop of the stack
|
|
||||||
if (isEmpty()) return null;
|
|
||||||
final Records.Handle h = getHandle(toor);
|
|
||||||
if (h == null) return null;
|
|
||||||
return new Node(h);
|
|
||||||
}
|
|
||||||
|
|
||||||
private Node botNode() throws IOException {
|
|
||||||
// return node on bottom of the stack
|
|
||||||
if (isEmpty()) {
|
|
||||||
Log.logInfo("Stack", "size() == 0");
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
final Records.Handle h = getHandle(root);
|
|
||||||
if (h == null) {
|
|
||||||
Log.logInfo("Stack", "getHandle(root) == null in " + this.filename);
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
return new Node(h);
|
|
||||||
}
|
|
||||||
|
|
||||||
public int imp(final File file, final String separator) throws IOException {
|
|
||||||
// imports a value-separated file, returns number of records that have been read
|
|
||||||
RandomAccessFile f = null;
|
|
||||||
try {
|
|
||||||
f = new RandomAccessFile(file,"r");
|
|
||||||
String s;
|
|
||||||
StringTokenizer st;
|
|
||||||
int recs = 0;
|
|
||||||
final Row.Entry buffer = row().newEntry();
|
|
||||||
int c;
|
|
||||||
int line = 0;
|
|
||||||
while ((s = f.readLine()) != null) {
|
|
||||||
s = s.trim();
|
|
||||||
line++;
|
|
||||||
if (s.length() > 0 && s.charAt(0) != '#') {
|
|
||||||
st = new StringTokenizer(s, separator);
|
|
||||||
// buffer the entry
|
|
||||||
c = 0;
|
|
||||||
while ((c < row().columns()) && (st.hasMoreTokens())) {
|
|
||||||
buffer.setCol(c++, st.nextToken().trim().getBytes());
|
|
||||||
}
|
|
||||||
if ((st.hasMoreTokens()) || (c != row().columns())) {
|
|
||||||
System.err.println("inapropriate number of entries in line " + line);
|
|
||||||
} else {
|
|
||||||
push(buffer);
|
|
||||||
recs++;
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return recs;
|
|
||||||
} finally {
|
|
||||||
if (f!=null) try{f.close(); f.getChannel().close();}catch(final Exception e){}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void print() throws IOException {
|
|
||||||
super.print();
|
|
||||||
final Iterator<Row.Entry> it = stackIterator(true);
|
|
||||||
Row.Entry r;
|
|
||||||
while (it.hasNext()) {
|
|
||||||
r = it.next();
|
|
||||||
System.out.print(" KEY:'" + r.getColString(0, null) + "'");
|
|
||||||
for (int j = 1; j < row().columns(); j++)
|
|
||||||
System.out.print(", V[" + j + "]:'" + r.getColString(j, null) + "'");
|
|
||||||
System.out.println();
|
|
||||||
}
|
|
||||||
System.out.println();
|
|
||||||
}
|
|
||||||
|
|
||||||
private static void cmd(final String[] args) {
|
|
||||||
System.out.print("kelondroStack ");
|
|
||||||
for (int i = 0; i < args.length; i++) System.out.print(args[i] + " ");
|
|
||||||
System.out.println("");
|
|
||||||
byte[] ret = null;
|
|
||||||
final Row lens = new Row("byte[] key-" + Integer.parseInt(args[1]) + ", byte[] value-" + Integer.parseInt(args[2]), NaturalOrder.naturalOrder);
|
|
||||||
try {
|
|
||||||
if ((args.length > 4) || (args.length < 2)) {
|
|
||||||
System.err.println("usage: kelondroStack -c|-p|-v|-g|-i|-s [file]|[key [value]] <db-file>");
|
|
||||||
System.err.println("( create, push, view, (g)pop, imp, shell)");
|
|
||||||
System.exit(0);
|
|
||||||
} else if (args.length == 2) {
|
|
||||||
RecordStack fm = new RecordStack(new File(args[1]), lens);
|
|
||||||
if (args[0].equals("-v")) {
|
|
||||||
fm.print();
|
|
||||||
ret = null;
|
|
||||||
} else if (args[0].equals("-g")) {
|
|
||||||
fm = new RecordStack(new File(args[1]), lens);
|
|
||||||
final Row.Entry ret2 = fm.pop();
|
|
||||||
ret = ((ret2 == null) ? null : ret2.getColBytes(1, true));
|
|
||||||
fm.close();
|
|
||||||
}
|
|
||||||
fm.close();
|
|
||||||
} else if (args.length == 3) {
|
|
||||||
if (args[0].equals("-i")) {
|
|
||||||
final RecordStack fm = new RecordStack(new File(args[2]), lens);
|
|
||||||
final int i = fm.imp(new File(args[1]),";");
|
|
||||||
fm.close();
|
|
||||||
ret = (i + " records imported").getBytes();
|
|
||||||
} else if (args[0].equals("-s")) {
|
|
||||||
final String db = args[2];
|
|
||||||
BufferedReader f = null;
|
|
||||||
try {
|
|
||||||
f = new BufferedReader(new FileReader(args[1]));
|
|
||||||
|
|
||||||
String m;
|
|
||||||
while (true) {
|
|
||||||
m = f.readLine();
|
|
||||||
if (m == null) break;
|
|
||||||
if (m.length() > 1 && m.charAt(0) != '#') {
|
|
||||||
m = m + " " + db;
|
|
||||||
cmd(line2args(m));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ret = null;
|
|
||||||
} finally {
|
|
||||||
if (f != null) try {f.close();}catch(final Exception e) {}
|
|
||||||
}
|
|
||||||
} else if (args[0].equals("-g")) {
|
|
||||||
final RecordStack fm = new RecordStack(new File(args[2]), lens);
|
|
||||||
final Row.Entry ret2 = fm.pop();
|
|
||||||
ret = ((ret2 == null) ? null : ret2.getColBytes(1, true));
|
|
||||||
fm.close();
|
|
||||||
}
|
|
||||||
} else if (args.length == 4) {
|
|
||||||
if (args[0].equals("-c")) {
|
|
||||||
// create <keylen> <valuelen> <filename>
|
|
||||||
final File f = new File(args[3]);
|
|
||||||
if (f.exists()) FileUtils.deletedelete(f);
|
|
||||||
final RecordStack fm = new RecordStack(f, lens);
|
|
||||||
fm.close();
|
|
||||||
} else if (args[0].equals("-p")) {
|
|
||||||
final RecordStack fm = new RecordStack(new File(args[3]), lens);
|
|
||||||
fm.push(fm.row().newEntry(new byte[][] {args[1].getBytes(), args[2].getBytes()}));
|
|
||||||
fm.close();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (ret == null)
|
|
||||||
System.out.println("NULL");
|
|
||||||
else
|
|
||||||
System.out.println(new String(ret));
|
|
||||||
} catch (final Exception e) {
|
|
||||||
Log.logException(e);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public static void main(final String[] args) {
|
|
||||||
// -c 10 20 test.stack
|
|
||||||
// -p a a1 test.stack
|
|
||||||
// -p b b1 test.stack
|
|
||||||
// -p c c1 test.stack
|
|
||||||
// -v test.stack
|
|
||||||
// -g test.stack
|
|
||||||
// -v test.stack
|
|
||||||
// -g 1 test.stack
|
|
||||||
cmd(args);
|
|
||||||
/*
|
|
||||||
kelondroStack s = new kelondroStack(new File("/Users/admin/dev/yacy/trunk/test.stack"), 1024, new int[]{10,10}, false);
|
|
||||||
try {
|
|
||||||
s.push(s.row().newEntry(new byte[][]{"test123".getBytes(), "abcdefg".getBytes()}));
|
|
||||||
s.close();
|
|
||||||
} catch (IOException e) {
|
|
||||||
// TODO Auto-generated catch block
|
|
||||||
Log.logException(e);
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
Loading…
Reference in new issue