Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Complete specification for a "Tree" #2

Open
athanclark opened this issue Sep 12, 2015 · 1 comment
Open

Complete specification for a "Tree" #2

athanclark opened this issue Sep 12, 2015 · 1 comment
Assignees
@athanclark
Labels
bug in progress necessary

Comments

@athanclark
Copy link
Owner

Ideally, rose trees are non-empty multi-tailed lists. That's how the Data.Tree.Rose class specifies it.

To complete the spec, we need the following (much like a set):

  • Operators
  • Query (no sense for lookup, these are unkeyed (sub-)functors. For that, see tries)
  • Construction
    • The @-> overloaded constructor will take care of the Cons case, but for some (like Data.Tree.Set), we'll need delete, etc. (insert is a malformed idea :s)
  • Set operations (union, intersection, difference)
  • Filter
  • Mapping

plus proper Fold, Traverse, and anything else we can tack on each implementation.
@athanclark athanclark self-assigned this Sep 12, 2015
@athanclark
Copy link
Owner Author

need First and Last for monoid / union instances

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@athanclark athanclark

Labels
bug in progress necessary
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@athanclark