Cabal revisions of heap-1.0.0

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

-Name:                heap-Version:             1.0.0--Category:            Data Structures-Synopsis:            Heaps in Haskell-Description:         A flexible Haskell implementation of minimum, maximum,-                     minimum-priority, maximum-priority and custom-ordered-                     heaps.--License:             BSD3-License-File:        LICENSE-Copyright:           (c) 2008-2009, Stephan Friedrichs-Author:              Stephan Friedrichs-Maintainer:          Stephan Friedrichs (deduktionstheorem at web dot de)--Build-Type:          Simple-Cabal-Version:       >= 1.2.3-Tested-With:         GHC == 6.10.2, GHC == 6.10.3--Flag Test-  Description:       Build a binary running test cases-  Default:           False--Library-  Build-Depends:     base >= 3 && < 5-  Exposed-Modules:-      Data.Heap-  Other-Modules:-      Data.Heap.Internal-    , Data.Heap.Item-  GHC-Options:       -Wall -fwarn-tabs-  Extensions:-      DeriveDataTypeable-    , EmptyDataDecls-    , FlexibleContexts-    , FlexibleInstances-    , MultiParamTypeClasses-    , TypeFamilies--Executable heap-tests-  if !flag( Test )-    Buildable:       False-  Main-Is:-      Test.hs-  Other-Modules:-      Data.Heap-    , Data.Heap.Internal-    , Data.Heap.Item-    , Test.Heap-    , Test.Heap.Common-    , Test.Heap.Internal-    , Test.Heap.Item-  Build-Depends:     QuickCheck >= 2 && < 3-  CPP-Options:       -D__TEST__-  GHC-Options:       -Wall -fwarn-tabs -fno-ignore-asserts+Name:                heap
+Version:             1.0.0
+x-revision: 1
+
+Category:            Data Structures
+Synopsis:            Heaps in Haskell
+Description:         A flexible Haskell implementation of minimum, maximum,
+                     minimum-priority, maximum-priority and custom-ordered
+                     heaps.
+
+License:             BSD3
+License-File:        LICENSE
+Copyright:           (c) 2008-2009, Stephan Friedrichs
+Author:              Stephan Friedrichs
+Maintainer:          Stephan Friedrichs (deduktionstheorem at web dot de)
+
+Build-Type:          Simple
+Cabal-Version:       >= 1.2.3
+Tested-With:         GHC == 6.10.2, GHC == 6.10.3
+
+Flag Test
+  Description:       Build a binary running test cases
+  Default:           False
+
+Library
+  Build-Depends:     base >= 3 && < 4.8
+  Exposed-Modules:
+      Data.Heap
+  Other-Modules:
+      Data.Heap.Internal
+    , Data.Heap.Item
+  GHC-Options:       -Wall -fwarn-tabs
+  Extensions:
+      DeriveDataTypeable
+    , EmptyDataDecls
+    , FlexibleContexts
+    , FlexibleInstances
+    , MultiParamTypeClasses
+    , TypeFamilies
+
+Executable heap-tests
+  if !flag( Test )
+    Buildable:       False
+  Main-Is:
+      Test.hs
+  Other-Modules:
+      Data.Heap
+    , Data.Heap.Internal
+    , Data.Heap.Item
+    , Test.Heap
+    , Test.Heap.Common
+    , Test.Heap.Internal
+    , Test.Heap.Item
+  Build-Depends:     QuickCheck >= 2 && < 3
+  CPP-Options:       -D__TEST__
+  GHC-Options:       -Wall -fwarn-tabs -fno-ignore-asserts