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

Incrementally update NestedArrays by GraphChanges #71

Open
wants to merge 14 commits into
base: master
Choose a base branch
from

Conversation

fdietze
Copy link
Member

@fdietze fdietze commented Jun 18, 2019

  • Only calculate the needed updates lazily (maybe use Observable?)
  • Actually use it somewhere
  • Integrate Filters
  • Things that don't need a traversal can be modeled with immutable hashmaps: (Notify, Member, Bookmark, Author, Read, ...)
  • Measure how much slower a traversal of Array[Array[Int]] is compared to NestedArrayInt. If it is not much slower, use Array[Array[Int]], as it is easier/faster to update.

@fdietze fdietze force-pushed the graphsplit branch 3 times, most recently from e27ced2 to f433767 Compare July 13, 2019 21:44
@fdietze fdietze force-pushed the graphsplit branch 2 times, most recently from 486a8a1 to 84144f6 Compare July 15, 2019 18:15
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

Successfully merging this pull request may close these issues.

1 participant