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. type FunctionMap = Map NvimMethod FunctionMapEntry

   nvim-hs	Neovim.Context.Internal

   A function map is a map containing the names of functions as keys and some context dependent value which contains all the necessary information to execute that function in the intended way. This type is only used internally and handles two distinct cases. One case is a direct function call, wich is simply a function that accepts a list of Object values and returns a result in the Neovim context. The second case is calling a function that has a persistent state. This is mediated to a thread that reads from a TQueue. (NB: persistent currently means, that state is stored for as long as the plugin provider is running and not restarted.)

2. type FunctionMapEntry = (FunctionalityDescription, FunctionType)

   nvim-hs	Neovim.Context.Internal

   Type of the values stored in the function map.

3. globalFunctionMap :: Config env -> TMVar FunctionMap

   nvim-hs	Neovim.Context.Internal

   This map is used to dispatch received messagepack function calls to it's appropriate targets.

4. mkFunctionMap :: [FunctionMapEntry] -> FunctionMap

   nvim-hs	Neovim.Context.Internal

   Create a new function map from the given list of FunctionMapEntry values.

5. printGlobalFunctionMap :: NvimHSDebugInstance -> IO ()

   nvim-hs	Neovim.Debug

   Print the global function map to the console.

6. gfoldMap :: forall c t m . (ADT t, Constraints t c, Monoid m) => (forall s . c s => s -> m) -> t -> m

   one-liner	Generics.OneLiner

   Map each component of a structure to a monoid, and combine the results. If you have a class Size, which measures the size of a structure, then this could be the default implementation:

   size = succ . getSum . gfoldMap @Size (Sum . size)
   

   gfoldMap is gtraverse specialized to Const.

7. gfoldMap1 :: forall c t m a . (ADT1 t, Constraints1 t c, Monoid m) => (forall (s :: Type -> Type) b . c s => (b -> m) -> s b -> m) -> (a -> m) -> t a -> m

   one-liner	Generics.OneLiner

   foldMap = gfoldMap1 @Foldable foldMap
   

   gfoldMap1 is gtraverse1 specialized to Const.

8. glfoldMap :: forall c t m . (ADT t, Constraints t c, Monoid m) => (forall s . c s => s % 1 -> m) -> t % 1 -> m

   one-liner	Generics.OneLiner

   Map each component of a structure to a linear monoid, and combine the results. For example. this could be the default implementation of Consumable:

   consume = glfoldMap @Consumable consume
   

   glfoldMap is gltraverse specialized to Const.

9. glmap :: forall c t . (ADT t, Constraints t c) => (forall s . c s => s % 1 -> s) -> t % 1 -> t

   one-liner	Generics.OneLiner

   Map over a structure linearly, updating each component. glmap is generic specialized to the linear arrow.

10. glmap1 :: forall c t a b . (ADT1 t, Constraints1 t c) => (forall d e (s :: Type -> Type) . c s => (d % 1 -> e) -> s d % 1 -> s e) -> (a % 1 -> b) -> t a % 1 -> t b

    one-liner	Generics.OneLiner

    fmap = gmap1 @Functor fmap
    

    glmap1 is generic1 specialized to the linear arrow.

Page 995 of many | Previous | Next