mirror of
http://43.156.76.180:8026/YuuMJ/EukPhylo.git
synced 2025-12-28 05:40:26 +08:00
39 lines
1.1 KiB
C++
39 lines
1.1 KiB
C++
// $Id: seqContainerTreeMap.h 8985 2010-11-16 19:56:20Z cohenofi $
|
|
|
|
#ifndef ___SEQUENCE_CONTAINER_TREE_MAP
|
|
#define ___SEQUENCE_CONTAINER_TREE_MAP
|
|
#include "definitions.h"
|
|
#include "tree.h"
|
|
#include "treeIt.h"
|
|
#include "sequenceContainer.h"
|
|
|
|
void checkThatNamesInTreeAreSameAsNamesInSequenceContainer(const tree& et,const sequenceContainer & sc, bool bLeavesOnly = true);
|
|
void intersectNamesInTreeAndSequenceContainer(tree& et,sequenceContainer & sc, bool bLeavesOnly= true);
|
|
|
|
void getLeavesSequences(const sequenceContainer& sc, const tree& tr, sequenceContainer& sc_leaves);
|
|
|
|
class seqContainerTreeMap {
|
|
public:
|
|
explicit seqContainerTreeMap(const sequenceContainer& sc,
|
|
const tree& et) {
|
|
checkThatNamesInTreeAreSameAsNamesInSequenceContainer(et,sc);
|
|
_V.resize(et.getNodesNum());
|
|
treeIterTopDownConst tit(et);
|
|
for (tree::nodeP myN = tit.first();myN!=tit.end(); myN = tit.next()) {
|
|
if (myN->isInternal()) {
|
|
_V[myN->id()] = -1;
|
|
} else {
|
|
_V[myN->id()] = sc.getId(myN->name(),false);
|
|
}
|
|
}
|
|
}
|
|
int seqIdOfNodeI(const int nodeID) {
|
|
return _V[nodeID];
|
|
}
|
|
|
|
private:
|
|
vector<int> _V;// _V[i] is the sequenceId of node I.
|
|
};
|
|
|
|
#endif
|