diff options
Diffstat (limited to '')
| -rw-r--r-- | stdlib/source/lux/data/collection/tree/rose/zipper.lux | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/stdlib/source/lux/data/collection/tree/rose/zipper.lux b/stdlib/source/lux/data/collection/tree/rose/zipper.lux index 663090cf2..61de6d585 100644 --- a/stdlib/source/lux/data/collection/tree/rose/zipper.lux +++ b/stdlib/source/lux/data/collection/tree/rose/zipper.lux @@ -4,14 +4,14 @@ functor comonad] [data - ["." maybe ("#/." monad)] + ["." maybe ("#;." monad)] [collection - ["." list ("#/." functor fold monoid)] + ["." list ("#;." functor fold monoid)] ["." stack (#+ Stack)]]] ["." macro ["." code] ["s" syntax (#+ Syntax syntax:)]]] - ["." // (#+ Tree) ("#/." functor)]) + ["." // (#+ Tree) ("#;." functor)]) ## Adapted from the clojure.zip namespace in the Clojure standard library. @@ -88,12 +88,12 @@ ## TODO: Remove once new-luxc becomes the standard compiler. (update@ #node (: (-> (Tree ($ 0)) (Tree ($ 0))) (function (_ node) - (set@ #//.children (list/compose (list.reverse (get@ #lefts zipper)) + (set@ #//.children (list;compose (list.reverse (get@ #lefts zipper)) (#.Cons (get@ #node zipper) (get@ #rights zipper))) node)))) ## (update@ #node (function (_ node) - ## (set@ #//.children (list/compose (list.reverse (get@ #lefts zipper)) + ## (set@ #//.children (list;compose (list.reverse (get@ #lefts zipper)) ## (#.Cons (get@ #node zipper) ## (get@ #rights zipper))) ## node))) @@ -122,7 +122,7 @@ (def: #export (<all-name> zipper) (All [a] (-> (Zipper a) (Zipper a))) - (list/fold (function (_ _) <one-name>) zipper (get@ <side> zipper)))] + (list;fold (function (_ _) <one-name>) zipper (get@ <side> zipper)))] [right rightmost #rights #lefts] [left leftmost #lefts #rights] @@ -167,7 +167,7 @@ (All [a] (-> a (Zipper a) (Zipper a))) (update@ [#node #//.children] (function (_ children) - (list/compose children + (list;compose children ## TODO: Remove once new-luxc becomes the standard compiler. (list (: (Tree ($ 0)) (//.tree [value {}]))) @@ -216,10 +216,10 @@ (structure: #export functor (Functor Zipper) (def: (map f fa) - {#parent (|> fa (get@ #parent) (maybe/map (map f))) - #lefts (|> fa (get@ #lefts) (list/map (///map f))) - #rights (|> fa (get@ #rights) (list/map (///map f))) - #node (///map f (get@ #node fa))})) + {#parent (|> fa (get@ #parent) (maybe;map (map f))) + #lefts (|> fa (get@ #lefts) (list;map (//;map f))) + #rights (|> fa (get@ #rights) (list;map (//;map f))) + #node (//;map f (get@ #node fa))})) ## TODO: Add again once new-luxc becomes the standard compiler. ## (structure: #export comonad (CoMonad Zipper) @@ -230,9 +230,9 @@ ## (def: (split wa) ## (let [tree-splitter (function (tree-splitter tree) ## {#//.value (zip tree) -## #//.children (list/map tree-splitter +## #//.children (list;map tree-splitter ## (get@ #//.children tree))})] -## {#parent (|> wa (get@ #parent) (maybe/map split)) -## #lefts (|> wa (get@ #lefts) (list/map tree-splitter)) -## #rights (|> wa (get@ #rights) (list/map tree-splitter)) +## {#parent (|> wa (get@ #parent) (maybe;map split)) +## #lefts (|> wa (get@ #lefts) (list;map tree-splitter)) +## #rights (|> wa (get@ #rights) (list;map tree-splitter)) ## #node (|> fa (get@ #node) tree-splitter)}))) |