The enanchment is useful for applications that make heavy use of BitSet objects as sets of integers, and therefore they need to make a lot of calls to cardinality() method, which actually require linear time in the number of words in use by the bit set. This optimization reduces the cost of calling cardinality() to constant time, as it simply returns the value of the field, and it also try to make as little effort as possible to update the field, when needed.
Moreover, it has been implemented a new method for testing wheter a bit set includes another bit set (i.e., the set of true bits of the parameter is a subset of the true bits of the instance). ------------- Commit messages: - Removed trailing spaces - Format file - Format file - Formatted - Added this. in BitSet(long[]) - Merge branch 'openjdk:master' into patch-2 - Merge branch 'openjdk:master' into patch-2 - Merge branch 'openjdk:master' into patch-2 - Merge branch 'openjdk:master' into patch-2 - Merge branch 'openjdk:master' into patch-2 - ... and 31 more: https://git.openjdk.org/jdk/compare/5a9490a4...57940e7f Changes: https://git.openjdk.org/jdk/pull/11837/files Webrev: https://webrevs.openjdk.org/?repo=jdk&pr=11837&range=00 Issue: https://bugs.openjdk.org/browse/JDK-8300487 Stats: 569 lines in 2 files changed: 185 ins; 45 del; 339 mod Patch: https://git.openjdk.org/jdk/pull/11837.diff Fetch: git fetch https://git.openjdk.org/jdk pull/11837/head:pull/11837 PR: https://git.openjdk.org/jdk/pull/11837
