Traverse BSP tree nodes using depth-first search. More...

#include <bsp_tree.hh>

Public Types
using	value_type = T

using	difference_type = std::ptrdiff_t

using	size_type = std::size_t

using	pointer = value_type *

using	const_pointer = const value_type *

using	reference = value_type &

using	const_reference = const value_type &

using	iterator_category = std::forward_iterator_tag

Public Member Functions
	BSP_node_iterator (value_type &tree)

	BSP_node_iterator (const BSP_node_iterator &)=default

	BSP_node_iterator (BSP_node_iterator &&)=default

BSP_node_iterator &	operator= (const BSP_node_iterator &)=default

BSP_node_iterator &	operator= (BSP_node_iterator &&)=default

bool	operator== (const BSP_node_iterator &rhs)

bool	operator!= (const BSP_node_iterator &rhs)

pointer	operator-> ()

const_pointer	operator-> () const

reference	operator * ()

const_reference	operator * () const

const_reference	operator++ ()

BSP_node_iterator	operator++ (int)

Detailed Description

Traverse BSP tree nodes using depth-first search.

Definition at line 40 of file bsp_tree.hh.

Public Types