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.

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

Fix "move" edit (formerly "big swap") #27

Open
matthewhammer opened this issue Apr 20, 2015 · 3 comments
Open

Fix "move" edit (formerly "big swap") #27

matthewhammer opened this issue Apr 20, 2015 · 3 comments

Comments

@matthewhammer
Copy link
Contributor

One benchmark seems to handle big swap well: List_reverse_name. Others do not, such as Rope_mergesort_name. We'd like to learn lessons from the code that works to fix the code that does not.

@matthewhammer
Copy link
Contributor Author

Some observations:

  • list_reverse_balanced is eager, not lazy. rope_of_list_rec could be simpler if it were eager too.
  • list_reverse_balanced uses a separate memo table for its accumulator (output structure).

Questions:

  • For List_reverse_name benchmark: Is time going to updating the output, or merely observing the output?

@labichn
Copy link
Contributor

labichn commented Aug 6, 2015

@kyleheadley, was this completed in the OOPSLA push?

@kyleheadley
Copy link
Contributor

There hasn't been any work on this problem since the 'move' interaction was created. 'Move' swaps the front half of a list with the back half, making it a far more dramatic change than any of the others. Right now the focus of research is on more applications of adapton, rather than expanding on what counts as 'incremental'

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants
@matthewhammer @labichn @kyleheadley and others