Cabal revisions of dom-lt-0.2.3

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

-name:               dom-lt-version:            0.2.3-cabal-version:      >= 1.10-build-type:         Simple-license:            BSD3-license-file:       LICENSE-category:           Algorithms, Graphs-author:             Matt Morrow-copyright:          (c) Matt Morrow, 2009-maintainer:         Andreas Klebinger <klebinger.andreas@gmx.at>-bug-reports:        https://github.com/AndreasPK/dom-lt/issues-stability:          stable-synopsis:           The Lengauer-Tarjan graph dominators algorithm.-description:-    The Lengauer-Tarjan graph dominators algorithm.--    Included are ways to compute domination and post-domination relationships.--tested-with:-  -- Every two major versions between 7 and 9 should be enough-  GHC == 9.0.1 || == 8.10.3 || == 8.8.4 || == 8.4.4 || == 8.0.2 || == 7.8.4 || == 7.4.2--Extra-Source-Files:-  Changelog.md--source-repository head-  type: git-  location: https://github.com/AndreasPK/dom-lt--library-  Default-Language: Haskell2010-  includes:-  build-tools:-  extra-libraries:-  hs-source-dirs:   .-  ghc-options:      -O2 -funbox-strict-fields-  default-extensions: RankNTypes-  build-depends:-      base >= 4.3 && < 5-    , array-    , containers >= 0.4.2.0 && < 0.7-  exposed-modules:-    Data.Graph.Dom,-    Data.Graph.Dom.Internal--test-suite dom-lt-tests-  Default-Language: Haskell2010-  type: exitcode-stdio-1.0--  Main-Is:  Main.hs-  hs-source-dirs: tests--  build-depends:-      base                        >=4.3   && <5-    , dom-lt-    , containers-    , HUnit                       >=1.3   && <1.7--  default-extensions:-  Ghc-Options: -Wall--benchmark dom-lt-bench-  Default-Language: Haskell2010-  type: exitcode-stdio-1.0--  Main-Is:  Main.hs-  hs-source-dirs: benchmarks--  Build-Depends: base, dom-lt, containers, criterion, deepseq-  default-extensions:--  Ghc-Options: -O2 -fno-full-laziness-+name:               dom-lt
+version:            0.2.3
+x-revision: 1
+cabal-version:      >= 1.10
+build-type:         Simple
+license:            BSD3
+license-file:       LICENSE
+category:           Algorithms, Graphs
+author:             Matt Morrow
+copyright:          (c) Matt Morrow, 2009
+maintainer:         Andreas Klebinger <klebinger.andreas@gmx.at>
+bug-reports:        https://github.com/AndreasPK/dom-lt/issues
+stability:          stable
+synopsis:           The Lengauer-Tarjan graph dominators algorithm.
+description:
+    The Lengauer-Tarjan graph dominators algorithm.
+
+    Included are ways to compute domination and post-domination relationships.
+
+tested-with:
+  -- Every two major versions between 7 and 9 should be enough
+  GHC == 9.0.1 || == 8.10.3 || == 8.8.4 || == 8.4.4 || == 8.0.2 || == 7.8.4 || == 7.4.2
+
+Extra-Source-Files:
+  Changelog.md
+
+source-repository head
+  type: git
+  location: https://github.com/AndreasPK/dom-lt
+
+library
+  Default-Language: Haskell2010
+  includes:
+  build-tools:
+  extra-libraries:
+  hs-source-dirs:   .
+  ghc-options:      -O2 -funbox-strict-fields
+  default-extensions: RankNTypes
+  build-depends:
+      base >= 4.3 && < 5
+    , array
+    , containers >= 0.4.2.0 && < 0.8
+  exposed-modules:
+    Data.Graph.Dom,
+    Data.Graph.Dom.Internal
+
+test-suite dom-lt-tests
+  Default-Language: Haskell2010
+  type: exitcode-stdio-1.0
+
+  Main-Is:  Main.hs
+  hs-source-dirs: tests
+
+  build-depends:
+      base                        >=4.3   && <5
+    , dom-lt
+    , containers
+    , HUnit                       >=1.3   && <1.7
+
+  default-extensions:
+  Ghc-Options: -Wall
+
+benchmark dom-lt-bench
+  Default-Language: Haskell2010
+  type: exitcode-stdio-1.0
+
+  Main-Is:  Main.hs
+  hs-source-dirs: benchmarks
+
+  Build-Depends: base, dom-lt, containers, criterion, deepseq
+  default-extensions:
+
+  Ghc-Options: -O2 -fno-full-laziness
+