public void IndexTest()
{
Assert.AreEqual(Tree.Count, InitialCount);
RBOrderedTreeNode <string> node = Tree.Find("005");
Assert.AreEqual("005", node.Key);
node = Tree.GetByOrder(0);
Assert.AreEqual("001", node.Key);
node = Tree.GetByOrder(4);
Assert.AreEqual("005", node.Key);
node = Tree.GetByOrder(2);
Assert.AreEqual("003", node.Key);
node = Tree.GetByOrder(5);
Assert.AreEqual("006", node.Key);
node = Tree.GetByOrder(7);
Assert.AreEqual("008", node.Key);
}
public bool MovePrev()
{
if (this.position == null)
{
return(false);
}
if (this.binaryMode)
{
RBOrderedTreeNode <GanttViewDataItem> rbOrderedTreeNode = this.items.rbTree.Previous((RBOrderedTreeNode <GanttViewDataItem>) this.position);
if (rbOrderedTreeNode != null)
{
this.current = rbOrderedTreeNode.Key;
this.position = (object)rbOrderedTreeNode;
return(true);
}
this.current = (GanttViewDataItem)null;
return(false);
}
int index = (int)this.position - 1;
if (index >= 0 && index < this.items.Count)
{
this.current = this.items[index];
this.position = (object)index;
return(true);
}
this.current = (GanttViewDataItem)null;
return(false);
}
public bool MoveNext()
{
if (this.position == null)
{
return(false);
}
if (this.binaryMode)
{
RBOrderedTreeNode <RadTreeNode> rbOrderedTreeNode = this.items.rbTree.Next((RBOrderedTreeNode <RadTreeNode>) this.position);
if (rbOrderedTreeNode != null)
{
this.current = rbOrderedTreeNode.Key;
this.position = (object)rbOrderedTreeNode;
return(true);
}
this.current = (RadTreeNode)null;
return(false);
}
int index = (int)this.position + 1;
if (index < this.items.Count)
{
this.current = this.items[index];
this.position = (object)index;
return(true);
}
this.current = (RadTreeNode)null;
return(false);
}
//[ExpectedException(typeof(IndexOutOfRangeException), "A negative index was inappropriately allowed.")]
public void NegativeIndexTest()
{
RBOrderedTreeNode <string> node = Tree.GetByOrder(-1);
Assert.IsNull(node, "A negative index was inappropriately allowed.");
Reverse();
node = Tree.GetByOrder(-1);
Assert.IsNull(node, "A negative index was inappropriately allowed.");
}
//[ExpectedException(typeof(IndexOutOfRangeException), "A negative index was inappropriately allowed.")]
public void ZeroIndexTest()
{
Tree.Clear();
RBOrderedTreeNode <string> node = Tree.GetByOrder(0);
Assert.IsNull(node);
Reverse();
node = Tree.GetByOrder(0);
Assert.IsNull(node);
}
//[ExpectedException(typeof(IndexOutOfRangeException), "A index grater then size of the collection was inappropriately allowed.")]
public void CountIndexTest()
{
RBOrderedTreeNode <string> node = Tree.GetByOrder(Tree.Count);
Assert.IsNull(node, "A index grater then size of the collection was inappropriately allowed.");
node = Tree.GetByOrder(Tree.Count - 1);
Assert.AreEqual("010", node.Key);
Reverse();
node = Tree.GetByOrder(Tree.Count - 1);
Assert.AreEqual("001", node.Key);
}
public void ReverseTest()
{
Assert.AreEqual(InitialCount, Tree.Count);
Reverse();
Assert.AreEqual(InitialCount, Tree.Count);
RBOrderedTreeNode <string> node = Tree.Find("005");
Assert.AreEqual("005", node.Key);
node = Tree.GetByOrder(0);
Assert.AreEqual("010", node.Key);
node = Tree.GetByOrder(4);
Assert.AreEqual("006", node.Key);
node = Tree.GetByOrder(9);
Assert.AreEqual("001", node.Key);
}
