public void Add(string nodeValue)
{
var lastPos = ((Array)_list).Length;
var node = new KCDLNode();
node.Value = nodeValue;
Array.Resize<KCDLNode>(ref _list, lastPos + 1);
_list[lastPos] = node;
if (lastPos > 0)
{
_list[lastPos - 1].Next = _list[lastPos];
_list[lastPos].Previous = _list[lastPos - 1];
}
_list[0].Previous = _list[((Array)_list).Length - 1];
_list[((Array)_list).Length - 1].Next = _list[0];
}
public void Delete(KCDLNode node)
{
if (node == null)
{
throw new NullReferenceException("node");
}
if (this.Find(node.Value) == null)
{
throw new ArgumentOutOfRangeException(node.Value);
}
var clone = ((Array)_list).Clone();
var pos = 0;
KCDLNode nodeToReLinked = null;
_list = new KCDLNode[((Array)clone).Length - 1];
foreach (KCDLNode item in (Array)clone)
{
if (!node.Equals(item))
{
_list[pos] = item;
nodeToReLinked = _list[pos];
_list[pos].Previous = pos.Equals(0) ? null : _list[pos - 1];
pos++;
}
else
{
if (nodeToReLinked != null)
{
nodeToReLinked.Next = item.Next;
}
}
}
if (!((Array)_list).Length.Equals(0))
{
_list[0].Previous = _list[((Array)_list).Length - 1];
_list[((Array)_list).Length - 1].Next = _list[0];
}
}