[Mono-list] List.FindAll method implementation

[Juan C. Olivares]

Miguel:

Anyway, the problem with this memory, as I said, is that we need to set it
to zero (I didn't find something like memset). So I did

(*ptr) = 0;

every time we change the value of ptr (value of the pointer). That's really
slow, event more than the old method.

Ok these are the results.. ten calls to FindAll in a list of 100,000
elements:

old method:             00.0913660
bool array method:      00.0903360
bit array method:       00.0847300
heap bit method:        00.0977530

JCO
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.ximian.com/pipermail/mono-list/attachments/20070320/cd719569/attachment.html