lsp-types-2.0.2.0: Haskell library for the Microsoft Language Server Protocol, data types

Safe Haskell | Safe-Inferred
Language | Haskell2010

Language.LSP.Protocol.Utils.SMethodMap

Synopsis

- data SMethodMap (v :: Method f t -> Type)
- singleton :: SMethod a -> v a -> SMethodMap v
- insert :: SMethod a -> v a -> SMethodMap v -> SMethodMap v
- delete :: SMethod a -> SMethodMap v -> SMethodMap v
- member :: SMethod a -> SMethodMap v -> Bool
- lookup :: SMethod a -> SMethodMap v -> Maybe (v a)
- map :: (forall a. u a -> v a) -> SMethodMap u -> SMethodMap v

# Documentation

data SMethodMap (v :: Method f t -> Type) #

A specialized alternative to a full dependent map for use with `SMethod`.

#### Instances

Instances details

Monoid (SMethodMap v) # |
Instance details Defined in Language.LSP.Protocol.Utils.SMethodMap Methods mempty :: SMethodMap v # mappend :: SMethodMap v -> SMethodMap v -> SMethodMap v # mconcat :: [SMethodMap v] -> SMethodMap v #
Semigroup (SMethodMap v) # |
Instance details Defined in Language.LSP.Protocol.Utils.SMethodMap Methods (<>) :: SMethodMap v -> SMethodMap v -> SMethodMap v # sconcat :: NonEmpty (SMethodMap v) -> SMethodMap v # stimes :: Integral b => b -> SMethodMap v -> SMethodMap v #

singleton :: SMethod a -> v a -> SMethodMap v #

insert :: SMethod a -> v a -> SMethodMap v -> SMethodMap v #

delete :: SMethod a -> SMethodMap v -> SMethodMap v #

member :: SMethod a -> SMethodMap v -> Bool #

lookup :: SMethod a -> SMethodMap v -> Maybe (v a) #

map :: (forall a. u a -> v a) -> SMethodMap u -> SMethodMap v #