| Age | Commit message (Collapse) | Author |
|---|
|
https://github.com/ruby/securerandom/commit/9a99978135
|
|
https://github.com/ruby/securerandom/pull/19/files#r1329476195
https://github.com/ruby/securerandom/commit/156cbb8448
|
|
Although the specification for UUIDv7 is still in draft, the UUIDv7
algorithm has been relatively stable as it progresses to completion.
Version 7 UUIDs can be very useful, because they are lexographically
sortable, which can improve e.g: database index locality. See section
6.10 of the draft specification for further explanation:
https://datatracker.ietf.org/doc/draft-ietf-uuidrev-rfc4122bis/
The specification allows up to 12 bits of extra timestamp precision, to
make UUID generation closer to monotonically increasing. This provides
between 1ms and ~240ns of timestamp precision. At the cost of some code
complexity and a small performance penalty, a kwarg may specify any
arbitrary precision between 0 and 12 extra bits. Any stronger
guarantees of monotonicity have considerably larger tradeoffs, so
nothing more is implemented. This limitation is documented.
Ruby issue: https://bugs.ruby-lang.org/issues/19735
https://github.com/ruby/securerandom/commit/34ed1a2ec3
|
|
Notes:
Merged: https://github.com/ruby/ruby/pull/8317
|
|
|
|
* Make its usage more obvious (by providing more detailed
examples);
* Include mention of it into Random itself;
* Small cleanups of docs.
Notes:
Merged: https://github.com/ruby/ruby/pull/5434
|
|
https://github.com/ruby/securerandom/commit/5460a18c35
|
|
|
|
|
|
https://github.com/ruby/securerandom/commit/1e57277b9e
Notes:
Merged: https://github.com/ruby/ruby/pull/5237
|
