-
Notifications
You must be signed in to change notification settings - Fork 18
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
IOHK
committed
Aug 30, 2024
1 parent
ed1da3f
commit 7007cb0
Showing
30 changed files
with
1,781 additions
and
3 deletions.
There are no files selected for viewing
47 changes: 47 additions & 0 deletions
47
...g-lexing-0.5.0.13-r0-6af29f35444036fb1b4489b53557599b615d8043857b62b17132bfec3a97abb3.nix
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,47 @@ | ||
| { system | ||
| , compiler | ||
| , flags | ||
| , pkgs | ||
| , hsPkgs | ||
| , pkgconfPkgs | ||
| , errorHandler | ||
| , config | ||
| , ... }: | ||
| { | ||
| flags = {}; | ||
| package = { | ||
| specVersion = "2.2"; | ||
| identifier = { name = "bytestring-lexing"; version = "0.5.0.13"; }; | ||
| license = "BSD-3-Clause"; | ||
| copyright = "2012–2024 wren romano, 2008–2011 Don Stewart"; | ||
| maintainer = "[email protected]"; | ||
| author = "wren gayle romano, Don Stewart"; | ||
| homepage = "https://wrengr.org/software/hackage.html"; | ||
| url = ""; | ||
| synopsis = "Efficiently parse and produce common integral and fractional numbers."; | ||
| description = "The bytestring-lexing package offers extremely efficient `ByteString`\nparsers for some common lexemes: namely integral and fractional\nnumbers. In addition, it provides efficient serializers for (some\nof) the formats it parses.\n\nAs of version 0.3.0, bytestring-lexing offers the best-in-show\nparsers for integral values. (According to the Warp web server's\nbenchmark of parsing the Content-Length field of HTTP headers.) And\nas of version 0.5.0 it offers (to my knowledge) the best-in-show\nparser for fractional/floating numbers.\n\nSome benchmarks for this package can be found at:\n<https://github.com/wrengr/bytestring-lexing/tree/master/bench/html>"; | ||
| buildType = "Simple"; | ||
| }; | ||
| components = { | ||
| "library" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| tests = { | ||
| "test-all" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."bytestring-lexing" or (errorHandler.buildDepError "bytestring-lexing")) | ||
| (hsPkgs."tasty" or (errorHandler.buildDepError "tasty")) | ||
| (hsPkgs."tasty-smallcheck" or (errorHandler.buildDepError "tasty-smallcheck")) | ||
| (hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| }; | ||
| } |
47 changes: 47 additions & 0 deletions
47
...g-lexing-0.5.0.14-r0-871039db7b8379566a35f63e30b49e5c4b579e63d67f4d697b54b34518ae6d5c.nix
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,47 @@ | ||
| { system | ||
| , compiler | ||
| , flags | ||
| , pkgs | ||
| , hsPkgs | ||
| , pkgconfPkgs | ||
| , errorHandler | ||
| , config | ||
| , ... }: | ||
| { | ||
| flags = {}; | ||
| package = { | ||
| specVersion = "2.2"; | ||
| identifier = { name = "bytestring-lexing"; version = "0.5.0.14"; }; | ||
| license = "BSD-3-Clause"; | ||
| copyright = "2012–2024 wren romano, 2008–2011 Don Stewart"; | ||
| maintainer = "[email protected]"; | ||
| author = "wren gayle romano, Don Stewart"; | ||
| homepage = "https://wrengr.org/software/hackage.html"; | ||
| url = ""; | ||
| synopsis = "Efficiently parse and produce common integral and fractional numbers."; | ||
| description = "The bytestring-lexing package offers extremely efficient `ByteString`\nparsers for some common lexemes: namely integral and fractional\nnumbers. In addition, it provides efficient serializers for (some\nof) the formats it parses.\n\nAs of version 0.3.0, bytestring-lexing offers the best-in-show\nparsers for integral values. (According to the Warp web server's\nbenchmark of parsing the Content-Length field of HTTP headers.) And\nas of version 0.5.0 it offers (to my knowledge) the best-in-show\nparser for fractional/floating numbers.\n\nSome benchmarks for this package can be found at:\n<https://github.com/wrengr/bytestring-lexing/tree/master/bench/html>"; | ||
| buildType = "Simple"; | ||
| }; | ||
| components = { | ||
| "library" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| tests = { | ||
| "test-all" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."bytestring-lexing" or (errorHandler.buildDepError "bytestring-lexing")) | ||
| (hsPkgs."tasty" or (errorHandler.buildDepError "tasty")) | ||
| (hsPkgs."tasty-smallcheck" or (errorHandler.buildDepError "tasty-smallcheck")) | ||
| (hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| }; | ||
| } |
104 changes: 104 additions & 0 deletions
104
...ring-trie-0.2.7.4-r0-653f2caa07209b40c76e650d0546d199ec66e605fa9afc22f7b9971ab17cc642.nix
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,104 @@ | ||
| { system | ||
| , compiler | ||
| , flags | ||
| , pkgs | ||
| , hsPkgs | ||
| , pkgconfPkgs | ||
| , errorHandler | ||
| , config | ||
| , ... }: | ||
| { | ||
| flags = {}; | ||
| package = { | ||
| specVersion = "2.2"; | ||
| identifier = { name = "bytestring-trie"; version = "0.2.7.4"; }; | ||
| license = "BSD-3-Clause"; | ||
| copyright = "2008–2024 wren gayle romano"; | ||
| maintainer = "[email protected]"; | ||
| author = "wren gayle romano"; | ||
| homepage = "https://wrengr.org/software/hackage.html"; | ||
| url = ""; | ||
| synopsis = "An efficient finite map from bytestrings to values."; | ||
| description = "An efficient finite map from bytestrings to values.\n\nThe implementation is based on big-endian patricia trees, like\n\"Data.IntMap\". We first trie on the elements of \"Data.ByteString\"\nand then trie on the big-endian bit representation of those\nelements. Patricia trees have efficient algorithms for union\nand other merging operations, but they're also quick for lookups\nand insertions.\n\nIf you are only interested in being able to associate strings\nto values, then you may prefer the @hashmap@ package which is\nfaster for those only needing a map-like structure. This package\nis intended for those who need the extra capabilities that a\ntrie-like structure can offer (e.g., structure sharing to reduce\nmemory costs for highly redundant keys, taking the submap of\nall keys with a given prefix, contextual mapping, extracting\nthe minimum and maximum keys, etc.)"; | ||
| buildType = "Simple"; | ||
| }; | ||
| components = { | ||
| "library" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| tests = { | ||
| "test-all" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."tasty" or (errorHandler.buildDepError "tasty")) | ||
| (hsPkgs."tasty-smallcheck" or (errorHandler.buildDepError "tasty-smallcheck")) | ||
| (hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck")) | ||
| (hsPkgs."tasty-hunit" or (errorHandler.buildDepError "tasty-hunit")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| (hsPkgs."smallcheck" or (errorHandler.buildDepError "smallcheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| benchmarks = { | ||
| "bench-Regression" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-Foldable" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-MatchOne" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-UnionWith" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| }; | ||
| } |
104 changes: 104 additions & 0 deletions
104
...ring-trie-0.2.7.5-r0-3565e6c6d4d89f44ddf8fdc118ecee9f55d93ab8f47d9a472fd0dd76bd71a7f7.nix
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,104 @@ | ||
| { system | ||
| , compiler | ||
| , flags | ||
| , pkgs | ||
| , hsPkgs | ||
| , pkgconfPkgs | ||
| , errorHandler | ||
| , config | ||
| , ... }: | ||
| { | ||
| flags = {}; | ||
| package = { | ||
| specVersion = "2.2"; | ||
| identifier = { name = "bytestring-trie"; version = "0.2.7.5"; }; | ||
| license = "BSD-3-Clause"; | ||
| copyright = "2008–2024 wren gayle romano"; | ||
| maintainer = "[email protected]"; | ||
| author = "wren gayle romano"; | ||
| homepage = "https://wrengr.org/software/hackage.html"; | ||
| url = ""; | ||
| synopsis = "An efficient finite map from bytestrings to values."; | ||
| description = "An efficient finite map from bytestrings to values.\n\nThe implementation is based on big-endian patricia trees, like\n\"Data.IntMap\". We first trie on the elements of \"Data.ByteString\"\nand then trie on the big-endian bit representation of those\nelements. Patricia trees have efficient algorithms for union\nand other merging operations, but they're also quick for lookups\nand insertions.\n\nIf you are only interested in being able to associate strings\nto values, then you may prefer the @hashmap@ package which is\nfaster for those only needing a map-like structure. This package\nis intended for those who need the extra capabilities that a\ntrie-like structure can offer (e.g., structure sharing to reduce\nmemory costs for highly redundant keys, taking the submap of\nall keys with a given prefix, contextual mapping, extracting\nthe minimum and maximum keys, etc.)"; | ||
| buildType = "Simple"; | ||
| }; | ||
| components = { | ||
| "library" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| tests = { | ||
| "test-all" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."tasty" or (errorHandler.buildDepError "tasty")) | ||
| (hsPkgs."tasty-smallcheck" or (errorHandler.buildDepError "tasty-smallcheck")) | ||
| (hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck")) | ||
| (hsPkgs."tasty-hunit" or (errorHandler.buildDepError "tasty-hunit")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| (hsPkgs."smallcheck" or (errorHandler.buildDepError "smallcheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| benchmarks = { | ||
| "bench-Regression" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-Foldable" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-MatchOne" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "bench-UnionWith" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."binary" or (errorHandler.buildDepError "binary")) | ||
| (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq")) | ||
| (hsPkgs."bytestring-trie" or (errorHandler.buildDepError "bytestring-trie")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| }; | ||
| } |
74 changes: 74 additions & 0 deletions
74
hackage/foldl-1.4.17-r0-1d3e219819e471d55c11e651c5c8721845ef240a2adc15a578e0a492004f9edf.nix
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,74 @@ | ||
| { system | ||
| , compiler | ||
| , flags | ||
| , pkgs | ||
| , hsPkgs | ||
| , pkgconfPkgs | ||
| , errorHandler | ||
| , config | ||
| , ... }: | ||
| { | ||
| flags = {}; | ||
| package = { | ||
| specVersion = "1.10"; | ||
| identifier = { name = "foldl"; version = "1.4.17"; }; | ||
| license = "BSD-3-Clause"; | ||
| copyright = "2013 Gabriella Gonzalez"; | ||
| maintainer = "[email protected]"; | ||
| author = "Gabriella Gonzalez"; | ||
| homepage = ""; | ||
| url = ""; | ||
| synopsis = "Composable, streaming, and efficient left folds"; | ||
| description = "This library provides strict left folds that stream in constant\nmemory, and you can combine folds using @Applicative@ style to derive new\nfolds. Derived folds still traverse the container just once and are often as\nefficient as hand-written folds."; | ||
| buildType = "Simple"; | ||
| }; | ||
| components = { | ||
| "library" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring")) | ||
| (hsPkgs."random" or (errorHandler.buildDepError "random")) | ||
| (hsPkgs."primitive" or (errorHandler.buildDepError "primitive")) | ||
| (hsPkgs."text" or (errorHandler.buildDepError "text")) | ||
| (hsPkgs."transformers" or (errorHandler.buildDepError "transformers")) | ||
| (hsPkgs."vector" or (errorHandler.buildDepError "vector")) | ||
| (hsPkgs."containers" or (errorHandler.buildDepError "containers")) | ||
| (hsPkgs."unordered-containers" or (errorHandler.buildDepError "unordered-containers")) | ||
| (hsPkgs."hashable" or (errorHandler.buildDepError "hashable")) | ||
| (hsPkgs."contravariant" or (errorHandler.buildDepError "contravariant")) | ||
| (hsPkgs."profunctors" or (errorHandler.buildDepError "profunctors")) | ||
| (hsPkgs."semigroupoids" or (errorHandler.buildDepError "semigroupoids")) | ||
| (hsPkgs."comonad" or (errorHandler.buildDepError "comonad")) | ||
| ] ++ pkgs.lib.optional (compiler.isGhc && compiler.version.lt "8.0") (hsPkgs."semigroups" or (errorHandler.buildDepError "semigroups")); | ||
| buildable = true; | ||
| }; | ||
| tests = { | ||
| "doctest" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."doctest" or (errorHandler.buildDepError "doctest")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| benchmarks = { | ||
| "Foldl" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."foldl" or (errorHandler.buildDepError "foldl")) | ||
| (hsPkgs."profunctors" or (errorHandler.buildDepError "profunctors")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| "Scanl" = { | ||
| depends = [ | ||
| (hsPkgs."base" or (errorHandler.buildDepError "base")) | ||
| (hsPkgs."criterion" or (errorHandler.buildDepError "criterion")) | ||
| (hsPkgs."foldl" or (errorHandler.buildDepError "foldl")) | ||
| ]; | ||
| buildable = true; | ||
| }; | ||
| }; | ||
| }; | ||
| } |
Oops, something went wrong.