-
Enhancement
-
Resolution: Not an Issue
-
P4
-
None
-
None
-
generic
-
generic
A DESCRIPTION OF THE PROBLEM :
According to current JEP-401 draft (https://bugs.openjdk.org/browse/JDK-8251554),
"two large trees of value objects can take unbounded time to compute == potentially a DoS attack risk".
It would be good to have equality method limited by field depth and duration. It can only be "false positive" - return true for some different objects.
According to current JEP-401 draft (https://bugs.openjdk.org/browse/JDK-8251554),
"two large trees of value objects can take unbounded time to compute == potentially a DoS attack risk".
It would be good to have equality method limited by field depth and duration. It can only be "false positive" - return true for some different objects.
- relates to
-
JDK-8296186 [lworld] explore acmp algorithm to determine two object graphs are "equivalance"
-
- Open
-