| commit | e8f0e51f1aef21cb0cbfc99649732ed532e2defc | [log] [tgz] |
|---|---|---|
| author | Yuyang Huang <yuyanghuang@google.com> | Thu May 30 13:46:01 2024 +0000 |
| committer | Gerrit Code Review <noreply-gerritcodereview@google.com> | Thu May 30 13:46:01 2024 +0000 |
| tree | 239a766f6bf8cc4f70fa42d5b9012a1f475e5888 | |
| parent | 1f49ad7c0668b17fb510b3dcafb8f7d49fc8b5dd [diff] |
Revert "Use TreeSet in validateDeduplicateBytesList() for clarity and efficiency" This reverts commit 1f49ad7c0668b17fb510b3dcafb8f7d49fc8b5dd. Reason for revert: Just realized `new TreeSet<>((a, b) -> Arrays.equals(a, b) ? 0 : 1);` doesn't work, it break the assumption of RBT ordering so it can still result in duplication due to different insertion order. Change-Id: I54132d5addb950fca87a63f9009684eee243093c