suzanne.soy/tock-mirror
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added a slightly hacky fastListify function built on top of applyDepthM

Browse Source
This commit is contained in:
Neil Brown 2008-11-21 18:54:23 +00:00
parent ae7557d623
commit d529d78846
1 changed files with 9 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
pass/Traversal.hs
View File

@ -28,8 +28,10 @@ module Traversal (
, DescendM, Descend, makeDescend , DescendM, Descend, makeDescend
, applyDepthM, applyDepthSM, applyDepthM2 , applyDepthM, applyDepthSM, applyDepthM2
, checkDepthM, checkDepthM2 , checkDepthM, checkDepthM2
, fastListify
) where ) where
import Control.Monad.State
import Data.Generics import Data.Generics
import qualified AST as A import qualified AST as A
@ -203,3 +205,10 @@ checkDepthM2 f1 f2 = makeRecurse ops
ops = baseOp `extOp` makeCheck ops f1 ops = baseOp `extOp` makeCheck ops f1
`extOp` makeCheck ops f2 `extOp` makeCheck ops f2
-- | Lists all the items (in arbitrary order) that meet the given criteria. Just
-- like the Data.Generics listify function, only faster
fastListify :: forall s t. (Data s, Data t) => (t -> Bool) -> s -> [t]
fastListify f x = execState (applyDepthM f' x) []
where
f' :: t -> State [t] t
f' y = when (f y) (modify (y:)) >> return y