|
|
|
|
@ -22,7 +22,7 @@
|
|
|
|
|
// 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.index;
|
|
|
|
|
package net.yacy.kelondro.index;
|
|
|
|
|
|
|
|
|
|
import java.io.BufferedInputStream;
|
|
|
|
|
import java.io.BufferedOutputStream;
|
|
|
|
|
@ -34,8 +34,6 @@ import java.io.InputStream;
|
|
|
|
|
import java.io.OutputStream;
|
|
|
|
|
import java.util.ArrayList;
|
|
|
|
|
import java.util.Iterator;
|
|
|
|
|
import java.util.Random;
|
|
|
|
|
import java.util.TreeMap;
|
|
|
|
|
import java.util.concurrent.BlockingQueue;
|
|
|
|
|
import java.util.concurrent.Callable;
|
|
|
|
|
import java.util.concurrent.ExecutionException;
|
|
|
|
|
@ -46,12 +44,9 @@ import java.util.concurrent.LinkedBlockingQueue;
|
|
|
|
|
import java.util.zip.GZIPInputStream;
|
|
|
|
|
import java.util.zip.GZIPOutputStream;
|
|
|
|
|
|
|
|
|
|
import net.yacy.kelondro.order.Base64Order;
|
|
|
|
|
import net.yacy.kelondro.order.ByteOrder;
|
|
|
|
|
import net.yacy.kelondro.order.CloneableIterator;
|
|
|
|
|
|
|
|
|
|
import de.anomic.kelondro.util.MemoryControl;
|
|
|
|
|
import de.anomic.yacy.dht.FlatWordPartitionScheme;
|
|
|
|
|
|
|
|
|
|
public class HandleMap implements Iterable<Row.Entry> {
|
|
|
|
|
|
|
|
|
|
@ -380,51 +375,6 @@ public class HandleMap implements Iterable<Row.Entry> {
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public static void main(String[] args) {
|
|
|
|
|
int count = (args.length == 0) ? 1000000 : Integer.parseInt(args[0]);
|
|
|
|
|
System.out.println("Starting test with " + count + " objects");
|
|
|
|
|
System.out.println("expected memory: " + (count * 16) + " bytes");
|
|
|
|
|
System.out.println("available memory: " + MemoryControl.available());
|
|
|
|
|
Random r = new Random(0);
|
|
|
|
|
long start = System.currentTimeMillis();
|
|
|
|
|
|
|
|
|
|
System.gc(); // for resource measurement
|
|
|
|
|
long a = MemoryControl.available();
|
|
|
|
|
HandleMap idx = new HandleMap(12, Base64Order.enhancedCoder, 4, 0, 150000);
|
|
|
|
|
for (int i = 0; i < count; i++) {
|
|
|
|
|
idx.inc(FlatWordPartitionScheme.positionToHash(r.nextInt(count)));
|
|
|
|
|
}
|
|
|
|
|
long timek = ((long) count) * 1000L / (System.currentTimeMillis() - start);
|
|
|
|
|
System.out.println("Result HandleMap: " + timek + " inc per second");
|
|
|
|
|
System.gc();
|
|
|
|
|
long memk = a - MemoryControl.available();
|
|
|
|
|
System.out.println("Used Memory: " + memk + " bytes");
|
|
|
|
|
System.out.println("x " + idx.get(FlatWordPartitionScheme.positionToHash(0)));
|
|
|
|
|
idx = null;
|
|
|
|
|
|
|
|
|
|
r = new Random(0);
|
|
|
|
|
start = System.currentTimeMillis();
|
|
|
|
|
byte[] hash;
|
|
|
|
|
Integer d;
|
|
|
|
|
System.gc(); // for resource measurement
|
|
|
|
|
a = MemoryControl.available();
|
|
|
|
|
TreeMap<byte[], Integer> hm = new TreeMap<byte[], Integer>(Base64Order.enhancedCoder);
|
|
|
|
|
for (int i = 0; i < count; i++) {
|
|
|
|
|
hash = FlatWordPartitionScheme.positionToHash(r.nextInt(count));
|
|
|
|
|
d = hm.get(hash);
|
|
|
|
|
if (d == null) hm.put(hash, 1); else hm.put(hash, d + 1);
|
|
|
|
|
}
|
|
|
|
|
long timej = ((long) count) * 1000L / (System.currentTimeMillis() - start);
|
|
|
|
|
System.out.println("Result TreeMap: " + timej + " inc per second");
|
|
|
|
|
System.gc();
|
|
|
|
|
long memj = a - MemoryControl.available();
|
|
|
|
|
System.out.println("Used Memory: " + memj + " bytes");
|
|
|
|
|
System.out.println("x " + hm.get(FlatWordPartitionScheme.positionToHash(0)));
|
|
|
|
|
System.out.println("Geschwindigkeitsfaktor j/k: " + ((float) (10 * timej / timek) / 10.0) + " - je kleiner desto besser fuer kelondro");
|
|
|
|
|
System.out.println("Speicherplatzfaktor j/k: " + ((float) (10 * memj / memk) / 10.0) + " - je groesser desto besser fuer kelondro");
|
|
|
|
|
System.exit(0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public Iterator<Row.Entry> iterator() {
|
|
|
|
|
return this.rows(true, null);
|
|
|
|
|
}
|
orbiter
16 years ago