Key | Value |
---|---|
FileName | ./usr/share/licenses/ghc-splitmix/LICENSE |
FileSize | 1522 |
MD5 | 7BD5B9BD1EB743B2FEF83AF75DE60046 |
SHA-1 | 87CD954EBB0F6D2867E9F402C5963F526643A915 |
SHA-256 | 5F3FACF95BB7D0DE63AAC65FF31E1C071CF37CFA28A56CADF236EAC1BD9C9FA3 |
SHA-512 | C54609C9283ADCA82E4492EB589D6F2105D51A6F60200398BF78409543682FC314D3105150817F9C7CFE8AAAB3D729E22F6CA784659FD0B8B178D544F0F69BEA |
SSDEEP | 24:xfCUnooV+bOI3rYFTQ+JLarYFT5LGM1FKBVJ94Os43sEskuZKWROLTt3hyxLTfyq:JGOYrYJCrYJ5K6FOz4943JL53hELmL32 |
TLSH | T1E031624712841BB34AE3165565AAAEC0F49DD02F3A237A053C6EF3945B6B12ED8B7480 |
insert-timestamp | 1721655359.8253639 |
mimetype | text/plain |
source | snap:UUaICqxIYfkJcPPaOOMdei9GTlkS4zLN_9 |
tar:gname | root |
tar:uname | root |
hashlookup:parent-total | 161 |
hashlookup:trust | 100 |
The searched file hash is included in 161 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | D8B0D7666B5D3F56532A03C545E2CE92 |
PackageArch | riscv64 |
PackageDescription | * 'Boring' types are isomorphic to '()'. * 'Absurd' types are isomorphic to 'Void'. See [What does () mean in Haskell -answer by Conor McBride](https://stackoverflow.com/questions/33112439/what-does-mean-in-haskell/33115522#33115522). |
PackageName | ghc-boring |
PackageRelease | dlh.1.1 |
PackageVersion | 0.2 |
SHA-1 | 0154067D75C709673EAAAD983F936417A9B0640B |
SHA-256 | 915ACFB3B5773452B4B308F1F40CF5139AD543A58B8AB75FAB5CA53176BF616C |
Key | Value |
---|---|
MD5 | A212EA2CF80010C5087898C1BAF4C74B |
PackageArch | x86_64 |
PackageDescription | As of now (end of 2021), there isn't 'cabal doctest' command. Yet, to properly work, 'doctest' needs plenty of configuration. This library provides the common bits for writing a custom 'Setup.hs'. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | ghc-cabal-doctest |
PackageRelease | bp154.1.11 |
PackageVersion | 1.0.9 |
SHA-1 | 01D762570018E652ECBE50C7A942B545551BEBC9 |
SHA-256 | 639B0088F6AD180635BAF6088807FC6430E215B184808971BFCE6042CAAFAA5D |
Key | Value |
---|---|
MD5 | 32EA52A02E318726AE589A80D1F97F42 |
PackageArch | aarch64 |
PackageDescription | This package provides the Haskell assoc library. |
PackageMaintainer | Fedora Project |
PackageName | ghc-assoc |
PackageRelease | 9.fc34 |
PackageVersion | 1.0.1 |
SHA-1 | 028EA90F281EEC7FCD3AF35BC2F4B1F2C9E54FC1 |
SHA-256 | 8E80BEF6F614C78AA73E698CA6FA468B84B656944F986B419822AD8FAD99A804 |
Key | Value |
---|---|
FileName | http://archlinux.mirror.root.lu//pool//community//haskell-splitmix-0.1.0.3-90-x86_64.pkg.tar.zst |
MD5 | F2522D1C2A9E9553CA53CC1C85A0214C |
SHA-1 | 02A40E3E85C4FD416103C1CCE1A959730425D6BF |
SHA-256 | E8DA311FA33D34032C3C31E6DED7DD871043778CE7752FC99500B3D32503AABB |
SSDEEP | 768:Bzb8T3emImXmkldmYZZRAxHx175guU7M/k0JJ9eEOA5ZnoelzfY:Z8TDIm2kldmmAJ1A7MccJ9eGzlzfY |
TLSH | T1A1F2F177AB134B7C2E912B9D28287C13DE309356829EE9848CFF690D791184E25BF259 |
Key | Value |
---|---|
MD5 | 93994421B8D667C510CEE517B2FD083A |
PackageArch | aarch64 |
PackageDescription | Currently (beginning of 2017), there isn't 'cabal doctest' command. Yet, to properly work doctest needs plenty of configuration. This library provides the common bits for writing custom Setup.hs See <https://github.com/haskell/cabal/issues/2327 Cabal/2327> for the progress of 'cabal doctest', i.e. whether this library is obsolete. |
PackageMaintainer | Fedora Project |
PackageName | ghc-cabal-doctest |
PackageRelease | 1.fc32 |
PackageVersion | 1.0.8 |
SHA-1 | 033C39DBF919E295285669791BCBDAC5A385E2A7 |
SHA-256 | 23670116D7BF42B0BC2A0D844966FF3BBE20995E48E1AE61D2924D4532AE091C |
Key | Value |
---|---|
MD5 | E7408E42708AEAE81A2FD93363BA1176 |
PackageArch | x86_64 |
PackageDescription | Pure Haskell implementation of SplitMix described in Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: <https://doi.org/10.1145/2660193.2660195> The paper describes a new algorithm /SplitMix/ for /splittable/ pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical operations per 64 bits generated. /SplitMix/ is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it __should not be used for cryptographic or security applications__, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state). |
PackageName | ghc-splitmix |
PackageRelease | dlh.32.1 |
PackageVersion | 0.1.0.4 |
SHA-1 | 0420E614624E2FCF99AE9CABDFF417A15B82E131 |
SHA-256 | 09FA9244CF175184FFC4FA62CB8B3DF20134EB4312FF955B52613C0837F836AF |
Key | Value |
---|---|
MD5 | 04A18398860E138119D3C46329BE49C9 |
PackageArch | x86_64 |
PackageDescription | Currently (beginning of 2017), there isn't 'cabal doctest' command. Yet, to properly work doctest needs plenty of configuration. This library provides the common bits for writing custom Setup.hs See <https://github.com/haskell/cabal/issues/2327 Cabal/2327> for the progress of 'cabal doctest', i.e. whether this library is obsolete. |
PackageName | ghc-cabal-doctest |
PackageRelease | ghc86.3.8 |
PackageVersion | 1.0.8 |
SHA-1 | 048927731679A56F0D3C55C3F85D0FC61EF75D75 |
SHA-256 | 6E956182B93BDC52A81B4018B71E258C619144005FA327C646B1C0C73FED14C3 |
Key | Value |
---|---|
MD5 | 5876BC458AD8CDB64A409D274BA7DE90 |
PackageArch | x86_64 |
PackageDescription | Pure Haskell implementation of SplitMix described in Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: <https://doi.org/10.1145/2660193.2660195> The paper describes a new algorithm /SplitMix/ for /splittable/ pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical operations per 64 bits generated. /SplitMix/ is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it __should not be used for cryptographic or security applications__, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state). |
PackageName | ghc-splitmix |
PackageRelease | ghc86.4.3 |
PackageVersion | 0.0.3 |
SHA-1 | 05BA4D15D4B71DC46FA37BC6617E43A1154E079C |
SHA-256 | 90AC1CECE939F934CB9620A9FE1E6F69DA88E2A97C8544763781D79A02260958 |
Key | Value |
---|---|
MD5 | 6528377032FA50DE0B29100302C58F44 |
PackageArch | x86_64 |
PackageDescription | Pure Haskell implementation of SplitMix described in Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: <https://doi.org/10.1145/2660193.2660195> The paper describes a new algorithm /SplitMix/ for /splittable/ pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical operations per 64 bits generated. /SplitMix/ is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it __should not be used for cryptographic or security applications__, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state). |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | ghc-splitmix |
PackageRelease | bp153.1.20 |
PackageVersion | 0.0.4 |
SHA-1 | 05CC4E9E5EC1E339D41AB76CB2A579859873B75B |
SHA-256 | 244833D744CAEB2C5096B2ED945F56F4C2A824D6892EE6B03416701F041BF7CE |
Key | Value |
---|---|
MD5 | CE0EA75FEBEBDEB0B811ECD5C831BC62 |
PackageArch | x86_64 |
PackageDescription | Pure Haskell implementation of SplitMix described in Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: <https://doi.org/10.1145/2660193.2660195> The paper describes a new algorithm /SplitMix/ for /splittable/ pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical operations per 64 bits generated. /SplitMix/ is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it __should not be used for cryptographic or security applications__, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state). |
PackageName | ghc-splitmix |
PackageRelease | dlh.32.4 |
PackageVersion | 0.1.0.4 |
SHA-1 | 077B6C90C147DC041CB7099702A404EC9341FC7E |
SHA-256 | 9359E2E506434BBFCAE72BCDAA19B65D74924E032DE563E3946220E44343FC6E |