github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-23 06:41:45 +03:00
Code Issues Projects Releases Wiki Activity

Correct the deprecation pragma.

Browse Source
This commit is contained in:
Rob Rix 2017-04-24 19:16:50 -04:00
parent 22ac1e3441
commit 6c38ec2b77
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -131,7 +131,7 @@ fToCV f = f . fmap extract
-- Note that this is in general O(n), since it must visit each node of the term in order to reconstruct the original term; and thus, a histomorphism performed with the resulting algebra will be O(n²). -- Note that this is in general O(n), since it must visit each node of the term in order to reconstruct the original term; and thus, a histomorphism performed with the resulting algebra will be O(n²).
rToCV :: (Functor (Base t), Corecursive t) => RAlgebra (Base t) t a -> CVAlgebra (Base t) a rToCV :: (Functor (Base t), Corecursive t) => RAlgebra (Base t) t a -> CVAlgebra (Base t) a
rToCV r = r . fmap (cata (embed . tailF) &&& extract) rToCV r = r . fmap (cata (embed . tailF) &&& extract)
{-# DEPRECATED "rToCV is asymptotically inefficient. Suggest refactoring to an FAlgebra or CVAlgebra." #-} {-# DEPRECATED rToCV "rToCV is asymptotically inefficient. Suggest refactoring to an FAlgebra or CVAlgebra." #-}
-- | Produce a list of identifiable subterms of a given term. -- | Produce a list of identifiable subterms of a given term.
-- --