## Introduction
`ordered-uuid-v4` is a JavaScript package that can generate a COMB (combined time-GUID), basically an ordered UUID. The COMB/ordered UUID contains: - 48-bit timestamp: the amount of centimilliseconds (10<sup>-5</sup>) since 00:00:00 UTC on 1 January 1970
Time-ordered UUID v7 generator
Locally ordered UUID generator
`ordered-uuid-v4` is a JavaScript package that can generate a COMB (combined time-GUID), basically an ordered UUID. The COMB/ordered UUID contains: - 48-bit timestamp: the amount of centimilliseconds (10<sup>-5</sup>) since 00:00:00 UTC on 1 January 1970
RFC9562 UUIDs
Support ordered UUID's prefixed with a string as properties for your Bookshelf models.
ordered list extension for tiptap
Locally ordered UUID
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
Combines array of streams into one Readable stream in strict order.
Ensure values are ordered consistently in your CSS.
A tiny (230B) and fast UUID (v4) generator for Node and the browser
Object literal maintaining its properties in the order they were added
remark-lint rule to warn when the markers of ordered lists violate a given style
A simple node js implementation of uuid v4 for use with Braintree's JS based SDKs.
remark-lint rule to check the marker value of ordered lists
A universally-unique, lexicographically-sortable, identifier generator
react-native-uuid is a zero-dependency TypeScript implementation of RFC4122.
Create and translate standard UUIDs with shorter formats.
Windows legacy GUID parser
Simple generation of sanity document IDs
A small implementation of `crypto.getRandomValues` for React Native. This is useful to polyfill for libraries like [uuid](https://www.npmjs.com/package/uuid) that depend on it.
Support validating ordered UUID's prefixed with a string in both string and binary format.
Order for UUID
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.
Snowflakes produces 128-bit and time-ordered ids. They run one on each node in infrastructure and will generate conflict-free ids on-demand without coordination.
UUIDs that are byte-ordered lamport clocks (timestamp, worker_id). Much simpler than type-1 UUID's crappy, weirdo layout.
UUID v7 is a time-ordered UUID format that encodes a Unix timestamp in the most significant 48 bits, making UUIDs naturally sortable by creation time. This library provides both high-performance and monotonic (strictly ordered) variants.
UUID and ULID primary key support for Rails with SQLite3. Provides automatic type registration, validation, foreign key detection, and clean schema generation. Supports UUIDv4 (random), UUIDv7 (time-ordered), and ULID (compact, time-sortable) with zero external dependencies.
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.