Fast easy to use and flexible sorting with TypeScript support
API wrapper around fast-sort
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.
Lightweight and performant natural sorting of arrays and collections by differentiating between unicode characters, numbers, dates, etc.
Compare alphanumeric strings the same way a human would, using a natural order algorithm
A tiny and fast selection algorithm in JavaScript.
Blazing fast, tree-shakeable, type-safe, modern utility library to sort any type of array in less than 1 KB!
Sort an Object or package.json based on the well-known package.json keys
JSS plugin that ensures style properties extend each other instead of override
Easy autofixable import sorting
🚩 FastImage, performant React Native image component.
A (much) faster String.prototype.localeCompare
TimSort: Fast Sorting for Node.js
PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies
Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax
Sort the keys of an object
vfile utility to sort messages by line/column
sort import syntax quickly
The custom `sort` method (mobile-first / desktop-first) of CSS media queries for `postcss-sort-media-queries`, `css-mqpacker` or `pleeease` (which uses css-mqpacker) or, perhaps, something else ))
Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with autofix enabled
Sort an object's keys, including an optional key list
Sort array elements in ascending order.
Sort objecy keys by length
Sort array elements in descending order.
VersionSorter is a C extension that does fast sorting of large sets of version strings.
A fast sorted set built using std::set and a fast sorted hash built using boost::multi_index_container.
Fast and awesome tables, with pagination, sorting, filtering and custom views.
This module provides classes of redis sorted set to implement fast ranking, search, filtering with coherent cache management policy.
Very simple and fast hit and popularity counter using Redis sorted sets.
Soulmate is a tool to help solve the common problem of developing a fast autocomplete feature. It uses Redis's sorted sets to build an index of partial words and corresponding top matches, and provides a simple sinatra app to query them. Soulmate finishes your sentences.
A fast and hackable JSON API engine based on EventMachine to be used as a backend for Angular, ember and all sorts of things. It is REALLY fast and have a DSL like sinatra, also have an embebed cache system
Soulmate Rails is a tool to help solve the common problem of developing a fast autocomplete feature for Rails. It uses Redis's sorted sets to build an index of partial words and corresponding top matches. Modified by Jim Zhan to add utility functions and for bug fixing.
sqdash is a fast, keyboard-driven TUI for monitoring and managing Solid Queue jobs. View pending, failed, and completed jobs, retry or discard failures, filter, sort, and navigate — all without leaving your terminal.
Zenweb is a set of classes/tools for organizing and formating a website. It is website oriented rather than webpage oriented, unlike most rendering tools. It is content oriented, rather than style oriented, unlike most rendering tools. It uses a rubygems plugin system to provide a very flexible, and powerful system. Zenweb 3 was inspired by jekyll. The filesystem layout is similar to jekyll's layout, but zenweb isn't focused on blogs. It can do any sort of website just fine. Zenweb uses rake to handle dependencies. As a result, scanning a website and regenerating incrementally is not just possible, it is blazingly fast. ==== To Install:
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.
Just write the help text for your application and ParseArgv will take care of your command line. It works sort of the other way around than OptParse, where you write a lot of code to get a command line parser and generated help text. ParseArgv simply takes your help text and parses the command line and presents you the results. You can use ParseArgv for simpler programs just as well as for CLI with multi-level sub-commands (git-like commands). ParseArgv is easy to use, fast and also helps you convert the data types of command line arguments.
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.