On Wed, 19 Sep 2018, Steven Bosscher wrote: > On Wed, Sep 19, 2018 at 3:06 PM Richard Biener wrote: > > If we'd only had a O(log n) search sparse bitmap implementation ... > > (Steven posted patches to switch bitmap from/to such one but IIRC > > that at least lacked bitmap_first_set_bit). > > But bitmap_first_set_bit would be easy to implement. Just take the > left-most node of the splay tree. > > Actually all bit-tests would be easy to implement. It's only > enumeration and set operations on the tree-views that would be > complicated fluff (easier to "switch views" than re-implement). > > Impressive that you remember >5yr old patches like that ;-)
;) Well, it's still useful (but obviously doesn't apply). Not sure iff the worst-case behavior of splay-trees makes it a pointless exercise though ;) Richard.
