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(m_Root, m_Data);
Changed();
}
public static IList <MerinoTreeElement> GetData()
{
// init variables, create global tree root
var treeElements = new List <MerinoTreeElement>();
var root = new MerinoTreeElement("Root", -1, 0);
root.children = new List <TreeElement>();
treeElements.Add(root);
// ok, now let's load the data
// then go through each file and get nodes for it, adding folder nodes as appropriate
int nodeID = 1;
for (int i = 0; i < MerinoData.CurrentFiles.Count; i++)
{
var yarnFile = MerinoData.CurrentFiles[i];
// v0.5.4, handle if yarn file might've been deleted
if (yarnFile == null)
{
MerinoData.CurrentFiles.RemoveAt(i);
i--;
continue;
}
// all folders are now created, let's add the yarn data now
var yarnData = GetDataFromFile(yarnFile, nodeID);
// set the file node's parent to root
yarnData[0].parent = root;
root.children.Add(yarnData[0]);
// add all data to tree elements
treeElements.AddRange(yarnData);
nodeID += yarnData.Count;
}
// IMPORTANT: sort the treeElements by id!!!
treeElements = treeElements.OrderBy(x => x.id).ToList();
// if there's already parent data then I don't really know what the depth value is used for (a cache to speed up GUI drawing?)
// but I think we're supposed to do this thing so let's do it
TreeElementUtility.UpdateDepthValues(root);
MerinoData.TreeElements = treeElements;
return(MerinoData.TreeElements);
}
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(m_Root, m_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(m_Root, m_Data);
Changed();
}
