New issue
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
Mutable BitSet does not provide efficient logical operations #5513
Comments
Imported From: https://issues.scala-lang.org/browse/SI-5513?orig=1 |
Christopher Sahnwaldt (jcsahnwaldt) said: |
@adriaanm said: |
Igor Petruk (igor-petruk) said: |
@JamesIry said: |
Denis Petrov (denis) said (edited on Dec 8, 2013 8:20:42 PM UTC): |
It works as expected in Scala 2.13.0 and implemented more less efficiently by direct accessing to underlying arrays of bit words:
It affects only Scala 2.12 or less:
Shouldn't the issue be closed as fixed? |
@joshlemer agree? |
@SethTisue agree |
The mutable BitSet does not expose mutating efficient logical operations like or, and, xor, and so on taking another BitSet.
I think those methods are an essential part of using mutable BitSets.
The text was updated successfully, but these errors were encountered: