CODEWITHSUNDEEP
c#javatreemapequivalent
user58817
user58817

Reputation:

Java TreeMap equivalent in C#?

Most places I've consulted say to use SortedList, but the problem is that the program I'm porting actually uses duplicate keys (differentiated by order), which is permissible with TreeMap, but not SortedList.

Any advice?

Upvotes: 25

Views: 36828

Answers (4)

Hrishabh Gupta
Hrishabh Gupta

Reputation: 1978

Generally use the sorted set

public class ItemComparer : IComparer<int[]>
{
    public int Compare(int[] item1, int[] item2)
    {
        if (item1[0] != item2[0]) return item1[0].CompareTo(item2[0]);
        return item1[1].CompareTo(item2[1]);
    }
}
var s = new SortedSet<int[]>(new ItemComparer());

Upvotes: 0

AHHP
AHHP

Reputation: 3047

Does SortedDictionary class help?

Upvotes: 22

sbeskur
sbeskur

Reputation: 2290

Another great implementation of a Red Black Tree in .NET can be found here: http://www.itu.dk/research/c5/

Upvotes: 4

AnthonyWJones
AnthonyWJones

Reputation: 189485

I don't think C# has one natively. However there are plenty of examples of Red-Black implementations out there. Here is one:-

http://www.codeproject.com/KB/recipes/redblackcs.aspx

Upvotes: 1

Related Questions