public void AddRemoveTest()
{
th.Add(1, 1, 0);
th.Add(1, 0, 1);
th.Add(0, 0, 2);
Assert.AreEqual(3, th.Count);
Assert.IsFalse(th.IsEmpty);
Assert.IsTrue(AreEqual(th.Peek(), 0, 0));
Assert.IsTrue(AreEqual(th.Poll(), 0, 0));
Assert.AreEqual(2, th.Count);
Assert.IsTrue(AreEqual(th.Peek(), 1, 0));
Assert.IsTrue(AreEqual(th.Poll(), 1, 0));
Assert.AreEqual(1, th.Count);
Assert.IsTrue(AreEqual(th.Peek(), 1, 1));
Assert.IsTrue(AreEqual(th.Poll(), 1, 1));
Assert.AreEqual(0, th.Count);
Assert.IsTrue(th.IsEmpty);
}
/// <summary>
/// Runs the SerialSolver
/// </summary>
/// <param name="ng">Nonogram to solve</param>
/// <returns>Number of solver tiles or -1 if a contradiction was encountered</returns>
public int Run(Nonogram ng)
{
_ng = ng.Copy();
_benchTime = TimeSpan.Zero;
_results = new List <Result>();
LineSolver ls = new LineSolver();
if (ls.Run(_ng) > 0)
{
if (ls.Solved())
{
_results = ls.Results();
_benchTime = ls.BenchTime();
_solved = true;
return(_results.Count);
}
}
_benchTime = ls.BenchTime();
Stopwatch sw = Stopwatch.StartNew();
_th = new TileHeap(_ng.Width, ng.Height);
Update(ls.Results());
for (int i = 0; i < _ng.Width; i++)
{
_th.Add(0, i, _ng.GetPrio(0, i));
_th.Add(_ng.Height - 1, i, _ng.GetPrio(_ng.Height - 1, i));
}
for (int i = 1; i < _ng.Height - 1; i++)
{
_th.Add(i, 0, _ng.GetPrio(i, 0));
_th.Add(i, _ng.Width - 1, _ng.GetPrio(i, _ng.Width - 1));
}
_benchTime = _benchTime.Add(sw.Elapsed);
TrialSolver trS = new TrialSolver();
while (!_th.IsEmpty)
{
Coordinate c = _th.Poll();
if (!_ng.Resolved(c.Row, c.Column))
{
int res = trS.Run(_ng, c.Row, c.Column);
if (res == -1)
{
return(_results.Count);
}
_benchTime = _benchTime.Add(trS.BenchTime());
sw = Stopwatch.StartNew();
Update(trS.Results());
_benchTime = _benchTime.Add(sw.Elapsed);
if (_ng.LeftToClear == 0)
{
_solved = true;
return(_results.Count);
}
}
}
if (_ng.LeftToClear < 201 || !_smalltree)
{
ISolver ts = new TreeSolver();
ts.Run(_ng);
_benchTime = _benchTime.Add(ts.BenchTime());
Update(ts.Results());
_solved = true;
}
return(_results.Count);
}
