CompactTree
|
This is the complete list of members for compact_tree, including all inherited members.
add_child(const CT_NODE_T parent_node, const std::string &new_label=EMPTY_STRING, CT_LENGTH_T new_length=ZERO_LENGTH) | compact_tree | inline |
calc_avg_bl(bool include_internal=true, bool include_leaves=true) const | compact_tree | inline |
calc_dist(CT_NODE_T u, CT_NODE_T v) const | compact_tree | inline |
calc_distance_matrix() | compact_tree | |
calc_total_bl(bool include_internal=true, bool include_leaves=true) const | compact_tree | inline |
children_begin(CT_NODE_T node) | compact_tree | inline |
children_end(CT_NODE_T node) | compact_tree | inline |
clear_edge_lengths(bool shrink=true) | compact_tree | inline |
clear_labels(bool shrink=true) | compact_tree | inline |
compact_tree(const char *const input, bool is_fn=true, bool store_labels=true, bool store_lengths=true, size_t reserve=0) | compact_tree | |
compact_tree(const std::string &input, bool is_fn=true, bool store_labels=true, bool store_lengths=true, size_t reserve=0) | compact_tree | inline |
compact_tree(const compact_tree &o) | compact_tree | inline |
extract_subtree(CT_NODE_T node) | compact_tree | |
find_mrca(const std::unordered_set< CT_NODE_T > &nodes) const | compact_tree | |
get_children(CT_NODE_T node) const | compact_tree | inline |
get_edge_length(CT_NODE_T node) const | compact_tree | inline |
get_edge_lengths() const | compact_tree | inline |
get_label(CT_NODE_T node) const | compact_tree | inline |
get_labels() const | compact_tree | inline |
get_newick(CT_NODE_T node=ROOT_NODE, bool include_semicolon=true) | compact_tree | inline |
get_num_internal() | compact_tree | inline |
get_num_leaves() | compact_tree | inline |
get_num_nodes() const | compact_tree | inline |
get_parent(CT_NODE_T node) const | compact_tree | inline |
get_root() const | compact_tree | inline |
has_edge_lengths() const | compact_tree | inline |
has_labels() const | compact_tree | inline |
is_leaf(CT_NODE_T node) const | compact_tree | inline |
is_root(CT_NODE_T node) const | compact_tree | inline |
leaves_begin() | compact_tree | inline |
leaves_end() | compact_tree | inline |
levelorder_begin() | compact_tree | inline |
levelorder_end() | compact_tree | inline |
operator[](CT_NODE_T i) const | compact_tree | inline |
postorder_begin() | compact_tree | inline |
postorder_end() | compact_tree | inline |
preorder_begin() | compact_tree | inline |
preorder_end() | compact_tree | inline |
print_newick(std::ostream &out, CT_NODE_T node=ROOT_NODE, bool include_semicolon=true) | compact_tree | |
replace_labels(const std::unordered_map< std::string, std::string > &label_map, bool include_internal=true) | compact_tree | inline |
set_edge_length(CT_NODE_T node, CT_LENGTH_T new_length) | compact_tree | inline |
set_label(CT_NODE_T node, const std::string &new_label) | compact_tree | inline |