> > Have you looked at these types?
> > System.ComponentModel.BindingList<T>
[quoted text clipped - 7 lines]
> Sort(Comparison) methods without too much hacking? They're not
> essential, but would come in handy for a couple of situations.
Find is pretty trivial to write - just apply the predicate to each
element in turn until you find a match.
Sort requires a bit more work, i.e. a real sort algorithm. Far from
impossible, but probably not worth doing until you actually need them.

Signature
Jon Skeet - <skeet@pobox.com>
http://www.pobox.com/~skeet Blog: http://www.msmvps.com/jon.skeet
World class .NET training in the UK: http://iterativetraining.co.uk
Mike D Sutton - 19 Mar 2008 19:00 GMT
> Sort requires a bit more work, i.e. a real sort algorithm. Far from
> impossible, but probably not worth doing until you actually need them.
Sort happens very infrequently at the moment and generally on pretty short lists (20 or so items), so for the time being
I guess I could simply create a List<T> internally, copy everything to it, perform the sort there then move everything
back. Bit on the ugly side, but cheap and cheesy for now until I get time to port in a Comparison based QuickSort.
Thanks again,
Mike