Tiny queue data structure
Validation rule for GraphQL query complexity analysis
Measure the churn/complexity score. Higher values mean hotspots where refactorings should happen.
Find the longest common subsequence.
ESLintCC is a ECMAScript/JavaScript tool that computes complexity of code by using ESLint
A library to find JS RegExp with super-linear worst-case time complexity for attack strings that repeat a single character.
Find wordy or unnecessary passages in your writing
Query complexity validation for GraphQL.js
realistic password strength estimation
Software complexity analysis for JavaScript projects
Software complexity analysis of JavaScript-family abstract syntax trees.
Get an iterator for any JS language value. Works robustly across all environments, all versions.
eslint plugin for complexity-related rules
A Pothos plugin for defining and limiting complexity of queries
Cyclomatic and cognitive complexity rules for oxlint
Enforce a visual complexity of the code
Extends LRU base on hashlru
Joi validation for password complexity requirements.
TypeScript definitions for graphql-validation-complexity
Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.
Apollo server plugin that limits query complexity.
visx primitives that rely on react-spring for animation
Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.