Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
taskResponseTaskLens :: Lens' (TaskResponse a) (Task a)bloodhound Database.Bloodhound.Common.Types No documentation available.
templateSettings :: IndexTemplate -> Maybe IndexSettingsbloodhound Database.Bloodhound.Common.Types No documentation available.
templateSettingsLens :: Lens' IndexTemplate (Maybe IndexSettings)bloodhound Database.Bloodhound.Common.Types No documentation available.
-
colorful-monoids Data.Monoid.Colorful.Flat No documentation available.
adjacentEdgeSet :: (Edge e, Ord n) => Graph e n el nl -> n -> Set (e n)comfort-graph Data.Graph.Comfort No documentation available.
-
comfort-graph Data.Graph.Comfort Could be implemented more efficiently.
edgeSet :: (Edge edge, Ord node) => Graph edge node edgeLabel nodeLabel -> Set (edge node)comfort-graph Data.Graph.Comfort No documentation available.
insertEdgeSet :: (Edge e, Ord n) => Map (e n) el -> Graph e n el nl -> Graph e n el nlcomfort-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.
nodeSet :: forall (e :: Type -> Type) n el nl . Graph e n el nl -> Set ncomfort-graph Data.Graph.Comfort No documentation available.
ResponseTimeout :: InetAddr -> ConnectionErrorcql-io Database.CQL.IO A timeout occurred while waiting for a response. See also setResponseTimeout. Retries are only safe for idempotent queries.