Skip to content

Commit

Permalink
Automatic Update
Browse files Browse the repository at this point in the history
  • Loading branch information
IOHK committed Nov 3, 2023
1 parent 7499db5 commit 2dfd896
Show file tree
Hide file tree
Showing 28 changed files with 1,077 additions and 5 deletions.
89 changes: 89 additions & 0 deletions ...e/chronos-1.1.5.1-r1-2e70ffed34f8e43951862c3151589568f90028868d1c88b0292b988ade9d318e.nix
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,89 @@
{ system
, compiler
, flags
, pkgs
, hsPkgs
, pkgconfPkgs
, errorHandler
, config
, ... }:
{
flags = {};
package = {
specVersion = "3.0";
identifier = { name = "chronos"; version = "1.1.5.1"; };
license = "BSD-3-Clause";
copyright = "2016 Andrew Martin";
maintainer = "Andrew Martin <andrew.thaddeus@gmail.com>\nchessai <chessai1996@gmail.com>";
author = "Andrew Martin";
homepage = "https://github.com/andrewthad/chronos";
url = "";
synopsis = "A high-performance time library";
description = "Chronos is a performance-oriented time library for Haskell, with a\nstraightforward API. The main differences between this\nand the <http://hackage.haskell.org/package/time time> library\nare:\n\n * Chronos uses machine integers where possible. This means\n that time-related arithmetic should be faster, with the\n drawback that the types are incapable of representing times\n that are very far in the future or the past (because Chronos\n provides nanosecond, rather than picosecond, resolution).\n For most users, this is not a hindrance.\n * Chronos provides 'ToJSON'/'FromJSON' instances for serialisation.\n * Chronos provides 'Unbox' instances for working with unboxed vectors.\n * Chronos provides 'Prim' instances for working with byte arrays/primitive arrays.\n * Chronos uses normal non-overloaded haskell functions for\n encoding and decoding time. It provides <http://hackage.haskell.org/package/attoparsec attoparsec> parsers for both 'Text' and\n 'ByteString'. Additionally, Chronos provides functions for\n encoding time to 'Text' or 'ByteString'. The http://hackage.haskell.org/package/time time> library accomplishes these with the\n <http://hackage.haskell.org/package/time-1.9.3/docs/Data-Time-Format.html Data.Time.Format> module, which uses UNIX-style datetime\n format strings. The approach taken by Chronos is faster and\n catches more mistakes at compile time, at the cost of being\n less expressive.";
buildType = "Simple";
};
components = {
"library" = {
depends = [
(hsPkgs."aeson" or (errorHandler.buildDepError "aeson"))
(hsPkgs."attoparsec" or (errorHandler.buildDepError "attoparsec"))
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
(hsPkgs."hashable" or (errorHandler.buildDepError "hashable"))
(hsPkgs."primitive" or (errorHandler.buildDepError "primitive"))
(hsPkgs."semigroups" or (errorHandler.buildDepError "semigroups"))
(hsPkgs."text" or (errorHandler.buildDepError "text"))
(hsPkgs."torsor" or (errorHandler.buildDepError "torsor"))
(hsPkgs."vector" or (errorHandler.buildDepError "vector"))
(hsPkgs."bytebuild" or (errorHandler.buildDepError "bytebuild"))
(hsPkgs."bytesmith" or (errorHandler.buildDepError "bytesmith"))
(hsPkgs."byteslice" or (errorHandler.buildDepError "byteslice"))
(hsPkgs."text-short" or (errorHandler.buildDepError "text-short"))
(hsPkgs."natural-arithmetic" or (errorHandler.buildDepError "natural-arithmetic"))
] ++ (pkgs.lib).optional (system.isWindows) (hsPkgs."Win32" or (errorHandler.buildDepError "Win32"));
buildable = true;
};
tests = {
"chronos-test" = {
depends = [
(hsPkgs."HUnit" or (errorHandler.buildDepError "HUnit"))
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
(hsPkgs."aeson" or (errorHandler.buildDepError "aeson"))
(hsPkgs."attoparsec" or (errorHandler.buildDepError "attoparsec"))
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."chronos" or (errorHandler.buildDepError "chronos"))
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
(hsPkgs."test-framework" or (errorHandler.buildDepError "test-framework"))
(hsPkgs."test-framework-hunit" or (errorHandler.buildDepError "test-framework-hunit"))
(hsPkgs."test-framework-quickcheck2" or (errorHandler.buildDepError "test-framework-quickcheck2"))
(hsPkgs."text" or (errorHandler.buildDepError "text"))
(hsPkgs."torsor" or (errorHandler.buildDepError "torsor"))
];
buildable = true;
};
};
benchmarks = {
"bench" = {
depends = [
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
(hsPkgs."attoparsec" or (errorHandler.buildDepError "attoparsec"))
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."chronos" or (errorHandler.buildDepError "chronos"))
(hsPkgs."criterion" or (errorHandler.buildDepError "criterion"))
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
(hsPkgs."old-locale" or (errorHandler.buildDepError "old-locale"))
(hsPkgs."text" or (errorHandler.buildDepError "text"))
(hsPkgs."text-short" or (errorHandler.buildDepError "text-short"))
(hsPkgs."thyme" or (errorHandler.buildDepError "thyme"))
(hsPkgs."time" or (errorHandler.buildDepError "time"))
(hsPkgs."vector" or (errorHandler.buildDepError "vector"))
];
buildable = true;
};
};
};
}
49 changes: 49 additions & 0 deletions ...-hedgehog-0.1.1.0-r0-2ec3540fbbdb108743c2fb8cc43f081eb13576d85bbec183567ad54d62d89b55.nix
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
{ system
, compiler
, flags
, pkgs
, hsPkgs
, pkgconfPkgs
, errorHandler
, config
, ... }:
{
flags = {};
package = {
specVersion = "1.12";
identifier = { name = "hspec-hedgehog"; version = "0.1.1.0"; };
license = "BSD-3-Clause";
copyright = "2020 Matt Parsons";
maintainer = "parsonsmatt@gmail.com";
author = "Matt Parsons";
homepage = "https://github.com/parsonsmatt/hspec-hedgehog#readme";
url = "";
synopsis = "Integrate Hedgehog and Hspec!";
description = "Please see the README on GitHub at <https://github.com/parsonsmatt/hspec-hedgehog#readme>";
buildType = "Simple";
};
components = {
"library" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."hspec" or (errorHandler.buildDepError "hspec"))
(hsPkgs."hspec-core" or (errorHandler.buildDepError "hspec-core"))
(hsPkgs."hedgehog" or (errorHandler.buildDepError "hedgehog"))
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
(hsPkgs."splitmix" or (errorHandler.buildDepError "splitmix"))
];
buildable = true;
};
tests = {
"hspec-hedgehog-test" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."hspec-hedgehog" or (errorHandler.buildDepError "hspec-hedgehog"))
(hsPkgs."hspec" or (errorHandler.buildDepError "hspec"))
(hsPkgs."hedgehog" or (errorHandler.buildDepError "hedgehog"))
];
buildable = true;
};
};
};
}
70 changes: 70 additions & 0 deletions ...ge/lz4-hs-0.1.5.2-r0-3d4b325ff9f51e0886ec952b72540fc6076ca16d5d12a449f5a6d388f1f1f3a0.nix
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
{ system
, compiler
, flags
, pkgs
, hsPkgs
, pkgconfPkgs
, errorHandler
, config
, ... }:
{
flags = { cross = false; };
package = {
specVersion = "2.2";
identifier = { name = "lz4-hs"; version = "0.1.5.2"; };
license = "BSD-3-Clause";
copyright = "Copyright: (c) 2020 Vanessa McHale";
maintainer = "vamchale@gmail.com";
author = "Vanessa McHale";
homepage = "";
url = "";
synopsis = "lz4 bindings for Haskell";
description = "lz4 streaming library via ByteString";
buildType = "Simple";
};
components = {
"library" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
];
build-tools = (pkgs.lib).optional (!flags.cross) (hsPkgs.buildPackages.c2hs.components.exes.c2hs or (pkgs.buildPackages.c2hs or (errorHandler.buildToolDepError "c2hs:c2hs")));
buildable = true;
};
tests = {
"lz4-test" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."lz4-hs" or (errorHandler.buildDepError "lz4-hs"))
(hsPkgs."tasty" or (errorHandler.buildDepError "tasty"))
(hsPkgs."tasty-hunit" or (errorHandler.buildDepError "tasty-hunit"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
];
buildable = true;
};
};
benchmarks = {
"lz4-mem" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."lz4-hs" or (errorHandler.buildDepError "lz4-hs"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."filepath" or (errorHandler.buildDepError "filepath"))
(hsPkgs."temporary" or (errorHandler.buildDepError "temporary"))
];
buildable = true;
};
"lz4-bench" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."lz4-hs" or (errorHandler.buildDepError "lz4-hs"))
(hsPkgs."criterion" or (errorHandler.buildDepError "criterion"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."temporary" or (errorHandler.buildDepError "temporary"))
(hsPkgs."filepath" or (errorHandler.buildDepError "filepath"))
];
buildable = true;
};
};
};
}
47 changes: 47 additions & 0 deletions ...e/poolboy-0.2.2.0-r0-1e69e86bcf2ad4e28dc3d5ff6053879de836923e6a274f9733c7346e8e56fc46.nix
View file
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 = "3.0";
identifier = { name = "poolboy"; version = "0.2.2.0"; };
license = "ISC";
copyright = "";
maintainer = "gautier.difolco@gmail.com";
author = "Gautier DI FOLCO";
homepage = "https://github.com/blackheaven/poolboy";
url = "";
synopsis = "Simple work queue for bounded concurrency";
description = "In-memory work queue helping with load management.";
buildType = "Simple";
};
components = {
"library" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."async" or (errorHandler.buildDepError "async"))
(hsPkgs."stm" or (errorHandler.buildDepError "stm"))
(hsPkgs."unliftio" or (errorHandler.buildDepError "unliftio"))
];
buildable = true;
};
tests = {
"poolboy-test" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."poolboy" or (errorHandler.buildDepError "poolboy"))
(hsPkgs."hspec" or (errorHandler.buildDepError "hspec"))
(hsPkgs."hspec-core" or (errorHandler.buildDepError "hspec-core"))
];
buildable = true;
};
};
};
}
75 changes: 75 additions & 0 deletions ...ge/relude-1.2.1.0-r1-2cab0cf30dd102ec7311730037aae3e588ab492bd5b9d2096a00679a41a10fb7.nix
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,75 @@
{ system
, compiler
, flags
, pkgs
, hsPkgs
, pkgconfPkgs
, errorHandler
, config
, ... }:
{
flags = {};
package = {
specVersion = "3.0";
identifier = { name = "relude"; version = "1.2.1.0"; };
license = "MIT";
copyright = "2016 Stephen Diehl, 2016-2018 Serokell, 2018-2023 Kowainik";
maintainer = "Kowainik <xrom.xkov@gmail.com>";
author = "Dmitrii Kovanikov, Veronika Romashkina, Stephen Diehl, Serokell";
homepage = "https://github.com/kowainik/relude";
url = "";
synopsis = "Safe, performant, user-friendly and lightweight Haskell Standard Library";
description = "@__relude__@ is an alternative prelude library. If you find the default\n@Prelude@ unsatisfying, despite its advantages, consider using @relude@\ninstead.\n\n== Relude goals and design principles\n* __Productivity.__ You can be more productive with a \"non-standard\" standard\n library, and @relude@ helps you with writing safer and more\n efficient code faster.\n\n* __Total programming__. Usage of [/partial functions/](https://www.reddit.com/r/haskell/comments/5n51u3/why_are_partial_functions_as_in_head_tail_bad/)\n can lead to unexpected bugs and runtime exceptions in pure\n code. The types of partial functions lie about their behaviour. And\n even if it is not always possible to rely only on total functions,\n @relude@ strives to encourage best-practices and reduce the\n chances of introducing a bug.\n\n +---------------------------------+--------------------------------------------+\n | __Partial__ | __Total__ |\n +=================================+============================================+\n | @head :: [a] -> a@ | @head :: NonEmpty a -> a@ |\n +---------------------------------+--------------------------------------------+\n | @tail :: [a] -> [a]@ | @tail :: NonEmpty a -> [a]@ |\n +---------------------------------+--------------------------------------------+\n | @read :: Read a => String -> a@ | @readMaybe :: Read a => String -> Maybe a@ |\n +---------------------------------+--------------------------------------------+\n | @fromJust :: Maybe a -> a@ | @fromMaybe :: a -> Maybe a -> a@ |\n +---------------------------------+--------------------------------------------+\n\n* __Type-safety__. We use the /\"make invalid states unrepresentable\"/ motto as one\n of our guiding principles. If it is possible, we express this concept through the\n types.\n\n /Example:/ @ whenNotNull :: Applicative f => [a] -> (NonEmpty a -> f ()) -> f () @\n\n* __Performance.__ We prefer @Text@ over @[String](https://www.reddit.com/r/haskell/comments/29jw0s/whats_wrong_with_string/)@,\n use space-leaks-free functions (e.g. our custom performant @sum@ and @product@),\n introduce @\\{\\-\\# INLINE \\#\\-\\}@ and @\\{\\-\\# SPECIALIZE \\#\\-\\}@ pragmas where\n appropriate, and make efficient container types\n (e.g. @Map@, @HashMap@, @Set@) more accessible.\n\n* __Minimalism__ (low number of dependencies). We do not force users of\n @relude@ to stick to any specific lens or text formatting or logging\n library. Where possible, @relude@ depends only on boot libraries.\n The [Dependency graph](https://raw.githubusercontent.com/kowainik/relude/main/relude-dependency-graph.png)\n of @relude@ can give you a clearer picture.\n\n* __Convenience__. Despite minimalism, we want to bring commonly used\n types and functions into scope, and make available functions easier\n to use. Some examples of conveniences:\n\n 1. No need to add @containers@, @unordered-containers@, @text@\n and @bytestring@ to dependencies in your @.cabal@ file to\n use the main API of these libraries\n 2. No need to import types like @NonEmpty@, @Text@, @Set@, @Reader[T]@, @MVar@, @STM@\n 3. Functions like @liftIO@, @fromMaybe@, @sortWith@ are available by default as well\n 4. @IO@ actions are lifted to @MonadIO@\n\n* __Excellent documentation.__\n\n 1. Tutorial\n 2. Migration guide from @Prelude@\n 3. Haddock for every function with examples tested by\n [doctest](http://hackage.haskell.org/package/doctest).\n 4. Documentation regarding [internal module structure](http://hackage.haskell.org/package/relude/docs/Relude.html)\n 5. @relude@-specific [HLint](http://hackage.haskell.org/package/hlint) rules: @[.hlint.yaml](https://github.com/kowainik/relude/blob/main/.hlint.yaml)@\n\n* __User-friendliness.__ Anyone should be able to quickly migrate to @relude@. Only\n some basic familiarity with the common libraries like @text@ and @containers@\n should be enough (but not necessary).\n\n* __Exploration.__ We have space to experiment with new ideas and proposals\n without introducing breaking changes. @relude@ uses the approach with\n @Extra.*@ modules which are not exported by default. The chosen approach makes it quite\n easy for us to provide new functionality without breaking anything and let\n the users decide to use it or not.";
buildType = "Simple";
};
components = {
"library" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
(hsPkgs."ghc-prim" or (errorHandler.buildDepError "ghc-prim"))
(hsPkgs."hashable" or (errorHandler.buildDepError "hashable"))
(hsPkgs."mtl" or (errorHandler.buildDepError "mtl"))
(hsPkgs."stm" or (errorHandler.buildDepError "stm"))
(hsPkgs."text" or (errorHandler.buildDepError "text"))
(hsPkgs."transformers" or (errorHandler.buildDepError "transformers"))
(hsPkgs."unordered-containers" or (errorHandler.buildDepError "unordered-containers"))
];
buildable = true;
};
tests = {
"relude-test" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."relude" or (errorHandler.buildDepError "relude"))
(hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
(hsPkgs."text" or (errorHandler.buildDepError "text"))
(hsPkgs."hedgehog" or (errorHandler.buildDepError "hedgehog"))
];
buildable = true;
};
"relude-doctest" = {
depends = [
(hsPkgs."relude" or (errorHandler.buildDepError "relude"))
(hsPkgs."doctest" or (errorHandler.buildDepError "doctest"))
(hsPkgs."Glob" or (errorHandler.buildDepError "Glob"))
];
buildable = true;
};
};
benchmarks = {
"relude-benchmark" = {
depends = [
(hsPkgs."base" or (errorHandler.buildDepError "base"))
(hsPkgs."relude" or (errorHandler.buildDepError "relude"))
(hsPkgs."tasty-bench" or (errorHandler.buildDepError "tasty-bench"))
(hsPkgs."unordered-containers" or (errorHandler.buildDepError "unordered-containers"))
];
buildable = true;
};
};
};
}
Loading

0 comments on commit 2dfd896

Please sign in to comment.