Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/tree__model_8hpp_source.html below:

NCBI C++ ToolKit: include/gui/widgets/phylo_tree/tree_model.hpp Source File

<

TData>

<

TNode>

{

[size_t(idx)].GetValue(); }

{

[size_t(idx)].GetValue(); }

<

TTreeModel,

Fun>

TTreeModel::TNodeType TNodeType;

stop_scan = func(tree_model, node_idx, delta_level);

TNodeType* tr = &tree_model[node_idx];

TNodeType::TNodeList_I TTreeNodeIterator;

TTreeNodeIterator it = tr->SubNodeBegin();

TTreeNodeIterator it_end = tr->SubNodeEnd();

stack<TTreeNodeIterator> tree_stack;

tr = &tree_model[*it];

stop_scan = func(tree_model, *it, delta_level);

(delta_level >= 0) &&

it = tr->SubNodeBegin();

it_end = tr->SubNodeEnd();

(tree_stack.empty()) {

it = tree_stack.top();

tr = &tree_model[*it];

it_end = tree_model[tr->GetParent()].SubNodeEnd();

func(tree_model, node_idx, -1);

<

TTreeModel,

Fun>

(tree_model, tree_model.GetRootIdx(), func);

<

TTreeModel>

<

TTreeModel,

Fun>

TTreeModel::TNodeType TNodeType;

TNodeType::TNodeList_I TTreeNodeIterator;

stop_scan = func(tree_model, node_idx, delta_level);

TNodeType* tr = &tree_model[node_idx];

TTreeNodeIterator it_end = node_iter.

.end();

(node_iter.

== it_end)

stack<NodeListIter<TTreeModel> > tree_stack;

tr = &tree_model[*node_iter.

];

stop_scan = func(tree_model, *node_iter.

, delta_level);

(delta_level >= 0) &&

tree_stack.push(node_iter);

(node_iter.

== it_end) {

(tree_stack.empty()) {

node_iter = tree_stack.top();

tr = &tree_model[*node_iter.

];

func(tree_model, node_idx, -1);

<

TTreeModel,

Fun>

<

TTreeModel,

Fun>

TTreeModel::TNodeType TNodeType;

stop_scan = func(tree_model, node_idx, delta_level);

TNodeType::TNodeList_I TTreeNodeIterator;

queue<TTreeIdx> node_queue;

node_queue.push(node_idx);

(!node_queue.empty()) {

node_idx = node_queue.front();

TNodeType* tr = &tree_model[node_idx];

TTreeNodeIterator it = tr->SubNodeBegin();

TTreeNodeIterator it_end = tr->SubNodeEnd();

(; it != it_end; ++it) {

stop_scan = func(tree_model, *it, delta_level);

node_queue.push(*it);

(--level_count == 0) {

level_count = node_queue.size();

func(tree_model, node_idx, -1);

<

TTreeModel,

Fun>

<

TData>

<

TData>

(HasChild(child_idx)) {

(

<< child_idx <<

);

m_ChildNodes.push_back(child_idx);

<

TData>

vector<TTreeIdx>::iterator iter = find(m_ChildNodes.begin(), m_ChildNodes.end(), child_idx);

(iter==m_ChildNodes.end()) {

m_ChildNodes.erase(iter);

<

TData>

( std::find(m_ChildNodes.begin(), m_ChildNodes.end(), child_idx) != m_ChildNodes.end());

<

TNode>

<

TNode>

<

TNode>

(node.GetParent() == TNodeType::Null())

m_Nodes[node.GetParent()];

<

TNode>

(node.GetParent() == TNodeType::Null())

m_Nodes[node.GetParent()];

<

TNode>

m_Nodes[size_t(parent_idx)].RemoveChild(child_idx);

m_Nodes[size_t(child_idx)].SetParent(Null());

<

TNode>

m_Nodes[size_t(parent_idx)].AddChild(child_idx);

m_Nodes[size_t(child_idx)].SetParent(parent_idx);

<

TNode>

(m_RootIdx == idx)

(idx >= m_Nodes.size())

x_ConvertUpstream(idx);

<

TNode>

parent_idx = m_Nodes[node_idx].GetParent();

(parent_idx != Null()) {

RemoveChild(parent_idx, node_idx);

x_ConvertUpstream(parent_idx);

AddChild(node_idx, parent_idx);

<

TNode>

m_Nodes.push_back(TNode());

idx = m_Nodes.size()-1;

<

TNode>

idx = m_Nodes.size();

m_Nodes.push_back(node);

<

TNode>

m_Nodes.reserve(target_size);

Base class for nodes in the tree.

const TData & operator*() const

const TData & GetValue() const

void RemoveChild(TTreeIdx child_idx)

Remove child node if it is a child of this node.

TData m_Data

Data object.

void RemoveParent()

Set the parent index to Null() e.g. for root node.

TNodeList::reverse_iterator TNodeList_RI

TNodeList_RI SubNodeRBegin()

Return reverse iterator to (reverse) begin of subnode array.

TTreeIdx GetParent() const

Get node's parent.

void ClearConnections()

Remove connections to parent and children of this node.

TTreeIdx m_ParentNode

Index of parent node to this node. ==Null() if this is the root node.

TData & operator*()

Return the value object for the node using de-referenceing semantics.

TNodeList_CI SubNodeEnd() const

Return const iterator to end of subnode list.

TNodeList & GetChildren()

Return the indices of this node's child nodes.

TNodeList::iterator TNodeList_I

void SetParent(TTreeIdx parent_idx)

Set index of nodes parent.

TNodeList_CRI SubNodeRBegin() const

Return const reverse iterator to (reverse) of begin of subnode array.

TNodeList_CRI SubNodeREnd() const

Return const reverse iterator to (reverse) end of subnode array.

bool HasChild(TTreeIdx child_idx) const

Check if another node is a child of this node.

CTreeModelNode()

Construct an empty node (null parent)

TData & GetValue()

Return the value object for the node.

TNodeList_I SubNodeBegin()

Return iterator to first subnode index.

TNodeList_RI SubNodeREnd()

Return reverse iterator to (reverse) end of subnode array.

TNodeList::const_reverse_iterator TNodeList_CRI

bool HasParent() const

Check if the node has a parent.

TNodeList::const_iterator TNodeList_CI

const TNodeList & GetChildren() const

const TData * operator->() const

vector< TTreeIdx > TNodeList

TNodeList_I SubNodeEnd()

Return iterator to end of subnode list.

bool IsLeaf() const

Report whether this is a leaf node.

static TTreeIdx Null()

Static function that returns the null value.

TNodeList_CI SubNodeBegin() const

Return const iterator to first subnode index.

vector< TTreeIdx > m_ChildNodes

Indices of all the children of this node.

void AddChild(TTreeIdx child_idx)

Add a child node.

void SetValue(const TData &data)

Set the value-object for the node.

int m_NumNodes

Number of nodes in tree (not including collapsed/hidden nodes)

const TNode & operator[](TTreeIdx idx) const

void ReRoot(TTreeIdx idx)

Sets the root idx to be 'idx' and updates the tree so that all nodes above the new root become childr...

virtual void x_ConvertUpstream(TTreeIdx node_idx)

Convert parents of node_idx to be its children.

const TValueType & GetNodeValue(TTreeIdx idx) const

const TNode & GetRoot() const

TNodeType & GetParent(TNodeType &node)

Return a reference to the parent node of the given node.

TNodeType::TNodeList_I TNodeList_I

TNodeVecType m_Nodes

The list of nodes in the tree.

TTreeIdx AddNode(const TNode &node)

Add a copy of node 'node' to the tree and return its index.

TValueType & GetNodeValue(TTreeIdx idx)

Return a reference to the 'value' object of a node.

const TNodeType & GetParent(TNodeType &node) const

TNodeType & operator[](TTreeIdx idx)

Use operator[] to return a reference to the node at 'idx'.

void Reserve(size_t target_size)

Allocate the memory in advance, if you know how big the tree will be.

size_t GetNumNodes() const

Get the number of displayed nodes in current tree layout.

static TTreeIdx Null()

Return the index value that represents a NULL node.

size_t GetSize() const

Get the number of nodes currently in the array.

void SetNumNodes(int count)

Set the number of displayed nodes in current tree layout.

CTreeModel()

Create empty tree. Tree is not valid at this point (no nodes)

TNodeType & GetNode(TTreeIdx idx)

Return a reference to the node at the given index.

TNodeType::TNodeList_CRI TNodeList_CRI

TNodeType::TNodeList_CI TNodeList_CI

void Clear()

Remove all nodes (empty array) and set root index to Null.

TNodeType::TNodeList_RI TNodeList_RI

TNodeType & GetRoot()

Return a reference to the root node of the tree.

void AddChild(TTreeIdx parent_idx, TTreeIdx child_idx)

Add the node at 'child_idx' to the children 'parent_idx'.

TNodeType::TNodeList TNodeList

const TNode & GetNode(TTreeIdx idx) const

std::vector< TNodeType > TNodeVecType

TTreeIdx GetRootIdx() const

Return the index of the root node.

TNode::TValueType TValueType

TTreeIdx AddNode()

Add a new default node to the tree and return its index.

void RemoveChild(TTreeIdx parent_idx, TTreeIdx child_idx)

Remove the node at 'child_idx' from its parent 'parent_idx' Nothing is done if the node 'child_idx' i...

void SetRootIdx(TTreeIdx idx)

Set the index of the root node of the tree.

TTreeIdx m_RootIdx

The index of the root node within the tree.

Include a standard set of the NCBI C++ Toolkit most basic headers.

#define LOG_POST(message)

This macro is deprecated and it's strongly recomended to move in all projects (except tests) to macro...

#define NCBI_THROW(exception_class, err_code, message)

Generic macro to throw an exception, given the exception class, error code and message string.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

ETreeTraverseCode

Tree traverse code returned by the traverse predicate function.

@ eTreeTraverseStop

Stop traversal (return form algorithm)

@ eTreeTraverse

Keep traversal.

@ eTreeTraverseStepOver

Do not traverse current node (pick the next one)

Depth-first tree traversal which allows the traversed tree to update the list of child nodes at the c...

NodeListIter(const NodeListIter &rhs)

void SetNode(TNodeType *tr)

TTreeModel::TNodeType TNodeType

TTreeModel::TNodeList TNodeList

NodeListIter & operator=(const NodeListIter &rhs)

TNodeType::TNodeList_I TTreeNodeIterator

NodeListIter(TNodeType *tr)

Fun TreeBreadthFirst(TTreeModel &tree_model, typename TTreeModel::TTreeIdx node_idx, Fun func)

Breadth-first tree traversall.

#define NULL_TREE_IDX

Global define for a NULL link in the tree used for comparison.

Fun TreeDepthFirst(TTreeModel &tree_model, typename TTreeModel::TTreeIdx node_idx, Fun func)

Depth-first tree traversal algorithm.

size_t TTreeIdx

Bi-directionaly linked N way tree allocated in a contiguous memory block.

Fun TreeDepthFirstInvarient(TTreeModel &tree_model, typename TTreeModel::TTreeIdx node_idx, Fun func)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4