@pipes-parse@ builds upon the @pipes@ library to provide shared parsing idioms and utilities: . * /Leftovers/: Save unused input for later consumption . * /Leftover propagation/: Leftovers are propagated backwards perfectly . * /Connect and Resume/: Use @StateT@ to save unused input for later . * /Termination Safety/: Detect and recover from end of input . @Pipes.Parse@ contains the full documentation for this library. . Read @Pipes.Parse.Tutorial@ for an extensive tutorial.

Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.

Bindings for Libsoup 3.x, autogenerated by haskell-gi.

Bindings for Gsk, autogenerated by haskell-gi.

Bindings for Gdk, autogenerated by haskell-gi.

QuickCheck support for the Tasty test framework. .

Bindings for libdbusgtk3, autogenerated by haskell-gi.

QuickCheck is a library for random testing of program properties. The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases. Specifications are expressed in Haskell, using combinators provided by QuickCheck. QuickCheck provides combinators to define properties, observe the distribution of test data, and define test data generators. . Most of QuickCheck's functionality is exported by the main "Test.QuickCheck" module. The main exception is the monadic property testing library in "Test.QuickCheck.Monadic". . If you are new to QuickCheck, you can try looking at the following resources: . * The <http://www.cse.chalmers.se/~rjmh/QuickCheck/manual.html official QuickCheck manual>. It's a bit out-of-date in some details and doesn't cover newer QuickCheck features, but is still full of good advice. * <https://begriffs.com/posts/2017-01-14-design-use-quickcheck.html>, a detailed tutorial written by a user of QuickCheck. . The <https://hackage.haskell.org/package/quickcheck-instances quickcheck-instances> companion package provides instances for types in Haskell Platform packages at the cost of additional dependencies.

For upgrading to streamly-0.9.0+ please read the <https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md Streamly-0.9.0 upgrade guide>. . Streamly is a standard library for Haskell that focuses on C-like performance, modular combinators, and streaming data flow model. Streamly consists of two packages: "streamly-core" and "streamly". <https://hackage.haskell.org/package/streamly-core streamly-core> provides basic features, and depends only on GHC boot libraries (see note below), while <https://hackage.haskell.org/package/streamly streamly> provides higher-level features like concurrency, time, lifted exceptions, and networking. For documentation, visit the <https://streamly.composewell.com Streamly website>. . The streamly-core package provides the following functionality: . * Streams as composable producers of a sequence of values. * Streams provide all the functionality provided by Haskell lists but in an effectful, streaming fashion with better performance. * Streams provide ListT and logic programming functionality as well. * Folds as composable stream consumers that reduce the streams to a single value or reduce segments of streams to transform the stream. * Parsers as more powerful, composable stream consumers supporting standard parser combinators with backtracking but in a streaming fashion. * Arrays with streaming interfaces providing high performance, modularity, and concise interface as all streaming operations can be performed on arrays. * Arrays can be immutable or mutable, unboxed or boxed, pinned or unpinned. * Arrays generalize the functionality provided by @bytestring@ and @text@ packages. * Interoperability with @bytestring@ and @text@ is provided via separate packages. * Arrays and folds provide natural builder functionality so there are no separate builder modules. * High performance binary serialization with configurable JSON like features. * Streaming combinators for unicode text processing, providing functionality equivalent to the @text@ package. * String interpolation for convenient construction of strings. * Streaming console IO (stdin/stdout) operations. * Streaming file and directory IO operations. . This package covers some or all of the functionality covered by @streaming, pipes, conduit, list-t, logic-t, foldl, attoparsec, array, primitive, vector, vector-algorithms, binary, cereal, store, bytestring, text, stringsearch, interpolate@. Streamly provides a consistent, concise, modular and performant interface for all this functionality. . Note: The dependencies "heaps" and "monad-control" are included in the package solely for backward compatibility, and will be removed in future versions.

Bindings for Gtk, autogenerated by haskell-gi.

This package provides array, slice and text operations.

For upgrading to streamly-0.9.0+ please read the <https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md Streamly-0.9.0 upgrade guide>. . Streamly is a standard library for Haskell that focuses on C-like performance, modular combinators, and streaming data flow model. Streamly consists of two packages, the <https://hackage.haskell.org/package/streamly-core streamly-core> package provides functionality that depends only on boot libraries, and the <https://hackage.haskell.org/package/streamly streamly> package provides additional functionality like concurrency, time, lifted exceptions, and networking. For unified documentation visit <https://streamly.composewell.com the streamly website>. . Streamly provides unified, modular building blocks to build high-performance, concurrent, scalable applications in Haskell . Stream fusion optimizations in streamly enable exceptional modularity with high performance comparable to C. Streamly complements the Haskell <https://hackage.haskell.org/package/base base> package, supplying additional functionality to quickly build general-purpose applications in Haskell. For high-level functionality built over streamly like streaming OS processes, shell programming, GNU coreutils, statistics, and compression libraries please see the <https://streamly.composewell.com/ecosystem.html streamly ecosystem packages>. . Performance with modularity: . * Performance on par with C (<https://github.com/composewell/streaming-benchmarks Benchmarks>) * API close to standard Haskell lists (<https://github.com/composewell/streamly-examples Examples>) * Declarative concurrency with automatic scaling * Filesystem, fsnotify, network, and Unicode support included * Fast binary serialization (with optional JSON like features) * More functionality is provided via many (<https://streamly.composewell.com/ecosystem.html ecosystem packages>) . Unified and powerful abstractions: . * Unifies streams, arrays, folds, and parsers * Unifies @Data.List@, @list-t@, and @logict@ with streaming * Unifies concurrency with standard streaming abstractions * Unifies reactive, time-domain programming with streaming * Unifies binary serialization and unboxed arrays * Interworks with other streaming libraries.

Bindings for GtkSource, autogenerated by haskell-gi.

Bindings for GObject, autogenerated by haskell-gi.

Haskell bindings for libarchive. Provides the ability to unpack archives, including the ability to unpack archives lazily.

SmallCheck support for the Hspec testing framework.

This package lacks a description. Run "info '(guix) Synopses and Descriptions'" for more information.

In many cases, it is useful, necessary, or simply nice to limit how frequently you perform some action. For example, you may want to limit how often your program makes a request of some web site. This library is intended as a general-purpose mechanism for rate-limiting IO actions.

Bindings for Atk, autogenerated by haskell-gi.

Foundation for libraries generated by haskell-gi

This package provides first class functional references in Van Laarhoven style supporting the following optics: . * Lenses (view, over) . * Traversals (toListOf, matching, over) . * Setters (over) . * Grates (zipWithOf, under, review) . * Resetters (under) . * Adapters (view, review) . * Grids (toListOf, over / under, review) . * Prisms (matching, over / under, review) . * Getters (view) . * Folders (toListOf) . * Reviewers (review).

Bindings for HarfBuzz, autogenerated by haskell-gi.

Control overloading support in haskell-gi generated bindings

This is a package somewhat like cdeps which scans .chs files for dependencies.