static IndexPath StartPath(IndexPath path, int length) { List <int> subPath = new List <int>(); for (int i = 0; i < length; i++) { subPath.Add(path.GetAt(i)); } return(new IndexPath(subPath)); }
private object GetData(SelectionModel selectionModel, IndexPath indexPath) { var data = selectionModel.Source; for (int i = 0; i < indexPath.GetSize(); i++) { var listData = data as IList; data = listData[indexPath.GetAt(i)]; } return(data); }
static bool IsSubSet(IndexPath path, IndexPath subset) { bool isSubset = true; for (int i = 0; i < subset.GetSize(); i++) { isSubset = path.GetAt(i) == subset.GetAt(i); if (!isSubset) { break; } } return(isSubset); }
private bool AreEqual(IndexPath a, IndexPath b) { if (a.GetSize() != b.GetSize()) { return(false); } for (int i = 0; i < a.GetSize(); i++) { if (a.GetAt(i) != b.GetAt(i)) { return(false); } } return(true); }
public 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); } } }
static bool IsSubSet(IndexPath path, IndexPath subset) { var subsetSize = subset.GetSize(); if (path.GetSize() < subsetSize) { return(false); } for (int i = 0; i < subsetSize; i++) { if (path.GetAt(i) != subset.GetAt(i)) { return(false); } } return(true); }
public static void TraverseRangeRealizeChildren( SelectionNode root, IndexPath start, IndexPath end, Action <TreeWalkNodeInfo> nodeAction) { Debug.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 */ (node, path, depth, 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.Last(); pendingNodes.RemoveLast(); 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; } } }