// $Id: seqContainerTreeMap.cpp 9939 2011-10-22 13:52:12Z cohenofi $

#include "seqContainerTreeMap.h"
#include "logFile.h"
#include "treeUtil.h"

/********************************************************************************************
*********************************************************************************************/
void intersectNamesInTreeAndSequenceContainer(tree& et, sequenceContainer & sc, bool bLeavesOnly){
	LOGnOUT(4,<<"\n intersectNames Tree vs Sequence. Before intersect numOfSeq= "<<sc.numberOfSeqs()<<" nunOfTaxa= "<<et.getLeavesNum()<<endl);
	treeIterDownTopConst tIt(et);
	vector<tree::nodeP> nodes2remove;
	vector<int> seqIDs2remove;
	//cout<<"tree names:"<<endl;

	for (tree::nodeP mynode = tIt.first(); mynode != tIt.end(); mynode = tIt.next()) {
		bool bFound = false;
		if (bLeavesOnly) {
			if (mynode->isInternal()) 
				continue;
		}
		sequenceContainer::constTaxaIterator it=sc.constTaxaBegin();
		for (;it != sc.constTaxaEnd(); ++it) 
		{
			string scName = it->name();
			string treeNodeName = mynode->name();

			if (it->name() == mynode->name()) 
			{
				bFound = true;
				break;
			}
		}
		if (bFound == false) 
		{
			string errMsg = "The taxID:\t";
			errMsg += mynode->name();
			errMsg += "\twas found in the tree file but not found in the sequence file. Removed from tree.";
			LOGnOUT(4,<<errMsg<<endl);
			nodes2remove.push_back(mynode);			
		}
	}
	for(int i=0; i<nodes2remove.size(); ++i){
		et.removeLeaf(nodes2remove[i]);
	}
	sequenceContainer::constTaxaIterator myseq=sc.constTaxaBegin();
	for (;myseq != sc.constTaxaEnd(); ++myseq){
		bool bFound = false;
		for (tree::nodeP mynode = tIt.first(); mynode != tIt.end(); mynode = tIt.next()) {			
			if (bLeavesOnly)
			{
				if (mynode->isInternal()) 
					continue;
			}
			if (myseq->name() == mynode->name()) 
			{
				bFound = true;
				break;
			}
		}
		if (bFound == false) 
		{
			string errMsg = "The taxID name:\t";
			errMsg += myseq->name();
			errMsg += "\twas found in the sequence file but not found in the tree file. Removed.";
			LOGnOUT(4,<<errMsg<<endl);
			seqIDs2remove.push_back(myseq->id());			
		}
	}
	for(int i=0; i<seqIDs2remove.size(); ++i){
		sc.remove(seqIDs2remove[i]);
	}
}

/********************************************************************************************
*********************************************************************************************/
//if bLeavesOnly == true then checks only leaves, otherwise the sequence container includes also internal nodes (as may be the result of simlations
void checkThatNamesInTreeAreSameAsNamesInSequenceContainer(const tree& et,const sequenceContainer & sc, bool bLeavesOnly){
	treeIterDownTopConst tIt(et);
	//cout<<"tree names:"<<endl;
	
	for (tree::nodeP mynode = tIt.first(); mynode != tIt.end(); mynode = tIt.next()) {
		bool bFound = false;
		if (bLeavesOnly) {
            if (mynode->isInternal()) 
                continue;
		}
		sequenceContainer::constTaxaIterator it=sc.constTaxaBegin();
		for (;it != sc.constTaxaEnd(); ++it) 
		{
			string scName = it->name();
			string treeNodeName = mynode->name();

			if (it->name() == mynode->name()) 
			{
				bFound = true;
				break;
			}
		}
		if (bFound == false) 
		{
			string errMsg = "The sequence name: ";
			errMsg += mynode->name();
			errMsg += " was found in the tree file but not found in the sequence file.\n";
			errMsg += " Please, Re-run program with _intersectTreeAndSeq to produce new MSA and Tree.\n";
			LOG(4,<<errMsg<<endl);
			errorMsg::reportError(errMsg);
		}
	}	
	sequenceContainer::constTaxaIterator it=sc.constTaxaBegin();
	for (;it != sc.constTaxaEnd(); ++it){
		bool bFound = false;	
		for (tree::nodeP mynode = tIt.first(); mynode != tIt.end(); mynode = tIt.next()) {
			if (bLeavesOnly)
			{
                if (mynode->isInternal()) 
                    continue;
			}
			if (it->name() == mynode->name()) 
			{
				bFound = true;
				break;
			}
		}
		if (bFound == false) 
		{
			string errMsg = "The sequence name: ";
			errMsg += it->name();
			errMsg += " was found in the sequence file but not found in the tree file.\n";
			errMsg += " Please, Re-run program with _intersectTreeAndSeq to produce new MSA and Tree.\n";
			errorMsg::reportError(errMsg);
		}
	}
}

/********************************************************************************************
// input: a tree and a sequence-container containing all of the leaves sequences.
// output: fills sc_leaves with the sequences of the leaves only.
*********************************************************************************************/
void getLeavesSequences(const sequenceContainer& sc,
						const tree& tr, sequenceContainer& sc_leaves) {
	vector<string> leavesNames = getSequencesNames(tr);
	vector<string>::iterator itr_leaves;
	for (itr_leaves=leavesNames.begin();itr_leaves!=leavesNames.end();++itr_leaves) {
		sequenceContainer::constTaxaIterator it_sc=sc.constTaxaBegin();
		for (;it_sc != sc.constTaxaEnd(); ++it_sc) {
			if (it_sc->name() == *(itr_leaves)) {
				sc_leaves.add(*it_sc);
				break;
			}
		}
	}
	if (tr.getLeavesNum() != sc_leaves.numberOfSeqs()) {
		string errMsg = "getLeavesSequencese: the number of leaves is not equal to the number of leaves' sequences";
		errorMsg::reportError(errMsg);
	}
}