github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2025-01-03 13:02:37 +03:00
Code Issues Projects Releases Wiki Activity

Replace the identifiable algebra with an identifier algebra.

Browse Source
This commit is contained in:
Rob Rix 2017-04-25 12:30:36 -04:00
parent 69bbc13da3
commit 0db2c73a1e
1 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/Language/Ruby/Syntax.hs
View File

@ -119,14 +119,18 @@ type RAlgebra f t a = f (t, a) -> a
fToR :: Functor (Base t) => FAlgebra (Base t) a -> RAlgebra (Base t) t a fToR :: Functor (Base t) => FAlgebra (Base t) a -> RAlgebra (Base t) t a
fToR f = f . fmap snd fToR f = f . fmap snd
-- | Produce a list of identifiable subterms of a given term. newtype Identifier' = Identifier' ByteString
deriving (Eq, Show)
-- | Produce the identifier for a given term, if any.
-- --
-- By “identifiable” we mean terms which have a user-assigned identifier associated with them, & which serve as a declaration rather than a reference; i.e. the declaration of a class or method or binding of a variable are all identifiable terms, but calling a named function or referencing a parameter is not. -- By “identifiable” we mean terms which have a user-assigned identifier associated with them, & which serve as a declaration rather than a reference; i.e. the declaration of a class or method or binding of a variable are all identifiable terms, but calling a named function or referencing a parameter is not.
identifiableAlg :: (InUnion fs Declaration.Method, InUnion fs Declaration.Class, Foldable (Union fs), Functor (Union fs)) => RAlgebra (Base (Term (Union fs) a)) (Term (Union fs) a) [Term (Union fs) a] identifierAlg :: (InUnion fs Syntax.Identifier, InUnion fs Declaration.Method, InUnion fs Declaration.Class, Foldable (Union fs), Functor (Union fs)) => FAlgebra (Base (Term (Union fs) a)) (Maybe Identifier')
identifiableAlg c@(_ :< union) = case union of identifierAlg (_ :< union) = case union of
_ | Just Declaration.Class{} <- prj union -> cofree (fmap fst c) : foldMap snd union _ | Just (Syntax.Identifier s) <- prj union -> Just (Identifier' s)
_ | Just Declaration.Method{} <- prj union -> cofree (fmap fst c) : foldMap snd union _ | Just Declaration.Class{..} <- prj union -> classIdentifier
_ -> foldMap snd union _ | Just Declaration.Method{..} <- prj union -> methodName
_ -> Nothing
-- | The cyclomatic complexity of a (sub)term. -- | The cyclomatic complexity of a (sub)term.
newtype CyclomaticComplexity = CyclomaticComplexity Int newtype CyclomaticComplexity = CyclomaticComplexity Int