Logo Search packages:      
Sourcecode: f-spot version File versions  Download package

IntervalHeapTests.cs

//
// IntervalHeapTests.cs
//
// Author:
//   Aaron Bockover <abockover@novell.com>
//
// Copyright (C) 2008 Novell, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//

#if ENABLE_TESTS

using System;
using NUnit.Framework;

using Hyena.Collections;

namespace Hyena.Collections.Tests
{
    [TestFixture]
    public class IntervalHeapTests
    {
        private IntervalHeap<int> heap;
        private static int [] heap_data = new int[2048];

        [TestFixtureSetUp]
        public void Init()
        {
            heap = new IntervalHeap<int>();
            for(int i = 0; i < heap_data.Length; i++) {
                heap_data[i] = i;
            }
        }

        private void PopulateHeap()
        {
            heap.Clear();

            foreach(int i in heap_data) {
                heap.Push(i, 0);
            }

            Assert.AreEqual(heap.Count, heap_data.Length);
        }

        [Test]
        public void PopHeap()
        {
            PopulateHeap();

            int i = 0;
            while(heap.Count > 0) {
                heap.Pop();
                i++;
            }

            Assert.AreEqual(i, heap_data.Length);
        }

        [Test]
        public void IterateHeap()
        {
            PopulateHeap();

            int i = 0;
            foreach(int x in heap) {
                Assert.AreEqual(x, heap_data[i++]);
            }

            Assert.AreEqual(i, heap.Count);
        }

        [Test]
        public void RemoveItemsFromHeap()
        {
            IntervalHeap<int> h = new IntervalHeap<int>();
            for(int i = 0; i < 20; i++) {
                h.Push(i, i);
            }

            h.Remove(10);
            h.Remove(2);
            h.Remove(11);
            h.Remove(9);
            h.Remove(19);
            h.Remove(0);

            Assert.AreEqual(h.Pop(), 18);
            Assert.AreEqual(h.Pop(), 17);
            Assert.AreEqual(h.Pop(), 16);
            Assert.AreEqual(h.Pop(), 15);
            Assert.AreEqual(h.Pop(), 14);
            Assert.AreEqual(h.Pop(), 13);
            Assert.AreEqual(h.Pop(), 12);
            Assert.AreEqual(h.Pop(), 8);
            Assert.AreEqual(h.Pop(), 7);
            Assert.AreEqual(h.Pop(), 6);
            Assert.AreEqual(h.Pop(), 5);
            Assert.AreEqual(h.Pop(), 4);
            Assert.AreEqual(h.Pop(), 3);
            Assert.AreEqual(h.Pop(), 1);

            Assert.AreEqual(h.Count, 0);
        }
    }
}

#endif

Generated by  Doxygen 1.6.0   Back to index