override public System.Web.UI.WebControls.TreeNode AddNode(
System.Web.UI.WebControls.TreeNodeCollection Nodes,
System.Web.UI.WebControls.TreeNode NewNode,
tree_node T_N)
{
if (Nodes.Equals(tree.Nodes) && (T_N != null))
{
//searches the right node into which do the additon
DataRow R = T_N.Row;
int skind = Convert.ToInt32(R["flag"]);
string kind;
if ((skind & 1) == 1)
{
kind = "S";
}
else
{
kind = "E";
}
foreach (System.Web.UI.WebControls.TreeNode N in Nodes)
{
if (N.Text == kind)
{
return(base.AddNode(N.ChildNodes, NewNode, T_N));
}
}
}
return(base.AddNode(Nodes, NewNode, T_N));
}
public static System.Web.UI.WebControls.TreeNode GetNodeFromPath(System.Web.UI.WebControls.TreeNodeCollection tree, string path)
{
System.Web.UI.WebControls.TreeNode retval = null;
string[] nodes = path.Split('/');
for (int i = 0; i < nodes.Length; i++)
{
for (int j = 0; j < tree.Count; j++)
{
if (tree[j].Value == nodes[i])
{
if (i == nodes.Length - 1)
{
retval = tree[j];
}
else
{
tree = tree[j].ChildNodes;
}
break;
}
}
}
return(retval);
}
public override System.Web.UI.WebControls.TreeNode AddNode(System.Web.UI.WebControls.TreeNodeCollection Nodes, System.Web.UI.WebControls.TreeNode NewNode, tree_node T_N)
{
if (Nodes.Equals(tree.Nodes) && (T_N != null) && (tree.Nodes.Count > 0))
{
if (GetTag(tree.Nodes[0]) == null)
{
return(base.AddNode(tree.Nodes[0].ChildNodes, NewNode, T_N));
}
}
return(base.AddNode(Nodes, NewNode, T_N));
}
override public System.Web.UI.WebControls.TreeNode AddNode(System.Web.UI.WebControls.TreeNodeCollection Nodes, System.Web.UI.WebControls.TreeNode NewNode, tree_node T_N)
{
if (Nodes.Equals(tree.Nodes) && (T_N != null))
{
foreach (System.Web.UI.WebControls.TreeNode N in Nodes)
{
if (N.Text == "Causale")
{
return(base.AddNode(N.ChildNodes, NewNode, T_N));
}
}
}
return(base.AddNode(Nodes, NewNode, T_N));
}
override public System.Web.UI.WebControls.TreeNode AddNode(
System.Web.UI.WebControls.TreeNodeCollection Nodes,
System.Web.UI.WebControls.TreeNode NewNode,
tree_node T_N)
{
if (Nodes.Equals(tree.Nodes) && (T_N != null))
{
//searches the right node into which do the additon
DataRow R = T_N.Row;
string kind = R["finpart"].ToString();
foreach (System.Web.UI.WebControls.TreeNode N in Nodes)
{
if (N.Text == kind)
{
return(base.AddNode(N.ChildNodes, NewNode, T_N));
}
}
}
return(base.AddNode(Nodes, NewNode, T_N));
}
