yacy_search_server/source/de/anomic/index/indexContainerOrder.java
orbiter db1eae0227 * simplified initialization of database objects
* replaced kelondroTree for NURLs by kelondroFlex
* replaced kelondroTree for EURLs by kelondroFlex
take care, may be very buggy
please finish crawls before updating. crawls will be lost.

git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@2452 6c8d7289-2bf4-0310-a012-ef5d649a1542
2006-08-24 02:19:25 +00:00

61 lines
1.7 KiB
Java

package de.anomic.index;
import de.anomic.kelondro.kelondroOrder;
public class indexContainerOrder implements kelondroOrder {
private kelondroOrder embeddedOrder;
public indexContainerOrder(kelondroOrder embedOrder) {
this.embeddedOrder = embedOrder;
}
public void direction(boolean ascending) {
this.embeddedOrder.direction(ascending);
}
public long partition(byte[] key, int forks) {
return this.embeddedOrder.partition(key, forks);
}
public int compare(Object a, Object b) {
if ((a instanceof indexContainer) && (b instanceof indexContainer)) {
return this.embeddedOrder.compare(((indexContainer) a).getWordHash(), ((indexContainer) b).getWordHash());
}
return this.embeddedOrder.compare(a, b);
}
public byte[] zero() {
return this.embeddedOrder.zero();
}
public void rotate(byte[] zero) {
this.embeddedOrder.rotate(zero);
}
public Object clone() {
return new indexContainerOrder((kelondroOrder) this.embeddedOrder.clone());
}
public String signature() {
return this.embeddedOrder.signature();
}
public long cardinal(byte[] key) {
return this.embeddedOrder.cardinal(key);
}
public int compare(byte[] a, byte[] b) {
return this.embeddedOrder.compare(a, b);
}
public int compare(byte[] a, int aoffset, int alength, byte[] b, int boffset, int blength) {
return this.embeddedOrder.compare(a, aoffset, alength, b, boffset, blength);
}
public boolean equals(kelondroOrder otherOrder) {
if (!(otherOrder instanceof indexContainerOrder)) return false;
return this.embeddedOrder.equals(((indexContainerOrder) otherOrder).embeddedOrder);
}
}