nebkor/julid-rs
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

fix images maybe

Browse source
This commit is contained in:
Joe Ardent 2023-07-25 17:54:20 -07:00
parent 114e556a84
commit 3ab7fe6876
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
README.md
View file

@ -32,7 +32,7 @@ but not all ULIDs are Julids) identifiers with the following properties:
It's that last bit that makes them distinctive. ULIDs have the following big-endian bit structure: It's that last bit that makes them distinctive. ULIDs have the following big-endian bit structure:
![ULID bit structure][./ulid.svg] ![ULID bit structure](./ulid.svg)
According to the ULID spec, for ULIDs created in the same millisecond, the least-significant bit According to the ULID spec, for ULIDs created in the same millisecond, the least-significant bit
should be incremented for each new one. Since that portion of the ULID is random, that means you may should be incremented for each new one. Since that portion of the ULID is random, that means you may
@ -43,7 +43,7 @@ millisecond.
To address these shortcomings, Julids (Joe's ULIDs) have the following big-endian bit structure: To address these shortcomings, Julids (Joe's ULIDs) have the following big-endian bit structure:
![Julid bit structure][./julid.svg] ![Julid bit structure](./julid.svg])
As with ULIDs, the 48 most-significant bits encode the time of creation. Unlike ULIDs, the next 16 As with ULIDs, the 48 most-significant bits encode the time of creation. Unlike ULIDs, the next 16
bits are not random, they're a monotonic counter for IDs created within the same millisecond. Since bits are not random, they're a monotonic counter for IDs created within the same millisecond. Since