public T[] ConvertToArray()
{
TwoWayListNode <T> current = head;
var countOfNodes = 1;
if (current == null)
{
var arr = new T[0];
return(arr);
}
while (current.Next != null)
{
if (current != null)
{
countOfNodes = countOfNodes + 1;
current = current.Next;
}
}
var array = new T[countOfNodes];
current = head;
for (var i = 0; i < array.Length; i++)
{
array[i] = current.Value;
current = current.Next;
}
return(array);
}
public T this[int index]
{
get
{
return(GetElementByIndex(index));
}
set
{
var node = new TwoWayListNode <T>(value);
TwoWayListNode <T> current = head;
for (var i = 0; i < index; i++)
{
if (current == null)
{
throw new ArgumentOutOfRangeException();
}
current = current.Next;
}
if (current == null)
{
return;
}
current.Value = node.Value;
}
}
/// insert value to end of list
public void Add(T value)
{
var node = new TwoWayListNode <T>(value);
if (head == null)
{
// empty collection
head = node;
}
else
{
// not empty collection
TwoWayListNode <T> current = head;
TwoWayListNode <T> previous = current.Previous;
while (current.Next != null)
{
if (current == null)
{
throw new ArgumentOutOfRangeException();
}
previous = current;
current = current.Next;
}
current.Next = node;
Count++;
}
}
public void AddAt(T value, int index)
{
var node = new TwoWayListNode <T>(value);
if (head != null && index != 0)
{
TwoWayListNode <T> current = head;
TwoWayListNode <T> previous = current.Previous;
for (var i = 0; i < index - 1; i++)
{
if (current == null)
{
throw new ArgumentOutOfRangeException();
}
previous = current;
current = current.Next;
}
node.Next = current.Next;
current.Next = node;
}
else if (head == null && index != 0)
{
throw new ArgumentOutOfRangeException();
}
else if (index == 0)
{
node.Next = head;
head = node;
}
}
public void Sort()
{
if (head == null)
{
return;
}
TwoWayListNode node1 = head;
TwoWayListNode node2 = head.Next;
int temp;
bool doubt = false;
do
{
doubt = false;
while (node1 != null && node1.Next != null)
{
if (node2.Value < node1.Value)
{
doubt = true;
temp = node1.Value;
node1.Value = node2.Value;
node2.Value = temp;
}
node1 = node1.Next;
node2 = node2.Next;
}
node1 = head;
node2 = node1.Next;
} while (doubt);
}
public bool Remove(T value)
{
TwoWayListNode <T> current = head;
if (current == null)
{
return(false);
}
TwoWayListNode <T> previous = current.Previous;
// 1: Пустой список: ничего не делать.
// 2: Один элемент: установить Previous = null.
// 3: Несколько элементов:
// a: Удаляемый элемент первый.
// b: Удаляемый элемент в середине или конце.
while (current != null)
{
if (current.Value.Equals(value))
{
/// Узел в середине или в конце.
if (current.Previous != null)
{
previous.Next = current.Next;
}
else
{
/// если удаляется первый элемент
/// переустанавливаем значение head
head = head.Next;
}
Count--;
return(true);
}
if (current.Next == null)
{
return(false);
}
previous = current;
current = current.Next;
current.Previous = previous;
}
return(false);
}
public T GetElementByIndex(int index)
{
TwoWayListNode <T> current = head;
while (current != null)
{
for (var i = 0; i < index; i++)
{
if (current == null)
{
throw new ArgumentOutOfRangeException();
}
current = current.Next;
}
return(current.Value);
}
throw new ArgumentOutOfRangeException();
}
public void Reverse()
{
if (head == null)
{
return;
}
TwoWayListNode <T> current = head;
TwoWayListNode <T> previous = current.Previous;
TwoWayListNode <T> next = current.Next;
while (current.Next != null)
{
next = current.Next;
current.Next = previous;
previous = current;
current = next;
}
current.Next = previous;
head = current;
}
public void Sort()
{
if (!typeof(IComparable).IsAssignableFrom(typeof(T)))
{
throw new InvalidOperationException();
}
if (head == null)
{
return;
}
TwoWayListNode <T> node1 = head;
TwoWayListNode <T> node2 = head.Next;
T temp;
bool doubt = false;
do
{
doubt = false;
while (node1 != null && node1.Next != null)
{
var node1Value = (IComparable)node1.Value;
if (node1Value.CompareTo(node2.Value) > 0)
{
doubt = true;
temp = node1.Value;
node1.Value = node2.Value;
node2.Value = temp;
}
node1 = node1.Next;
node2 = node2.Next;
}
node1 = head;
node2 = node1.Next;
} while (doubt);
}
public bool RemoveAt(int index)
{
TwoWayListNode <T> current = head;
if (current == null)
{
return(false);
}
TwoWayListNode <T> previous = current.Previous;
while (current != null)
{
if (index != 0)
{
for (var i = 0; i < index; i++)
{
previous = current;
if (current.Next == null)
{
return(false);
}
previous = current;
current = current.Next;
current.Previous = previous;
}
previous.Next = current.Next;
return(true);
}
head = head.Next;
return(true);
}
return(false);
}
public TwoWayListNode(TNode value, TwoWayListNode <TNode> next, TwoWayListNode <TNode> previous)
{
Value = value;
Next = next;
Previous = previous;
}
public TwoWayListNode(int value, TwoWayListNode next, TwoWayListNode previous)
{
Value = value;
Next = next;
Previous = previous;
}
