using DataStructures.Heaps;
using Xunit;

namespace UnitTest.DataStructuresTests
{
    public static class BinomialHeapsTest
    {
        [Fact]
        public static void DoTest()
        {
            int i = 37;
            int numberOfItems = 100000;
            BinomialMinHeap<int> firstHeap = new BinomialMinHeap<int>();
            BinomialMinHeap<int> secondHeap = new BinomialMinHeap<int>();
            BinomialMinHeap<int> thirdHeap = new BinomialMinHeap<int>();

            for (i = 37; i != 0; i = (i + 37) % numberOfItems)
            {
                if (i % 2 == 0)
                    secondHeap.Add(i);
                else
                    firstHeap.Add(i);
            }

            firstHeap.Merge(secondHeap);
            thirdHeap = firstHeap;

            for (i = 1; i <= thirdHeap.Count; i++)
            {
                var min = thirdHeap.ExtractMin();
                Assert.True(min == i, "WRONG MIN");
            }

            Assert.True(secondHeap.IsEmpty, "SECOND HEAP SHOULD BE EMPTY");
        }
    }
}