JavaScript implementation of a double-ended queue
TypeScript
18
2
Other
This project provides a JavaScript implementation of a double-ended queue (deque), offering efficient insertion and removal of elements from both ends. It's designed for developers who need a flexible data structure that generalizes stacks and queues, with a comprehensive API including rotation, extension, and iteration capabilities. The library is particularly useful for TypeScript projects, as it includes published type definitions.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of blakeembrey/deque
TypeScript definitions for benchmark
TypeScript definitions for jest
TypeScript definitions for node
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Extremely fast double-ended queue implementation
Modern native Git hooks
Delightful JavaScript Testing.
Lint files staged by git
A deep deletion module for node (like `rm -rf`)
A Jest transformer with source map support that lets you use Jest to test projects written in TypeScript
TypeScript execution environment and REPL for node.js, with source map support
An extensible static analysis linter for the TypeScript language
Do you wanna use tslint and prettier without conflicts? tslint-config-prettier disables all conflicting rules that may cause such problems. Prettier takes care of formatting and tslint the rest.
A TSLint config for JavaScript Standard Style
TypeScript is a language for application scale JavaScript development
Support the repos that depend on this repository
Top contributors
![dependabot[bot]'s profile](https://avatars.githubusercontent.com/dependabot[bot])
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
