internal static void Traverse(
SelectionNode root,
bool realizeChildren,
Action <TreeWalkNodeInfo> nodeAction)
{
var pendingNodes = new List <TreeWalkNodeInfo>();
var current = new IndexPath(null);
pendingNodes.Add(new TreeWalkNodeInfo(root, current));
while (pendingNodes.Count > 0)
{
var nextNode = pendingNodes[pendingNodes.Count - 1];
pendingNodes.RemoveAt(pendingNodes.Count - 1);
int count = realizeChildren ? nextNode.Node.DataCount : nextNode.Node.ChildrenNodeCount;
for (int i = count - 1; i >= 0; i--)
{
SelectionNode child = nextNode.Node.GetAt(i, realizeChildren);
var childPath = nextNode.Path.CloneWithChildIndex(i);
if (child != null)
{
pendingNodes.Add(new TreeWalkNodeInfo(child, childPath, nextNode.Node));
}
}
// Queue the children first and then perform the action. This way
// the action can remove the children in the action if necessary
nodeAction(nextNode);
}
}
public SelectionModel()
{
// Parent is null for root node.
m_rootNode = new SelectionNode(this, null /* parent */);
// Parent is null for leaf node since it is shared. This is ok since we just
// use the leaf as a placeholder and never ask stuff of it.
m_leafNode = new SelectionNode(this, null /* parent */);
}
internal SelectionNode(SelectionModel manager, SelectionNode parent)
{
m_manager = manager;
m_parent = parent;
// TODO: MZ: What?
//m_source = manager;
//m_dataSource = manager;
m_source = null;
m_dataSource = null;
}
internal static void TraverseIndexPath(
SelectionNode root,
IndexPath path,
bool realizeChildren,
Action <SelectionNode, IndexPath, int /*depth*/, int /*childIndex*/> nodeAction)
{
var node = root;
for (int depth = 0; depth < path.GetSize(); depth++)
{
int childIndex = path.GetAt(depth);
nodeAction(node, path, depth, childIndex);
if (depth < path.GetSize() - 1)
{
node = node.GetAt(childIndex, realizeChildren);
}
}
}
internal static void TraverseRangeRealizeChildren(
SelectionNode root,
IndexPath start,
IndexPath end,
Action <TreeWalkNodeInfo> nodeAction)
{
MUX_ASSERT(start.CompareTo(end) == -1);
var pendingNodes = new List <TreeWalkNodeInfo>();
IndexPath current = start;
// Build up the stack to account for the depth first walk up to the
// start index path.
TraverseIndexPath(
root,
start,
true, /* realizeChildren */
(SelectionNode node, IndexPath path, int depth, int childIndex) =>
{
var currentPath = StartPath(path, depth);
bool isStartPath = IsSubSet(start, currentPath);
bool isEndPath = IsSubSet(end, currentPath);
int startIndex = depth < start.GetSize() && isStartPath ? Math.Max(0, start.GetAt(depth)) : 0;
int endIndex = depth < end.GetSize() && isEndPath ? Math.Min(node.DataCount - 1, end.GetAt(depth)) : node.DataCount - 1;
for (int i = endIndex; i >= startIndex; i--)
{
var child = node.GetAt(i, true /* realizeChild */);
if (child != null)
{
var childPath = currentPath.CloneWithChildIndex(i);
pendingNodes.Add(new TreeWalkNodeInfo(child, childPath, node));
}
}
});
// From the start index path, do a depth first walk as long as the
// current path is less than the end path.
while (pendingNodes.Count > 0)
{
var info = pendingNodes[pendingNodes.Count - 1];
pendingNodes.RemoveAt(pendingNodes.Count - 1);
int depth = info.Path.GetSize();
bool isStartPath = IsSubSet(start, info.Path);
bool isEndPath = IsSubSet(end, info.Path);
int startIndex = depth < start.GetSize() && isStartPath?start.GetAt(depth) : 0;
int endIndex = depth < end.GetSize() && isEndPath?end.GetAt(depth) : info.Node.DataCount - 1;
for (int i = endIndex; i >= startIndex; i--)
{
var child = info.Node.GetAt(i, true /* realizeChild */);
if (child != null)
{
var childPath = info.Path.CloneWithChildIndex(i);
pendingNodes.Add(new TreeWalkNodeInfo(child, childPath, info.Node));
}
}
nodeAction(info);
if (info.Path.CompareTo(end) == 0)
{
// We reached the end index path. stop iterating.
break;
}
}
}
internal TreeWalkNodeInfo(SelectionNode node, IndexPath indexPath)
{
Node = node;
Path = indexPath;
ParentNode = null;
}
internal TreeWalkNodeInfo(SelectionNode node, IndexPath indexPath, SelectionNode parent)
{
Node = node;
Path = indexPath;
ParentNode = parent;
}
