public void AddElements(IList <T> elements, TreeElement parent, int insertPosition)
{
if (elements == null)
{
throw new ArgumentNullException("elements", "elements is null");
}
if (elements.Count == 0)
{
throw new ArgumentNullException("elements", "elements Count is 0: nothing to add");
}
if (parent == null)
{
throw new ArgumentNullException("parent", "parent is null");
}
if (parent.Children == null)
{
parent.Children = new List <TreeElement>();
}
parent.Children.InsertRange(insertPosition, elements.Cast <TreeElement>());
foreach (var element in elements)
{
element.Parent = parent;
element.Depth = parent.Depth + 1;
TreeElementUtility.UpdateDepthValues(element);
}
TreeElementUtility.TreeToList(Root, _data);
Changed();
}
public static void TestTreeToListWorks()
{
// Arrange
var root = new TestElement("root", -1);
root.Children = new List <TreeElement>();
root.Children.Add(new TestElement("A", 0));
root.Children.Add(new TestElement("B", 0));
root.Children.Add(new TestElement("C", 0));
root.Children[1].Children = new List <TreeElement>();
root.Children[1].Children.Add(new TestElement("Bchild", 1));
root.Children[1].Children[0].Children = new List <TreeElement>();
root.Children[1].Children[0].Children.Add(new TestElement("Bchildchild", 2));
// Test
var result = new List <TestElement>();
TreeElementUtility.TreeToList(root, result);
// Assert
string[] namesInCorrectOrder = { "root", "A", "B", "Bchild", "Bchildchild", "C" };
Assert.AreEqual(namesInCorrectOrder.Length, result.Count, "Result count is not match");
for (var i = 0; i < namesInCorrectOrder.Length; ++i)
{
Assert.AreEqual(namesInCorrectOrder[i], result[i].Name);
}
TreeElementUtility.ValidateDepthValues(result);
}
public void MoveElements(TreeElement parentElement, int insertionIndex, List <TreeElement> elements)
{
if (insertionIndex < 0)
{
throw new ArgumentException(
"Invalid input: insertionIndex is -1, client needs to decide what index elements should be reparented at");
}
// Invalid reparenting input
if (parentElement == null)
{
return;
}
// We are moving items so we adjust the insertion index to accomodate that any items above the insertion index is removed before inserting
if (insertionIndex > 0)
{
insertionIndex -= parentElement.Children.GetRange(0, insertionIndex).Count(elements.Contains);
}
// Remove draggedItems from their parents
foreach (var draggedItem in elements)
{
draggedItem.Parent.Children.Remove(draggedItem); // remove from old parent
draggedItem.Parent = parentElement; // set new parent
}
if (parentElement.Children == null)
{
parentElement.Children = new List <TreeElement>();
}
// Insert dragged items under new parent
parentElement.Children.InsertRange(insertionIndex, elements);
TreeElementUtility.UpdateDepthValues(Root);
TreeElementUtility.TreeToList(Root, _data);
Changed();
}
public void RemoveElements(IList <T> elements)
{
foreach (var element in elements)
{
if (element == Root)
{
throw new ArgumentException("It is not allowed to remove the root element");
}
}
var commonAncestors = TreeElementUtility.FindCommonAncestorsWithinList(elements);
foreach (var element in commonAncestors)
{
element.Parent.Children.Remove(element);
element.Parent = null;
}
TreeElementUtility.TreeToList(Root, _data);
Changed();
}
public void AddElement(T element, TreeElement parent, int insertPosition)
{
if (element == null)
{
throw new ArgumentNullException("element", "element is null");
}
if (parent == null)
{
throw new ArgumentNullException("parent", "parent is null");
}
if (parent.Children == null)
{
parent.Children = new List <TreeElement>();
}
parent.Children.Insert(insertPosition, element);
element.Parent = parent;
TreeElementUtility.UpdateDepthValues(parent);
TreeElementUtility.TreeToList(Root, _data);
Changed();
}
