vebt/package.json

A Van Emde Boas tree, also known as a vEB tree, is a tree data structure which implements an associative array with k-bit integer keys. It performs all operations in O(log k) time, or equivalently in O(log log K) time, where K = 2^k is the maximum number

{
	"name": "vebt",
	"version": "1.0.1",
	"homepage": "https://github.com/kourb/vebt#readme",
	"keywords": [
		"vebt",
		"veb"
	],
	"author": {
		"name": "Vlad Kourbatski",
		"email": "i1954@xe.am",
		"url": "http://xe.am/i1954"
	},
	"maintainers": [
		{
			"name": "kourb",
			"email": "i1954@xe.am"
		}
	],
	"main": "lib/vebt.js",
	"engines": {
		"node": ">=1.0.0"
	},
	"repository": {
		"type": "git",
		"url": "git://github.com/kourb/vebt.git"
	},
	"bugs": {
		"url": "https://github.com/kourb/vebt/issues"
	},
	"license": "GPL-2.0"
}