child.Tree = tree;
child.SetParent (parent);
if (marked) {
- child.TrackViewState ();
+ ((IStateManager)child).TrackViewState ();
child.SetDirty ();
dirty = true;
}
for (int n=index+1; n<items.Count; n++)
((TreeNode)items[n]).Index = n;
if (marked) {
- child.TrackViewState ();
+ ((IStateManager)child).TrackViewState ();
child.SetDirty ();
dirty = true;
}
if (oi != -1) node = originalItems [oi];
else node = new TreeNode ();
if (dirty) Add (node);
- node.LoadViewState (pair.Second);
+ ((IStateManager)node).LoadViewState (pair.Second);
}
}
for (int n=0; n<items.Count; n++) {
TreeNode node = items[n] as TreeNode;
int oi = Array.IndexOf (originalItems, node);
- object ns = node.SaveViewState ();
+ object ns = ((IStateManager)node).SaveViewState ();
if (ns != null) hasData = true;
state [n + 1] = new Pair (oi, ns);
}
ArrayList list = new ArrayList ();
for (int n=0; n<items.Count; n++) {
TreeNode node = items[n] as TreeNode;
- object ns = node.SaveViewState ();
+ object ns = ((IStateManager)node).SaveViewState ();
if (ns != null) {
hasData = true;
list.Add (new Pair (n, ns));
originalItems = new TreeNode [items.Count];
for (int n=0; n<items.Count; n++) {
originalItems [n] = (TreeNode) items [n];
- originalItems [n].TrackViewState ();
+ ((IStateManager)originalItems [n]).TrackViewState ();
}
}