Space-efficient geometric algorithms and data structures By Ilya Katz and Hervé Brönnimann

block_tree_heap.hpp File Reference

---

Detailed Description

This file contains space efficient tree/heap adapter.

Definition in file block_tree_heap.hpp.

Go to the source code of this file.

Namespaces
namespace	inplaceds
Data Structures
class	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >
	A standard container made up of unique keys, which can be retrieved in logarithmic time. More...
struct	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >::DataNode
	Defines nodes in the underlying rb-tree. DataNode is a structure that encapsulates information regarding a line segment and its event. Specifically it contains a SequenceIterator to the first active line segment of a block and its event and intersection line (if applicable). More...
struct	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >::_M_key_comp
	This is the functor that is passed to the rb_tree for comparisons of tree nodes. More...
struct	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >::_M_key_comp_pq
	This is the functor that is passed to the rb_tree for comparisons of tree nodes. More...
struct	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >::_M_KeyOfValue
class	inplaceds::block_tree_heap< SequenceIterator, Geometry, _Compare, _Compare_PQ, _Alloc >::_Space_TH_Iterator< _Tp >
	Iterator class for the block_tree_heap. More...

---

Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.