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

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

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

Sort(

idx,

order);

SortSubtreeDist(

idx,

vector<float>& distances,

order);

SortLabel(

idx,

order);

vector<pair<string,string> >& subtree_labels,

sel_children =

,

sel_parents =

);

GetSelState(TSelState& sel_state,

sel_children =

,

sel_parents =

)

;

ClearSelection();

GetSelected(vector<TTreeIdx>& sel)

;

GetSelectedIDs(vector<TID>& sel)

;

GetExplicitlySelected(vector<TTreeIdx>& esel)

;

GetExplicitlySelectedAndNotCollapsed(vector<TTreeIdx>& esel)

;

GetExplicitlySelectedIDs(vector<TID>& esel)

;

SetExplicitlySelected(

vector<TID>& esel);

SetLeavesExplicitlySelected();

SetSelection(

vector<TTreeIdx>& sel,

sel_children =

,

sel_parents =

);

SetSelectionIDs(

vector<TID>& ids,

sel=

,

sel_children=

);

()

{

(m_Selected.size() > 0 ?

:

); }

SelectByPoint(

& pt,

sel,

toggle,

labels_visible,

rotated_labels=

);

vector<TTreeIdx> GetAllCollapsed()

;

SetCurrentNode(

node_idx);

SetCurrentNode(

& pt,

labels_visible,

rotated_labels,

unselect=

);

HasCurrentEdge()

;

(itNode != m_NodesMap.end()) ? itNode->second :

();

UpdateNodesMapping();

override_explicit=

);

x_SelectParents(

& node,

sel,

children_selected =

);

x_GetParentState(TSelState& sel_state,

x_GetChildState(TSelState& sel_state,

<

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->SubNodeBeginEx();

TTreeNodeIterator it_end = tr->SubNodeEndEx();

stack<TTreeNodeIterator> tree_stack;

tr = &tree_model[*it];

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

(delta_level >= 0) &&

it = tr->SubNodeBeginEx();

it_end = tr->SubNodeEndEx();

(tree_stack.empty()) {

it = tree_stack.top();

tr = &tree_model[*it];

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

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->SubNodeBeginEx();

TTreeNodeIterator it_end = tr->SubNodeEndEx();

(; 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>

Tree subclass also has functions and data needed for rendering and selection.

CRef< CTreeGraphicsModel > m_GraphicsModel

Model for rendering (updated from current tree state)

bool IsUnused(TTreeIdx idx) const

Return true if the given position in the array is not currently included as a node in the tree.

TTIDPhyloTreeNodeMap m_NodesMap

CRef< CTreeGraphicsModel > GetGraphicsModelRef()

CPhyloTree & operator=(const CPhyloTree &)

TTreeIdx m_CurrentEdgeChild

Currently active edge (to allow re-rooting by edge).

map< TID, TTreeIdx > TTIDPhyloTreeNodeMap

Node ID to tree index map.

TTreeIdx m_CurrentNode

Currently active node (for operations like edit), or Null()

TTreeIdxSet m_ExplicitlySelected

Often when you select a node, it's children or parents may also join the selection set.

CPhyloNodeData::TClusterID TClusterID

bool HasSelection() const

CPhyloSelectionSetMgr & GetSelectionSets()

const CBioTreeFeatureDictionary & GetFeatureDict() const

TTreeIdx GetCurrentNodeIdx() const

Return the index of the currently active node (may be Null()).

CRef< CRgbaGradColorTable > m_ColorTable

Color table to store colors by index.

vector< TSelStateValue > TSelState

CPhyloTree(const CPhyloTree &)

Disable copy.

TTreeIdx m_CurrentEdgeParent

CPhyloSelectionSetMgr m_SelectionSets

Selection sets - sets of selected nodes, which are saved in the biotreecontainer in user data (visual...

const CPhyloSelectionSetMgr & GetSelectionSets() const

bool HasCurrentNode() const

Return true if the currently active node is not Null()

TTreeIdx FindNodeById(TID id) const

Return index of the node with the given id or Null().

set< TTreeIdx > TTreeIdxSet

Indices of all the nodes with selection state eSelected.

CBioTreeFeatureDictionary & GetFeatureDict()

Return feature dictionary.

pair< TTreeIdx, CPhyloNodeData::TSelectedState > TSelStateValue

size_t GetNumSelected() const

Returns the number of selected nodes.

CBioTreeFeatureDictionary m_FeatureDict

Feature dictionary.

void SetGraphicsModelRef(CRef< CTreeGraphicsModel > gm)

Set graphics model - may be needed if we want to render to different graphics contexts since graphics...

CRgbaGradColorTable Provides a storage for colors (to eliminate color creation overhead) and Function...

class CTreeGraphicsModel Model for rendering tree graphics data.

virtual void x_ConvertUpstream(TTreeIdx node_idx)

Convert parents of node_idx to be its children.

static TTreeIdx Null()

Return the index value that represents a NULL node.

void Clear()

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

container_type::const_iterator const_iterator

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

#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)

#define NCBI_GUIWIDGETS_PHYLO_TREE_EXPORT

Portable reference counted smart and weak pointers using CWeakRef, CRef, CObject and CObjectEx.

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

Breadth-first tree traversal that skips collapsed nodes.

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

Depth-first tree traversal that skips collapsed nodes.

size_t TTreeIdx

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

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