DateTime as key in a SortedDictionary<K, V>

Question

Can I safely use DateTime as a key in a SortedDictionary<K, V> without implementing my own IComparer?

I've tried it and sort order is maintained and importantly for my purpose the .ContainsKey<T> method works as expected. But I just want to double check before committing myself down this road.

Update: Thanks for clearing that up folks. All good answers.

Cheers
Kev

Answer 1

you will not need a new IComparer. your default IComparer will use the GetHashCode() from your value object and compare/sort with that. Since the DateTime type implements the GetHashCode() correctly, the default IComparer will sort as you want it to (like you have discovered).

creating new comparer's is more for complex collections that you may have written yourself. i wrote a complex comparer once. it's a bit mind blowing.

Answer 2

I don't foresee any problems; behind the scenes the value is a long tick value.

Also, ensure that all of the values are based in the same time zone - personally I use UTC/GMT for storing and calculating and only adjust to local time when displaying.

Answer 3

I works well because DateTime implements IComparable<DateTime>. So you can rely in the Comparer(T).Default.

Internally, the DateTime uses ticks to compare 2 dates.