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

Add optional replace algorithm based on previous and current nodes #356

Merged
merged 1 commit into from
May 28, 2019

Conversation

agubler
Copy link
Member

@agubler agubler commented May 27, 2019

Type: feature

The following has been addressed in the PR:

Description:

Adds a replace algorithm to use when the previous nodes where all keyed and none of the keys are in the next nodes.

Resolves #351

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.

Determine optimal algorithm when process VDom arrays
2 participants