Welcome to the Lounge

honey the codewitch wrote:

Sorted collections are supposed to enforce sorted order *always*

public void ChangeValue(Project ptochange, DateTime newdate)
{
    Projects.Value.Remove(ptochange);
    ptochange.DeadLine = newdate;  
    Projects.Value.Add(ptochange);
}

public class Project : IComparable
{
    public Project(string name, DateTime deadLine)
    {
        Name = name;
        DeadLine = deadLine;
    }

    public string Name { set; get; }
    public DateTime DeadLine { set; get; }

    public int CompareTo(object y)
    {
        if (ReferenceEquals(this, y)) return 0;
        if (ReferenceEquals(null, y)) return 1;

        return this.DeadLine.CompareTo(((Project)y).DeadLine);
    }
}

honey the codewitch wrote:

SortedXXXX flavor that doesn't sort on add or edit in .NET

honey the codewitch wrote:

when you remove and readd there will never be a new allocation because you just had a free slot

Starting with .NET Framework 4, the SortedSet<T> class provides a self-balancing tree that maintains data in sorted order after insertions, deletions, and searches. This class and the HashSet<T> class implement the ISet<T> interface.

class Node {
   public Node Left;
   public Node Right;
}

struct Node {
    public int LeftIndex;
    public int RightIndex;
}

Node[] m_nodeList;

honey the codewitch wrote:

I don't trust any SortedXXXXX implementation under the ComponentModel now after seeing that.

BillWoodruff wrote:

i began to get angry as my cherished image of myself as an expert debugger

BillWoodruff wrote:

the beast was doing what i told it to do

BillWoodruff wrote:

i think we need a new word for this special kind of bruised-ego chagrin mixed with plummeting self-esteem