{-# LANGUAGE TemplateHaskell #-}
-- Cyclic dependencies mean we have to put poor StaticRegistrationOptions on its own
module Language.LSP.Types.StaticRegistrationOptions where

import Data.Aeson.TH
import Data.Text (Text)
import Language.LSP.Types.Utils

data StaticRegistrationOptions =
  StaticRegistrationOptions
    { StaticRegistrationOptions -> Maybe Text
_id :: Maybe Text
    } deriving (ReadPrec [StaticRegistrationOptions]
ReadPrec StaticRegistrationOptions
Int -> ReadS StaticRegistrationOptions
ReadS [StaticRegistrationOptions]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [StaticRegistrationOptions]
$creadListPrec :: ReadPrec [StaticRegistrationOptions]
readPrec :: ReadPrec StaticRegistrationOptions
$creadPrec :: ReadPrec StaticRegistrationOptions
readList :: ReadS [StaticRegistrationOptions]
$creadList :: ReadS [StaticRegistrationOptions]
readsPrec :: Int -> ReadS StaticRegistrationOptions
$creadsPrec :: Int -> ReadS StaticRegistrationOptions
Read,Int -> StaticRegistrationOptions -> ShowS
[StaticRegistrationOptions] -> ShowS
StaticRegistrationOptions -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [StaticRegistrationOptions] -> ShowS
$cshowList :: [StaticRegistrationOptions] -> ShowS
show :: StaticRegistrationOptions -> String
$cshow :: StaticRegistrationOptions -> String
showsPrec :: Int -> StaticRegistrationOptions -> ShowS
$cshowsPrec :: Int -> StaticRegistrationOptions -> ShowS
Show,StaticRegistrationOptions -> StaticRegistrationOptions -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: StaticRegistrationOptions -> StaticRegistrationOptions -> Bool
$c/= :: StaticRegistrationOptions -> StaticRegistrationOptions -> Bool
== :: StaticRegistrationOptions -> StaticRegistrationOptions -> Bool
$c== :: StaticRegistrationOptions -> StaticRegistrationOptions -> Bool
Eq)
deriveJSON lspOptions ''StaticRegistrationOptions