Use the new integrate function

This commit is contained in:
Spencer Janssen
2007-06-04 06:26:53 +00:00
parent cad36baa19
commit 1912feee50
2 changed files with 2 additions and 4 deletions

View File

@@ -257,7 +257,7 @@ integrate (Node x l r) = reverse l ++ x : r
-- integration of a one-hole list cursor, back to a list.
--
index :: Eq a => StackSet i a s -> [a]
index = with [] $ \(Node t l r) -> reverse l ++ t : r
index = with [] integrate
-- let is = t : r ++ reverse l in take (length is) (dropWhile (/= m) (cycle is))