Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. mappingFieldName :: MappingField -> FieldName

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

2. mappingFieldNameLens :: Lens' MappingField FieldName

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

3. mappingFields :: Mapping -> [MappingField]

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

4. mappingFieldsLens :: Lens' Mapping [MappingField]

   bloodhound	Database.Bloodhound.Common.Types

   No documentation available.

5. mapNodesLeaves :: (state0 -> state1) -> (state0 -> state1) -> T move state0 -> T move state1

   board-games	Game.Tree

   No documentation available.

6. mapTrees :: (a -> b) -> [(c, a)] -> [(c, b)]

   board-games	Game.Tree

   No documentation available.

7. mapAccumLM :: (Monad m, Traversable t) => (acc -> x -> m (acc, y)) -> acc -> t x -> m (acc, t y)

   breakpoint	Debug.Breakpoint.GhcFacade

   Monadic version of mapAccumL

8. mapAndRecoverM :: (a -> TcRn b) -> [a] -> TcRn [b]

   breakpoint	Debug.Breakpoint.GhcFacade

   Drop elements of the input that fail, so the result list can be shorter than the argument list

9. mapAndReportM :: (a -> TcRn b) -> [a] -> TcRn [b]

   breakpoint	Debug.Breakpoint.GhcFacade

   Apply the function to all elements on the input list If all succeed, return the list of results Otherwise fail, propagating all errors

10. mapAndUnzip3M :: Monad m => (a -> m (b, c, d)) -> [a] -> m ([b], [c], [d])

    breakpoint	Debug.Breakpoint.GhcFacade

    mapAndUnzipM for triples

Page 280 of many | Previous | Next