toni
Version:
Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it
44 lines (43 loc) • 1.2 kB
JSON
{
"name": "toni"
, "version": "0.6.2"
, "description": "Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it also implies a gain greater than 200% in performances, for accessing values, when it was used with big integer ranges."
, "homepage": "https://github.com/rootslab/toni"
, "private": false
, "repository": {
"type": "git"
, "url": "git://github.com/rootslab/toni.git"
}
, "keywords": [
"toni"
, "bitmap"
, "bitarray"
, "bitset"
," lookup table"
, "buffer"
, "util"
]
, "author": {
"name": "Guglielmo Ferri"
, "email": "44gatti@gmail.com"
}
, "dependencies": {
"bolgia" : ">=2.7.4"
},
"devDependencies": {
"dado" : ">=0.2.0"
}
, "main": "index"
, "engines": {
"node": ">=0.10.x"
}
, "scripts": {
"test": "node test/run.js"
, "bench": "bash bench/run.sh"
}
, "license": "MIT"
, "readmeFilename": "Readme.md"
, "bugs": {
"url": "https://github.com/rootslab/toni/issues"
}
}