Hoogle Search

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

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

  1. toWord8Set :: [Char] -> Set Word8

    bitset-word8 Data.BitSetWord8.Internal

    Convert given list of Char into Set of Word8. Any Char having code point greater than 0xff is ignored.

  2. chaseType :: forall a proxy (m :: Type -> Type) . Data a => proxy a -> ((Maybe (Alias m), Ix) -> AMap m -> AMap m) -> State (DataDef m) (Either Aliased Ix, ((Nat, Integer), Maybe Int))

    boltzmann-samplers Boltzmann.Data.Oracle

    No documentation available.

  3. traverseType :: forall a proxy (m :: Type -> Type) . Data a => proxy a -> Ix -> State (DataDef m) (Either Aliased Ix, ((Nat, Integer), Maybe Int))

    boltzmann-samplers Boltzmann.Data.Oracle

    Traversal of the definition of a datatype.

  4. traverseType' :: forall a proxy (m :: Type -> Type) . Data a => proxy a -> DataType -> State (DataDef m) ([(Integer, Constr, [(Maybe Aliased, C)])], ((Nat, Integer), Maybe Int))

    boltzmann-samplers Boltzmann.Data.Oracle

    No documentation available.

  5. adjacentEdgeSet :: (Edge e, Ord n) => Graph e n el nl -> n -> Set (e n)

    comfort-graph Data.Graph.Comfort

    No documentation available.

  6. deleteNodeSet :: forall (e :: Type -> Type) n el nl . (Edge e, Ord n) => Set n -> Graph e n el nl -> Graph e n el nl

    comfort-graph Data.Graph.Comfort

    Could be implemented more efficiently.

  7. edgeSet :: (Edge edge, Ord node) => Graph edge node edgeLabel nodeLabel -> Set (edge node)

    comfort-graph Data.Graph.Comfort

    No documentation available.

  8. insertEdgeSet :: (Edge e, Ord n) => Map (e n) el -> Graph e n el nl -> Graph e n el nl

    comfort-graph Data.Graph.Comfort

    In the current implementation existing edges are replaced with new labels. However, I think we should better have an extra function for this purpose and you should not rely on this behavior. It is an unchecked error if edges between non-existing nodes are inserted.

  9. nodeSet :: forall (e :: Type -> Type) n el nl . Graph e n el nl -> Set n

    comfort-graph Data.Graph.Comfort

    No documentation available.

  10. emptySet :: Key ε => Set ε

    core-data Core.Data.Structures

    An empty collection. This is used for example as an inital value when building up a Set using a fold.

Page 143 of many | Previous | Next