Category116 packages

Data

• MemoTrie0.6.11Trie-based memo functionshackage
• OneTuple0.4.3Singleton Tuplehackage
• Only0.1The 1-tuple type or single-value "collection"hackage
• StateVar1.2.2State variableshackage
• Stream0.4.7.2A library for manipulating infinite lists.hackage
• Unique0.4.8.0It provides the functionality like unix "uniq" utilityhackage
• aeson-casing0.2.0.0Tools to change the formatting of field names in Aeson instances.hackage
• assoc1.1.1swap and assoc: Symmetric and Semigroupy Bifunctorshackage
• atomic-primops0.8.8A safe approach to CAS and other atomic ops in Haskell.hackage
• base161.0Fast RFC 4648-compliant Base16 encodinghackage
• base16-bytestring1.0.2.0RFC 4648-compliant Base16 encodings for ByteStringshackage
• base58-bytestring0.1.0Implementation of BASE58 transcoding for ByteStringshackage
• base641.0A modern Base64 libraryhackage
• base64-bytestring1.2.1.0Fast base64 encoding and decoding for ByteStringshackage
• base64-bytestring-type1.0.1A newtype around ByteString, for base64 encodinghackage
• bifunctors5.6.3Bifunctorshackage
• bimap0.5.0Bidirectional mapping between two key typeshackage
• bin0.1.4.1Bin: binary natural numbers.hackage
• binary0.8.9.3Binary serialisation for Haskell values using lazy ByteStringsboot
• binary-orphans1.0.6Compatibility package for binary; provides instanceshackage
• bitvec1.1.6.0Space-efficient bit vectorshackage
• blaze-builder0.4.4.1Efficient buffered output.hackage
• bloomfilter-blocked0.1.0.2Fast, compact Bloom filtershackage
• boring0.2.2.1Boring and Absurd typeshackage
• bytestring0.12.2.0Fast, compact, strict and lazy byte strings with a list interfaceboot
• bytestring-trie0.2.7.7An efficient finite map from bytestrings to values.hackage
• call-stack0.4.0Use GHC call-stacks in a backward compatible wayhackage
• case-insensitive1.2.1.0Case insensitive string comparisonhackage
• cereal0.5.8.3A binary serialization libraryhackage
• character-ps0.1Pattern synonyms for ASCII characters for Word8, Word16 etchackage
• charset0.3.12Fast unicode character sets based on complemented PATRICIA trieshackage
• colour2.3.7A model for human colour/color perceptionhackage
• compact0.2.0.0Non-GC'd, contiguous storage for immutable data structureshackage
• conduit1.3.6.1Streaming data processing library.hackage
• conduit-extra1.3.8Batteries included conduit: adapters for common libraries.hackage
• crypton-asn1-encoding0.10.0ASN.1 data (raw, BER or DER) readers and writershackage
• crypton-asn1-parse0.10.0A monadic parser combinator for a ASN.1 stream.hackage
• crypton-asn1-types0.4.1ASN.1 typeshackage
• crypton-pem0.3.0Privacy Enhanced Mail (PEM) file format reader and writer.hackage
• crypton-x5091.8.0X509 reader and writerhackage
• crypton-x509-store1.8.0X.509 collection accessing and storing methodshackage
• crypton-x509-system1.8.0Handle per-operating-system X.509 accessors and storagehackage
• crypton-x509-validation1.8.0X.509 Certificate and CRL validationhackage
• data-default0.8.0.2A class for types with a default valuehackage
• data-default-class0.2.0.0A class for types with a default value (compatibility shim)hackage
• data-elevator0.3Coerce between unlifted boxed and lifted types.hackage
• data-fix0.3.4Fixpoint data typeshackage
• dec0.0.6Decidable propositions.hackage
• dependent-map0.4.0.1Dependent finite maps (partial dependent products)hackage
• dependent-sum0.7.2.0Dependent sum typehackage
• deque0.4.4.4Double-ended queueshackage
• dlist1.0Difference listshackage
• dot0.3Datatypes and encoding for graphviz dot fileshackage
• entropy0.4.1.11A platform independent entropy sourcehackage
• file-embed0.0.16.0Use Template Haskell to embed file contents directly.hackage
• fin0.3.2Nat and Fin: peano naturals and finite numbershackage
• ghc-compact0.1.0.0In memory storage of deeply evaluated data structureboot
• hashable1.5.1.0A class for types that can be converted to a hash valuehackage
• indexed-profunctors0.1.1.1Utilities for indexed profunctorshackage
• indexed-traversable0.1.5FunctorWithIndex, FoldableWithIndex, TraversableWithIndexhackage
• indexed-traversable-instances0.1.2.1More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndexhackage
• infinite-list0.1.3Infinite listshackage
• integer-conversion0.1.1Conversion from strings to Integerhackage
• lens5.3.6Lenses, Folds and Traversalshackage
• microlens0.4.14.0A tiny lens library with no dependencieshackage
• microlens-ghc0.4.15.1microlens + array, bytestring, containers, transformershackage
• microlens-mtl0.2.1.0microlens support for Reader/Writer/State from mtlhackage
• microlens-th0.4.3.17Automatic generation of record lenses for microlenshackage
• mono-traversable1.0.21.0Type classes for mapping, folding, and traversing monomorphic containershackage
• monoidal-containers0.6.8.0Containers with monoidal accumulationhackage
• mutable-containers0.3.4.1Abstactions and concrete implementations of mutable containershackage
• nonempty-vector0.2.4Non-empty vectorshackage
• optics-core0.4.2Optics as an abstract interface: core definitionshackage
• ordered-containers0.2.4Set- and Map-like types that remember the order elements were insertedhackage
• partial-order0.2.0.0Provides typeclass suitable for types admitting a partial orderhackage
• pointed5.0.5Pointed and copointed datahackage
• primitive0.9.1.0Primitive memory-related operationshackage
• pvar1.0.0.0Mutable variable with primitive valueshackage
• ral0.2.2Random access listshackage
• reducers3.12.5Semigroups, specialized containers and a general map/reduce frameworkhackage
• reflection2.1.9Reifies arbitrary terms into types that can be reflected back into termshackage
• relapse1.0.0.1Sensible RLP encodinghackage
• resourcet1.3.0Deterministic allocation and freeing of scarce resources.hackage
• scientific0.3.9.0Numbers represented using scientific notationhackage
• semialign1.4Align and Zip type-classes from the common Semialign ancestor.hackage
• serdoc-core0.3.2.0Generated documentation of serialization formatshackage
• size-based0.1.3.3Sized functors, for size-based enumerationshackage
• some1.0.6Existential type: Somehackage
• sop-core0.5.0.2True Sums of Productshackage
• sop-extras0.4.1.1Type-level and data utilities that build upon SOP.hackage
• streaming0.2.4.0an elementary streaming prelude and general stream type.hackage
• streaming-bytestring0.3.4Fast, effectful byte streams.hackage
• streaming-commons0.2.3.1Common lower-level functions needed by various streaming data librarieshackage
• strict0.5.1Strict data types and String IO.hackage
• strict-list1.0.0.1Strict linked list with stack-safe operationshackage
• strict-sop-core0.1.4.0Strict replacement for NS and NP.hackage
• string-interpolate0.3.4.0Haskell string/text/bytestring interpolation that just workshackage
• tagged0.8.11Haskell 98 phantom types to avoid unsafely passing dummy argumentshackage
• text2.1.3An efficient packed Unicode text type.boot
• text-conversions0.3.1.1Safe conversions between textual typeshackage
• text-short0.1.6.1Memory-efficient representation of Unicode text stringshackage
• these1.2.1An either-or-both data type.hackage
• tree-diff0.4.1Diffing of (expression) trees.hackage
• universe-base1.1.4A class for finite and recursively enumerable types.hackage
• unix-time0.4.17Unix time parser/formatter and utilitieshackage
• unordered-containers0.2.21Efficient hashing-based container typeshackage
• uuid-types1.0.6.1Type definitions for Universally Unique Identifiershackage
• validation1.3.2A data-type like Either but with an accumulating Applicativehackage
• vector0.13.2.0Efficient Arrayshackage
• vector-algorithms0.9.1.0Efficient algorithms for vector arrayshackage
• vector-binary-instances0.2.5.2Instances of Data.Binary for vectorhackage
• vector-stream0.1.0.1Efficient Streamshackage
• vector-th-unbox0.2.2Deriver for Data.Vector.Unboxed using Template Haskellhackage
• wide-word0.1.9.0Data types for large but fixed width signed and unsigned integershackage
• witherable0.5filterable traversablehackage
• yaml0.11.11.2Support for parsing and rendering YAML documents.hackage