> > An interesting question is, how can you identify bitmaps that could > benefit from viewing it as a tree (at least for some time). I have no > ideas here. Something with detailed memory stats, of course, but then > how to derive some measure for a trade-off between list or tree view. > Thoughts?
Well, I guess we can simply accumulate the counter on linked list walks (when the one element cache is missed) and divide it by number of iterations. Where this number thends to grow and not be counstant bounded, we have nonlinear behaviour, right? Honza
