vrv::IntTree Struct Reference

Generic int map recursive structure for storing hierachy of values For example, we want to process all staves one by one, and within each staff all layer one by one, and so one (lyrics, etc.). More...

#include <vrvdef.h>

Public Attributes
std::map< int, IntTree >	child

Detailed Description

Generic int map recursive structure for storing hierachy of values For example, we want to process all staves one by one, and within each staff all layer one by one, and so one (lyrics, etc.).

In IntTree, we can store @n with all existing values (1 => 1 => 1; 2 => 1 => 1) The stucture must be filled first and can then be used by instanciating a vector of corresponding Comparison (typically AttNIntegerComparison for @n attribute). See Doc::PrepareData for an example.

---

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

• vrvdef.h