sort objects in arrays by their keys
Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with autofix enabled
Sort objecy keys by length
Sort interface and string enum keys
Sort the keys of an object
Sort an object's keys, including an optional key list
Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax
Sort an Object or package.json based on the well-known package.json keys
Sort the keys in an object.
require object destructure key to be sorted
StyleX eslint plugin.
Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with extra features
Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with autofix enabled
TypeScript definitions for sort-object-keys
Sort the keys of an object recursively
Comparators with support for types implementing the @thi.ng/api/ICompare interface
Sorting a json object based on keys either ascending or descending & even recursively
Prettier package.json plugin to make the order of properties nice.
JSON diff
Enforce keys sorting on objects and TS types in a custom order with autofix
Fully extendable eslint plugin for JSON i18n translation files.
Takes a json-file and return a copy of the same file, but sorted
Prettier plugin to sort JSON files alphanumerically by key
A prettier plugins to sort imports in provided RegEx order
Sort keys in Hash
sorts csv by keys
Pretty print a sorted hash by key.
Sorts YAML files alphabetically by key.
Ensure sorting of keys in JSON generated from Hash objects
Add unicode collation key from ICU library to String.Add unicode collation key from ICU library to Ruby Strings.
Ultra simple manual sort key handling for ActiveRecord models.
Rubocop extension used to enforce that the keys of a hash are sorted alphabetically
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
A DSL for sorting active record results based on a hash with keys with the term sort_ in them.
Provides a Jekyll filter that provides case-insensitive hash key sorting.
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.