esds
Version:
ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)
50 lines (49 loc) • 1.02 kB
JSON
{
"name": "esds",
"version": "0.6.0",
"description": "ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)",
"main": "ESDS.js",
"bugs": {
"url": "https://github.com/jayalbo/ESDS/issues"
},
"keywords": [
"priority queue",
"heap",
"queue",
"stack",
"trie",
"graph",
"bst",
"binary search tree",
"bianry tree",
"js",
"bloom filters",
"bloom-filter",
"bloom_filters",
"filter",
"filters",
"es6",
"directed graph",
"undirected graph",
"prefix tree",
"digital tree",
"list",
"linked-list",
"linked list",
"data_structures",
"data structures"
],
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"repository": {
"type": "git",
"url": "https://github.com/jayalbo/ESDS.git"
},
"type": "module",
"author": "",
"license": "MIT",
"dependencies": {
"xxhash-wasm": "^0.4.1"
}
}