tree.h File Reference

Go to the source code of this file.

Data Structures
class	GiNaCRA::tree_node_< T >
	A node in the tree, combining links to other nodes as well as the actual data. More...
class	GiNaCRA::tree< T, tree_node_allocator >
class	GiNaCRA::tree< T, tree_node_allocator >::iterator_base
	Base class for iterators, only pointers stored, no traversal logic. More...
class	GiNaCRA::tree< T, tree_node_allocator >::pre_order_iterator
	Depth-first iterator, first accessing the node, then its children. More...
class	GiNaCRA::tree< T, tree_node_allocator >::post_order_iterator
	Depth-first iterator, first accessing the children, then the node itself. More...
class	GiNaCRA::tree< T, tree_node_allocator >::breadth_first_queued_iterator
	Breadth-first iterator, using a queue. More...
class	GiNaCRA::tree< T, tree_node_allocator >::fixed_depth_iterator
	Iterator which traverses only the nodes at a given depth from the root. More...
class	GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator
	Iterator which traverses only the nodes which are siblings of each other. More...
class	GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator
	Iterator which traverses only the leaves. More...
class	GiNaCRA::tree< T, tree_node_allocator >::iterator_base_less
	Comparator class for iterators (compares pointer values; why doesn't this work automatically?) More...
class	GiNaCRA::tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >
	Comparator class for two nodes of a tree (used for sorting and searching). More...
Namespaces
namespace	GiNaCRA
	Implementation of the class Constraint.

---

Detailed Description

Author:

Kasper Peeters

Version:

2.81

Date:

23-Aug-2011

See also:

http://tree.phi-sci.com/

http://tree.phi-sci.com/ChangeLog

The tree.hh library for C++ provides an STL-like container class for n-ary trees, templated over the data stored at the nodes. Various types of iterators are provided (post-order, pre-order, and others). Where possible the access methods are compatible with the STL or alternative algorithms are available.

The code is modified by Joachim Redies in the following way:

• renamed the file to tree.h
• renamed the define to TREE_H
• formatted the code differently
• included in a namespace due to collision with GiNaC

Definition in file tree.h.