Difference between revisions of "Talk:Zipper monad"
Jump to navigation
Jump to search
DavidHouse (talk | contribs) |
DavidHouse (talk | contribs) (update the TODO) |
||
| Line 2: | Line 2: | ||
== TODO == |
== TODO == |
||
| − | * Generalise! I'm making good progress on writing a more general lib to cover any traversable data structure. |
+ | * Generalise! I'm making good progress on writing a more general lib to cover any traversable data structure. UPDATE done in version 1 [[User:DavidHouse|DavidHouse]] 18:55, 19 April 2006 (UTC) |
| − | * Better error reporting. |
+ | * Better error reporting. UPDATE done in version 1 [[User:DavidHouse|DavidHouse]] 18:55, 19 April 2006 (UTC) |
* Name changes: |
* Name changes: |
||
| − | ** Change it to the 'Traversal monad' (as you shouldn't have to use the zipper for location). |
+ | ** Change it to the 'Traversal monad' (as you shouldn't have to use the zipper for location). UPDATE decided not to. [[User:DavidHouse|DavidHouse]] 18:55, 19 April 2006 (UTC) |
| − | ** Change left and right to move from a right branch to its corresponding left one and vice versa: this fits in better with the BTree lib. |
+ | ** Change left and right to move from a right branch to its corresponding left one and vice versa: this fits in better with the BTree lib. UPDATE decided not to: left and right are more natural, and we can still have a swap combinator to switch branches. [[User:DavidHouse|DavidHouse]] 18:55, 19 April 2006 (UTC) |
Latest revision as of 18:55, 19 April 2006
Here's where I'd like to go with this:
TODO
- Generalise! I'm making good progress on writing a more general lib to cover any traversable data structure. UPDATE done in version 1 DavidHouse 18:55, 19 April 2006 (UTC)
- Better error reporting. UPDATE done in version 1 DavidHouse 18:55, 19 April 2006 (UTC)
- Name changes:
- Change it to the 'Traversal monad' (as you shouldn't have to use the zipper for location). UPDATE decided not to. DavidHouse 18:55, 19 April 2006 (UTC)
- Change left and right to move from a right branch to its corresponding left one and vice versa: this fits in better with the BTree lib. UPDATE decided not to: left and right are more natural, and we can still have a swap combinator to switch branches. DavidHouse 18:55, 19 April 2006 (UTC)