Îõ³h$Ë Æ.      !"#$%&'()*+,- Safe-Inferred F.ulidÃUnroll and produce an exact number of bytes (left-pad with 0 bytes)/ulid Source: Ûhttps://hackage.haskell.org/package/binary-0.8.5.1/docs/src/Data-Binary-Class.html#line-311:Fold and unfold an Integer to and from a list of its bytesÇMOST SIGNIFICANT BYTE FIRST please (this is a change from the default  impl)./0 Safe-Inferred CulidèReturns the digits of a positive integer as a list. Throws an error if given a zero or negative base.ulidÇTakes a list of digits, and converts them back into a positive integer.ulidThe base to use (typically 10).ulid$The number to convert to digit form.ulid8Either Nothing or the digits of the number in list form.ulidThe base to use.ulid&The digits of the number in list form.ulidThe original number. Safe-Inferred Aulid/Decode a character to its corresponding integerulid0Encode an integer to its corresponding characterulid encode 5 123"0003V"| >>> encode (-5) (-123) ""uliddecode 5 "0003V" [(123,"")]ulid Overall length of resulting TextulidNatural number to encodeulid20 padded, Douglas Crockford's base 32 encoded TextulidOverall length of input TextulidBase 32 encoded TextulidList of possible parsesNone 38ˆulidNewtype wrapping a 1ulid Generate a Æ based on a cryptographically secure random number generator. See: Íhttps://hackage.haskell.org/package/crypto-api-0.13.3/docs/Crypto-Random.htmlulid Generate a 5 based on a standard random number generator. See: Æhttps://hackage.haskell.org/package/random-1.1/docs/System-Random.html ulidNote: The call to 2> splits the generator, so this is safe to call multiple timesÃGenerate a ULID Random based on the global random number generator.   Safe-Inferred 38 ´ulidUNIX time in millisecondsulid3Generate a ULID Timestamp based on a specified timeulid;Generate a ULID Timestamp based on current system UNIX timeulidÅSpecified UNIX time with millisecond precision (e.g. 1469918176.385)None 38 ²ulid 8t <- getULIDTimeStamp r <- getULIDRandom pure $ ULID t r ulidÈDerive a ULID using a specified time and default random number generator!ulidÈDerive a ULID using the current time and default random number generator"ulidÛConvert a ULID to its corresponding (at most) 128-bit Integer. Integer equivalents retain sortable trait (same sort order). This could be useful for storing in a database using a smaller field than storing the shown 36, but still human-readable unlike the Binary version.#ulid6Convert a ULID from its corresponding 128-bit Integer.&ulidâBecause of the strictness annotations, this shouldn't be needed and shouldn't do anything. This is tested and confirmed in the benchmark, but since the work to put it here has already been done it's no harm to leave it in. ulidÇSpecified UNIX time with millisecond precision (e.g. 1469918176.385)#ulid8The ULID's Integer equivalent, as generated by toInteger !"# !"#4      !"#$%%&'()*+,-./0123456789:;<=>?@AÂ#ulid-0.3.2.0-BcOZlFVsiMK2FGyhpAn5jUData.ULID.DigitsData.ULID.Base32Data.ULID.RandomData.ULID.TimeStamp Data.ULIDData.Binary.RollDataBinarydigitsunDigits decodeChar encodeCharencodedecode ULIDRandommkCryptoULIDRandom mkULIDRandom getULIDRandom$fNFDataULIDRandom$fBinaryULIDRandom$fReadULIDRandom$fShowULIDRandom$fEqULIDRandom$fDataULIDRandom$fGenericULIDRandom ULIDTimeStampmkULIDTimeStampgetULIDTimeStamp$fNFDataULIDTimeStamp$fBinaryULIDTimeStamp$fReadULIDTimeStamp$fShowULIDTimeStamp$fEqULIDTimeStamp$fOrdULIDTimeStamp$fDataULIDTimeStamp$fGenericULIDTimeStampULID timeStamprandom getULIDTimegetULID ulidToIntegerulidFromInteger$fHashableULID $fRandomULID $fNFDataULID $fBinaryULID $fReadULID $fShowULID $fOrdULID$fEqULID $fDataULID $fGenericULIDunrollunroll'rollbytestring-0.10.10.0Data.ByteString.Internal ByteString%random-1.2.1.1-4yg3wqkjsQdBr0UpSZdkxv System.Random newStdGen text-1.2.3.2Data.Text.InternalText