Automatic Update

default.nix

@@ -10254,6 +10254,7 @@ with builtins; mapAttrs (_: mapAttrs (_: data: rec {
   "map-reduce-folds" = import ./nix/map-reduce-folds.nix;
   "map-syntax" = import ./nix/map-syntax.nix;
   "mapalgebra" = import ./nix/mapalgebra.nix;
+  "mappings" = import ./nix/mappings.nix;
   "mappy" = import ./nix/mappy.nix;
   "mapquest-api" = import ./nix/mapquest-api.nix;
   "maquinitas-tidal" = import ./nix/maquinitas-tidal.nix;

hackage/WeakSets-1.6.1.0-r0-64a75ec4f129b137bcf4b05c88e008292a7c70e86491971096e95a65d68dc3fb.nix

@@ -0,0 +1,40 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = {};
+    package = {
+      specVersion = "2.4";
+      identifier = { name = "WeakSets"; version = "1.6.1.0"; };
+      license = "LGPL-3.0-or-later";
+      copyright = "";
+      maintainer = "guillaumesabbagh@protonmail.com";
+      author = "Guillaume Sabbagh";
+      homepage = "https://gitlab.utc.fr/gsabbagh/sets";
+      url = "";
+      synopsis = "Simple set types. Useful to create sets of arbitrary types and nested sets.";
+      description = "This package answers two problems : how to make sets and maps of types which do not implement the Ord typeclass and how to make arbitrarily nested sets as set theory allows. The problems are resolved thanks to `WeakSet`s and `WeakMap`s. A `WeakSet` is like a list where duplicates are considered the same when testing for equality. A `WeakMap` is a set of couples (key,value).";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [ (hsPkgs."base" or (errorHandler.buildDepError "base")) ];
+        buildable = true;
+        };
+      tests = {
+        "WeakSets-test" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."WeakSets" or (errorHandler.buildDepError "WeakSets"))
+            ];
+          buildable = true;
+          };
+        };
+      };
+    }

hackage/aeson-yaml-1.1.0.1-r4-9e094958326f4651729e062688653b414b3dfa5115d4a46724a9598a68b5e67b.nix

@@ -0,0 +1,68 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = { build-binaries = false; };
+    package = {
+      specVersion = "1.12";
+      identifier = { name = "aeson-yaml"; version = "1.1.0.1"; };
+      license = "BSD-3-Clause";
+      copyright = "2019 Clovyr LLC";
+      maintainer = "patrick@clovyr.io";
+      author = "Patrick Nielsen";
+      homepage = "https://github.com/clovyr/aeson-yaml";
+      url = "";
+      synopsis = "Output any Aeson value as YAML (pure Haskell library)";
+      description = "This library exposes functions for encoding any Aeson value as YAML. There\nis also support for encoding multiple values into YAML \"documents\".\n\nThis library is pure Haskell, and does not depend on C FFI with libyaml. It\nis also licensed under the BSD3 license.";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [
+          (hsPkgs."aeson" or (errorHandler.buildDepError "aeson"))
+          (hsPkgs."base" or (errorHandler.buildDepError "base"))
+          (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+          (hsPkgs."text" or (errorHandler.buildDepError "text"))
+          (hsPkgs."unordered-containers" or (errorHandler.buildDepError "unordered-containers"))
+          (hsPkgs."vector" or (errorHandler.buildDepError "vector"))
+          ];
+        buildable = true;
+        };
+      exes = {
+        "json-to-yaml" = {
+          depends = [
+            (hsPkgs."aeson" or (errorHandler.buildDepError "aeson"))
+            (hsPkgs."aeson-yaml" or (errorHandler.buildDepError "aeson-yaml"))
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+            ];
+          buildable = if !flags.build-binaries then false else true;
+          };
+        };
+      tests = {
+        "test" = {
+          depends = [
+            (hsPkgs."aeson" or (errorHandler.buildDepError "aeson"))
+            (hsPkgs."aeson-yaml" or (errorHandler.buildDepError "aeson-yaml"))
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+            (hsPkgs."string-qq" or (errorHandler.buildDepError "string-qq"))
+            (hsPkgs."tasty" or (errorHandler.buildDepError "tasty"))
+            (hsPkgs."tasty-hunit" or (errorHandler.buildDepError "tasty-hunit"))
+            (hsPkgs."unordered-containers" or (errorHandler.buildDepError "unordered-containers"))
+            (hsPkgs."yaml" or (errorHandler.buildDepError "yaml"))
+            ];
+          build-tools = [
+            (hsPkgs.buildPackages.tasty-discover.components.exes.tasty-discover or (pkgs.buildPackages.tasty-discover or (errorHandler.buildToolDepError "tasty-discover:tasty-discover")))
+            ];
+          buildable = true;
+          };
+        };
+      };
+    }

hackage/algebraic-graphs-0.7-r2-75f8bbfffc8bc6c8a0a3c61f7f3ed2129fee35fd929822230b693786059f4fdf.nix

@@ -0,0 +1,53 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = {};
+    package = {
+      specVersion = "2.2";
+      identifier = { name = "algebraic-graphs"; version = "0.7"; };
+      license = "MIT";
+      copyright = "Andrey Mokhov, 2016-2022";
+      maintainer = "Andrey Mokhov <andrey.mokhov@gmail.com>, github: @snowleopard,\nAlexandre Moine <alexandre@moine.me>, github: @nobrakal";
+      author = "Andrey Mokhov <andrey.mokhov@gmail.com>, github: @snowleopard";
+      homepage = "https://github.com/snowleopard/alga";
+      url = "";
+      synopsis = "A library for algebraic graph construction and transformation";
+      description = "<https://github.com/snowleopard/alga Alga> is a library for algebraic construction and\nmanipulation of graphs in Haskell. See <https://github.com/snowleopard/alga-paper this paper>\nfor the motivation behind the library, the underlying theory and implementation details.\n\nThe top-level module\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph.html Algebra.Graph>\ndefines the main data type for /algebraic graphs/\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph.html#t:Graph Graph>,\nas well as associated algorithms. For type-safe representation and\nmanipulation of /non-empty algebraic graphs/, see\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-NonEmpty.html Algebra.Graph.NonEmpty>.\nFurthermore, /algebraic graphs with edge labels/ are implemented in\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-Labelled.html Algebra.Graph.Labelled>.\n\nThe library also provides conventional graph data structures, such as\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-AdjacencyMap.html Algebra.Graph.AdjacencyMap>\nalong with its various flavours:\n\n* adjacency maps specialised to graphs with vertices of type 'Int'\n(<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-AdjacencyIntMap.html Algebra.Graph.AdjacencyIntMap>),\n* non-empty adjacency maps\n(<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-NonEmpty-AdjacencyMap.html Algebra.Graph.NonEmpty.AdjacencyMap>),\n* adjacency maps for undirected bipartite graphs\n(<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-Bipartite-AdjacencyMap.html Algebra.Graph.Bipartite.AdjacencyMap>),\n* adjacency maps with edge labels\n(<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-Labelled-AdjacencyMap.html Algebra.Graph.Labelled.AdjacencyMap>),\n* acyclic adjacency maps\n(<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-Acyclic-AdjacencyMap.html Algebra.Graph.Acyclic.AdjacencyMap>),\n\nA large part of the API of algebraic graphs and adjacency maps is available\nthrough the 'Foldable'-like type class\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-ToGraph.html Algebra.Graph.ToGraph>.\n\nThe type classes defined in\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-Class.html Algebra.Graph.Class>\nand\n<http://hackage.haskell.org/package/algebraic-graphs/docs/Algebra-Graph-HigherKinded-Class.html Algebra.Graph.HigherKinded.Class>\ncan be used for polymorphic construction and manipulation of graphs.\n\nThis is an experimental library and the API is expected to remain unstable until version 1.0.0.\nPlease consider contributing to the on-going\n<https://github.com/snowleopard/alga/issues discussions on the library API>.";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [
+          (hsPkgs."array" or (errorHandler.buildDepError "array"))
+          (hsPkgs."base" or (errorHandler.buildDepError "base"))
+          (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+          (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
+          (hsPkgs."transformers" or (errorHandler.buildDepError "transformers"))
+          ];
+        buildable = true;
+        };
+      tests = {
+        "main" = {
+          depends = [
+            (hsPkgs."array" or (errorHandler.buildDepError "array"))
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+            (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
+            (hsPkgs."transformers" or (errorHandler.buildDepError "transformers"))
+            (hsPkgs."algebraic-graphs" or (errorHandler.buildDepError "algebraic-graphs"))
+            (hsPkgs."extra" or (errorHandler.buildDepError "extra"))
+            (hsPkgs."inspection-testing" or (errorHandler.buildDepError "inspection-testing"))
+            (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
+            ];
+          buildable = true;
+          };
+        };
+      };
+    }

hackage/base64-0.4.2.4-r4-82af79b6e72dd3e1891cb6cd698bc466331261295a0feb6ef019cc6e4b1383d1.nix

@@ -0,0 +1,70 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = {};
+    package = {
+      specVersion = "2.0";
+      identifier = { name = "base64"; version = "0.4.2.4"; };
+      license = "BSD-3-Clause";
+      copyright = "(c) 2019-2022 Emily Pillmore";
+      maintainer = "emilypi@cohomolo.gy";
+      author = "Emily Pillmore";
+      homepage = "https://github.com/emilypi/base64";
+      url = "";
+      synopsis = "A modern RFC 4648-compliant Base64 library";
+      description = "RFC 4648-compliant Base64 with an eye towards performance and modernity (additional support for RFC 7049 standards)";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [
+          (hsPkgs."base" or (errorHandler.buildDepError "base"))
+          (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+          (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
+          (hsPkgs."text" or (errorHandler.buildDepError "text"))
+          (hsPkgs."text-short" or (errorHandler.buildDepError "text-short"))
+          ];
+        buildable = true;
+        };
+      tests = {
+        "tasty" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."base64" or (errorHandler.buildDepError "base64"))
+            (hsPkgs."base64-bytestring" or (errorHandler.buildDepError "base64-bytestring"))
+            (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+            (hsPkgs."QuickCheck" or (errorHandler.buildDepError "QuickCheck"))
+            (hsPkgs."random-bytestring" or (errorHandler.buildDepError "random-bytestring"))
+            (hsPkgs."tasty" or (errorHandler.buildDepError "tasty"))
+            (hsPkgs."tasty-hunit" or (errorHandler.buildDepError "tasty-hunit"))
+            (hsPkgs."tasty-quickcheck" or (errorHandler.buildDepError "tasty-quickcheck"))
+            (hsPkgs."text" or (errorHandler.buildDepError "text"))
+            (hsPkgs."text-short" or (errorHandler.buildDepError "text-short"))
+            ];
+          buildable = true;
+          };
+        };
+      benchmarks = {
+        "bench" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."base64" or (errorHandler.buildDepError "base64"))
+            (hsPkgs."base64-bytestring" or (errorHandler.buildDepError "base64-bytestring"))
+            (hsPkgs."bytestring" or (errorHandler.buildDepError "bytestring"))
+            (hsPkgs."criterion" or (errorHandler.buildDepError "criterion"))
+            (hsPkgs."deepseq" or (errorHandler.buildDepError "deepseq"))
+            (hsPkgs."random-bytestring" or (errorHandler.buildDepError "random-bytestring"))
+            (hsPkgs."text" or (errorHandler.buildDepError "text"))
+            ];
+          buildable = true;
+          };
+        };
+      };
+    }

hackage/brick-list-skip-0.1.1.8-r0-04ed16b76e0d9779e7ec4f772bf0cf677c0450882e1ac3002ad0058255ddb25b.nix

@@ -0,0 +1,50 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = { demo = false; };
+    package = {
+      specVersion = "3.0";
+      identifier = { name = "brick-list-skip"; version = "0.1.1.8"; };
+      license = "0BSD";
+      copyright = "";
+      maintainer = "amano.kenji@proton.me";
+      author = "amano.kenji";
+      homepage = "https://codeberg.org/amano.kenji/brick-list-skip";
+      url = "";
+      synopsis = "Skip a certain kind of items when moving in brick list";
+      description = "This package contains functions that can be used in brick event handlers to skip a certain kind of items when\nmoving in brick list.\n\nFor example, you can skip a separator because selecting a separator doesn't make sense.\n\nYou can run demo programs to see how it works.\n\n== For Contributors\n\nThis library tries not to exceed 120 characters per line.";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [
+          (hsPkgs."base" or (errorHandler.buildDepError "base"))
+          (hsPkgs."brick" or (errorHandler.buildDepError "brick"))
+          (hsPkgs."microlens" or (errorHandler.buildDepError "microlens"))
+          (hsPkgs."vector" or (errorHandler.buildDepError "vector"))
+          (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+          ];
+        buildable = true;
+        };
+      exes = {
+        "brick-list-skip" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."brick" or (errorHandler.buildDepError "brick"))
+            (hsPkgs."microlens" or (errorHandler.buildDepError "microlens"))
+            (hsPkgs."vector" or (errorHandler.buildDepError "vector"))
+            (hsPkgs."brick-list-skip" or (errorHandler.buildDepError "brick-list-skip"))
+            (hsPkgs."vty" or (errorHandler.buildDepError "vty"))
+            ];
+          buildable = if !flags.demo then false else true;
+          };
+        };
+      };
+    }

hackage/brick-tabular-list-2.2.0.6-r0-eb96bad2a0ed9c16b14d30648775e3d406400d2ef45d8be5e04268b51824246f.nix

@@ -0,0 +1,65 @@
+{ system
+  , compiler
+  , flags
+  , pkgs
+  , hsPkgs
+  , pkgconfPkgs
+  , errorHandler
+  , config
+  , ... }:
+  {
+    flags = { demo = false; };
+    package = {
+      specVersion = "3.0";
+      identifier = { name = "brick-tabular-list"; version = "2.2.0.6"; };
+      license = "0BSD";
+      copyright = "";
+      maintainer = "amano.kenji@proton.me";
+      author = "amano.kenji";
+      homepage = "https://codeberg.org/amano.kenji/brick-tabular-list";
+      url = "";
+      synopsis = "Tabular list widgets for brick.";
+      description = "This package contains two tabular list widgets for brick.\n\n* Grid tabular list\n* Mixed tabular list\n\nA tabular list consists of cells(row columns), column headers, and row headers. Column headers and row headers are\noptional.\n\nIt can handle a very large data set if you delete invisible rows from memory and fetch visible rows from a database\n(file). For example, SQLite database file can handle a large spreadsheet.\n\n== To get started\n\n* Read \"Brick.Widgets.TabularList.Grid\" or \"Brick.Widgets.TabularList.Mixed\".\n* Run demo programs. To learn more quickly, modify and run demo programs.\n\n== Lens support\n\nIf you want to use lens, I encourage using @OverloadedLabels@ extension with generic-lens or optics-core.\n\nFor zoom, you have to use van Laarhoven lens because brick supports zoom through microlens.\n\n== For Contributors\n\nThis library tries not to exceed 120 characters per line.";
+      buildType = "Simple";
+      };
+    components = {
+      "library" = {
+        depends = [
+          (hsPkgs."base" or (errorHandler.buildDepError "base"))
+          (hsPkgs."brick" or (errorHandler.buildDepError "brick"))
+          (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+          (hsPkgs."generic-lens" or (errorHandler.buildDepError "generic-lens"))
+          (hsPkgs."microlens" or (errorHandler.buildDepError "microlens"))
+          (hsPkgs."optics-core" or (errorHandler.buildDepError "optics-core"))
+          (hsPkgs."vty" or (errorHandler.buildDepError "vty"))
+          ];
+        buildable = true;
+        };
+      exes = {
+        "mixed-tabular-list" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."brick" or (errorHandler.buildDepError "brick"))
+            (hsPkgs."brick-tabular-list" or (errorHandler.buildDepError "brick-tabular-list"))
+            (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+            (hsPkgs."optics-core" or (errorHandler.buildDepError "optics-core"))
+            (hsPkgs."vector" or (errorHandler.buildDepError "vector"))
+            (hsPkgs."vty" or (errorHandler.buildDepError "vty"))
+            ];
+          buildable = if !flags.demo then false else true;
+          };
+        "grid-tabular-list" = {
+          depends = [
+            (hsPkgs."base" or (errorHandler.buildDepError "base"))
+            (hsPkgs."brick" or (errorHandler.buildDepError "brick"))
+            (hsPkgs."brick-tabular-list" or (errorHandler.buildDepError "brick-tabular-list"))
+            (hsPkgs."containers" or (errorHandler.buildDepError "containers"))
+            (hsPkgs."optics-core" or (errorHandler.buildDepError "optics-core"))
+            (hsPkgs."vector" or (errorHandler.buildDepError "vector"))
+            (hsPkgs."vty" or (errorHandler.buildDepError "vty"))
+            ];
+          buildable = if !flags.demo then false else true;
+          };
+        };
+      };
+    }