You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
41 lines
1.7 KiB
41 lines
1.7 KiB
Package: ulid
|
|
Type: Package
|
|
Title: Generate Universally Unique Lexicographically Sortable Identifier
|
|
Version: 0.1.0
|
|
Date: 2018-12-28
|
|
Authors@R: c(
|
|
person("Bob", "Rudis", email = "bob@rud.is", role = c("aut", "cre"),
|
|
comment = c(ORCID = "0000-0001-5670-2640")),
|
|
person("suyash", role = c("aut"),
|
|
comment = "ULID C++ Port <https://github.com/suyash/ulid/>")
|
|
)
|
|
Maintainer: Bob Rudis <bob@rud.is>
|
|
Description: Universally unique identifiers ('UUIDs') can be suboptimal for many
|
|
uses-cases because they aren't the most character efficient way of encoding
|
|
128 bits of randomness; v1/v2 versions are impractical in many environments,
|
|
as they require access to a unique, stable MAC address; v3/v5 versions require
|
|
a unique seed and produce randomly distributed IDs, which can cause fragmentation
|
|
in many data structures; v4 provides no other information than randomness which
|
|
can cause fragmentation in many data structures. 'ULIDs' (<https://github.com/ulid/spec>)
|
|
have 128-bit compatibility with 'UUID', 1.21e+24 unique ULIDs per millisecond,
|
|
are lexicographically sortable, canonically encoded as a 26 character string,
|
|
as opposed to the 36 character 'UUID', use Crockford's 'base32' for better
|
|
efficiency and readability (5 bits per character), are case insensitive,
|
|
have no special characters (i.e. are 'URL' safe) and have a onotonic sort order
|
|
(correctly detects and handles the same millisecond).
|
|
URL: https://gitlab.com/hrbrmstr/ulid
|
|
BugReports: https://gitlab.com/hrbrmstr/ulid/issues
|
|
SystemRequirements: C++11
|
|
NeedsCompilation: yes
|
|
Encoding: UTF-8
|
|
License: MIT + file LICENSE
|
|
Suggests:
|
|
testthat,
|
|
covr
|
|
Depends:
|
|
R (>= 3.2.0)
|
|
Imports:
|
|
Rcpp
|
|
RoxygenNote: 6.1.1
|
|
LinkingTo:
|
|
Rcpp
|
|
|