org.zoodb.index.critbit.Examples 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 2009-2017 Tilmann Zaeschke. All rights reserved.
 * 
 * This file is part of TinSpin.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.zoodb.index.critbit;

import java.util.Arrays;

import org.zoodb.index.critbit.CritBit.QueryIterator;
import org.zoodb.index.critbit.CritBit.QueryIteratorKD;


/**
 * 
 * @author Tilmann Zaeschke
 */
public class Examples {

	public static void main(String[] args) {
		ex1D_32();
		ex1D_float();
		ex1D_256();
		
		ex4D();
	}
	
	/**
	 * Example of a 1D crit-bit tree with 32 bit integer keys.
	 */
	private static void ex1D_32() {
		log("Testing 1D 32 bit tree");
		log("======================");
		CritBit1D cb = CritBit.create1D(32);
		long[] key = new long[]{1234};
		cb.put(key, "hello 32");
		log("contains() --> " + cb.contains(key));
		log("get() --> "+ cb.get(key));
		long[] min = new long[]{123}; 
		long[] max = new long[]{12345}; 
		QueryIterator it = cb.query(min, max); 
		log("iterator val: " + it.next());
		QueryIterator it2 = cb.query(min, max); 
		log("iterator key: " + it2.nextKey()[0]);
		log("remove: " + cb.remove(key));
	}

	/**
	 * Example of a 1D crit-bit tree with 64 bit float keys.
	 */
	private static void ex1D_float() {
		log("Testing 1D float tree");
		log("=====================");
		//double-float requires 64 bit
		CritBit1D cb = CritBit.create1D(64);
		long[] key = new long[]{BitTools.toSortableLong(12.34)};
		cb.put(key, "hello float");
		log("contains() --> " + cb.contains(key));
		log("get() --> "+ cb.get(key));
		long[] min = new long[]{BitTools.toSortableLong(1.0)}; 
		long[] max = new long[]{BitTools.toSortableLong(15.0)}; 
		QueryIterator it = cb.query(min, max); 
		log("iterator val: " + it.next());
		QueryIterator it2 = cb.query(min, max); 
		log("iterator key: " + BitTools.toDouble(it2.nextKey()[0]));
		log("remove: " + cb.remove(key));
	}

	/**
	 * Example of a 1D crit-bit tree with 256 bit integer keys.
	 */
	private static void ex1D_256() {
		log("Testing 1D 256 bit tree");
		log("=======================");
		CritBit1D cb = CritBit.create1D(256);  
		long[] key = new long[]{ 123456789012L, 3456, 4567, 12345678901234L};
		cb.put(key, "hello 256");
		log("contains() --> " + cb.contains(key));
		log("get() --> "+ cb.get(key));
		long[] min = new long[]{0, 0, 0, 0}; 
		long[] max = new long[]{Long.MAX_VALUE, Long.MAX_VALUE, Long.MAX_VALUE, Long.MAX_VALUE}; 
		QueryIterator it = cb.query(min, max); 
		log("iterator val: " + it.next());
		QueryIterator it2 = cb.query(min, max); 
		log("iterator key: " + it2.nextKey()[0]);
		log("remove: " + cb.remove(key));
	}

	/**
	 * Example of a 4D crit-bit tree with 1 float dimension.
	 */
	private static void ex4D() {
		log("Testing 4D tree");
		log("===============");
		CritBitKD cb = CritBit.createKD(64, 4);  
		long[] key = new long[]{ 
				123456789012L, 
				3456, 
				BitTools.toSortableLong(1234.5678), // double dimension
				12345678901234L};
		cb.putKD(key, "hello 4D");
		log("contains() --> " + cb.containsKD(key));
		log("get() --> "+ cb.getKD(key));
		long[] min = new long[]{0, 0, BitTools.toSortableLong(1.0), 0}; 
		long[] max = new long[]{Long.MAX_VALUE, Long.MAX_VALUE,
				BitTools.toSortableLong(Double.MAX_VALUE), Long.MAX_VALUE}; 
		QueryIteratorKD it = cb.queryKD(min, max); 
		log("iterator val: " + it.next());
		QueryIteratorKD it2 = cb.queryKD(min, max); 
		log("iterator key: " + Arrays.toString(it2.nextKey()));
		log("remove: " + cb.removeKD(key));
	}

	private static void log(String msg) {
		System.out.println(msg);
	}
}