blob: 003c5384c79b94127671cd5097d8d2325dd38f41 (
plain)
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
//
// System.Collections.QueueTest
// Test suite for System.Collections.Queue
//
// Author:
// Ricardo Fernández Pascual
//
// (C) 2001 Ricardo Fernández Pascual
//
using System;
using System.Collections;
using NUnit.Framework;
namespace MonoTests.System.Collections {
public class QueueTest : TestCase {
public QueueTest ()
: base ("System.Collection.Queue testsuite") {}
public QueueTest (String name) : base (name) {}
protected Queue q1;
protected Queue q2;
protected Queue emptyQueue;
protected override void SetUp () {
q1 = new Queue (10);
for (int i = 0; i < 100; i++)
q1.Enqueue (i);
q2 = new Queue (50, 1.5f);
for (int i = 50; i < 100; i++)
q2.Enqueue (i);
emptyQueue = new Queue ();
}
public static ITest Suite {
get {
return new TestSuite (typeof (QueueTest));
}
}
public void TestConstructors () {
Assert (q1.Count == 100);
Assert (q2.Count == 50);
Assert (emptyQueue.Count == 0);
// TODO: Test Queue (ICollection)
}
// TODO: should test all methods from ICollection,
// but it should be done in ICollectionTest.cs... ??
public void TestCopyTo () {
int[] a1 = new int[100];
int[] a2 = new int[60];
string progress_marker = "";
try {
progress_marker = "before first CopyTo";
q1.CopyTo (a1, 0);
for (int i = 0; i < 100; i++)
AssertEquals (i, a1[i]);
// Remove some items from q2 and add other
// items, to avoid having an "easy" just created
// Queue
for (int i = 50; i < 60; i++)
Assert (i == (int) q2.Dequeue ());
for (int i = 100; i < 110; i++)
q2.Enqueue (i);
progress_marker = "before second CopyTo";
q2.CopyTo (a2, 10);
for (int i = 60; i < 110; i++)
Assert (i == a2[i - 60 + 10]);
// Copying an empty Queue should not modify the array
progress_marker = "before third CopyTo";
emptyQueue.CopyTo (a2, 10);
for (int i = 60; i < 110; i++)
Assert (i == a2[i - 60 + 10]);
} catch (Exception e) {
Fail ("Unexpected exception at marker <" + progress_marker + ">: e = " + e);
}
}
public void TestEnumerator () {
int i;
IEnumerator e;
e = q1.GetEnumerator ();
i = 0;
while (e.MoveNext ()) {
AssertEquals ("q1 at i=" + i, i, ((int) e.Current));
i++;
}
e = q2.GetEnumerator ();
i = 50;
while (e.MoveNext ()) {
AssertEquals (i, ((int) e.Current));
i++;
}
e = emptyQueue.GetEnumerator ();
if (e.MoveNext ())
Fail ("Empty Queue enumerator returning elements!");
e = q1.GetEnumerator ();
try {
e.MoveNext ();
q1.Enqueue (0);
e.MoveNext ();
Fail ("#1 Should have thrown InvalidOperationException");
} catch (InvalidOperationException) { }
e = q1.GetEnumerator ();
}
public void TestClone () {
Queue q3 = (Queue) q2.Clone ();
Assert (q3.Count == q2.Count);
for (int i = 0; i < 50; i++)
Assert (q2.Dequeue ().Equals (q3.Dequeue ()));
Assert (q3.Count == 0);
Assert (q2.Count == 0);
}
public void ClearTest () {
q1.Clear ();
Assert (q1.Count == 0);
q2.Clear ();
Assert (q2.Count == 0);
emptyQueue.Clear ();
Assert (emptyQueue.Count == 0);
}
public void ContainsTest () {
for (int i = 0; i < 100; i++) {
Assert (q1.Contains (i));
Assert (!emptyQueue.Contains (i));
if (i < 50)
Assert (!q2.Contains (i));
else
Assert (q2.Contains (i));
}
}
public void EnqueueDequeuePeekTest () {
int q1size = q1.Count;
int q2size = q2.Count;
q2.Enqueue (null);
Assert (q2.Count == ++q2size);
for (int i = 0; i < 50; i++) {
int k = (int) q1.Peek ();
Assert (q1.Count == q1size);
int j = (int) q1.Dequeue ();
Assert (q1.Count == --q1size);
Assert (i == j);
Assert (j == k);
q2.Enqueue (j);
Assert (q2.Count == ++q2size);
}
for (int i = 50; i < 100; i++) {
Assert (((int) q2.Dequeue ()) == i);
Assert (q2.Count == --q2size);
}
Assert (q2.Peek () == null);
Assert (q2.Dequeue () == null);
Assert (q2.Count == --q2size);
for (int i = 0; i < 50; i++) {
Assert (((int) q2.Dequeue ()) == i);
Assert (q2.Count == --q2size);
}
}
// TODO: test Syncronized operation
}
}
|
