Cabal revisions of EdisonAPI-1.2.2

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

-Build-type:     Simple-Name:           EdisonAPI-Version:        1.2.2-License:        OtherLicense-License-File:   COPYRIGHT-Author:         Chris Okasaki-Maintainer:     robdockins AT fastmail DOT fm-Synopsis:       A library of efficent, purely-functional data structures (API)-Category:       Data Structures-Homepage:	http://www.cs.princeton.edu/~rdockins/edison/home/-Stability:      Stable-Description:-   Edison is a library of purely functional data structures written by-   Chris Okasaki.  It is named after Thomas Alva Edison and for the-   mnemonic value EDiSon (Efficent Data Structures).-   Edison provides several families of abstractions, each with-   multiple implementations.  The main abstractions provided by Edison are:-   Sequences such as stacks, queues, and dequeues;-   Collections such as sets, bags and heaps; and-   Associative Collections such as finite maps and priority queues-    where the priority and element are distinct.--Hs-Source-Dirs: src-Exposed-modules:-     Data.Edison-     Data.Edison.Prelude-     Data.Edison.Sym-     Data.Edison.Assoc-     Data.Edison.Coll-     Data.Edison.Coll.Utils-     Data.Edison.Seq-     Data.Edison.Seq.ListSeq-Build-Depends:-     base >= 2.0 && < 5,-     mtl >= 1.0-Extensions:-     MultiParamTypeClasses-     FunctionalDependencies-     UndecidableInstances-Ghc-Options: -funbox-strict-fields -fwarn-incomplete-patterns+cabal-version:  >=1.0
+Build-type:     Simple
+Name:           EdisonAPI
+Version:        1.2.2
+x-revision: 1
+License:        OtherLicense
+License-File:   COPYRIGHT
+Author:         Chris Okasaki
+Maintainer:     robdockins AT fastmail DOT fm
+Synopsis:       A library of efficent, purely-functional data structures (API)
+Category:       Data Structures
+Homepage:	http://www.cs.princeton.edu/~rdockins/edison/home/
+Stability:      Stable
+Description:
+   Edison is a library of purely functional data structures written by
+   Chris Okasaki.  It is named after Thomas Alva Edison and for the
+   mnemonic value EDiSon (Efficent Data Structures).
+   Edison provides several families of abstractions, each with
+   multiple implementations.  The main abstractions provided by Edison are:
+   Sequences such as stacks, queues, and dequeues;
+   Collections such as sets, bags and heaps; and
+   Associative Collections such as finite maps and priority queues
+    where the priority and element are distinct.
+
+Hs-Source-Dirs: src
+Exposed-modules:
+     Data.Edison
+     Data.Edison.Prelude
+     Data.Edison.Sym
+     Data.Edison.Assoc
+     Data.Edison.Coll
+     Data.Edison.Coll.Utils
+     Data.Edison.Seq
+     Data.Edison.Seq.ListSeq
+Build-Depends:
+     base >= 2.0 && < 4.13,
+     mtl >= 1.0
+Extensions:
+     MultiParamTypeClasses
+     FunctionalDependencies
+     UndecidableInstances
+Ghc-Options: -funbox-strict-fields -fwarn-incomplete-patterns