additional-cabals/enumerator-0.4.20.cabal

+name: enumerator
+version: 0.4.20
+license: MIT
+license-file: license.txt
+author: John Millikin <jmillikin@gmail.com>
+maintainer: jmillikin@gmail.com
+copyright: 2010-2011 John Millikin, 2011 Mikhail Vorozhtsov
+build-type: Simple
+cabal-version: >= 1.6
+category: Data, Enumerator
+stability: experimental
+homepage: https://john-millikin.com/software/enumerator/
+bug-reports: mailto:jmillikin@gmail.com
+
+synopsis: Reliable, high-performance processing with left-fold enumerators
+description:
+  Typical buffer&#x2013;based incremental I/O is based around a single loop,
+  which reads data from some source (such as a socket or file), transforms
+  it, and generates one or more outputs (such as a line count, HTTP
+  responses, or modified file). Although efficient and safe, these loops are
+  all single&#x2013;purpose; it is difficult or impossible to compose
+  buffer&#x2013;based processing loops.
+  .
+  Haskell&#x2019;s concept of &#x201C;lazy I/O&#x201D; allows pure code to
+  operate on data from an external source. However, lazy I/O has several
+  shortcomings. Most notably, resources such as memory and file handles can
+  be retained for arbitrarily long periods of time, causing unpredictable
+  performance and error conditions.
+  .
+  Enumerators are an efficient, predictable, and safe alternative to lazy
+  I/O. Discovered by Oleg Kiselyov, they allow large datasets to be processed
+  in near&#x2013;constant space by pure code. Although somewhat more complex
+  to write, using enumerators instead of lazy I/O produces more correct
+  programs.
+  .
+  This library contains an enumerator implementation for Haskell, designed to
+  be both simple and efficient. Three core types are defined, along with
+  numerous helper functions:
+  .
+  * /Iteratee/: Data sinks, analogous to left folds. Iteratees consume
+  a sequence of /input/ values, and generate a single /output/ value.
+  Many iteratees are designed to perform side effects (such as printing to
+  @stdout@), so they can also be used as monad transformers.
+  .
+  * /Enumerator/: Data sources, which generate input sequences. Typical
+  enumerators read from a file handle, socket, random number generator, or
+  other external stream. To operate, enumerators are passed an iteratee, and
+  provide that iteratee with input until either the iteratee has completed its
+  computation, or EOF.
+  .
+  * /Enumeratee/: Data transformers, which operate as both enumerators and
+  iteratees. Enumeratees read from an /outer/ enumerator, and provide the
+  transformed data to an /inner/ iteratee.
+
+extra-source-files:
+  benchmarks/enumerator-benchmarks.cabal
+  benchmarks/Benchmarks.hs
+  --
+  examples/cat.hs
+  examples/wc.hs
+  --
+  scripts/common.bash
+  scripts/dist
+  scripts/run-benchmarks
+  scripts/run-coverage
+  scripts/run-tests
+  --
+  tests/enumerator-tests.cabal
+  tests/data/ascii-crlf.txt
+  tests/data/ascii-lf.txt
+  tests/data/utf8-crlf.txt
+  tests/data/utf8-lf.txt
+  tests/EnumeratorTests.hs
+  tests/EnumeratorTests/Binary.hs
+  tests/EnumeratorTests/Binary/Consume.hs
+  tests/EnumeratorTests/Binary/Drop.hs
+  tests/EnumeratorTests/Binary/Fold.hs
+  tests/EnumeratorTests/Binary/Handle.hs
+  tests/EnumeratorTests/Binary/Isolate.hs
+  tests/EnumeratorTests/Binary/Iterate.hs
+  tests/EnumeratorTests/Binary/Map.hs
+  tests/EnumeratorTests/Binary/Repeat.hs
+  tests/EnumeratorTests/Binary/Replicate.hs
+  tests/EnumeratorTests/Binary/Require.hs
+  tests/EnumeratorTests/Binary/Split.hs
+  tests/EnumeratorTests/Binary/Unfold.hs
+  tests/EnumeratorTests/Binary/Util.hs
+  tests/EnumeratorTests/Binary/Zip.hs
+  tests/EnumeratorTests/CatchError.hs
+  tests/EnumeratorTests/Compatibility.hs
+  tests/EnumeratorTests/Instances.hs
+  tests/EnumeratorTests/Join.hs
+  tests/EnumeratorTests/List.hs
+  tests/EnumeratorTests/List/Consume.hs
+  tests/EnumeratorTests/List/Drop.hs
+  tests/EnumeratorTests/List/Fold.hs
+  tests/EnumeratorTests/List/Isolate.hs
+  tests/EnumeratorTests/List/Iterate.hs
+  tests/EnumeratorTests/List/Map.hs
+  tests/EnumeratorTests/List/Repeat.hs
+  tests/EnumeratorTests/List/Replicate.hs
+  tests/EnumeratorTests/List/Require.hs
+  tests/EnumeratorTests/List/Split.hs
+  tests/EnumeratorTests/List/Unfold.hs
+  tests/EnumeratorTests/List/Unique.hs
+  tests/EnumeratorTests/List/Util.hs
+  tests/EnumeratorTests/List/Zip.hs
+  tests/EnumeratorTests/Misc.hs
+  tests/EnumeratorTests/Sequence.hs
+  tests/EnumeratorTests/Stream.hs
+  tests/EnumeratorTests/Text.hs
+  tests/EnumeratorTests/Text/Codecs.hs
+  tests/EnumeratorTests/Text/Consume.hs
+  tests/EnumeratorTests/Text/Drop.hs
+  tests/EnumeratorTests/Text/Fold.hs
+  tests/EnumeratorTests/Text/Handle.hs
+  tests/EnumeratorTests/Text/Isolate.hs
+  tests/EnumeratorTests/Text/Iterate.hs
+  tests/EnumeratorTests/Text/Map.hs
+  tests/EnumeratorTests/Text/Repeat.hs
+  tests/EnumeratorTests/Text/Replicate.hs
+  tests/EnumeratorTests/Text/Require.hs
+  tests/EnumeratorTests/Text/Split.hs
+  tests/EnumeratorTests/Text/Unfold.hs
+  tests/EnumeratorTests/Text/Util.hs
+  tests/EnumeratorTests/Text/Zip.hs
+  tests/EnumeratorTests/Trans.hs
+  tests/EnumeratorTests/Util.hs
+
+source-repository head
+  type: git
+  location: https://john-millikin.com/code/haskell-enumerator/
+
+source-repository this
+  type: git
+  location: https://john-millikin.com/code/haskell-enumerator/
+  tag: haskell-enumerator_0.4.20
+
+library
+  ghc-options: -Wall -O2
+  hs-source-dirs: lib
+
+  build-depends:
+      base >= 4.0 && < 5.0
+    , transformers >= 0.2
+    , bytestring >= 0.9
+    , containers >= 0.1
+    , text >= 0.7
+
+  if impl(ghc >= 7.7)
+    cpp-options: -DGHC78_DATA_TYPEABLE=1
+
+  exposed-modules:
+    Data.Enumerator
+    Data.Enumerator.Binary
+    Data.Enumerator.Internal
+    Data.Enumerator.IO
+    Data.Enumerator.List
+    Data.Enumerator.Text
+    Data.Enumerator.Trans
+
+  other-modules:
+    Data.Enumerator.Compatibility
+    Data.Enumerator.Util

additional-cabals/fgl-5.6.0.0.cabal

+name:          fgl
+version:       5.6.0.0
+license:       BSD3
+license-file:  LICENSE
+author:        Martin Erwig, Ivan Lazar Miljenovic
+maintainer:    Ivan.Miljenovic@gmail.com
+category:      Data Structures, Graphs
+synopsis:      Martin Erwig's Functional Graph Library
+
+description:   {
+An inductive representation of manipulating graph data structures.
+.
+Original website can be found at <http://web.engr.oregonstate.edu/~erwig/fgl/haskell>.
+}
+cabal-version: >= 1.10
+build-type:    Simple
+extra-source-files:
+               ChangeLog
+
+tested-with:   GHC == 7.0.4, GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3,
+               GHC == 7.8.4, GHC == 7.10.2, GHC == 8.0.1, GHC == 8.1.*
+
+source-repository head
+    type:         git
+    location:     https://github.com/haskell/fgl.git
+
+flag containers042 {
+    manual:  False
+    default: True
+}
+
+library {
+    default-language: Haskell98
+
+    exposed-modules:
+        Data.Graph.Inductive.Internal.Heap,
+        Data.Graph.Inductive.Internal.Queue,
+        Data.Graph.Inductive.Internal.RootPath,
+        Data.Graph.Inductive.Internal.Thread,
+        Data.Graph.Inductive.Basic,
+        Data.Graph.Inductive.Example,
+        Data.Graph.Inductive.Graph,
+        Data.Graph.Inductive.Monad,
+        Data.Graph.Inductive.NodeMap,
+        Data.Graph.Inductive.PatriciaTree,
+        Data.Graph.Inductive.Query,
+        Data.Graph.Inductive.Tree,
+        Data.Graph.Inductive.Monad.IOArray,
+        Data.Graph.Inductive.Monad.STArray,
+        Data.Graph.Inductive.Query.ArtPoint,
+        Data.Graph.Inductive.Query.BCC,
+        Data.Graph.Inductive.Query.BFS,
+        Data.Graph.Inductive.Query.DFS,
+        Data.Graph.Inductive.Query.Dominators,
+        Data.Graph.Inductive.Query.GVD,
+        Data.Graph.Inductive.Query.Indep,
+        Data.Graph.Inductive.Query.MST,
+        Data.Graph.Inductive.Query.MaxFlow,
+        Data.Graph.Inductive.Query.MaxFlow2,
+        Data.Graph.Inductive.Query.Monad,
+        Data.Graph.Inductive.Query.SP,
+        Data.Graph.Inductive.Query.TransClos,
+        Data.Graph.Inductive
+
+    other-modules:
+        Paths_fgl
+
+    build-depends:    base < 5
+                    , transformers
+                    , array
+
+    if flag(containers042)
+        build-depends:    containers >= 0.4.2
+                        , deepseq >= 1.1.0.0 && < 1.5
+    else
+        build-depends:    containers < 0.4.2
+
+    if impl(ghc >= 7.2) && impl(ghc < 7.6)
+        build-depends:
+            ghc-prim
+
+    ghc-options:      -Wall
+
+}
+
+test-suite fgl-tests {
+    default-language: Haskell98
+
+    type:             exitcode-stdio-1.0
+
+    build-depends:    fgl
+                    , base
+                    , QuickCheck >= 2.8 && < 2.10
+                    , hspec >= 2.1 && < 2.5
+                    , containers
+
+    hs-source-dirs:   test
+                      fgl-arbitrary
+
+    main-is:          TestSuite.hs
+
+    other-modules:    Data.Graph.Inductive.Arbitrary
+                    , Data.Graph.Inductive.Graph.Properties
+                    , Data.Graph.Inductive.Proxy
+                    , Data.Graph.Inductive.Query.Properties
+
+    ghc-options:      -Wall
+
+}
+
+benchmark fgl-benchmark {
+    if flag(containers042)
+        buildable:    True
+    else
+        buildable:    False
+
+    default-language: Haskell98
+
+    type:             exitcode-stdio-1.0
+
+    hs-source-dirs:   test
+
+    main-is:          benchmark.hs
+
+    other-modules:    Data.Graph.Inductive.Proxy
+
+    build-depends:    fgl
+                    , base
+                    , microbench
+                    , deepseq
+
+    ghc-options:      -Wall
+
+}

packages.txt

@@ -358,7 +358,7 @@ hashable-extras 0.2.3 avoid
 hashable-time 0.2.0.2
 hashmap 1.3.3
 hashtables 1.2.3.1
-haskeline 0.7.4.3
+haskeline 0.7.4.2 behind ghcpkg
 haskell-gi 0.21.4
 haskell-gi-base 0.21.1
 haskell-gi-overloading 1.0
@@ -585,7 +585,7 @@ monoid-subclasses 0.4.6
 mono-traversable 1.0.9.0
 mono-traversable-instances 0.1.0.0
 mountpoints 1.0.2
-mtl 2.2.2
+mtl 2.2.2 ghcpkg
 mtl-compat 0.2.1.3 avoid
 mtlparse 0.1.4.0
 mueval 0.9.3 key
@@ -647,7 +647,8 @@ panic 0.4.0.1
 parallel 3.2.2.0
 parallel-tree-search 0.4.1
 parseargs 0.2.0.8
-parsec 3.1.13.0 notest
+parsec 3.1.13.0 ghcpkg notest
+parsec-numbers 0.1.0
 parser-combinators 1.0.0
 parsers 0.12.9
 patat 0.8.0.0 binary
@@ -829,7 +830,7 @@ StateVar 1.1.1.1
 static-hash 0.0.1
 statistics 0.14.0.2
 status-notifier-item 0.3.0.0
-stm 2.4.5.1
+stm 2.4.5.1 ghcpkg
 stm-chans 3.0.0.4
 STMonadTrans 0.4.3
 storable-complex 0.2.2
@@ -881,7 +882,7 @@ test-framework-quickcheck2 0.3.0.5
 test-framework-th 0.2.4
 test-framework-th-prime 0.0.10
 texmath 0.11.1
-text 1.2.3.0 notest
+text 1.2.3.0 ghcpkg notest
 text-binary 0.2.1.1
 text-format 0.3.2
 text-icu 0.7.0.1