mirror of
https://github.com/zrwusa/data-structure-typed.git
synced 2024-09-20 03:54:05 +00:00
91 lines
3.6 KiB
JSON
91 lines
3.6 KiB
JSON
{
|
|
"name": "data-structure-typed",
|
|
"version": "1.21.0",
|
|
"description": "Javascript & TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
|
|
"main": "dist/index.js",
|
|
"scripts": {
|
|
"build": "rm -rf dist && npx tsc",
|
|
"test": "jest",
|
|
"update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed --save-dev",
|
|
"build:docs": "typedoc --out docs ./src",
|
|
"deps:check": "dependency-cruiser src",
|
|
"build:publish": "npm run test && npm run build && npm run build:docs && npm publish"
|
|
},
|
|
"repository": {
|
|
"type": "git",
|
|
"url": "git+https://github.com/zrwusa/data-structure-typed.git"
|
|
},
|
|
"keywords": [
|
|
"Binary Tree",
|
|
"Binary Search Tree (BST)",
|
|
"AVL Tree",
|
|
"Tree Multiset",
|
|
"Segment Tree",
|
|
"Binary Indexed Tree",
|
|
"Graph",
|
|
"Directed Graph",
|
|
"Undirected Graph",
|
|
"Linked List",
|
|
"Singly Linked List",
|
|
"Doubly Linked List",
|
|
"Queue",
|
|
"Object Deque",
|
|
"Array Deque",
|
|
"Stack",
|
|
"Hash",
|
|
"Coordinate Set",
|
|
"Coordinate Map",
|
|
"Heap",
|
|
"Priority Queue",
|
|
"Max Priority Queue",
|
|
"Min Priority Queue",
|
|
"Trie",
|
|
"DFS",
|
|
"DFSIterative",
|
|
"BFS",
|
|
"morris",
|
|
"Bellman-Ford ",
|
|
"Dijkstra's Algorithm",
|
|
"Floyd-Warshall Algorithm",
|
|
"Tarjan's Algorithm"
|
|
],
|
|
"author": "Tyler Zeng zrwusa@gmail.com",
|
|
"license": "MIT",
|
|
"bugs": {
|
|
"url": "https://github.com/zrwusa/data-structure-typed/issues"
|
|
},
|
|
"homepage": "https://github.com/zrwusa/data-structure-typed#readme",
|
|
"types": "dist/index.d.ts",
|
|
"devDependencies": {
|
|
"@types/jest": "^29.5.3",
|
|
"@types/node": "^20.4.9",
|
|
"avl-tree-typed": "^1.19.7",
|
|
"binary-tree-typed": "^1.19.7",
|
|
"bst-typed": "^1.19.7",
|
|
"dependency-cruiser": "^13.1.2",
|
|
"deque-typed": "^1.19.7",
|
|
"directed-graph-typed": "^1.19.7",
|
|
"doubly-linked-list-typed": "^1.19.7",
|
|
"graph-typed": "^1.19.7",
|
|
"heap-typed": "^1.19.7",
|
|
"jest": "^29.6.2",
|
|
"linked-list-typed": "^1.19.7",
|
|
"max-heap-typed": "^1.19.7",
|
|
"max-priority-queue-typed": "^1.19.7",
|
|
"min-heap-typed": "^1.19.7",
|
|
"min-priority-queue-typed": "^1.19.7",
|
|
"priority-queue-typed": "^1.19.7",
|
|
"singly-linked-list-typed": "^1.19.7",
|
|
"stack-typed": "^1.19.7",
|
|
"tree-multiset-typed": "^1.19.7",
|
|
"trie-typed": "^1.19.7",
|
|
"ts-jest": "^29.1.1",
|
|
"typedoc": "^0.24.8",
|
|
"typescript": "^4.9.5",
|
|
"undirected-graph-typed": "^1.19.7"
|
|
},
|
|
"dependencies": {
|
|
"zod": "^3.22.2"
|
|
}
|
|
}
|