• About
  • Snapshots
  • LTS
  • Nightly
  • FAQ
  • Blog

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 :: Ord a => MultiSet a -> MultiSet a -> Bool

    multiset Data.MultiSet

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

  2. isSubsetOf :: Ord a => MultiSet a -> MultiSet a -> Bool

    multiset Data.MultiSet

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

  3. toSet :: MultiSet a -> Set a

    multiset Data.MultiSet

    O(n). Convert a multiset to a Set, removing duplicates.

  4. offset :: T (v :: Type -> Type) a -> !Int

    orthotope Data.Array.Internal

    No documentation available.

  5. reverseT :: forall (v :: Type -> Type) a . [Int] -> ShapeL -> T v a -> T v a

    orthotope Data.Array.Internal

    No documentation available.

  6. transposeT :: forall (v :: Type -> Type) a . [Int] -> T v a -> T v a

    orthotope Data.Array.Internal

    No documentation available.

  7. traverseT :: forall (v :: Type -> Type) a b f . (Vector v, VecElem v a, VecElem v b, Applicative f) => ShapeL -> (a -> f b) -> T v a -> f (T v b)

    orthotope Data.Array.Internal

    No documentation available.

  8. sliceOffsets :: Slice ls ss rs => Proxy ls -> Proxy ss -> [Int]

    orthotope Data.Array.Internal.Shape

    No documentation available.

  9. maxSet :: Maxima a -> Set a

    partialord Data.PartialOrd

    No documentation available.

  10. minSet :: Minima a -> Set a

    partialord Data.PartialOrd

    No documentation available.

Page 151 of many | Previous | Next

Stackage is a service provided by the Haskell Foundation │ Originally developed by FP Complete