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

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

NCBI C++ ToolKit: src/algo/structure/cd_utils/cuSeqTreeAlg.cpp Source File

midpointDist = 0.0;

dToNewParent = 0, dToNewChild = 0;

(oldTree.

() == 0) {

midpointDist = dmax/2.0;

(cursor1.

() && dToEnd1 < midpointDist) {

dToEnd1 += cursor1->distance;

cursor1 = tmpTree.

(cursor2);

(!cursor1.

() || !tmpTree.

(cursor1).is_valid()) {

item =

(

, -1, dToEnd1-midpointDist);

cursor2->distance -= item.

;

(dToEnd1 == midpointDist) {

newTreeRoot = cursor1;

cursor1 = tmpTree.

(newTreeRoot);

cursor2 = newTreeRoot;

dToNewParent = cursor2->distance;

cursor2->distance = 0.0;

dToNewChild = cursor1->distance;

cursor1->distance = dToNewParent;

dToNewParent = dToNewChild;

cursor1 = tmpTree.

(cursor2);

tmpTreeCursor = cursor2.

();

(tmpTreeCursor != tmpSibling) {

tmpTreeCursor->distance += cursor2->distance;

(nTopLevelNodes == 2) {

cursor1 = tmpTree.

();

cursor1->distance += dToNewParent;

}

(nTopLevelNodes > 2) {

.SeqTreeBase::operator=(tmpTree.

(newTreeRoot));

(nTopLevelNodes > 2) {

newTreeCursor =

.begin();

(!found && newTreeCursor !=

.end()) {

(*newTreeCursor == item) {

sit = newTreeCursor.

();

(sit != newTreeCursor.

()) {

(*sit == nullItem) {

sit->distance = dToNewParent;

found = (

== 1) ?

:

;

rootDMax = 0.0, d1 = 0.0, d2 = 0.0;

(atree.

() < 2) {

end1 = atree.

();

end2 = atree.

();

it = atree.

();

(it != atree.

() && foundCount < 2) {

(rootEnd1.

() && *it == *rootEnd1) {

}

(rootEnd2.is_valid() && *it == *rootEnd2) {

(foundCount < 2) {

(

&& rootEnd1 != rootEnd2 && rootDMax > 0) {

end1 = atree.

();

end2 = atree.

();

localMax, localBranch1, localBranch2;

(dBranch1 >= dBranch2);

sibDist, testDist;

(

&& sibCursor != cursor.

()) {

sibDist = sibCursor->distance;

=

(sibCursor, localMax, localBranch1, localEnd1, localBranch2, localEnd2);

testDist = localBranch1 + sibDist + dBranch1;

(localMax > dMax && localMax > testDist) {

dBranch1 = localBranch1 + sibDist;

dBranch2 = localBranch2 + sibDist;

}

(testDist >= localMax && testDist > dMax) {

(localBranch1 + sibDist > dBranch1) {

dBranch1 = localBranch1 + sibDist;

dBranch2 = localBranch1 + sibDist;

}

(dMax >= localMax && dMax >= testDist) {

static const Rootedness DEF_ROOTED

bool useMidpointRooting()

void midpointRootIfNeeded()

static const string NO_NAME

sibling_iterator end() const

unsigned int number_of_children() const

sibling_iterator begin() const

pre_order_iterator iterator

sibling_iterator previous_sibling(const iterator_base &) const

sibling_iterator next_sibling(const iterator_base &) const

iter append_child(iter position)

tree reroot(iterator newRoot)

pre_order_iterator begin() const

iter insert(iter position, const T &x)

unsigned int number_of_children(const iterator_base &) const

iter reparent(iter position, sibling_iterator begin, sibling_iterator end)

unsigned int number_of_siblings(const iterator_base &) const

pre_order_iterator end() const

bool GetMaxPath(const SeqTree &atree, double &dMax, SeqTree::iterator &end1, SeqTree::iterator &end2)

void MidpointRootSeqTree(const SeqTree &oldTree, SeqTree &newTree)

const double RESET_WITH_TINY_DISTANCE

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define END_SCOPE(ns)

End the previously defined scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

#define BEGIN_SCOPE(ns)

Define a new scope.

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