You probably have had the need to sort an ObservableCollection at some point in one of your applications by either ascending or descending order. Of course, you can always use the ObservableCollection.OrderBy and ObservableCollection.OrderByDescending, but these methods just return a new collection of IOrderedEnumerable, which forces you have to rebind the DataContext/ItemsSource in your UI, which could be a pain. So instead, wouldn’t it be nice to have an ObservableCollection that you could call a Sort method on, give it a lambda to sort on and a direction, then have it perform the sort without having to rebind to the UI. Well, it is not a difficult as you may think. So lets go ahead and write one.
public class SortableObservableCollection<T> : ObservableCollection<T> { public SortableObservableCollection(List<T> list) : base(list) { } public SortableObservableCollection(IEnumerable<T> collection) : base(collection) { } public void Sort<TKey>(Func<T, TKey> keySelector, System.ComponentModel.ListSortDirection direction) { switch (direction) { case System.ComponentModel.ListSortDirection.Ascending: { ApplySort(Items.OrderBy(keySelector)); break; } case System.ComponentModel.ListSortDirection.Descending: { ApplySort(Items.OrderByDescending(keySelector)); break; } } } public void Sort<TKey>(Func<T, TKey> keySelector, IComparer<TKey> comparer) { ApplySort(Items.OrderBy(keySelector, comparer)); } private void ApplySort(IEnumerable<T> sortedItems) { var sortedItemsList = sortedItems.ToList(); foreach (var item in sortedItemsList) { Move(IndexOf(item), sortedItemsList.IndexOf(item)); } } }
Now we can create a new SortableObservableCollection<T> and sort it either direction without having to return a new IOrderedEnumerable and rebind the DataContext/ItemsSource.
//sort ascending MySortableList.Sort(x => x.Name, ListSortDirection.Ascending); //sort descending MySortableList.Sort(x => x.Name, ListSortDirection.Descending);
When you sort your collection, the UI is notified that something has changed and updates itself automatically.
Isn’t it TERRIBLE unefficient to iterate over the sorted list, find the old & new index of each item, and them move it?
@Itay Sagui
Well, this isn’t a cure all, solve all solution. This is just one way to accomplish a common task. It is a simple implementation, so just about anyone can understand how it works. I use it on a simple read only list of objects that have only 2 properties, so I notice no problems with performance even with records of over 5,000. If you have a more efficient method please share your solution.
Thanks i saw this on http://social.msdn.microsoft.com/Forums/en-US/wpf/thread/5909dbcc-9a9f-4260-bc36-de4aa9bbd383 first but that didnt have ascending and descending.
You made my day! Thank you 🙂