|
|
|
|
|
|
by Zooper
2680 days ago
|
|
|
I'd prototyped this solution as well for deep object comparisons, storing the hash in a weakmap, so hashes could be garbage collected as the Objects themselves, which act as keys, are collected; this also solves any potential infinite recursion, as the same object key points to the same value, and you could terminate after a collision there. That said, why are we doing this and where is our native isEqual method? |
|
|