{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"alias-map","owner":"jsdsl","isFork":false,"description":"A map where multiple keys point to a single value, and the removal of a single key removes all matching key-value pairs.","allTopics":["map","data-structure","alias","adt","multikey"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":16,"issueCount":2,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-02T00:06:37.456Z"}},{"type":"Public","name":"container","owner":"jsdsl","isFork":false,"description":"An interface representing the general forms of data structures that contain elements.","allTopics":["typescript","collection","data-structure","containers","container","collections","adt"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":5,"issueCount":1,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-07T04:22:30.163Z"}},{"type":"Public","name":"trie","owner":"jsdsl","isFork":false,"description":"Tree-based string storage data structure.","allTopics":["tree","data-structure","adt","trie"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":14,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-04T06:18:02.653Z"}},{"type":"Public","name":"array-list","owner":"jsdsl","isFork":false,"description":"An ArrayList implementation in JavaScript/TypeScript.","allTopics":["list","data-structure","adt","arraylist"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":15,"issueCount":2,"starsCount":0,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-04T05:08:05.417Z"}},{"type":"Public","name":"doubly-linked-list","owner":"jsdsl","isFork":false,"description":"A full-featured doubly-linked list implementation.","allTopics":["data-structure","dll","adt","doubly-linked-list"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":16,"issueCount":2,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-04T04:51:49.356Z"}},{"type":"Public","name":"action-queue","owner":"jsdsl","isFork":false,"description":"A series of executable actions represented as a queue.","allTopics":["data-structure","queue","callback","adt","fifo"],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":14,"issueCount":5,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-04T04:48:31.421Z"}},{"type":"Public","name":"abstract-list","owner":"jsdsl","isFork":false,"description":"An abstraction of the list data structure.","allTopics":["list","data-structure","adt","abstract"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":16,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-04T04:48:18.064Z"}},{"type":"Public","name":"optionals","owner":"jsdsl","isFork":false,"description":"`Option` and `Result` structures, similar to Rust.","allTopics":[],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-16T21:01:39.242Z"}},{"type":"Public","name":"iterator","owner":"jsdsl","isFork":false,"description":"A collection of classes that allow iteration over a predefined collection of elements.","allTopics":["iteration","iterator","iterables","iterators","iterable","for-in","async-iterators","for-each","for-of","for-await-of","async-iterable","async-iterator","async-iteration","async-iterables","for-await","typescript"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-13T15:35:53.931Z"}},{"type":"Public","name":"semaphore","owner":"jsdsl","isFork":false,"description":"A Promise-based semaphore implementation.","allTopics":["async","semaphore","mutex","mutual-exclusion","typescript"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-11-04T16:45:22.626Z"}},{"type":"Public","name":"stream","owner":"jsdsl","isFork":false,"description":"A series of consumable elements that can be filtered, mapped, reduced, etc. into other streams, or collected into various other data structures.","allTopics":["functional","data-structure","series","adt","stream"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-17T20:59:26.986Z"}},{"type":"Public","name":"collections","owner":"jsdsl","isFork":false,"description":"A set of interfaces, abstract classes, and types that seek to describe most basic data structures.","allTopics":["map","list","typescript","data-structure","containers","dictionary","data-structures","collections","adt","adts"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-14T20:58:34.894Z"}},{"type":"Public","name":"bimap","owner":"jsdsl","isFork":false,"description":"A bidirectional map written in TypeScript.","allTopics":["map","data-structure","dictionary","bimap","adt","bidirectional-dictionary","bi-map","bidirectional-map","two-way-map","reversible-map","reversible-dictionary","typescript"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":1,"issueCount":3,"starsCount":6,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-14T19:43:25.846Z"}},{"type":"Public archive","name":"locking-queue","owner":"jsdsl","isFork":false,"description":"A mutex solution as an alternative to Promises/async+await.","allTopics":["data-structure","queue","adt","mutex","fifo"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-14T19:31:27.108Z"}},{"type":"Public","name":"queue","owner":"jsdsl","isFork":false,"description":"A queue (FIFO) implementation written in TypeScript.","allTopics":["typescript","data-structure","queue","adt","fifo","first-in-first-out"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":5,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-13T16:52:40.051Z"}},{"type":"Public","name":"stack","owner":"jsdsl","isFork":false,"description":"A stack (LIFO) implementation written in TypeScript.","allTopics":["data-structure","adt","lifo","last-in-first-out","typescript","stack"],"primaryLanguage":{"name":"TypeScript","color":"#3178c6"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-10T14:10:53.183Z"}},{"type":"Public","name":"multi-tract","owner":"jsdsl","isFork":false,"description":"A special implementation of a doubly linked list in which multiple 'tracts' form both per-tract lists, as well as an overall sequential list.","allTopics":["data-structure","dll","adt","doubly-linked-list","multi-path"],"primaryLanguage":{"name":"Shell","color":"#89e051"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-10-02T00:35:16.043Z"}},{"type":"Public","name":"comparators","owner":"jsdsl","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Shell","color":"#89e051"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-07-26T15:07:42.251Z"}}],"repositoryCount":18,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"jsdsl repositories"}