This repository was archived by the owner on Sep 7, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 38
Expand file tree
/
Copy pathqueue.cs
More file actions
155 lines (141 loc) · 3.43 KB
/
Copy pathqueue.cs
File metadata and controls
155 lines (141 loc) · 3.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
using System;
using System.Collections.Generic;
/// <summary>
/// Generic queue (First In First Out) implementation using linked list.
/// </summary>
/// <typeparam name="T">Item type.</typeparam>
class Queue<T>
{
private Node<T> _head;
private Node<T> _tail;
/// <summary>
/// Initialize the queue.
/// </summary>
public Queue()
{
}
/// <summary>
/// Enqueue an item.
/// </summary>
/// <param name="item">Item to queue.</param>
public void Enqueue(T item)
{
var node = Node<T>.Create(item);
if (_head == null)
{
_head = node;
_tail = node;
}
else
{
_tail.Next = node;
_tail = node;
}
}
/// <summary>
/// Dequeue an item.
/// </summary>
/// <returns>Dequeued item.</returns>
public T Dequeue()
{
return DequeueOrPeek(true);
}
/// <summary>
/// Peek an item.
/// </summary>
/// <returns>Peeked item.</returns>
public T Peek()
{
return DequeueOrPeek(false);
}
private T DequeueOrPeek(bool dequeue)
{
if (_head == null)
throw new InvalidOperationException("Queue is empty.");
var node = _head;
if (dequeue)
{
_head = _head.Next;
if (_head == null)
_tail = null;
}
return node.Data;
}
/// <summary>
/// Returns the content of the queue as string.
/// </summary>
/// <returns>Content of the queue as string.</returns>
public override string ToString()
{
var result = string.Empty;
var node = _head;
while (node != null)
{
result += node.Data.ToString() + " ";
node = node.Next;
}
return result.Trim();
}
/// <summary>
/// Clears the queue.
/// </summary>
public void Clear()
{
_head = null;
_tail = null;
}
}
/// <summary>
/// Generic linked list's node.
/// </summary>
class Node<T>
{
/// <summary>
/// Creates a new instance of node.
/// </summary>
/// <param name="data">Data instance.</param>
private Node(T data)
{
Data = data;
}
/// <summary>
/// Gets the node data.
/// </summary>
public T Data { get; private set; }
/// <summary>
/// Gets or sets the next node.
/// </summary>
public Node<T> Next { get; set; }
/// <summary>
/// Creates a new instance of node.
/// </summary>
/// <param name="data">Data instance.</param>
/// <returns>Node instance.</returns>
public static Node<T> Create(T data)
{
return new Node<T>(data);
}
}
class QueueTest
{
public static void Main()
{
var queue = new Queue<int>();
queue.Enqueue(1);
queue.Enqueue(2);
queue.Enqueue(3);
Console.WriteLine("Dequeued: {0}", queue.Dequeue());
queue.Enqueue(4);
queue.Enqueue(5);
Console.WriteLine("Peeked: {0}", queue.Peek());
queue.Enqueue(6);
queue.Enqueue(7);
Console.WriteLine("Peeked: {0}", queue.Peek());
queue.Enqueue(8);
queue.Enqueue(9);
queue.Enqueue(10);
Console.WriteLine("Dequeued: {0}", queue.Dequeue());
Console.WriteLine("Dequeued: {0}", queue.Dequeue());
Console.WriteLine("Queue contents: {0}", queue.ToString());
}
}