ulid-tight: Another ULID implementation with tight memory representation

[ data, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

ulid-tight is one implementation of ULID. The data type Ulid consumes only 128-bit.


[Skip to Readme]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1
Change log CHANGELOG.md
Dependencies base (<4.20), binary (<0.9), bytestring (<0.13), deepseq (<1.6), hashable (<1.5), primitive (<0.10), random (>=1.2 && <1.3), template-haskell (<2.22), text (<2.2), time (<1.13) [details]
Tested with ghc ==9.2.8, ghc ==9.4.7, ghc ==9.6.3
License MIT
Copyright (c) 2023 Keito Kajitani
Author Keito Kajitani <ijaketak@gmail.com>
Maintainer Keito Kajitani <ijaketak@gmail.com>
Category Data
Home page https://github.com/ijaketak/ulid-tight
Source repo head: git clone https://github.com/ijaketak/ulid-tight
this: git clone https://github.com/ijaketak/ulid-tight(tag v0.1)
Uploaded by ijaketak at 2023-10-19T00:20:30Z
Distributions NixOS:0.1
Downloads 45 total (4 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-10-19 [all 1 reports]

Readme for ulid-tight-0.1

[back to package description]

ulid-tight

Hackage Haskell CI

ulid-tight is one implementation of ULID. The data type Ulid consumes only 128-bit.

For ULID, see https://github.com/ulid/spec.