public bool Contains(T data)
{
DoublyNode <T> current = head;
while (current != null)
{
if (current.Data.Equals(data))
{
return(true);
}
current = current.Next;
}
return(false);
}
public void AddLast(T data)
{
DoublyNode <T> node = new DoublyNode <T>(data);
if (head == null)
{
head = node;
}
else
{
tail.Next = node;
node.Previous = tail;
}
tail = node;
count++;
}
public void AddFirst(T data)
{
DoublyNode <T> node = new DoublyNode <T>(data);
DoublyNode <T> temp = head;
node.Next = temp;
head = node;
if (count == 0)
{
tail = head;
}
else
{
temp.Previous = node;
}
count++;
}
public T RemoveFirst()
{
if (count == 0)
{
throw new InvalidOperationException();
}
T output = head.Data;
if (count == 1)
{
head = tail = null;
}
else
{
head = head.Next;
head.Previous = null;
}
count--;
return(output);
}
public T RemoveLast()
{
if (count == 0)
{
throw new InvalidOperationException();
}
T output = tail.Data;
if (count == 1)
{
head = tail = null;
}
else
{
tail = tail.Previous;
tail.Next = null;
}
count--;
return(output);
}
/// <summary>
/// Метод добавляет элемент в начало дека
/// </summary>
/// <param name="data">Элемент для добавления</param>
public void AddFirst(T data)
{
DoublyNode <T> node = new DoublyNode <T>(data);
DoublyNode <T> temp = head;
node.Next = temp;
head = node;
if (count == 0)
{
tail = head;
}
else
{
temp.Previous = node;
}
count++;
if (Count != null)
{
Count(this, new ForEventArgs <T>(data));
}
}
public void Clear()
{
head = null;
tail = null;
count = 0;
}