martinusso/ulid

Universally Unique Lexicographically Sortable Identifier implementation for Delphi (Object Pascal)

Universally Unique Lexicographically Sortable Identifier implementation for Delphi (Object Pascal)

A Delphi/Object Pascal port of alizain/ulid.

Why ULID?

• 128-bit compatibility with UUID
• 1.21e+24 unique ULIDs per millisecond
• Lexicographically sortable!
• Canonically encoded as a 26 character string, as opposed to the 36 character UUID
• Uses Crockford's base32 for better efficiency and readability (5 bits per character)
• Case insensitive
• No special characters (URL safe)
• [Delphi] Is faster than CreateGUID

For more information, check out ULID's README.

Usage

uses ULID

CreateULID; // 01ARZ3NDEKTSV4RRFFQ69G5FAV

How to contribute

Just make changes and submit a pull request (No Test No 🍻).

ulid's Issues

Generator does not enforce monotonicity

See spec. https://github.com/ulid/spec

When generating a ULID within the same millisecond, we can provide some guarantees regarding sort order. Namely, if the same millisecond is detected, the random component is incremented by 1 bit in the least significant bit position (with carrying).