Haskell 反思:记录有字段吗?

Dan*_*ton 4 generics reflection haskell

GHC 泛型工具让您检查构造函数名称,但是字段名称呢?

假设我有一个数据类型

data Foo
  = F {f :: Int}
  | OO {oo :: String}
  | Foo {f :: Int, oo :: String}
Run Code Online (Sandbox Code Playgroud)

我有以下数据

aFoo :: Foo
Run Code Online (Sandbox Code Playgroud)

我可以写这样的东西:

ooMay :: Foo -> Maybe String
ooMay f@(Foo {}) = Just (oo f)
ooMay f@(OO {}) = Just (oo f)
ooMay f@(F {}) = Nothing
Run Code Online (Sandbox Code Playgroud)

oo通过我知道可以安全使用的构造函数保护访问器。

有没有办法用泛型来写这个?类似的东西fieldMay存在吗?

ooMay :: Foo -> Maybe String
ooMay f = fieldMay "oo" f
Run Code Online (Sandbox Code Playgroud)

HTN*_*TNW 7

是的,这是可行的。字段名称写入类型构造函数(参数)的Repas 参数中。Haddock 掩盖了并且基于example的类忽略了其中的信息,但现在我们需要它。M1MetaM1Generic

只是为了让我们知道我们在处理什么:

ghci> :kind! Rep Foo
Rep Foo :: * -> *
= D1
    ('MetaData "Foo" "Ghci1" "interactive" 'False)
    (C1
       ('MetaCons "F" 'PrefixI 'True)
       (S1
          ('MetaSel
             ('Just "f") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy)
          (Rec0 Int))
     :+: (C1
            ('MetaCons "OO" 'PrefixI 'True)
            (S1
               ('MetaSel
                  ('Just "oo")
                  'NoSourceUnpackedness
                  'NoSourceStrictness
                  'DecidedLazy)
               (Rec0 String))
          :+: C1
                ('MetaCons "Foo" 'PrefixI 'True)
                (S1
                   ('MetaSel
                      ('Just "f") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy)
                   (Rec0 Int)
                 :*: S1
                       ('MetaSel
                          ('Just "oo")
                          'NoSourceUnpackedness
                          'NoSourceStrictness
                          'DecidedLazy)
                       (Rec0 String))))
Run Code Online (Sandbox Code Playgroud)

所以我们基本上只是搜索S1s 并选择具有正确名称的那个。为简单起见,让我们先看看那些具有正确类型的。

class GFieldMay rep a where
    gFieldMay :: String -> rep p -> Maybe a
-- fields of the right type might match the name
instance {-# OVERLAPS #-} Selector s => GFieldMay (M1 S s (K1 i a)) a where
    gFieldMay name m@(M1 (K1 x))
      | name == selName m = Just x
      | otherwise = Nothing
-- any other fields must be pruned (no deep search)
instance {-# OVERLAPPING #-} GFieldMay (M1 S s f) a where
    gFieldMay _ _ = Nothing
-- drill through any other metadata
instance {-# OVERLAPPABLE #-} GFieldMay f a => GFieldMay (M1 i m f) a where
    gFieldMay name (M1 x) = gFieldMay name x
-- search both sides of products
instance (GFieldMay l a, GFieldMay r a) => GFieldMay (l :*: r) a where
    gFieldMay name (l :*: r) = gFieldMay name l <|> gFieldMay name r
-- search the given side of sums
instance (GFieldMay l a, GFieldMay r a) => GFieldMay (l :+: r) a where
    gFieldMay name (L1 x) = gFieldMay name x
    gFieldMay name (R1 x) = gFieldMay name x
Run Code Online (Sandbox Code Playgroud)

就是这样

fieldMay :: (Generic a, GFieldMay (Rep a) f) => String -> a -> Maybe f
fieldMay name = gFieldMay name . from
Run Code Online (Sandbox Code Playgroud)

达达!

main = putStr $ unlines $
  [ show x ++ ": " ++ show (fieldMay "oo" x :: Maybe String)
  | x <- [F 42, OO "5", Foo 42 "5"]]
-- F {f = 42}: Nothing
-- OO {oo = "5"}: Just "5"
-- Foo {f = 42, oo = "5"}: Just "5"
Run Code Online (Sandbox Code Playgroud)