From 6c38ec2b775c0a1b539ba1296bb12d6ec340b5a1 Mon Sep 17 00:00:00 2001 From: Rob Rix Date: Mon, 24 Apr 2017 19:16:50 -0400 Subject: [PATCH] Correct the deprecation pragma. --- src/Language/Ruby/Syntax.hs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/Language/Ruby/Syntax.hs b/src/Language/Ruby/Syntax.hs index dc81501ce..abf81fb94 100644 --- a/src/Language/Ruby/Syntax.hs +++ b/src/Language/Ruby/Syntax.hs @@ -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²). rToCV :: (Functor (Base t), Corecursive t) => RAlgebra (Base t) t a -> CVAlgebra (Base t) a 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. --