Skip to content

Commit e07df92

Browse files
author
IOHK
committed
Automatic Update
1 parent 03e4b08 commit e07df92

File tree

77 files changed

+3669
-15
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

77 files changed

+3669
-15
lines changed

‎default.nix

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -13375,6 +13375,7 @@ with builtins; mapAttrs (_: mapAttrs (_: data: rec {
1337513375
"raw-feldspar" = import ./nix/raw-feldspar.nix;
1337613376
"raw-strings-qq" = import ./nix/raw-strings-qq.nix;
1337713377
"rawfilepath" = import ./nix/rawfilepath.nix;
13378+
"rawlock" = import ./nix/rawlock.nix;
1337813379
"rawr" = import ./nix/rawr.nix;
1337913380
"rawstring-qm" = import ./nix/rawstring-qm.nix;
1338013381
"raylib-imgui" = import ./nix/raylib-imgui.nix;
@@ -13729,6 +13730,7 @@ with builtins; mapAttrs (_: mapAttrs (_: data: rec {
1372913730
"resource-pool-catchio" = import ./nix/resource-pool-catchio.nix;
1373013731
"resource-pool-fork-avanov" = import ./nix/resource-pool-fork-avanov.nix;
1373113732
"resource-pool-monad" = import ./nix/resource-pool-monad.nix;
13733+
"resource-registry" = import ./nix/resource-registry.nix;
1373213734
"resource-simple" = import ./nix/resource-simple.nix;
1373313735
"resourcet" = import ./nix/resourcet.nix;
1373413736
"resourcet-effectful" = import ./nix/resourcet-effectful.nix;

‎hackage/ChasingBottoms-1.3.1.15-r1-02d6b91e21d409f330e2edb20f55cc524e395d532feeb8d961f54eac602b6cc0.nix

Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "1.10";
14+
identifier = { name = "ChasingBottoms"; version = "1.3.1.15"; };
15+
license = "MIT";
16+
copyright = "Copyright (c) Nils Anders Danielsson 2004-2022, 2024.";
17+
maintainer = "http://www.cse.chalmers.se/~nad/";
18+
author = "Nils Anders Danielsson";
19+
homepage = "";
20+
url = "";
21+
synopsis = "For testing partial and infinite values.";
22+
description = "Do you ever feel the need to test code involving bottoms (e.g. calls to\nthe @error@ function), or code involving infinite values? Then this\nlibrary could be useful for you.\n\nIt is usually easy to get a grip on bottoms by showing a value and\nwaiting to see how much gets printed before the first exception is\nencountered. However, that quickly gets tiresome and is hard to automate\nusing e.g. QuickCheck\n(<http://www.cse.chalmers.se/~rjmh/QuickCheck/>). With this library you\ncan do the tests as simply as the following examples show.\n\nTesting explicitly for bottoms:\n\n> > isBottom (head [])\n> True\n\n> > isBottom bottom\n> True\n\n> > isBottom (\\_ -> bottom)\n> False\n\n> > isBottom (bottom, bottom)\n> False\n\nComparing finite, partial values:\n\n> > ((bottom, 3) :: (Bool, Int)) ==! (bottom, 2+5-4)\n> True\n\n> > ((bottom, bottom) :: (Bool, Int)) <! (bottom, 8)\n> True\n\nShowing partial and infinite values (@\\\\\\/!@ is join and @\\/\\\\!@ is meet):\n\n> > approxShow 4 $ (True, bottom) \\/! (bottom, 'b')\n> \"Just (True, 'b')\"\n\n> > approxShow 4 $ (True, bottom) /\\! (bottom, 'b')\n> \"(_|_, _|_)\"\n\n> > approxShow 4 $ ([1..] :: [Int])\n> \"[1, 2, 3, _\"\n\n> > approxShow 4 $ (cycle [bottom] :: [Bool])\n> \"[_|_, _|_, _|_, _\"\n\nApproximately comparing infinite, partial values:\n\n> > approx 100 [2,4..] ==! approx 100 (filter even [1..] :: [Int])\n> True\n\n> > approx 100 [2,4..] /=! approx 100 (filter even [bottom..] :: [Int])\n> True\n\nThe code above relies on the fact that @bottom@, just as @error\n\\\"...\\\"@, @undefined@ and pattern match failures, yield\nexceptions. Sometimes we are dealing with properly non-terminating\ncomputations, such as the following example, and then it can be nice to\nbe able to apply a time-out:\n\n> > timeOut' 1 (reverse [1..5])\n> Value [5,4,3,2,1]\n\n> > timeOut' 1 (reverse [1..])\n> NonTermination\n\nThe time-out functionality can be used to treat \\\"slow\\\" computations as\nbottoms:\n\n@\n\\> let tweak = Tweak &#x7b; approxDepth = Just 5, timeOutLimit = Just 2 &#x7d;\n\\> semanticEq tweak (reverse [1..], [1..]) (bottom :: [Int], [1..] :: [Int])\nTrue\n@\n\n@\n\\> let tweak = noTweak &#x7b; timeOutLimit = Just 2 &#x7d;\n\\> semanticJoin tweak (reverse [1..], True) ([] :: [Int], bottom)\nJust ([],True)\n@\n\nThis can of course be dangerous:\n\n@\n\\> let tweak = noTweak &#x7b; timeOutLimit = Just 0 &#x7d;\n\\> semanticEq tweak (reverse [1..100000000]) (bottom :: [Integer])\nTrue\n@\n\nTimeouts can also be applied to @IO@ computations:\n\n> > let primes () = unfoldr (\\(x:xs) -> Just (x, filter ((/= 0) . (`mod` x)) xs)) [2..]\n> > timeOutMicro 100 (print $ primes ())\n> [2,NonTermination\n> > timeOutMicro 10000 (print $ take 10 $ primes ())\n> [2,3,5,7,11,13,17,19,23,29]\n> Value ()\n\nFor the underlying theory and a larger example involving use of\nQuickCheck, see the article \\\"Chasing Bottoms, A Case Study in Program\nVerification in the Presence of Partial and Infinite Values\\\"\n(<http://www.cse.chalmers.se/~nad/publications/danielsson-jansson-mpc2004.html>).\n\nThe code has been tested using GHC. Most parts can probably be\nported to other Haskell compilers, but this would require some work.\nThe @TimeOut@ functions require preemptive scheduling, and most of\nthe rest requires @Data.Generics@; @isBottom@ only requires\nexceptions, though.";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = [
28+
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
29+
(hsPkgs."mtl" or (errorHandler.buildDepError "mtl"))
30+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
31+
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
32+
(hsPkgs."random" or (errorHandler.buildDepError "random"))
33+
(hsPkgs."syb" or (errorHandler.buildDepError "syb"))
34+
];
35+
buildable = true;
36+
};
37+
tests = {
38+
"ChasingBottomsTestSuite" = {
39+
depends = [
40+
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
41+
(hsPkgs."mtl" or (errorHandler.buildDepError "mtl"))
42+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
43+
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
44+
(hsPkgs."random" or (errorHandler.buildDepError "random"))
45+
(hsPkgs."syb" or (errorHandler.buildDepError "syb"))
46+
(hsPkgs."array" or (errorHandler.buildDepError "array"))
47+
];
48+
buildable = true;
49+
};
50+
};
51+
};
52+
}

‎hackage/MonadRandom-0.6.1-r0-17914ff7ca7bf9982ee65fe5a18780e9f54ce2d9ca4d3c3950cfc9284b8d72e3.nix

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "1.10";
14+
identifier = { name = "MonadRandom"; version = "0.6.1"; };
15+
license = "BSD-3-Clause";
16+
copyright = "";
17+
maintainer = "Brent Yorgey <[email protected]>";
18+
author = "Cale Gibbard and others";
19+
homepage = "";
20+
url = "";
21+
synopsis = "Random-number generation monad.";
22+
description = "Support for computations which consume random values.";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = [
28+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
29+
(hsPkgs."transformers" or (errorHandler.buildDepError "transformers"))
30+
(hsPkgs."transformers-compat" or (errorHandler.buildDepError "transformers-compat"))
31+
(hsPkgs."mtl" or (errorHandler.buildDepError "mtl"))
32+
(hsPkgs."primitive" or (errorHandler.buildDepError "primitive"))
33+
(hsPkgs."random" or (errorHandler.buildDepError "random"))
34+
] ++ pkgs.lib.optional (compiler.isGhc && compiler.version.lt "8.0") (hsPkgs."fail" or (errorHandler.buildDepError "fail"));
35+
buildable = true;
36+
};
37+
};
38+
}

‎hackage/aftovolio-0.4.0.0-r0-2690fcb5a1134d88aef128c03f222d2e6fe05913b21087ee09c2b94b1e3a71c1.nix

Lines changed: 75 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,75 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "2.4";
14+
identifier = { name = "aftovolio"; version = "0.4.0.0"; };
15+
license = "MIT";
16+
copyright = "Oleksandr Zhabenko";
17+
maintainer = "[email protected]";
18+
author = "Oleksandr Zhabenko";
19+
homepage = "";
20+
url = "";
21+
synopsis = "An AFTOVolio implementation for creating texts with special phonetic / prosodic properties.";
22+
description = "It is another project that is based on the similar ideas as [phonetic-languages-simplified-examples-array package](https://hackage.haskell.org/package/phonetic-languages-simplified-examples-array). It combines general functionality with an example of complete one for Ukrainian language with extended documentation, mostly in the README.md file. ";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = [
28+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
29+
(hsPkgs."rhythmic-sequences" or (errorHandler.buildDepError "rhythmic-sequences"))
30+
(hsPkgs."cli-arguments" or (errorHandler.buildDepError "cli-arguments"))
31+
(hsPkgs."directory" or (errorHandler.buildDepError "directory"))
32+
(hsPkgs."rev-scientific" or (errorHandler.buildDepError "rev-scientific"))
33+
(hsPkgs."async" or (errorHandler.buildDepError "async"))
34+
(hsPkgs."mmsyn2-array" or (errorHandler.buildDepError "mmsyn2-array"))
35+
(hsPkgs."minmax" or (errorHandler.buildDepError "minmax"))
36+
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
37+
(hsPkgs."monoid-insertleft" or (errorHandler.buildDepError "monoid-insertleft"))
38+
(hsPkgs."intermediate-structures" or (errorHandler.buildDepError "intermediate-structures"))
39+
(hsPkgs."quantizer" or (errorHandler.buildDepError "quantizer"))
40+
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
41+
(hsPkgs."lists-flines" or (errorHandler.buildDepError "lists-flines"))
42+
];
43+
buildable = true;
44+
};
45+
exes = {
46+
"aftovolioUkr" = {
47+
depends = [
48+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
49+
(hsPkgs."rhythmic-sequences" or (errorHandler.buildDepError "rhythmic-sequences"))
50+
(hsPkgs."cli-arguments" or (errorHandler.buildDepError "cli-arguments"))
51+
(hsPkgs."directory" or (errorHandler.buildDepError "directory"))
52+
(hsPkgs."rev-scientific" or (errorHandler.buildDepError "rev-scientific"))
53+
(hsPkgs."async" or (errorHandler.buildDepError "async"))
54+
(hsPkgs."mmsyn2-array" or (errorHandler.buildDepError "mmsyn2-array"))
55+
(hsPkgs."minmax" or (errorHandler.buildDepError "minmax"))
56+
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
57+
(hsPkgs."monoid-insertleft" or (errorHandler.buildDepError "monoid-insertleft"))
58+
(hsPkgs."intermediate-structures" or (errorHandler.buildDepError "intermediate-structures"))
59+
(hsPkgs."quantizer" or (errorHandler.buildDepError "quantizer"))
60+
(hsPkgs."containers" or (errorHandler.buildDepError "containers"))
61+
(hsPkgs."lists-flines" or (errorHandler.buildDepError "lists-flines"))
62+
];
63+
buildable = true;
64+
};
65+
"unconcatUkr2" = {
66+
depends = [
67+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
68+
(hsPkgs."mmsyn2-array" or (errorHandler.buildDepError "mmsyn2-array"))
69+
(hsPkgs."intermediate-structures" or (errorHandler.buildDepError "intermediate-structures"))
70+
];
71+
buildable = true;
72+
};
73+
};
74+
};
75+
}

‎hackage/bearriver-0.14.11-r0-ca2ee1036ff7b18e23bfba87e6ca4e6c23792b7fbfe68cfb5fa7613c001fa473.nix

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "1.10";
14+
identifier = { name = "bearriver"; version = "0.14.11"; };
15+
license = "BSD-3-Clause";
16+
copyright = "Copyright (c) 2019-2022 - Ivan Perez\n,\nCopyright (c) 2016-2018 - Ivan Perez and Manuel Bärenz";
17+
maintainer = "[email protected]";
18+
author = "Ivan Perez, Manuel Bärenz";
19+
homepage = "https://github.com/ivanperez-keera/dunai";
20+
url = "";
21+
synopsis = "FRP Yampa replacement implemented with Monadic Stream Functions.";
22+
description = "<https://hackage.haskell.org/package/Yampa Yampa> is a popular Functional\nReactive Programming (FRP) implementation that has been used extensively for\nall kinds of applications, including robotics and games.\n\n<https://dl.acm.org/doi/10.1145/2976002.2976010 Monadic Stream Functions> are\na new abstraction for data processors that combine arrows and monads. The\nlibrary <https://hackage.haskell.org/package/dunai dunai> provides a default\nimplementation.\n\nBearriver (a tributary to the Yampa river) provides the same API as Yampa,\nbut implemented using dunai underneath. The goal is to facilitate\nunderstanding what's different about Yampa, and other FRP and Reactive\nProgramming libraries, by creating wrappers around dunai defined precisely by\nthose differences.\n\nBecause dunai is particularly fast, especially with optimizations enabled,\nthis implementation is faster than traditional Yampa for medium-sized and\nlarge applications.";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = ([
28+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
29+
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
30+
(hsPkgs."dunai" or (errorHandler.buildDepError "dunai"))
31+
(hsPkgs."mtl" or (errorHandler.buildDepError "mtl"))
32+
(hsPkgs."random" or (errorHandler.buildDepError "random"))
33+
(hsPkgs."simple-affine-space" or (errorHandler.buildDepError "simple-affine-space"))
34+
(hsPkgs."transformers" or (errorHandler.buildDepError "transformers"))
35+
] ++ pkgs.lib.optional (compiler.isGhc && compiler.version.le "7.8.4") (hsPkgs."MonadRandom" or (errorHandler.buildDepError "MonadRandom"))) ++ pkgs.lib.optional (!(compiler.isGhc && compiler.version.ge "8.0")) (hsPkgs."fail" or (errorHandler.buildDepError "fail"));
36+
buildable = true;
37+
};
38+
};
39+
}

‎hackage/control-monad-omega-0.3.3-r0-531b95813a57603386a5c35a82b8f195969dbe23dc04422cee39ea86541adaba.nix

Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "2.0";
14+
identifier = { name = "control-monad-omega"; version = "0.3.3"; };
15+
license = "LicenseRef-PublicDomain";
16+
copyright = "";
17+
maintainer = "[email protected]";
18+
author = "Luke Palmer";
19+
homepage = "http://github.com/luqui/control-monad-omega";
20+
url = "";
21+
synopsis = "A breadth-first list monad.";
22+
description = "A monad for enumerating sets: like the list\nmonad but breadth-first.";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = [ (hsPkgs."base" or (errorHandler.buildDepError "base")) ];
28+
buildable = true;
29+
};
30+
tests = {
31+
"omega-tests" = {
32+
depends = [
33+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
34+
(hsPkgs."control-monad-omega" or (errorHandler.buildDepError "control-monad-omega"))
35+
(hsPkgs."tasty" or (errorHandler.buildDepError "tasty"))
36+
(hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck"))
37+
];
38+
buildable = true;
39+
};
40+
};
41+
benchmarks = {
42+
"omega-bench" = {
43+
depends = [
44+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
45+
(hsPkgs."control-monad-omega" or (errorHandler.buildDepError "control-monad-omega"))
46+
(hsPkgs."tasty-bench" or (errorHandler.buildDepError "tasty-bench"))
47+
];
48+
buildable = true;
49+
};
50+
};
51+
};
52+
}

‎hackage/dimensional-1.1-r3-240f62161fb67eb10d4b404cd816ac15c4bcdfe8d7ace83fd65a206569ef3f62.nix

Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
{ system
2+
, compiler
3+
, flags
4+
, pkgs
5+
, hsPkgs
6+
, pkgconfPkgs
7+
, errorHandler
8+
, config
9+
, ... }:
10+
{
11+
flags = {};
12+
package = {
13+
specVersion = "1.10";
14+
identifier = { name = "dimensional"; version = "1.1"; };
15+
license = "BSD-3-Clause";
16+
copyright = "Bjorn Buckwalter 2006-2018";
17+
maintainer = "[email protected]";
18+
author = "Bjorn Buckwalter";
19+
homepage = "https://github.com/bjornbm/dimensional/";
20+
url = "";
21+
synopsis = "Statically checked physical dimensions,\nusing Type Families and Data Kinds.";
22+
description = "Dimensional is a library providing data types for performing arithmetic\nwith physical quantities and units. Information about the physical\ndimensions of the quantities and units is embedded in their types and the\nvalidity of operations is verified by the type checker at compile time.\nThe boxing and unboxing of numerical values as quantities is done by\nmultiplication and division with units. The library is designed to, as\nfar as is practical, enforce/encourage best practices of unit usage.\nVersion 1 of the dimensional package differs from earlier version in that\nthe dimension tracking is implemented using Closed Type Families and Data Kinds\nrather than functional dependencies. This enables a number of features, including\nimproved support for unit names and quantities with statically-unknown dimensions.\nRequires GHC 7.8 or later.";
23+
buildType = "Simple";
24+
};
25+
components = {
26+
"library" = {
27+
depends = [
28+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
29+
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
30+
(hsPkgs."exact-pi" or (errorHandler.buildDepError "exact-pi"))
31+
(hsPkgs."ieee754" or (errorHandler.buildDepError "ieee754"))
32+
(hsPkgs."numtype-dk" or (errorHandler.buildDepError "numtype-dk"))
33+
(hsPkgs."vector" or (errorHandler.buildDepError "vector"))
34+
(hsPkgs."semigroups" or (errorHandler.buildDepError "semigroups"))
35+
];
36+
buildable = true;
37+
};
38+
tests = {
39+
"tests" = {
40+
depends = [
41+
(hsPkgs."dimensional" or (errorHandler.buildDepError "dimensional"))
42+
(hsPkgs."hspec" or (errorHandler.buildDepError "hspec"))
43+
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
44+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
45+
];
46+
buildable = true;
47+
};
48+
"doctests" = {
49+
depends = [
50+
(hsPkgs."dimensional" or (errorHandler.buildDepError "dimensional"))
51+
(hsPkgs."doctest" or (errorHandler.buildDepError "doctest"))
52+
(hsPkgs."Glob" or (errorHandler.buildDepError "Glob"))
53+
(hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
54+
(hsPkgs."template-haskell" or (errorHandler.buildDepError "template-haskell"))
55+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
56+
];
57+
buildable = true;
58+
};
59+
};
60+
benchmarks = {
61+
"simple" = {
62+
depends = [
63+
(hsPkgs."base" or (errorHandler.buildDepError "base"))
64+
(hsPkgs."criterion" or (errorHandler.buildDepError "criterion"))
65+
(hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
66+
(hsPkgs."dimensional" or (errorHandler.buildDepError "dimensional"))
67+
];
68+
buildable = true;
69+
};
70+
};
71+
};
72+
}

0 commit comments

Comments
 (0)