FMUntidyQueue< cell_t > Class Template Reference

Wraps the UntidyQueue implementation by Jerome Piovano More...

#include <fmuntidyqueue.hpp>

Public Member Functions
	FMUntidyQueue (unsigned s=1000, double inc=2)
	Creates an object with s buckets of size s.
void	push (cell_t *c)
	Pushes a new element into the heap.
size_t	size () const
	Returns current size of the heap.
void	increase (cell_t *c)
	Updates the position of the cell in the priority queue. Its priority can only increase. Also updates the bucket of the cell.
unsigned int	topIdx ()
	Returns index of the element with lowest value (to be popped next).
void	pop ()
	Removes the top value of the heap.
void	clear ()
	Deallocates heap memory.
bool	empty () const
	Returns true if the heap is empty.

Protected Attributes
levelset::PriorityQueue< const cell_t * > *	queue_
	The actual Unitidy queue for cell_t.

Detailed Description

template<class cell_t = FMCell>
class FMUntidyQueue< cell_t >

Todo:

save buckets here as a hash table instead of saving them in FMCell.

Copyright (C) 2014 Javier V. Gomez www.javiervgomez.com

This program 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 3 of the License, or (at your option) any later version. This program 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 this program. If not, see http://www.gnu.org/licenses/.

Definition at line 27 of file fmuntidyqueue.hpp.

---

The documentation for this class was generated from the following file:

• /home/jvgomez/Desktop/fastmarching/include/fast_methods/datastructures/fmuntidyqueue.hpp