NCBI C++ ToolKit
Classes | Public Types | Public Member Functions | Public Attributes | Private Member Functions | Private Attributes | List of all members
tree< T, tree_node_allocator > Class Template Reference

Search Toolkit Book for tree

#include <algo/structure/cd_utils/tree_msvc7.hpp>

+ Inheritance diagram for tree< T, tree_node_allocator >:
+ Collaboration diagram for tree< T, tree_node_allocator >:

Classes

class  compare_nodes
 
class  fixed_depth_iterator
 
class  iterator_base
 
class  iterator_base_less
 
class  post_order_iterator
 
class  pre_order_iterator
 
class  sibling_iterator
 

Public Types

typedef tree_node_< T > tree_node
 
typedef T value_type
 
typedef pre_order_iterator iterator
 

Public Member Functions

 tree ()
 
 tree (const T &)
 
 tree (const iterator_base &)
 
 tree (const tree< T, tree_node_allocator > &)
 
 ~tree ()
 
void operator= (const tree< T, tree_node_allocator > &)
 
pre_order_iterator begin () const
 
pre_order_iterator end () const
 
post_order_iterator begin_post () const
 
post_order_iterator end_post () const
 
fixed_depth_iterator begin_fixed (const iterator_base &, unsigned int) const
 
fixed_depth_iterator end_fixed (const iterator_base &, unsigned int) const
 
sibling_iterator begin (const iterator_base &) const
 
sibling_iterator end (const iterator_base &) const
 
template<typename iter >
iter parent (iter) const
 
sibling_iterator previous_sibling (const iterator_base &) const
 
sibling_iterator next_sibling (const iterator_base &) const
 
void clear ()
 
template<typename iter >
iter erase (iter)
 
void erase_children (const iterator_base &)
 
template<typename iter >
iter append_child (iter position)
 
template<typename iter >
iter append_child (iter position, const T &x)
 
template<typename iter >
iter append_child (iter position, iter other_position)
 
template<typename iter >
iter append_children (iter position, sibling_iterator from, sibling_iterator to)
 
pre_order_iterator set_head (const T &x)
 
template<typename iter >
iter insert (iter position, const T &x)
 
sibling_iterator insert (sibling_iterator position, const T &x)
 
template<typename iter >
iter insert_subtree (iter position, const iterator_base &subtree)
 
template<typename iter >
iter insert_after (iter position, const T &x)
 
template<typename iter >
iter replace (iter position, const T &x)
 
template<typename iter >
iter replace (iter position, const iterator_base &from)
 
sibling_iterator replace (sibling_iterator orig_begin, sibling_iterator orig_end, sibling_iterator new_begin, sibling_iterator new_end)
 
template<typename iter >
iter flatten (iter position)
 
template<typename iter >
iter reparent (iter position, sibling_iterator begin, sibling_iterator end)
 
template<typename iter >
iter reparent (iter position, iter from)
 
template<typename iter >
iter move_after (iter target, iter source)
 
template<typename iter >
iter move_before (iter target, iter source)
 
template<typename iter >
iter move_below (iter target, iter source)
 
void merge (sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, bool duplicate_leaves=false)
 
void sort (sibling_iterator from, sibling_iterator to, bool deep=false)
 
template<class StrictWeakOrdering >
void sort (sibling_iterator from, sibling_iterator to, StrictWeakOrdering comp, bool deep=false)
 
template<typename iter >
bool equal (const iter &one, const iter &two, const iter &three) const
 
template<typename iter , class BinaryPredicate >
bool equal (const iter &one, const iter &two, const iter &three, BinaryPredicate) const
 
template<typename iter >
bool equal_subtree (const iter &one, const iter &two) const
 
template<typename iter , class BinaryPredicate >
bool equal_subtree (const iter &one, const iter &two, BinaryPredicate) const
 
tree subtree (sibling_iterator from, sibling_iterator to) const
 
void subtree (tree &, sibling_iterator from, sibling_iterator to) const
 
void swap (sibling_iterator it)
 
int size () const
 
bool empty () const
 
int depth (const iterator_base &) const
 
unsigned int number_of_children (const iterator_base &) const
 
unsigned int number_of_siblings (const iterator_base &) const
 
bool is_in_subtree (const iterator_base &position, const iterator_base &begin, const iterator_base &end) const
 
bool is_valid (const iterator_base &) const
 
unsigned int index (sibling_iterator it) const
 
sibling_iterator child (const iterator_base &position, unsigned int) const
 
tree reroot (iterator newRoot)
 

Public Attributes

tree_node * head
 
tree_node * feet
 

Private Member Functions

void head_initialise_ ()
 
void copy_ (const tree< T, tree_node_allocator > &other)
 

Private Attributes

tree_node_allocator alloc_
 

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >

Definition at line 89 of file tree_msvc7.hpp.

Member Typedef Documentation

◆ iterator

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
typedef pre_order_iterator tree< T, tree_node_allocator >::iterator

Definition at line 173 of file tree_msvc7.hpp.

◆ tree_node

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
typedef tree_node_<T> tree< T, tree_node_allocator >::tree_node

Definition at line 92 of file tree_msvc7.hpp.

◆ value_type

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
typedef T tree< T, tree_node_allocator >::value_type

Definition at line 93 of file tree_msvc7.hpp.

Constructor & Destructor Documentation

◆ tree() [1/4]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree

Definition at line 438 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::head_initialise_().

◆ tree() [2/4]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree ( const T &  x)

Definition at line 444 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::head_initialise_(), and tree< T, tree_node_allocator >::set_head().

◆ tree() [3/4]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree ( const iterator_base &  other)

Definition at line 451 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::set_head().

◆ tree() [4/4]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree ( const tree< T, tree_node_allocator > &  other)

Definition at line 492 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::copy_(), and tree< T, tree_node_allocator >::head_initialise_().

◆ ~tree()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::~tree

Definition at line 459 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::feet, and tree< T, tree_node_allocator >::head.

Member Function Documentation

◆ append_child() [1/3]

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::append_child ( iter  position)

Definition at line 680 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, assert, kp::constructor(), tree< T, tree_node_allocator >::head, and tmp.

Referenced by CDFamily::addChild(), SeqTreeAsnizer::addChildNode(), tree< T, tree_node_allocator >::append_child(), NJ_TreeAlgorithm::ComputeTree(), GetMaxPath(), NJ_TreeAlgorithm::Join(), SLC_TreeAlgorithm::Join(), tree< T, tree_node_allocator >::merge(), MidpointRootSeqTree(), CdTreeStream::read(), and tree< T, tree_node_allocator >::replace().

◆ append_child() [2/3]

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::append_child ( iter  position,
const T &  x 
)

Definition at line 704 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, assert, kp::constructor(), tree< T, tree_node_allocator >::head, and tmp.

◆ append_child() [3/3]

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::append_child ( iter  position,
iter  other_position 
)

Definition at line 732 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::append_child(), assert, tree< T, tree_node_allocator >::head, and tree< T, tree_node_allocator >::replace().

◆ append_children()

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::append_children ( iter  position,
sibling_iterator  from,
sibling_iterator  to 
)

Definition at line 742 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::insert_subtree().

◆ begin() [1/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::begin ( void  ) const

Definition at line 573 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::head, and tree_node_< T >::next_sibling.

Referenced by SeqTree::addSelectionFields(), SeqTreeRootedLayout::calculateNodePositions(), SeqTree::clearInternalNodeSelection(), NJ_TreeAlgorithm::ComputeTree(), SLC_TreeAlgorithm::ComputeTree(), CDFamily::convergeTo(), SeqTreeAsnizer::convertToAsnSeqTree(), SeqTreeAsnizer::convertToSeqTree(), tree< T, tree_node_allocator >::copy_(), tree< T, tree_node_allocator >::empty(), tree< T, tree_node_allocator >::equal_subtree(), CDFamily::findCD(), CDFamily::findCDByAccession(), SeqTreeRootedLayout::findEdgeEnd(), SeqTree::fixRowName(), SeqTree::fixRowNumber(), CDFamily::getAllCD(), SeqTreeAPI::getAllEdges(), CDFamily::getCdsNotOnPathToRoot(), CDFamily::getChildren(), SeqTree::getDistantNodes(), SeqTree::getDiversityRankToRow(), GetMaxPath(), CDFamily::getNewickRepresentation(), CDFamily::getSelectedCDs(), SeqTree::getSequenceComposition(), CDFamily::inspect(), tree< T, tree_node_allocator >::is_in_subtree(), SeqTreeAPI::loadAndValidateExistingTree(), TreeAlgorithm::midpointRootIfNeeded(), MidpointRootSeqTree(), SeqTree::prepare(), CdTreeStream::read(), tree< T, tree_node_allocator >::reparent(), s_AnalyzeLibraryOrder(), s_CTreeNew(), s_SaveHSP(), CDFamily::selectAllCDs(), CDFamily::selectCDs(), MultipleAlignment::setAlignment(), CDFamily::setRootCD(), tree< T, tree_node_allocator >::size(), tree< T, tree_node_allocator >::sort(), CdTreeStream::toString(), tree< T, tree_node_allocator >::tree(), SeqTree::uncollapseAll(), SeqTree::updateSeqCounts(), and CdTreeStream::writeToFile().

◆ begin() [2/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::begin ( const iterator_base &  pos) const

Definition at line 637 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::end(), tree_node_< T >::first_child, and tree< T, tree_node_allocator >::iterator_base::node.

◆ begin_fixed()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::begin_fixed ( const iterator_base &  pos,
unsigned int  dp 
) const

Definition at line 602 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::iterator_base::node, and tmp.

◆ begin_post()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::begin_post

Definition at line 585 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::feet, tree< T, tree_node_allocator >::head, tree_node_< T >::next_sibling, and tmp.

◆ child()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::child ( const iterator_base &  position,
unsigned int  num 
) const

Definition at line 1376 of file tree_msvc7.hpp.

References assert, tree_node_< T >::first_child, tree< T, tree_node_allocator >::iterator_base::node, and tmp.

◆ clear()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::clear ( void  )

Definition at line 520 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::feet, tree< T, tree_node_allocator >::head, and tree_node_< T >::next_sibling.

Referenced by NJ_TreeAlgorithm::ComputeTree(), SLC_TreeAlgorithm::ComputeTree(), tree< T, tree_node_allocator >::copy_(), CProjectItemsTree::CreateFrom(), GetMaxPath(), and tree< T, tree_node_allocator >::~tree().

◆ copy_()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::copy_ ( const tree< T, tree_node_allocator > &  other)
private

Definition at line 499 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::iterator_base::skip_children().

Referenced by tree< T, tree_node_allocator >::operator=(), and tree< T, tree_node_allocator >::tree().

◆ depth()

template<class T , class tree_node_allocator >
int tree< T, tree_node_allocator >::depth ( const iterator_base &  it) const

Definition at line 1260 of file tree_msvc7.hpp.

References assert, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::parent.

Referenced by build_tree(), and pqdownheap().

◆ empty()

template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::empty

Definition at line 1253 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), and tree< T, tree_node_allocator >::end().

◆ end() [1/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::end ( void  ) const

Definition at line 579 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::feet.

Referenced by CDFamily::addChild(), CProjectTreeBuilder::AddDatatoolSourcesDepends(), SeqTree::addSelectionFields(), AnalyzeDllData(), CCyclicDepends::AnalyzeProjItem(), CCyclicDepends::AnalyzeProjItemNew(), tree< T, tree_node_allocator >::begin(), SeqTree::clearInternalNodeSelection(), CPreBuildEventTool::CommandLine(), CDFamily::convergeTo(), SeqTreeAsnizer::convertToAsnSeqTree(), tree< T, tree_node_allocator >::copy_(), CreateDllBuildTree(), SAsnProjectSingleT::DoCreate(), SAsnProjectMultipleT::DoCreate(), SAppProjectT::DoCreate(), SLibProjectT::DoCreate(), SDllProjectT::DoCreate(), SMsvcProjectT::DoCreate(), tree< T, tree_node_allocator >::empty(), tree< T, tree_node_allocator >::equal_subtree(), CCyclicDepends::ExtendChains(), CDFamily::findCD(), CDFamily::findCDByAccession(), SeqTreeRootedLayout::findEdgeEnd(), CDFamily::findFamily(), SeqTree::fixRowName(), SeqTree::fixRowNumber(), CDFamily::getAllCD(), CDFamily::getCdsNotOnPathToRoot(), CDFamily::getChildren(), CDFamily::getClassicalParent(), SeqTree::getLeafById(), GetMaxPath(), CDFamily::getPathToRoot(), CDFamily::getSelectedCDs(), SeqTree::getSequenceComposition(), CDFamily::inspect(), tree< T, tree_node_allocator >::is_in_subtree(), CDFamily::isDup(), TreeAlgorithm::midpointRootIfNeeded(), MidpointRootSeqTree(), tree< T, tree_node_allocator >::next_sibling(), CDFamily::removeChild(), tree< T, tree_node_allocator >::reparent(), s_AnalyzeLibraryOrder(), s_CTreeNew(), s_IsInTree(), s_ReportDependenciesStatus(), s_SaveHSP(), CDFamily::selectAllCDs(), CDFamily::selectCDs(), CDFamily::setRootCD(), tree< T, tree_node_allocator >::size(), tree< T, tree_node_allocator >::sort(), SeqTree::uncollapseAll(), SeqTree::updateSeqCounts(), and CProjectTreeBuilder::VerifyBuildOrder().

◆ end() [2/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::end ( const iterator_base &  pos) const

Definition at line 646 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::iterator_base::node, and tree< T, tree_node_allocator >::sibling_iterator::parent_.

◆ end_fixed()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::end_fixed ( const iterator_base &  pos,
unsigned int  dp 
) const

Definition at line 619 of file tree_msvc7.hpp.

References assert, tree< T, tree_node_allocator >::iterator_base::node, and tmp.

◆ end_post()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::end_post

Definition at line 596 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::feet.

◆ equal() [1/2]

template<class T , class tree_node_allocator >
template<typename iter >
bool tree< T, tree_node_allocator >::equal ( const iter &  one,
const iter &  two,
const iter &  three 
) const

Definition at line 1180 of file tree_msvc7.hpp.

Referenced by tree< T, tree_node_allocator >::equal_subtree().

◆ equal() [2/2]

template<class T , class tree_node_allocator >
template<typename iter , class BinaryPredicate >
bool tree< T, tree_node_allocator >::equal ( const iter &  one,
const iter &  two,
const iter &  three,
BinaryPredicate  fun 
) const

Definition at line 1196 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::is_valid(), and tree< T, tree_node_allocator >::iterator_base::number_of_children().

◆ equal_subtree() [1/2]

template<class T , class tree_node_allocator >
template<typename iter >
bool tree< T, tree_node_allocator >::equal_subtree ( const iter &  one,
const iter &  two 
) const

Definition at line 1188 of file tree_msvc7.hpp.

◆ equal_subtree() [2/2]

template<class T , class tree_node_allocator >
template<typename iter , class BinaryPredicate >
bool tree< T, tree_node_allocator >::equal_subtree ( const iter &  one,
const iter &  two,
BinaryPredicate  fun 
) const

Definition at line 1215 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::equal(), and tree< T, tree_node_allocator >::number_of_children().

◆ erase()

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::erase ( iter  it)

Definition at line 546 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, assert, tree_node_< T >::data, kp::destructor(), tree< T, tree_node_allocator >::erase_children(), tree< T, tree_node_allocator >::head, tree_node_< T >::next_sibling, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.

Referenced by AnalyzeDllData(), tree< T, tree_node_allocator >::clear(), SAppProjectT::DoCreate(), SLibProjectT::DoCreate(), SDllProjectT::DoCreate(), SMsvcProjectT::DoCreate(), CCyclicDepends::ExtendChains(), CDFamily::removeChild(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::reroot().

◆ erase_children()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::erase_children ( const iterator_base &  it)

Definition at line 528 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, kp::destructor(), tree_node_< T >::first_child, tree_node_< T >::last_child, tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, and prev().

Referenced by tree< T, tree_node_allocator >::erase(), and tree< T, tree_node_allocator >::replace().

◆ flatten()

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::flatten ( iter  position)

Definition at line 973 of file tree_msvc7.hpp.

References tmp.

◆ head_initialise_()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::head_initialise_
private

Definition at line 467 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, tree< T, tree_node_allocator >::feet, tree_node_< T >::first_child, tree< T, tree_node_allocator >::head, tree_node_< T >::last_child, tree_node_< T >::next_sibling, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.

Referenced by tree< T, tree_node_allocator >::tree().

◆ index()

template<class T , class tree_node_allocator >
unsigned int tree< T, tree_node_allocator >::index ( sibling_iterator  it) const

Definition at line 1356 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::head, tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.

◆ insert() [1/2]

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::insert ( iter  position,
const T &  x 
)

Definition at line 762 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, kp::constructor(), tree< T, tree_node_allocator >::feet, and tmp.

Referenced by NJ_TreeAlgorithm::ComputeTree(), SLC_TreeAlgorithm::ComputeTree(), SeqTreeAsnizer::convertToSeqTree(), tree< T, tree_node_allocator >::copy_(), GetMaxPath(), tree< T, tree_node_allocator >::insert_subtree(), CdTreeStream::read(), tree< T, tree_node_allocator >::set_head(), and CDFamily::setRootCD().

◆ insert() [2/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::insert ( sibling_iterator  position,
const T &  x 
)

Definition at line 786 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, kp::constructor(), tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, tree< T, tree_node_allocator >::sibling_iterator::parent_, tree_node_< T >::prev_sibling, tree< T, tree_node_allocator >::sibling_iterator::range_last(), and tmp.

◆ insert_after()

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::insert_after ( iter  position,
const T &  x 
)

Definition at line 814 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, kp::constructor(), and tmp.

◆ insert_subtree()

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::insert_subtree ( iter  position,
const iterator_base &  subtree 
)

Definition at line 838 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::subtree().

Referenced by tree< T, tree_node_allocator >::append_children(), tree< T, tree_node_allocator >::merge(), and tree< T, tree_node_allocator >::replace().

◆ is_in_subtree()

template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::is_in_subtree ( const iterator_base &  position,
const iterator_base &  begin,
const iterator_base &  end 
) const

Definition at line 1336 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), and tmp.

◆ is_valid()

template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::is_valid ( const iterator_base &  it) const

Definition at line 1349 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::feet, and tree< T, tree_node_allocator >::iterator_base::node.

Referenced by tree< T, tree_node_allocator >::equal().

◆ merge()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::merge ( sibling_iterator  to1,
sibling_iterator  to2,
sibling_iterator  from1,
sibling_iterator  from2,
bool  duplicate_leaves = false 
)

Definition at line 1079 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::insert_subtree(), and tree< T, tree_node_allocator >::parent().

◆ move_after()

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
template<typename iter >
iter tree< T, tree_node_allocator >::move_after ( iter  target,
iter  source 
)

◆ move_before()

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::move_before ( iter  target,
iter  source 
)

Definition at line 1053 of file tree_msvc7.hpp.

References assert, tree_node_< T >::next_sibling, tree_node_< T >::parent, tree_node_< T >::prev_sibling, and rapidjson::source.

◆ move_below()

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
template<typename iter >
iter tree< T, tree_node_allocator >::move_below ( iter  target,
iter  source 
)

◆ next_sibling()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::next_sibling ( const iterator_base &  position) const

Definition at line 669 of file tree_msvc7.hpp.

References assert, tree< T, tree_node_allocator >::end(), tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::parent.

Referenced by SeqTree::getDiversityRankToRow(), GetMaxPath(), MidpointRootSeqTree(), and tree< T, tree_node_allocator >::reroot().

◆ number_of_children()

template<class T , class tree_node_allocator >
unsigned int tree< T, tree_node_allocator >::number_of_children ( const iterator_base &  it) const

Definition at line 1273 of file tree_msvc7.hpp.

References tree_node_< T >::first_child, tree_node_< T >::next_sibling, and tree< T, tree_node_allocator >::iterator_base::node.

Referenced by tree< T, tree_node_allocator >::equal_subtree(), MidpointRootSeqTree(), NJ_TreeAlgorithm::numChildren(), and SLC_TreeAlgorithm::numChildren().

◆ number_of_siblings()

template<class T , class tree_node_allocator >
unsigned int tree< T, tree_node_allocator >::number_of_siblings ( const iterator_base &  it) const

Definition at line 1289 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::head, tree_node_< T >::next_sibling, and tree< T, tree_node_allocator >::iterator_base::node.

Referenced by CDFamily::getNewickRepresentation(), MidpointRootSeqTree(), tree< T, tree_node_allocator >::reroot(), and CdTreeStream::write().

◆ operator=()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::operator= ( const tree< T, tree_node_allocator > &  other)

Definition at line 486 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::copy_().

◆ parent()

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::parent ( iter  position) const

Definition at line 655 of file tree_msvc7.hpp.

References assert.

Referenced by SeqTreeRootedLayout::findEdgeEnd(), CDFamily::getClassicalParent(), SeqTree::getDiversityRankToRow(), CDFamily::isDirectAncestor(), NJ_TreeAlgorithm::Join(), SLC_TreeAlgorithm::Join(), tree< T, tree_node_allocator >::merge(), TreeAlgorithm::midpointRootIfNeeded(), MidpointRootSeqTree(), SeqTree::prepare(), CdTreeStream::read(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::reroot().

◆ previous_sibling()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::previous_sibling ( const iterator_base &  position) const

Definition at line 662 of file tree_msvc7.hpp.

References assert, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::prev_sibling.

Referenced by SeqTree::getDiversityRankToRow(), and MidpointRootSeqTree().

◆ reparent() [1/2]

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::reparent ( iter  position,
iter  from 
)

Definition at line 1046 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::end(), and tree< T, tree_node_allocator >::reparent().

◆ reparent() [2/2]

template<class T , class tree_node_allocator >
template<typename iter >
iter tree< T, tree_node_allocator >::reparent ( iter  position,
sibling_iterator  begin,
sibling_iterator  end 
)

Definition at line 1001 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), first(), last(), tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::parent.

Referenced by NJ_TreeAlgorithm::Join(), SLC_TreeAlgorithm::Join(), MidpointRootSeqTree(), and tree< T, tree_node_allocator >::reparent().

◆ replace() [1/3]

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::replace ( iter  position,
const iterator_base &  from 
)

Definition at line 867 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::alloc_, tree< T, tree_node_allocator >::append_child(), assert, kp::constructor(), tree_node_< T >::data, kp::destructor(), tree< T, tree_node_allocator >::erase_children(), tree_node_< T >::first_child, tree< T, tree_node_allocator >::head, last(), tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, tree< T, tree_node_allocator >::parent(), tree_node_< T >::prev_sibling, and tmp.

◆ replace() [2/3]

template<class T , class tree_node_allocator >
template<class iter >
iter tree< T, tree_node_allocator >::replace ( iter  position,
const T &  x 
)

Definition at line 858 of file tree_msvc7.hpp.

References kp::constructor(), and kp::destructor().

Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::copy_(), tree< T, tree_node_allocator >::insert_subtree(), and tree< T, tree_node_allocator >::tree().

◆ replace() [3/3]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::replace ( sibling_iterator  orig_begin,
sibling_iterator  orig_end,
sibling_iterator  new_begin,
sibling_iterator  new_end 
)

Definition at line 927 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::erase(), first(), tree< T, tree_node_allocator >::insert_subtree(), last(), next(), tree_node_< T >::next_sibling, and tree< T, tree_node_allocator >::iterator_base::node.

◆ reroot()

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
tree tree< T, tree_node_allocator >::reroot ( iterator  newRoot)
inline

Definition at line 341 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::iterator_base::is_valid(), newTree(), tree< T, tree_node_allocator >::next_sibling(), tree< T, tree_node_allocator >::number_of_siblings(), tree< T, tree_node_allocator >::parent(), and tree< T, tree_node_allocator >::subtree().

Referenced by MidpointRootSeqTree().

◆ set_head()

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::set_head ( const T &  x)

Definition at line 754 of file tree_msvc7.hpp.

References assert, tree< T, tree_node_allocator >::feet, tree< T, tree_node_allocator >::head, tree< T, tree_node_allocator >::insert(), and tree_node_< T >::next_sibling.

Referenced by tree< T, tree_node_allocator >::tree().

◆ size()

template<class T , class tree_node_allocator >
int tree< T, tree_node_allocator >::size ( void  ) const

Definition at line 1241 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), and i.

Referenced by CDFamily::getCDCounts(), GetMaxPath(), TreeAlgorithm::midpointRootIfNeeded(), MidpointRootSeqTree(), CCalcSlantedTree::operator()(), and CTreeCollisionModel2D::UpdateVisibility().

◆ sort() [1/2]

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::sort ( sibling_iterator  from,
sibling_iterator  to,
bool  deep = false 
)

Definition at line 1112 of file tree_msvc7.hpp.

Referenced by tree< T, tree_node_allocator >::sort().

◆ sort() [2/2]

template<class T , class tree_node_allocator >
template<class StrictWeakOrdering >
void tree< T, tree_node_allocator >::sort ( sibling_iterator  from,
sibling_iterator  to,
StrictWeakOrdering  comp,
bool  deep = false 
)

Definition at line 1120 of file tree_msvc7.hpp.

References tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::end(), next(), tree< T, tree_node_allocator >::iterator_base::node, prev(), tree_node_< T >::prev_sibling, and tree< T, tree_node_allocator >::sort().

◆ subtree() [1/2]

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator > tree< T, tree_node_allocator >::subtree ( sibling_iterator  from,
sibling_iterator  to 
) const

Definition at line 1225 of file tree_msvc7.hpp.

References tmp.

Referenced by tree< T, tree_node_allocator >::insert_subtree(), and tree< T, tree_node_allocator >::reroot().

◆ subtree() [2/2]

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::subtree ( tree< T, tree_node_allocator > &  tmp,
sibling_iterator  from,
sibling_iterator  to 
) const

Definition at line 1234 of file tree_msvc7.hpp.

References tmp.

◆ swap()

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::swap ( sibling_iterator  it)

Definition at line 1301 of file tree_msvc7.hpp.

References tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.

Member Data Documentation

◆ alloc_

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
tree_node_allocator tree< T, tree_node_allocator >::alloc_
private

Definition at line 394 of file tree_msvc7.hpp.

Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::erase_children(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::~tree().

◆ feet

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
tree_node * tree< T, tree_node_allocator >::feet

Definition at line 332 of file tree_msvc7.hpp.

Referenced by tree< T, tree_node_allocator >::begin_post(), tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::end_post(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::is_valid(), tree< T, tree_node_allocator >::set_head(), and tree< T, tree_node_allocator >::~tree().

◆ head

template<class T , class tree_node_allocator = std::allocator<tree_node_<T> >>
tree_node* tree< T, tree_node_allocator >::head

Definition at line 332 of file tree_msvc7.hpp.

Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::begin_post(), tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::index(), tree< T, tree_node_allocator >::number_of_siblings(), tree< T, tree_node_allocator >::replace(), tree< T, tree_node_allocator >::set_head(), and tree< T, tree_node_allocator >::~tree().

The documentation for this class was generated from the following file:
Generated by doxygen 1.9.0
Modified on Fri Dec 01 04:50:36 2023 by modify_doxy.py rev. 669887