On Sunday, 29 July 2012 at 10:34:50 UTC, Dmitry Olshansky wrote:
Might be a third option: A template struct that represents a
BitArray type (with 90% of the code); you then insert a
structure with key functions that would handle the
value/reference & duplication part.
Sounds a lot like mixin template. I'd try to invent some small
set of primitive operations and auto-magically construct the
others from it.
Pretty much... syntactical sugar, just add tea (T) I made a
funny! :D
I'll meditate on it for a few days and see if anything pops up.
And just to keep your mind busy :) how about adding SIMD to
speed it all up:
http://dlang.org/simd.html
It's kind of new & cool thing but not very well documented.
Mmm I'll look it over. If it can work for larger bulk operations
I don't see why not.
