Ned Wolpert wrote:
<snip>
>The real issue is that looking for performance gains is a constant.
We can always try to make things faster. We have to decide what is
acceptable performance for a given release. (I'm currently getting
acceptable performance myself, so I may not be one to judge... though
once lazy collections are less-likely to deadlock in a multi-threaded
environment for me, then I'll have even better performance.)
O(N) = N where N = number of child objects. is ok IMO
O(N) = N(1)*N(2)*...*N(n) is where N(n) = number of objects for a nth child class. Is NOT ok IMO.
Regards
Jan H. Hansen
