public bool RemoveAt(int index)
{
OneWayListNode <T> current = head;
OneWayListNode <T> previous = null;
while (current != null)
{
if (index != 0)
{
for (var i = 0; i < index; i++)
{
previous = current;
if (current == null || current.Next == null)
{
return(false);
}
current = current.Next;
}
previous.Next = current.Next;
return(true);
}
head = head.Next;
return(true);
}
return(false);
}
public T[] ConvertToArray()
{
OneWayListNode <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 void AddAt(T value, int index)
{
var node = new OneWayListNode <T>(value);
if (head != null && index != 0)
{
OneWayListNode <T> current = head;
for (var i = 0; i < index - 1; i++)
{
if (current == null)
{
throw new ArgumentOutOfRangeException();
}
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;
}
OneWayListNode node1 = head;
OneWayListNode 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 void FailOnOperationsWithInvalidNode()
{
var invalidNode = new OneWayListNode <int>(new OneWayList <int>(), 12);
var sut = new OneWayList <int>(iarray);
// Assert
Assert.Throws <InvalidOperationException>(() => sut.Delete(invalidNode));
Assert.Throws <InvalidOperationException>(() => sut.InsertAfter(invalidNode, 12));
}
/// insert value to end of list
public void Add(T value)
{
var node = new OneWayListNode <T>(value);
if (head == null)
{
// empty collection
head = node;
}
else
{
// not empty collection
OneWayListNode <T> current = head;
while (current.Next != null)
{
current = current.Next;
}
current.Next = node;
}
}
public T GetElementByIndex(int index)
{
OneWayListNode <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();
}
private bool PrivateFind(string entry, out int hash, out OneWayListNode <string> node)
{
hash = GetHashCode(entry);
var list = _entries[hash];
if (list != null)
{
var current = list.Head;
while (current != null)
{
if (current.Value.Equals(entry))
{
node = current;
return(true);
}
current = current.Next;
}
}
node = null;
return(false);
}
public void Reverse()
{
if (head == null)
{
return;
}
OneWayListNode <T> current = head;
OneWayListNode <T> previous = null;
OneWayListNode <T> next = null;
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;
}
OneWayListNode <T> node1 = head;
OneWayListNode <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 Remove(int value)
{
OneWayListNode <T> current = head;
OneWayListNode <T> previous = null;
// 1: Пустой список: ничего не делать.
// 2: Один элемент: установить Previous = null.
// 3: Несколько элементов:
// a: Удаляемый элемент первый.
// b: Удаляемый элемент в середине или конце.
while (current != null)
{
if (current.Value.Equals(value))
{
/// Узел в середине или в конце.
if (previous != null)
{
previous.Next = current.Next;
}
else
{
/// если удаляется первый элемент
/// переустанавливаем значение head
head = head.Next;
}
Count--;
return(true);
}
previous = current;
current = current.Next;
}
return(false);
}
public OneWayListNode(TNode value, OneWayListNode <TNode> next)
{
Value = value;
Next = next;
}
public OneWayListNode(int value, OneWayListNode next)
{
Value = value;
Next = next;
}