Array-backed implementation of a deque. Supports O(1) random access, and amortized O(1) insertion and removal at the front and back of the deque
Extremely fast double-ended queue implementation
Curated collection of data structures for the JavaScript/TypeScript.
Deques are a generalization of stacks and queues
A performant double-ended queue (deque) implementation in javascript.
A simple double ended queue datastructure
Custom Playwright commands to inject axe-core and test for a11y
TypeScript definitions for double-ended-queue
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
Fully accessible react components library for Deque Cauldron
Array manipulation, ordering, searching, summarizing, etc.
A simple list of possible Typed Array names.
Which kind of Typed Array is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
Is this value a JS ArrayBuffer?
Get the byte length of an ArrayBuffer, even in engines without a `.byteLength` method.
An ES7/ES2016 spec-compliant `Array.prototype.includes` shim/polyfill/replacement that works as far down as ES3.
Robustly get the length of a Typed Array
Robustly get the byte offset of a Typed Array
Is this value a JS SharedArrayBuffer?
`Array.prototype.concat`, but made safe by ignoring Symbol.isConcatSpreadable
Robustly get the byte length of a Typed Array
Get the ArrayBuffer out of a TypedArray, robustly.
Is this value a JS Typed Array? This module works cross-realm/iframe, does not depend on `instanceof` or mutable properties, and despite ES6 Symbol.toStringTag.
General purpose glob-based configuration matching.
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
Deque implemented by array.
No description provided.
No description provided.
No description provided.