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__collision__model2d_8cpp_source.html below:

NCBI C++ ToolKit: src/gui/widgets/phylo_tree/tree_collision_model2d.cpp Source File

vector<size_t>::const_iterator iter;

(iter=node_indices.begin(); iter!=node_indices.end(); ++iter) {

default_angle =

->GetAngle();

->SetAngle(scaled_angle);

->SetAngle(default_angle);

(grid_pos.Y() = posi_ll.

(); grid_pos.Y()<=posi_ur.

(); ++grid_pos.Y()) {

(grid_pos.X() = posi_ll.

(); grid_pos.X()<=posi_ur.

(); ++grid_pos.X()) {

best_vis_idx = -1;

best_vis_label_dist = FLT_MAX;

best_hidden_idx = -1;

best_hidden_label_dist = FLT_MAX;

(

=0;

<cell_nodes.size(); ++

) {

xdelta = (x-p.

()) * 1.0f/

.

();

ydelta = (y-p.

()) * 1.0f/

.

();

dist = sqrtf( xdelta*xdelta + ydelta*ydelta );

vis_label = node->GetVisible() && labels_visible;

(vis_label && dist < best_vis_label_dist) {

best_vis_idx = cell_nodes[

];

best_vis_label_dist = dist;

(!vis_label && dist < best_hidden_label_dist) {

best_hidden_idx = cell_nodes[

];

best_hidden_label_dist = dist;

(node->GetVisible() && labels_visible) {

best_vis_idx = cell_nodes[

];

best_vis_label_dist = node->GetNodeSize();

(best_vis_idx > -1) {

tree_idx = best_vis_idx;

(best_hidden_idx != -1) {

tree_idx = best_hidden_idx;

vector<CPhyloTree::TTreeIdx> sel_nodes;

(

x = idx1.

(); x <= idx2.

(); ++x) {

(

y = idx1.

(); y <= idx2.

(); ++y) {

(

= 0;

<cell_nodes.size(); ++

) {

(p.

() >= x1 && p.

() <= x2 &&

p.

() >= y1 && p.

() <= y2) {

sel_nodes.push_back(cell_nodes[

]);

(sel_nodes.begin(), sel_nodes.end());

sel_nodes.erase(std::unique(sel_nodes.begin(), sel_nodes.end()), sel_nodes.end());

xoverlap = !( (ll2.

() > ur1.

() || ur2.

() < ll1.

()) );

yoverlap = !( (ll2.

() > ur1.

() || ur2.

() < ll1.

()) );

(xoverlap && yoverlap);

prev_posi_ll.

() =

(prev_posi_ll.

(), 0);

prev_posi_ll.

() =

(prev_posi_ll.

(), 0);

prev_posi_ur.

() =

(prev_posi_ur.

(), 0);

prev_posi_ur.

() =

(prev_posi_ur.

(), 0);

(

x = prev_posi_ll.

(); x <= prev_posi_ur.

(); ++x) {

(

y = prev_posi_ll.

(); y <= prev_posi_ur.

(); ++y) {

std::vector<size_t>& cell_nodes =

(idx).

;

(

=0;

<cell_nodes.size(); ++

) {

(*tree)[cell_nodes[

]]->SetVisible(

);

(

x = posi_ll.

(); x <= posi_ur.

(); ++x) {

(

y = posi_ll.

(); y <= posi_ur.

(); ++y) {

std::vector<size_t>& cell_nodes =

(idx).

;

(

=0;

<cell_nodes.size(); ++

) {

((*

)[cell_nodes[

]]->GetDisplayLabel() !=

)

(*tree)[cell_nodes[

]]->SetVisible(

);

(

x = posi_ll.

(); x <= posi_ur.

(); ++x) {

(

y = posi_ll.

(); y <= posi_ur.

(); ++y) {

std::vector<size_t> cell_nodes =

(idx).

;

(

=0;

<cell_nodes.size(); ++

) {

label1_visible = (l1->GetVisible() && l1->GetDisplayLabel().length() > 0);

scaled_nodesize_x1 = l1->GetNodeDisplaySize()*

.

();

scaled_nodesize_y1 = l1->GetNodeDisplaySize()*

.

();

nll1.

() = l1->X()-scaled_nodesize_x1;

nll1.

() = l1->Y()-scaled_nodesize_y1;

nur1.

() = l1->X()+scaled_nodesize_x1;

nur1.

() = l1->Y()+scaled_nodesize_y1;

(

j=

+1; j<cell_nodes.

(); ++j) {

label2_visible = (l2->GetVisible() && l2->GetDisplayLabel().length() > 0);

(label2_visible) {

l2->SetVisible(

);

l2->SetVisible(

);

(label1_visible) {

scaled_nodesize_x2 = l1->GetNodeDisplaySize()*

.

();

scaled_nodesize_y2 = l1->GetNodeDisplaySize()*

.

();

nll2.

() = l2->X()-scaled_nodesize_x2;

nll2.

() = l2->Y()-scaled_nodesize_y2;

nur2.

() = l2->X()+scaled_nodesize_x2;

nur2.

() = l2->Y()+scaled_nodesize_y2;

l1->SetVisible(

);

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

class CSpatialHash2D Class for simple 2D spatial organization that allows for some collision checking...

CVect2< int > m_VisMinIdx

Range of visible indices from previous call to UpdateVisibility.

int m_Width

Width and heigt of table (m_MaxIdx-m_MinIdx)

TElemType & Get(const TVeci &item)

float m_ResolutionX

Divisor for dividing model-space resolution into table indices.

CVect2< float > m_PrevVisMax

CVect2< float > m_PrevVisMin

Visible rectangle area from previous call to UpdateVisibility.

TElemType GetSafe(const TVeci &item) const

Return an empty TElemType if index is out of range.

CVect2< int > m_VisMaxIdx

TVeci m_MinIdx

Min/Max indicies in the table.

CVect2< float > m_Scale

Current scaling factor of model for viewing in x and y.

void Update(const CGlPane &pane, const CVect2< float > &scale)

Update all geometry (needed when topology changes)

CRef< CPhyloTreeScheme > m_SL

void UpdateScaled(const CGlPane &pane, const CVect2< float > &scale)

Only update scaled geometry (needed when zoom changes)

void Sync(const CGlPane &pane, CTreeGraphicsModel *m)

Insert data from model (labels/nodes)

CTreeGraphicsModel * m_Model

Underlying graphics model.

vector< size_t > SelectNodes(float x1, float y1, float x2, float y2)

Return all nodes within the region (x1,y1) - (x2,y2)

virtual void UpdateVisibility(const TModelRect &r)

Find collisions between labels in visible regions to determine visiblity.

size_t TestForNode(float x, float y, bool labels_visible, bool rotated_labels=false)

Return node at position (x,y), if any.

void SetScheme(CPhyloTreeScheme &sl)

Set rendering scheme for tree (has info needed for node sizes)

static bool RectIntersect(const CVect2< float > &ll1, const CVect2< float > &ur1, const CVect2< float > &ll2, const CVect2< float > &ur2)

Utility function returns true if rectangle one (ll1-ur1) intersects rectangle 2 (ll2-ur2)

class CTreeGraphicsModel Model for rendering tree graphics data.

vector< size_t > & GetNodeIndices()

Get all the nodes (indicies point to nodes in phylo tree)

CPhyloTree * GetTree()

Get the tree (to which the node indices belong)

bool GetRotateLabels() const

float GetCurrentRotationAngle(const CGlPane &pane, const CPhyloTreeNode &n, bool &visible) const

Return node's label rotation angle for current zoom level.

static TTreeIdx Null()

Return the index value that represents a NULL node.

TObjectType * GetPointer(void) THROWS_NONE

Get pointer,.

void Reset(void)

Reset reference object.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

constexpr auto sort(_Init &&init)

The NCBI C++/STL use hints.

Defines: CTimeFormat - storage class for time format.

double r(size_t dimension_, const Int4 *score_, const double *prob_, double theta_)

vector< size_t > m_Labels

CompareLabelX(CPhyloTree *tree, const CVect2< float > &s)

bool operator()(size_t lhs, size_t rhs)

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