C# Sortable collection which allows duplicate keys

by

Use your own IComparer!

Like already stated in some other answers, you should use your own comparer class. For this sake I use a generic IComparer class, that works with anything that implements IComparable:

/// <summary>
/// Comparer for comparing two keys, handling equality as beeing greater
/// Use this Comparer e.g. with SortedLists or SortedDictionaries, that don't allow duplicate keys
/// </summary>
/// <typeparam name="TKey"></typeparam>
public class DuplicateKeyComparer<TKey>
                :
             IComparer<TKey> where TKey : IComparable
{
    #region IComparer<TKey> Members

    public int Compare(TKey x, TKey y)
    {
        int result = x.CompareTo(y);

        if (result == 0)
            return 1; // Handle equality as being greater. Note: this will break Remove(key) or
        else          // IndexOfKey(key) since the comparer never returns 0 to signal key equality
            return result;
    }

    #endregion
}

You will use it when instancing a new SortedList, SortedDictionary etc:

SortedList<int, MyValueClass> slist = new SortedList<int, MyValueClass>(new DuplicateKeyComparer<int>());

Here int is the key that can be duplicate.

More Related Contents:

  1. Creating a blocking Queue in .NET?
  2. What’s the best way of implementing a thread-safe Dictionary?
  3. What’s the difference between SortedList and SortedDictionary?
  4. Bidirectional 1 to 1 Dictionary in C#
  5. .NET HashTable Vs Dictionary – Can the Dictionary be as fast?
  6. C# Set collection?
  7. Collection versus List what should you use on your interfaces?
  8. Is there a built-in method to compare collections?
  9. ReadOnlyCollection or IEnumerable for exposing member collections?
  10. How to check if IEnumerable is null or empty?
  11. Is there anything like asynchronous BlockingCollection?
  12. Is there a Lower Bound function on a SortedList?
  13. What .NET collection provides the fastest search
  14. Does List guarantee insertion order?
  15. The opposite of Intersect()
  16. When to use a SortedList over a SortedDictionary?
  17. Does the Enumerator of a Dictionary return key value pairs in the order they were added?
  18. Does C# have a way of giving me an immutable Dictionary?
  19. Thread safe collections in .NET
  20. Initial capacity of collection types, e.g. Dictionary, List
  21. C# List – Removing items while looping / iterating [duplicate]
  22. Returning ‘IList’ vs ‘ICollection’ vs ‘Collection’
  23. Is it possible to create some IGrouping object
  24. IEnumerable and order
  25. What’s Wrong with an ArrayList?
  26. How to get random values from array in C# [duplicate]
  27. Determine if a number can be made with prepicked numbers and times
  28. Is there a C# case insensitive equals operator?
  29. Create dynamic buttons in a grid layout – Create a magic square UI
  30. How to use multi color in richtextbox [duplicate]

Leave a Comment