mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
c8624903c6
terms (words) are not any more retrieved by their word hash string, but by a byte[] containing the word hash. this has strong advantages when RWIs are sorted in the ReferenceContainer Cache and compared with the sun.java TreeMap method, which needed getBytes() and new String() transformations before. Many thousands of such conversions are now omitted every second, which increases the indexing speed by a factor of two. git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@5812 6c8d7289-2bf4-0310-a012-ef5d649a1542
89 lines
3.4 KiB
Java
89 lines
3.4 KiB
Java
// indexContainerOrder.java
|
|
// (C) 2007 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
|
|
// first published 2007 on http://yacy.net
|
|
//
|
|
// This is a part of YaCy, a peer-to-peer based web search engine
|
|
//
|
|
// $LastChangedDate$
|
|
// $LastChangedRevision$
|
|
// $LastChangedBy$
|
|
//
|
|
// 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.text;
|
|
|
|
import de.anomic.kelondro.order.AbstractOrder;
|
|
import de.anomic.kelondro.order.Order;
|
|
|
|
public class ReferenceContainerOrder<ReferenceType extends Reference> extends AbstractOrder<ReferenceContainer<ReferenceType>> implements Order<ReferenceContainer<ReferenceType>>, Cloneable {
|
|
|
|
private final ReferenceFactory<ReferenceType> factory;
|
|
private final Order<byte[]> embeddedOrder;
|
|
|
|
public ReferenceContainerOrder(ReferenceFactory<ReferenceType> factory, final Order<byte[]> embedOrder) {
|
|
this.embeddedOrder = embedOrder;
|
|
this.factory = factory;
|
|
}
|
|
|
|
public boolean wellformed(final ReferenceContainer<ReferenceType> a) {
|
|
return embeddedOrder.wellformed(a.getTermHash());
|
|
}
|
|
|
|
public void direction(final boolean ascending) {
|
|
this.embeddedOrder.direction(ascending);
|
|
}
|
|
|
|
public long partition(final byte[] key, final int forks) {
|
|
return this.embeddedOrder.partition(key, forks);
|
|
}
|
|
|
|
public int compare(final ReferenceContainer<ReferenceType> a, final ReferenceContainer<ReferenceType> b) {
|
|
return this.embeddedOrder.compare(a.getTermHash(), b.getTermHash());
|
|
}
|
|
|
|
public boolean equal(ReferenceContainer<ReferenceType> a, ReferenceContainer<ReferenceType> b) {
|
|
return this.embeddedOrder.equal(a.getTermHash(), b.getTermHash());
|
|
}
|
|
|
|
public void rotate(final ReferenceContainer<ReferenceType> zero) {
|
|
this.embeddedOrder.rotate(zero.getTermHash());
|
|
this.zero = new ReferenceContainer<ReferenceType>(this.factory, this.embeddedOrder.zero(), zero);
|
|
}
|
|
|
|
public Order<ReferenceContainer<ReferenceType>> clone() {
|
|
return new ReferenceContainerOrder<ReferenceType>(this.factory, this.embeddedOrder.clone());
|
|
}
|
|
|
|
public String signature() {
|
|
return this.embeddedOrder.signature();
|
|
}
|
|
|
|
public long cardinal(final byte[] key) {
|
|
return this.embeddedOrder.cardinal(key);
|
|
}
|
|
|
|
public boolean equals(final Order<ReferenceContainer<ReferenceType>> otherOrder) {
|
|
if (!(otherOrder instanceof ReferenceContainerOrder)) return false;
|
|
return this.embeddedOrder.equals(((ReferenceContainerOrder<ReferenceType>) otherOrder).embeddedOrder);
|
|
}
|
|
|
|
public long cardinal(final ReferenceContainer<ReferenceType> key) {
|
|
return this.embeddedOrder.cardinal(key.getTermHash());
|
|
}
|
|
|
|
}
|