June 02, 2013 [Issue 10239] New: Efficient bitcount for std.bitmanip.BitArray | ||||
---|---|---|---|---|
| ||||
http://d.puremagic.com/issues/show_bug.cgi?id=10239 Summary: Efficient bitcount for std.bitmanip.BitArray Product: D Version: D2 Platform: All OS/Version: All Status: NEW Severity: enhancement Priority: P2 Component: Phobos AssignedTo: nobody@puremagic.com ReportedBy: bearophile_hugs@eml.cc --- Comment #0 from bearophile_hugs@eml.cc 2013-06-02 05:10:04 PDT --- Split from Issue 4124. I suggest to add to BitArray a method to count set bits. There are _very_ efficient algorithms to do this. Optionally such member function should have two arguments to specify the start and ending points to count the bits into. See also Issue 10238 -- Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- |
Copyright © 1999-2021 by the D Language Foundation