RFR: 8300487: Store cardinality as a field in BitSet [v2]

[fabioromano1]

> 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).

fabioromano1 has updated the pull request incrementally with one additional commit since the last revision:

  Added author to includes(BitSet)

-------------

Changes:
  - all: https://git.openjdk.org/jdk/pull/11837/files
  - new: https://git.openjdk.org/jdk/pull/11837/files/57940e7f..d06ed69d

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=11837&range=01
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=11837&range=00-01

  Stats: 2 lines in 1 file changed: 1 ins; 0 del; 1 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