Data.Aeson.Key
data Key Source #
Defined in Data.Aeson.Key
Methods
(==) :: Key -> Key -> Bool Source #
(/=) :: Key -> Key -> Bool Source #
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Key -> c Key Source #
gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Key Source #
toConstr :: Key -> Constr Source #
dataTypeOf :: Key -> DataType Source #
dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Key) Source #
dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Key) Source #
gmapT :: (forall b. Data b => b -> b) -> Key -> Key Source #
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Key -> r Source #
gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Key -> r Source #
gmapQ :: (forall d. Data d => d -> u) -> Key -> [u] Source #
gmapQi :: Int -> (forall d. Data d => d -> u) -> Key -> u Source #
gmapM :: Monad m => (forall d. Data d => d -> m d) -> Key -> m Key Source #
gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Key -> m Key Source #
gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Key -> m Key Source #
compare :: Key -> Key -> Ordering Source #
(<) :: Key -> Key -> Bool Source #
(<=) :: Key -> Key -> Bool Source #
(>) :: Key -> Key -> Bool Source #
(>=) :: Key -> Key -> Bool Source #
max :: Key -> Key -> Key Source #
min :: Key -> Key -> Key Source #
readsPrec :: Int -> ReadS Key Source #
readList :: ReadS [Key] Source #
readPrec :: ReadPrec Key Source #
readListPrec :: ReadPrec [Key] Source #
showsPrec :: Int -> Key -> ShowS Source #
show :: Key -> String Source #
showList :: [Key] -> ShowS Source #
fromString :: String -> Key Source #
(<>) :: Key -> Key -> Key Source #
sconcat :: NonEmpty Key -> Key Source #
stimes :: Integral b => b -> Key -> Key Source #
mempty :: Key Source #
mappend :: Key -> Key -> Key Source #
mconcat :: [Key] -> Key Source #
rnf :: Key -> () Source #
hashWithSalt :: Int -> Key -> Int Source #
hash :: Key -> Int Source #
Defined in Data.Aeson.Types.FromJSON
fromJSONKey :: FromJSONKeyFunction Key Source #
fromJSONKeyList :: FromJSONKeyFunction [Key] Source #
parseJSON :: Value -> Parser Key Source #
parseJSONList :: Value -> Parser [Key] Source #
Defined in Data.Aeson.Types.ToJSON
toJSONKey :: ToJSONKeyFunction Key Source #
toJSONKeyList :: ToJSONKeyFunction [Key] Source #
(.=) :: ToJSON v => Key -> v -> Pair Source #
toJSON :: Key -> Value Source #
toEncoding :: Key -> Encoding Source #
toJSONList :: [Key] -> Value Source #
toEncodingList :: [Key] -> Encoding Source #
lift :: Quote m => Key -> m Exp Source #
liftTyped :: forall (m :: Type -> Type). Quote m => Key -> Code m Key Source #
Defined in Data.Aeson.KeyMap
imap :: (Key -> a -> b) -> KeyMap a -> KeyMap b Source #
ifoldMap :: Monoid m => (Key -> a -> m) -> KeyMap a -> m Source #
ifoldMap' :: Monoid m => (Key -> a -> m) -> KeyMap a -> m Source #
ifoldr :: (Key -> a -> b -> b) -> b -> KeyMap a -> b Source #
ifoldl :: (Key -> b -> a -> b) -> b -> KeyMap a -> b Source #
ifoldr' :: (Key -> a -> b -> b) -> b -> KeyMap a -> b Source #
ifoldl' :: (Key -> b -> a -> b) -> b -> KeyMap a -> b Source #
itraverse :: Applicative f => (Key -> a -> f b) -> KeyMap a -> f (KeyMap b) Source #
ialignWith :: (Key -> These a b -> c) -> KeyMap a -> KeyMap b -> KeyMap c Source #
izipWith :: (Key -> a -> b -> c) -> KeyMap a -> KeyMap b -> KeyMap c Source #
imapMaybe :: (Key -> a -> Maybe b) -> KeyMap a -> KeyMap b Source #
ifilter :: (Key -> a -> Bool) -> KeyMap a -> KeyMap a Source #
iwither :: Applicative f => (Key -> a -> f (Maybe b)) -> KeyMap a -> f (KeyMap b) Source #
iwitherM :: Monad m => (Key -> a -> m (Maybe b)) -> KeyMap a -> m (KeyMap b) Source #
ifilterA :: Applicative f => (Key -> a -> f Bool) -> KeyMap a -> f (KeyMap a) Source #
toString :: Key -> String Source #
toText :: Key -> Text Source #
fromText :: Text -> Key Source #
coercionToText :: Maybe (Coercion Key Text) Source #
'coercing r1 r2' will evaluate to r1 if Key is Coercible to Text, and to r2 otherwise.
'coercing r1 r2'
r1
Key
Coercible
Text
r2
Using coercing we can make more efficient implementations when Key is backed up by Text without exposing internals.
coercing