We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Create new LinkedHashSet and populate it with 2 objects.
Set<Object> set = new LinkedHashSet<>(); set.add(new Object()); set.add(new Object());
Then make deep clone of if
Cloner cloner = new Cloner(); Set<Object> clone = cloner.deepClone(set);
And finnaly pick the first item and try to check if cloned set contains it (or even remove it from there)
Object first = clone.toArray()[0]; clone.contains(first); // returns false clone.remove(first); // also returns false and leave set unchanged
PS. It only affects java.util.LinkedHashSet, java.util.HashSet works well, as expected.
The text was updated successfully, but these errors were encountered:
Successfully merging a pull request may close this issue.
Create new LinkedHashSet and populate it with 2 objects.
Then make deep clone of if
And finnaly pick the first item and try to check if cloned set contains it (or even remove it from there)
PS.
It only affects java.util.LinkedHashSet, java.util.HashSet works well, as expected.
The text was updated successfully, but these errors were encountered: