Combine a series of sort functions to create complex sort orders
CSS Property Sort Order based on the SMACSS methodology
CSS Property Sort Order based on the SMACSS methodology
Recess-based property sort order for Stylelint.
Compare strings containing a mix of letters and numbers in the way a human being would in sort order.
Compare strings containing a mix of letters and numbers in the way a human being would in sort order.
encode/decode with same encoded sort order as bytewise
Find the index to insert an element in array keeping the sort order.
React hooks sort order
Applies specific sort order to more than two levels of chapters and stories in a storybook.
GraphQL sort order definitions
Guarantees stable sort order for all Prisma queries
Declare a default object sort order in your business classes
Stylelint config for Property Sort Ordering based on the SMACSS methodology
Stylelint config for Property Sort Ordering based on the SMACSS methodology
A JavaScript library to paginate across multiple data sources at once, whilst retaining the sort order.
Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.
Simultaneously sort two strided arrays based on the sort order of the first array using Shellsort.
Simultaneously sort two strided arrays based on the sort order of the first array using insertion sort.
Deep-copy an object, with keys sorted. Supports circular references and custom sort order.
Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
Entro Sort is an in-place, linearithmic, unstable sorting algorithm.
lexicographic sort-order preserving binary encoding
lexicographic sort-order preserving binary encoding
lexicographic sort-order preserving binary encoding
Lexicographic sort-order preserving binary encoding format for key-value stores
Host local media as if it were a podcast to easily download it to a phone or other player
High-performance Rust library and CLI tool for multi-provider web search. Supports Google, ArXiv, DuckDuckGo, Tavily AI, and more with aggregation strategies.
Renamed to sapphire-journal / sapphire-journal-core. Markdown-based task and note manager that keeps your data alive as plain text - timeless like fossils
[DEPRECATED] CLI for archelon — use the archelon crate instead
A fast and efficient file deduplication tool with support for media files
An extensible CLI tool that filters, sorts, and aggregates search results from car websites. Because of course you want to search for cars from the command line.
DEPRECATED: This crate is no longer maintained. Please use the `iceberg` crate instead.
Manipulate column sort orders...
The "easy-peasy" dynamic sorting pattern for ActiveRecord that your Rails apps deserve.
A construct for representing the sorting order of a set of fields which can be sorted in a cascading fasion. Originally designed for Rails 2.3.14
Sort an array in the same order as `sort --dictionary-sort`
Implements a variant of Set whose elements are sorted in ascending order
This GEM is sorting Arrays in a natural order. a2 < a10. Beside that this GEM has some methods to sort version strings. It even recognises alpha, beta, RC, dev and stable versions.
Add (optional) extension description here
Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order. Torid exists to solve the problem of generating UUIDs that when ordered lexically, they are also ordered temporally. I needed a way to generate ids for events that are entering a system with the following criteria: 1. Fast ID generation 2. No central coordinating server/system 3. No local storage 4. Library code, that is multiple apps on the same machine can use the same code and they will not generate duplicate ids 5. Eventually stored in a UUID field in a database. So 128bit ids are totally fine. The IDs that Torid generates are 128bit IDs made up of 2, 64bit parts. * 64bit microsecond level UNIX timestamp * 64bit hash of the system hostname, process id and a random value.
Rails sorting and ordering without deadlocks
Sort lines in YAML files in a predictable order
Store order of your models by using lexicographic sorting.
Modified version of `Minitest::Reporters::SpecReporter` which prints test results in alphabetical order, grouped by test class.
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.