Dependency-free utility functions for efficiently managing sorted arrays
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
JavaScript utilities for Vega.
Isomorphic, load-anywhere function to sort an array by scalar, deep or computed values in any standard or custom order
utilities for primitive JavaScript types
Programmatic access to the ARIA specification
A collection of order related linting rules for Stylelint.
Programmatic access to information about the AXObject Model
Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax
Framework-independent loaders for 3D graphics formats
A tiny and fast selection algorithm in JavaScript.
Essential JS 2 DataManager
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
Topological sorting with grouping support
Lightweight and performant natural sorting of arrays and collections by differentiating between unicode characters, numbers, dates, etc.
PostCSS plugin to keep rules and at-rules content in order.
JavaScript date/time utilities for Vega.
Sorts CSS declarations fast and automatically in a certain order.
Minimum utility toolbelt
Push items to an array at their correct sort-position
A Prettier plugin for sorting Tailwind CSS classes.
Sorting the keys of an object
Standalone Tailwind CSS class sorter with Prettier plugin compatibility, extracted from tailwindlabs/prettier-plugin-tailwindcss
Fast and powerful array sorting. Sort an array of objects by one or more properties. Any number of nested properties or custom comparison functions may be used.