> Google ate my e-mail. :-)
:)
> Also your code to iterate the bitarray is still inefficient. You check the
> leading zeros in an uint but then you iterate the bits one by one over that
> to iterate over all set bits. This should be faster:
Using bit arrays seems like such an antiquated method. I mean it’s certainly
somewhat memory-friendly (in that it’s compact, minimal L2 contention), avoids
pointers, etc, but what are some alternatives? I mean, I could certainly
imagine a lock-free version that has nice properties and is still essentially a
bit array for book-keeping, but I don’t have broader intuition. I have to
imagine they ported simply because that’s what the old code does/did.
Getting it working is certainly first priority, but I’m just curious what the
thoughts are on them.
Cheers!
Sean
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
BRL-CAD Developer mailing list
brlcad-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/brlcad-devel
