A fully-functional functional lexicographic permutation generator generator.
A fully-functional functional lexicographic permutation generator generator.
Get a lexicographic cartesian product and lexicographic permutation at any specific index from data. Generate complete lexicographic cartesian product from single or multiple set of data. Generate complete lexicographic combination from data. Generate non-lexicographic permutation and k-permutation.
LevelDB-compatible bytewise comparator and key-shortening logic for arbitrary byte slices, providing Compare, FindShortestSeparator, and FindShortSuccessor traits plus a global BytewiseComparator implementation used in bitcoin-rs.
Provides hybrid natural and lexicographical sorting for strings and byte slices, useful for sorting mixed lists of filenames and identifiers.
Serialization format which preserves lexicographical ordering, for use with key-value databases
Library for inverse lexicographic (a tergo) sorting
CLI tool for inverse lexicographic (a tergo) sorting; installs the `invlex` binary
Library for comparing and sorting strings lexicographically and naturally
Generating Lexicographically-Evenly-Spaced Strings, or: Mudder.js in Rust.
Nanosecond-Precision Universally Lexicographically Sortable Identifier
Arbitrary precision decimals with lexicographically sortable byte encoding
SQL engine backed by the Exoware API.
Sort Unicode strings lexically
Universally Unique Lexicographically Sortable Identifier implementation for Ruby
Ruby library providing support for Universally unique Lexicographically Sortable Identifiers. ULIDs are helpful in systems where you need to generate ID values that are absolutely lexicographically sortable by time, regardless of where they were generated.
Store order of your models by using lexicographic sorting.
Lofis is a small helper to fix lexicographical order for international sorting.
Library for sorting a set of elements based on their lexicographic order and the average distance between them
Universally Unique Lexicographically Sortable Identifier
Provides a simple method to invert lexicographically a number.
Allow your models to order and reorder elements using lexoranking sorting.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected