Hoogle Search

Within Stackage Nightly 2025-10-07 (ghc-9.12.2)

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

  1. isProperSubsetOf :: IntSet -> IntSet -> Bool

    intern Data.Interned.IntSet

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

  2. 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.

  3. unsafeSet :: Int -> a -> Array a % 1 -> Array a

    linear-base Data.Array.Mutable.Linear

    Same as set, but does not do bounds-checking. The behaviour is undefined if an out-of-bounds index is provided.

  4. unsafeSet :: HasCallStack => Int -> a -> Vector a % 1 -> Vector a

    linear-base Data.Vector.Mutable.Linear

    Same as write, but does not do bounds-checking. The behaviour is undefined when passed an invalid index.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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).

  10. fromSet :: MonoidNull v => (k -> v) -> Set k -> MonoidMap k v

    monoidmap-internal Data.MonoidMap.Internal

    Constructs a MonoidMap from a Set and a function from keys to values. Satisfies the following property for all possible keys k: 

    get k (fromSet f ks) ==
if Set.member k ks
then f k
else mempty
    This function performs canonicalisation of null values, and has a time complexity that is linear in the size of the set.

Page 149 of many | Previous | Next