File: DequeTests.cs

package info (click to toggle)
bless 0.6.3-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,960 kB
  • sloc: cs: 15,261; xml: 1,954; sh: 18; makefile: 15; python: 4
file content (149 lines) | stat: -rw-r--r-- 3,186 bytes parent folder | download | duplicates (6)
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
// created on 7/4/2005 at 12:38 PM
/*
 *   Copyright (c) 2005, Alexandros Frantzis (alf82 [at] freemail [dot] gr)
 *
 *   This file is part of Bless.
 *
 *   Bless is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation; either version 2 of the License, or
 *   (at your option) any later version.
 *
 *   Bless is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with Bless; if not, write to the Free Software
 *   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
using NUnit.Framework;
using System;

using Bless.Util;

namespace BlessTests.Util {

[TestFixture]
public class DequeTests {


	[Test]
	public void CountTest()
	{
		Deque<int> d = new Deque<int>();
		d.AddFront(4);
		d.AddFront(5);
		d.AddFront(6);
		d.AddFront(7);

		Assert.AreEqual(4, d.Count);
	}

	[Test]
	public void RemoveEndTest()
	{
		Deque<int> d = new Deque<int>();
		d.AddFront(4);
		d.AddFront(5);
		d.AddFront(6);
		d.AddFront(7);

		Assert.AreEqual(4, (int)d.RemoveEnd());
		Assert.AreEqual(5, (int)d.RemoveEnd());
		Assert.AreEqual(6, (int)d.RemoveEnd());
		Assert.AreEqual(7, (int)d.RemoveEnd());
	}

	[Test]
	public void RemoveFrontTest()
	{
		Deque<int> d = new Deque<int>();
		d.AddFront(4);
		d.AddFront(5);
		d.AddFront(6);
		d.AddFront(7);

		Assert.AreEqual(7, (int)d.RemoveFront());
		Assert.AreEqual(6, (int)d.RemoveFront());
		Assert.AreEqual(5, (int)d.RemoveFront());
		Assert.AreEqual(4, (int)d.RemoveFront());
	}




	[Test]
	public void MixedTest()
	{
		Deque<int> d = new Deque<int>();
		d.AddFront(5);
		d.AddEnd(6);
		d.AddFront(4);
		d.AddEnd(7);

		Assert.AreEqual(7, (int)d.RemoveEnd());
		Assert.AreEqual(4, (int)d.RemoveFront());
		Assert.AreEqual(6, (int)d.RemoveEnd());
		Assert.AreEqual(5, (int)d.RemoveFront());
	}

	[Test]
	public void PeekTest()
	{
		Deque<int> d = new Deque<int>();

		d.AddEnd(4);
		d.AddEnd(5);
		d.AddEnd(6);
		d.AddEnd(7);

		Assert.AreEqual(7, (int)d.PeekEnd());
		Assert.AreEqual(7, (int)d.PeekEnd());
		Assert.AreEqual(4, (int)d.PeekFront());
		Assert.AreEqual(4, (int)d.PeekFront());
		d.RemoveEnd();
		Assert.AreEqual(6, (int)d.PeekEnd());
		d.RemoveFront();
		Assert.AreEqual(5, (int)d.PeekFront());
	}

	[Test]
	public void ClearTest()
	{
		Deque<int> d = new Deque<int>();

		d.AddEnd(4);
		d.AddEnd(5);
		d.AddEnd(6);
		d.AddEnd(7);

		Assert.AreEqual(7, (int)d.PeekEnd());
		Assert.AreEqual(4, (int)d.PeekFront());

		d.Clear();
		Assert.AreEqual(0, d.Count);
	}

	[Test]
	public void NullTest()
	{
		Deque<object> d = new Deque<object>();

		Assert.IsNull(d.RemoveFront(), "#1");
		
		object o = new object();
		d.AddEnd(o);
		Assert.AreEqual(o, d.RemoveEnd(), "#2");
		Assert.IsNull(d.RemoveEnd(), "#3");

		d.AddFront(o);
		Assert.AreEqual(o, d.RemoveFront(), "#4");
		Assert.IsNull(d.RemoveFront(), "#5");

	}

}

} // end namespace