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

Possible optimization: hashing #19

Closed
LifeIsStrange opened this issue Dec 7, 2021 · 2 comments
Closed

Possible optimization: hashing #19

LifeIsStrange opened this issue Dec 7, 2021 · 2 comments

Comments

@LifeIsStrange
Copy link

Leverage hashing for detecting change much much faster than a deep comparison?
And microdiff would have optionally a backing buffer/cache of previous object hashes?

@denis-bel
Copy link
Contributor

What do you propose to hash? If I understand you, you want to hash objects and compare hashes, and only if hashes are different, do comparison?

@AsyncBanana
Copy link
Owner

I think the user should do this themselves because this would increase code size, and for many things, a lack of changes is unlikely enough that the disadvantages outweigh the advantages.

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

3 participants