mcrl2/atermpp/aterm_balanced_tree.h

Include file:

#include "mcrl2/atermpp/aterm_balanced_tree.h"

Classes

• std::hash
• atermpp::term_balanced_tree::iterator
• atermpp::term_balanced_tree
• atermpp::term_balanced_tree

Typedefs

type atermpp::aterm_balanced_tree

typedef for term_balanced_tree< aterm >

A term_balanced_tree with elements of type aterm.

Functions

bool atermpp::is_aterm_balanced_tree(const aterm_appl &t)

void make_term_balanced_tree(term_balanced_tree<Term> &result, ForwardTraversalIterator p, const std::size_t size, Transformer transformer)

std::string atermpp::pp(const term_balanced_tree<Term> t)

Functions

void std::swap(atermpp::term_balanced_tree<T> &t1, atermpp::term_balanced_tree<T> &t2)

Swaps two balanced trees.

This operation is more efficient than exchanging terms by an assignment, as swapping does not require to change the protection of terms.

Parameters:

• t1 The first term
• t2 The second term