[Mono-list] List.FindAll method implementation

[Juan C. Olivares]

Nice idea but..

Some results:

100 elements:
old method:             00:00:00.0126610 (26x)
stackalloc bit method:  00:00:00.0004750 (1x)
array bit method:       00:00:00.0010700 (2x)
heap bit method:        00:00:00.0038830 (8x)

1,000 elements:
old method:             00:00:00.0139250 (24x)
stackalloc bit method:  00:00:00.0005670 (1x)
array bit method:       00:00:00.0010890 (2x)
 heap bit method:        00:00:00.0034920 (6x)

10,000 elements:
 old method:             00:00:00.0136110 (12x)
stackalloc bit method:  00:00:00.0011240 (1x)
array bit method:       00:00:00.0016450 (1.4x)
heap bit method:        00:00:00.0043110 (3x)

50,000 elements:
old method:             00:00:00.0175970 (3x)
stackalloc bit method:  00:00:00.0085630 (1.5x)
array bit method:       00:00:00.0055010 (1x)
heap bit method:        00:00:00.0099590 (1.8x)

 100,000 elements:
old method:             00:00:00.0210330 (2x)
array bit method:       00:00:00.0100430 (1x)
heap bit method:        00:00:00.0154150 (1.5x)

 1,000,000 elements:
old method:             00:00:00.1243730 (1.2x)
 array bit method:       00:00:00.0973110 (1x)
heap bit method:        00:00:00.1285650 (1.3x)

10,000,000 elements:
old method:             00:00:00.9252570 (1x)
array bit method:       00:00:00.9632300 ( 1.05x)
heap bit method:        00:00:01.1098490 (1.20x)


I think the "heap bit" method is not that good :)

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