I've created a small library called StreamX, which acts like a type-safe, index-aware zipper to enable parallel streaming over multiple lists. It supports functional operations like forEach, map, ...

I am trying to create a Tree Zipper using Rust. It is inspired by this answer but I am using struct fields instead of Vec for the childs. I want to have a tree of nodes, e.g.: 7 / \ 4 11 / ...

I have two rose trees in Haskell of m and n nodes, respectively. I want to replace the ith node of the first tree with the jth node of the second tree. e.g. tree 1: R ...

I am currently implementing derivatives of regular data structures, in Agda, as presented in the One-Hole Context paper by Conor McBride [5]. In implementing it straight out of the OHC paper, which ...

When you iterate through an arbitrarily nested Clojure zipper in a depth-first fashion via z/next, can you get or reconstruct the already visited part of the zipper, preserving its structure? For ...

I made my way thru the Tutorial available at Learn your Haskell and I ask myself why the Author uses a list as the second type for the implemented Zipper? Here is the relevant Code: type Name = ...

Say I have a tree like this. I would like to obtain the paths to child nodes that only contain leaves and not non-leaf child nodes. So for this tree root ├──leaf123 ├──level_a_node1 │ ├──leaf456 ├...

I'm using Clojure's zippers to implement what I thought wouldn't be particularly challenging but it seems I may be missing something. Essentially what I want to do is, given some data structure as a ...

I have a clojure map that looks like this: {"l1" [{"name" "s1", "url" "something", "coordinates" {"latitude" 100, "longitude" 200}} {"name" "s2", "url" "something", "coordinates" {"latitude" ...

I want to write a function for a zipper that removes all right siblings of a node while staying at the same location. (defn remove-all-rights-1 [loc] (if (zip/right loc) (recur (zip/remove (...

I'm writing a tree ( business process decision tree ) in clojure data structure . (require clojure.zip :as z) (z/vector-zip [ :billed? [:yes [:check-bank-account] ...

I am looking to transform a clojure tree structure into a map with its dependencies For example, an input like: [{:value "A"} [{:value "B"} [{:value "C"} {:value "D"}] [{:value "E"} [{:...

I am currently searching for implementations of Huet's Zipper ``in the wild''. So far, I have found: The agda compiler (correct me if I'm wrong) uses the zipper for the eliminator of call-by-need ...

Say I have a tree where I want to visit - and that should include the possibility to modify the visited items - all items that match the path (def visit-path [:b :all :x :all]) where I use :all as a ...

I have the following: data Expr : Type -> Type where Lift : a -> Expr a Add : Num a => Expr a -> Expr a -> Expr a And : Expr Bool -> Expr Bool -> Expr Bool Cnst : Expr ...