Persistent stack data structures for JavaScript
A fully persistent balanced binary search tree
Immutable Data Collections
Extract meaning from JS Errors
Captures and cleans stack traces
No description provided.
FantasyLand compliant (monadic) alternative to Promises
Fast purely functional immutable lists.
Merkle tree implemented as a persistent datastructure
Clean up error stack traces
Generate artificial backtrace by walking arguments.callee.caller chain
Get v8 stack traces as an array of CallSite objects.
A practical functional library for JavaScript programmers.
Cross-browser Error parser
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Persistent ordered mapping from strings
Use space and slash separated color notation in CSS
Deep-merge the values of one object structure into another
Cross-platform functionality to manage cached credentials.
ESLint rules to promote functional programming in TypeScript.
Strongly typed trie data structure for path and URL-like strings.
Vue.js util for intelligently merging data passed to functional components.
JS Object representation of a stack frame
Functional programming in TypeScript