Category19 packages

Data Structures

• PSQueue1.2.2Priority Search Queuehackage
• adjunctions4.4.4Adjunctions and representable functorshackage
• array0.5.8.0Mutable and immutable arraysboot
• barbies2.1.1.0Classes for working with types that can change clothes.hackage
• containers0.8Assorted concrete container typesboot
• data-clist0.2Simple functional ring type.hackage
• distributive0.6.3Distributive functors -- Dual to Traversablehackage
• enummapset0.7.3.0IntMap and IntSet with Enum keys/elements.hackage
• fgl5.8.3.1Martin Erwig's Functional Graph Libraryhackage
• fingertree0.1.6.3Generic finger-tree structure, with example instanceshackage
• heaps0.4.1Asymptotically optimal Brodal/Okasaki heaps.hackage
• hw-fingertree0.1.2.1Generic finger-tree structure, with example instanceshackage
• kan-extensions5.2.8Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monadshackage
• keys3.12.5Keyed functors and containershackage
• multiset0.3.4.3The Data.MultiSet container typehackage
• nonempty-containers0.3.6.0Non-empty variants of containers data types, with full APIhackage
• pqueue1.7.0.0Reliable, persistent, fast priority queues.hackage
• psqueues0.2.8.3Pure priority search queueshackage
• void0.7.4A Haskell 98 logically uninhabited data typehackage