Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. defaultWriteIniSettings :: WriteIniSettings

    ini Data.Ini

    The default settings for writing INI files.

  2. module Data.Interned.IntSet

    An efficient implementation of integer sets. Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g. 

    import Data.IntSet (IntSet)
import qualified Data.IntSet as IntSet
    The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced set implementation (see Data.Set).
    • Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseer.ist.psu.edu/okasaki98fast.html
    • D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534.
    Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64). Unlike the reference implementation in Data.IntSet, Data.Interned.IntSet uses hash consing to ensure that there is only ever one copy of any given IntSet in memory. This is enabled by the normal form of the PATRICIA trie. This can mean a drastic reduction in the memory footprint of a program in exchange for much more costly set manipulation.

  3. data IntSet

    intern Data.Interned.IntSet

    A set of integers.

  4. isProperSubsetOf :: IntSet -> IntSet -> Bool

    intern Data.Interned.IntSet

    O(n+m). Is this a proper subset? (ie. a subset but not equal).

  5. isSubsetOf :: IntSet -> IntSet -> Bool

    intern Data.Interned.IntSet

    O(n+m). Is this a subset? (s1 isSubsetOf s2) tells whether s1 is a subset of s2.

  6. clientStoreClientIdSet :: ClientStore ci si a -> Set ci

    mergeful Data.Mergeful.Collection

    The set of client ids. These are only the client ids of the added items that have not been synced yet.

  7. clientStoreSyncIdSet :: Ord si => ClientStore ci si a -> Set si

    mergeful Data.Mergeful.Collection

    The set of server ids. This includes the ids of items that have been marked as deleted.

  8. clientStoreUndeletedSyncIdSet :: Ord si => ClientStore ci si a -> Set si

    mergeful Data.Mergeful.Collection

    The set of server ids. This does not include the ids of items that have been marked as deleted.

  9. reverseTakeFromEndG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Takes the specified quantity from the right end of the structure and then reverses the result.

  10. reverseTakeG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Is analogous to the taking the specified quantity from the structure and then reversing the result. Uses strict variant of the foldl, so is not suitable for large amounts of data. Not recommended for performance reasons. For lists just use the combination (reverse . take n).

Page 156 of many | Previous | Next