fibonacci_heap.cc

// Copyright (C) 2009 EPITA Research and Development Laboratory (LRDE)
//
// This file is part of Olena.
//
// Olena 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, version 2 of the License.
//
// Olena 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 Olena.  If not, see <http://www.gnu.org/licenses/>.
//
// As a special exception, you may use this file as part of a free
// software project without restriction.  Specifically, if other files
// instantiate templates or use macros or inline functions from this
// file, or you compile this file and link it with other files to produce
// an executable, this file does not by itself cause the resulting
// executable to be covered by the GNU General Public License.  This
// exception does not however invalidate any other reasons why the
// executable file might be covered by the GNU General Public License.



#include <mln/util/fibonacci_heap.hh>
#include <mln/core/alias/point2d.hh>


using mln::point2d;

point2d p[] = { point2d(4,5), point2d(3,4), point2d(3,2),
                point2d(1,6), point2d(2,3), point2d(3,5),
                point2d(2,4), point2d(7,2), point2d(9,6),
                point2d(7,3) };

point2d res_1[] = { point2d(1,6), point2d(2,3), point2d(2,4) };

point2d res_2[] = { point2d(53,4), point2d(5,4), point2d(1,4),
                    point2d(3,2),  point2d(3,4), point2d(3,5),
                    point2d(4,5),  point2d(7,2), point2d(7,3),
                    point2d(9,6) };


int main()
{
  using namespace mln;

  util::fibonacci_heap<int,point2d> heap;
  for (unsigned i = 0; i < 5; ++i)
    heap.push(3, p[i]);

  util::fibonacci_heap<int,point2d> heap2;
  for (unsigned i = 5; i < 10; ++i)
    heap2.push(3, p[i]);



  heap.push(heap2);

  mln_assertion(heap2.is_empty());
  mln_assertion(heap2.nelements() == 0);

//  mln_assertion(heap.front() == res_1[0]);




  heap2.push(heap);

  mln_assertion(heap.is_empty());
  mln_assertion(heap.nelements() == 0);

  mln_assertion(heap2.front() == res_1[0]);


  for (unsigned i = 0; i < 3; ++i)
    mln_assertion(heap2.pop_front() == res_1[i]);


  heap2.push(1, point2d(53,4));
  heap2.push(3, point2d(1,4));
  heap2.push(2, point2d(5,4));

  unsigned i = 0;
  while (heap2.is_valid())
  {
    mln_assertion(heap2.pop_front() == res_2[i++]);
    mln_assertion(heap2.nelements() == (10 - i));
  }

  mln_assertion(heap2.is_empty());
  mln_assertion(heap2.nelements() == 0);



  heap.push(3, point2d(2,4));
  heap2.push(3, point2d(53,4));
  util::fibonacci_heap<int,point2d> tmp = heap;
  heap = heap2;
  heap2 = tmp;

  mln_assertion(heap2.nelements() == 1);
  mln_assertion(heap.nelements() == 1);
  mln_assertion(tmp.nelements() == 0);


  util::fibonacci_heap<int,point2d> tmp2(heap);

  mln_assertion(tmp2.nelements() == 1);
  mln_assertion(heap.nelements() == 0);

}