[Issue 10239] New: Efficient bitcount for std.bitmanip.BitArray

Sun Jun 2 05:10:05 PDT 2013

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 at puremagic.com
        ReportedBy: bearophile_hugs at eml.cc

--- Comment #0 from bearophile_hugs at 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: -------