{"id":13548748,"url":"https://github.com/monmohan/dsjslib","last_synced_at":"2025-12-24T05:20:38.573Z","repository":{"id":57216738,"uuid":"9926585","full_name":"monmohan/dsjslib","owner":"monmohan","description":"A library implementing several standard data structures and utilities, in JavaScript. Its written and tested using Node.js which is the target platform. ","archived":false,"fork":false,"pushed_at":"2017-07-19T21:03:30.000Z","size":578,"stargazers_count":772,"open_issues_count":5,"forks_count":68,"subscribers_count":48,"default_branch":"master","last_synced_at":"2025-03-18T18:04:02.529Z","etag":null,"topics":["algorithms","datastructures","javascript"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/monmohan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-05-08T02:22:06.000Z","updated_at":"2025-02-25T04:16:32.000Z","dependencies_parsed_at":"2022-08-28T21:01:11.061Z","dependency_job_id":null,"html_url":"https://github.com/monmohan/dsjslib","commit_stats":null,"previous_names":["monmohan/dsjs"],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/monmohan%2Fdsjslib","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/monmohan%2Fdsjslib/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/monmohan%2Fdsjslib/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/monmohan%2Fdsjslib/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/monmohan","download_url":"https://codeload.github.com/monmohan/dsjslib/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246895881,"owners_count":20851346,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","datastructures","javascript"],"created_at":"2024-08-01T12:01:14.025Z","updated_at":"2025-12-24T05:20:38.541Z","avatar_url":"https://github.com/monmohan.png","language":"JavaScript","readme":"[dsjslib](https://github.com/monmohan/dsjslib)\n=======================================\nThis is a collection of different data structures and utilities, implemented in JavaScript.\nIts written and tested using Node.js which is also the target platform.\n\n### [API Documentation \u003e\u003e](http://monmohan.github.io/dsjslib)\n\n\nOverview\n----------------\n* New\n    * [Bloom Filter](http://monmohan.github.io/dsjslib/BloomFilter.html) - Probabilistic data structure to test whether an element is a member of a set.\n\n* Maps\n    * Sorted Maps:  Maps sorted according to natural ordering of keys or by comparator function provided at creation time.\n    Two different backing stores are available\n        * [AVLTree](http://monmohan.github.io/dsjslib/AVLTree.html)\n        * [Skip List](http://monmohan.github.io/dsjslib/SkipList.html)\n    * Tries Map optimized for prefix searching on string keys\n        * [Multi Way Trie](http://monmohan.github.io/dsjslib/RWayTrie.html)\n        * [Ternary Search Trie](http://monmohan.github.io/dsjslib/TernarySearchTrie.html)\n    * Multi-Valued Map supporting multiple values for a key\n        * [MultiMap](http://monmohan.github.io/dsjslib/MultiMap.html)\n        * [TreeMultiMap](http://monmohan.github.io/dsjslib/TreeMultiMap.html) - In addition, Map is sorted on keys. Uses AVLTree as backing store\n* Queues\n    * [Linked Deque](http://monmohan.github.io/dsjslib/LinkedDeque.html) - An optionally capacity constrained deque based on linked nodes\n    * [Priority Queue](http://monmohan.github.io/dsjslib/PriorityQueue.html) - Priority Queue based on a Binary Heap\n    * [Delay Queue](http://monmohan.github.io/dsjslib/DelayQueue.html) - Queue of 'Delayed' items, item can only be taken when its delay has expired.\n        For example usage see [wiki: DelayQueue-for-Scheduled-Task-Management](https://github.com/monmohan/dsjslib/wiki/Example:-DelayQueue-for-Scheduled-Task-Management)\n\n* Utilities\n    * [LRU Cache with Stats](http://monmohan.github.io/dsjslib/Cache.html) Google Guava inspired LRU cache. [Reference: Google Guava](https://code.google.com/p/guava-libraries/). In-memory LRU cache implementation for Node,\n    inspired by Google Guava Loading Cache .  The cache is simpler since it doesn't have to deal with concurrent threads, but other functionality of Guava\n    cache are captured like\n           - Auto loader function\n           - Removal listener\n           - Auto expiry After Write (TTL)\n           - Max Size and weight\n           - Cache Stats recording\n    For usage and overview see wiki: https://github.com/monmohan/dsjslib/wiki/LRU-Cache-Feature-and-usage-overview\n\n    * [BitSet](http://monmohan.github.io/dsjslib/BitSet.html) - An array of bits with operations to set, examine and clear individual bits\n    * [CircularBuffer](http://monmohan.github.io/dsjslib/CircularBuffer.html) - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.\n    When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.\n    * [Bloom Filter](http://monmohan.github.io/dsjslib/BloomFilter.html) - Probabilistic data structure to test whether an element is a member of a set.\n    * [BTree](http://monmohan.github.io/dsjslib/BTree.html) - Self balancing generalized Search Tree\n\n\nInstallation\n-------------------------\n```js\n    npm install dsjslib\n```\n**Current version 0.6.14 is stable and thoroughly tested on Node v0.10**\n","funding_links":[],"categories":["JavaScript","data structures and algorithms"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmonmohan%2Fdsjslib","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmonmohan%2Fdsjslib","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmonmohan%2Fdsjslib/lists"}