Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. taskResponseTask :: TaskResponse a -> Task a

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

2. taskResponseTaskLens :: Lens' (TaskResponse a) (Task a)

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

3. templateSettings :: IndexTemplate -> Maybe IndexSettings

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

4. templateSettingsLens :: Lens' IndexTemplate (Maybe IndexSettings)

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

5. Reset :: Colored a

   colorful-monoids	Data.Monoid.Colorful.Flat

   No documentation available.

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

   comfort-graph	Data.Graph.Comfort

   No documentation available.

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

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

   comfort-graph	Data.Graph.Comfort

   No documentation available.

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

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

    comfort-graph	Data.Graph.Comfort

    No documentation available.

Page 181 of many | Previous | Next