ch.ethz.globis.pht64kd.MaxKTree64 Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of phtree Show documentation

The PH-Tree is a multi-dimensional index

There is a newer version: 2.8.1

/*
 * Copyright 2011-2016 ETH Zurich. All Rights Reserved.
 *
 * This software is the proprietary information of ETH Zurich.
 * Use is subject to license terms.
 */
package ch.ethz.globis.pht64kd;

import ch.ethz.globis.phtree.v11.nt.NodeTreeV11;

public class MaxKTree64 implements MaxKTreeI {

	private final long[] dummy;
	private final NodeTreeV11 tree;
	
	private MaxKTree64() {
		this.tree = NodeTreeV11.create(64);
		this.dummy = new long[getKeyBitWidth()];
	}
	
	private MaxKTree64(int keyWidth) {
		this.tree = NodeTreeV11.create(keyWidth);
		this.dummy = new long[getKeyBitWidth()];
	}
	
	public static  MaxKTree64 create() {
		return new MaxKTree64<>();
	}
	
	public static  MaxKTree64 create(int keyWidth) {
		return new MaxKTree64<>(keyWidth);
	}
	
	public T put(long key, T value) {
		return tree.put(key, dummy, value);
	}
	
	public T putKD(long key, long[] kdKey, T value) {
		return tree.put(key, kdKey, value);
	}
	
	public boolean contains(long key) {
		return tree.contains(key, dummy);
	}
	
	public T get(long key) {
		return tree.get(key, dummy);
	}
	
	public T getKd(long key, long[] kdKeyOut) {
		return tree.get(key, kdKeyOut);
	}
	
	public T remove(long key) {
		return tree.remove(key);
	}
	
	public boolean delete(long key) {
		return tree.remove(key) != null;
	}
	
	public String toStringTree() {
		return tree.toStringTree();
	}
	
	public PhIterator64 queryWithMask(long minMask, long maxMask) {
		return tree.queryWithMask(minMask, maxMask);
	}
	
	public PhIterator64 query(long min, long max) {
		return tree.query(min, max);
	}
	
	public PhIterator64 iterator() {
		return tree.iterator();
	}
	
	public boolean checkTree() {
		return tree.checkTree();
	}

	@Override
	public int size() {
		return tree.size();
	}

	@Override
	public int getKeyBitWidth() {
		return tree.getKeyBitWidth();
	}

	@Override
	public Object getRoot() {
		return tree.getRoot();
	}
	
}