public object Clone()
{
SRTree tmp = new SRTree();
if (this.LeftList != null)
{
tmp.LeftList = this.LeftList.Clone() as ArrayList;
}
if (this.RightList != null)
{
tmp.RightList = this.RightList.Clone() as ArrayList;
}
return(tmp);
}
/// <summary>
/// Merge the right lists of passed tree and current tree.
/// </summary>
/// <param name="tree"></param>
public void Merge(SRTree tree)
{
if (tree == null)
{
tree = new SRTree();
}
if (tree.RightList == null)
{
tree.RightList = new ArrayList();
}
if (this.RightList != null)
{
IEnumerator en = this.RightList.GetEnumerator();
while (en.MoveNext())
{
if (!tree.RightList.Contains(en.Current))
{
tree.RightList.Add(en.Current);
}
}
}
}
public object Clone()
{
SRTree tmp = new SRTree();
if (this.LeftList != null)
tmp.LeftList = this.LeftList.Clone() as ArrayList;
if (this.RightList != null)
tmp.RightList = this.RightList.Clone() as ArrayList;
return tmp;
}
public QueryContext(Topologies.Local.LocalCacheBase cache)
{
_cache = cache;
_tree = new SRTree();
}
/// <summary>
/// Merge the right lists of passed tree and current tree.
/// </summary>
/// <param name="tree"></param>
public void Merge(SRTree tree)
{
if (tree == null)
tree = new SRTree();
if (tree.RightList == null)
tree.RightList = new ArrayList();
if (this.RightList != null)
{
IEnumerator en = this.RightList.GetEnumerator();
while (en.MoveNext())
{
if (!tree.RightList.Contains(en.Current))
tree.RightList.Add(en.Current);
}
}
}