lexid
ID generator
A fast and customizable ID generator with lexicographically orderable IDs.
fast lexicographically orderable/sortable ID generator
8 stars
2 watching
0 forks
Language: Go
last commit: almost 2 years ago gogolangk-sortableuuid-generator
Related projects:
| Repository | Description | Stars |
|---|---|---|
 gofrs/uuid | A Go implementation of Universally Unique Identifiers (UUIDs) with support for various versions and formats. | 1,581 |
 kayac/go-katsubushi | An ID generation service that supports multiple protocols and provides unique IDs to clients. | 180 |
 matoous/go-nanoid | Provides a cryptographically strong random ID generator with adjustable length and character set for use in various applications. | 1,292 |
 celrenheit/sandflake | A decentralized ID generator for sequential, lexicographically sortable unique IDs | 83 |
 twharmon/gouid | Provides universally unique IDs with cryptographic security | 24 |
 lexborisov/yauid | Generates decentralized unique IDs with time ordering and node ID information | 21 |
 sija/ksuid.cr | A Crystal implementation of globally unique IDs with timestamp and random payload components. | 15 |
 edwingeng/wuid | A fast and unique identifier generator | 532 |
 sasluca/zig-nanoid | A tiny, URL-friendly ID generator that produces unique, random strings with customizable length and alphabet | 27 |
 viascom/nanoid-kotlin | A Kotlin class that generates unique, secure, URL-friendly IDs with customizable length and alphabet | 27 |
 ahoo-wang/cosid | A high-performance distributed ID generator for generating unique IDs in a scalable and flexible manner | 490 |
 einar-hjortdal/lexical_uuid | A method for generating universally unique identifiers optimized for database use, designed to be lexicographically sortable. | 4 |
 adamhalasz/uniqid | A fast and unique identifier generator based on the current time, process ID, and MAC address. | 617 |
 zelark/nano-id | A Clojure library for generating unique URL-friendly string IDs | 191 |
 duailibe/cuid | Generates unique, sequential IDs with optimal performance for horizontal scaling and lookup | 55 |