FastqPuri
|
structure containing a T_ACGT-tree. More...
#include <tree.h>
Public Attributes | |
uint32_t | L |
uint32_t | pool_count |
uint32_t | pool_available |
uint32_t | nnodes |
Node ** | pool_2D |
structure containing a T_ACGT-tree.
The tree structure is stored in a pointer to pointer to Node. We grow the structure on the flight as we need more memory. In the outer direction, we start by allocating NPOOL_2D pointers to Node. In the inner direction, we allocate NPOOL_1D Nodes and fill them as we read the fasta file. When all of them are allocated, we allocate again NPOOL_1D. If NPOOL_2D pointers to Node are allocated, the outer dimension is reallocated with +NPOOL_2D extra elements. L is the depth of the tree, pool_count is the number on Node* elements used so far, pool_available is the number of Nodes available in every moment, and nnodes is the total number of nodes filled in. We limit the number of allocated nodes to UINT_MAX (we cannot count more nodes!).
uint32_t _tree::L |
depth of the tree
uint32_t _tree::nnodes |
Number of nodes in the tree
Node** _tree::pool_2D |
2D pool containing the nodes that form the tree
uint32_t _tree::pool_available |
Number of empty nodes available in the pool
uint32_t _tree::pool_count |
Number of elements in the second dimension