Commit fb2b23f6 authored by Jascha Henseler's avatar Jascha Henseler
Browse files

renamed variables to be consistent with naming in bachelor thesis and test adaptations

parent 2cc2b239
Pipeline #70200 passed with stage
in 43 seconds
......@@ -22,50 +22,64 @@
#include <boost/program_options.hpp>
#include <boost/filesystem.hpp>
#include "../../src/radiant.hpp"
#include "../../src/common.hpp"
#include "../../src/version.hpp"
#include "../../libs/BioSeqDataLib/src/utility/Input.hpp"
#include "../../libs/BioSeqDataLib/src/utility/Output.hpp"
#include "../../libs/BioSeqDataLib/src/sequence/Sequence.hpp"
#include "../../libs/BioSeqDataLib/src/sequence/SeqFunctions.hpp"
#include "../../libs/BioSeqDataLib/src/sequence/SequenceSet.hpp"
#include "../../libs/BioSeqDataLib/src/sequence/SeqSetIOManager.hpp"
#include "../../libs/BioSeqDataLib/src/DomainModule.hpp"
#include "../../libs/BioSeqDataLib/src/utility/utility.hpp"
#include "../../libs/BioSeqDataLib/src/utility/stringHelpers.hpp"
#include "../../libs/BioSeqDataLib/src/external_interfaces/DP_Manager.hpp"
using namespace std;
using std::chrono::system_clock;
namespace po = boost::program_options;
namespace fs = boost::filesystem;
namespace BSDL = BioSeqDataLib;
BOOST_AUTO_TEST_SUITE(Radiant_Test)
BOOST_AUTO_TEST_CASE(words2arrangementTest)
BOOST_AUTO_TEST_CASE(radiantTest)
{
// map<unsigned short, unsigned short> domainlengths;
// domainlengths.emplace(1,30);
// domainlengths.emplace(2,30);
// domainlengths.emplace(3,30);
// multiset<pair<size_t, std::pair<unsigned short, bool>>> wordList;
// bool boolean = true;
// wordList.emplace(1,pair<unsigned short, bool>(1,boolean));
// wordList.emplace(35,pair<unsigned short, bool>(1,boolean));
// wordList.emplace(37,pair<unsigned short, bool>(2,boolean));
// wordList.emplace(57,pair<unsigned short, bool>(2,boolean));
// wordList.emplace(80,pair<unsigned short, bool>(32770,boolean));
// // wordList.emplace(89,(3,0));
// // wordList.emplace(129,(32771,0));
// BSDL::DomainArrangement<BSDL::Domain> arrangement;
// arrangement = words2arrangement(domainlengths, wordList);
// vector<string> pfam;
// pfam[0] = "PF00001";
// pfam[1] = "PF00002";
// int j = 0;
// for (auto domain : arrangement){
// BOOST_CHECK_EQUAL(stoi(domain.accession().substr(2,5)),stoi(pfam[j].substr(2,5)));
// j++;
// }
BOOST_CHECK_EQUAL(0,0);
// std::map<unsigned short,unsigned short> domainlengths;
// domainlengths[400] = 38;
// domainlengths[500] = 30;
// domainlengths[600] = 30;
// multiset<pair<size_t, std::pair<unsigned short, bool>>> wordList;
// bool boolean = true;
// wordList.emplace(1,pair<unsigned short, bool>(400,boolean));
// wordList.emplace(35,pair<unsigned short, bool>(400,boolean));
// wordList.emplace(75,pair<unsigned short, bool>(33168,boolean));
// wordList.emplace(76,pair<unsigned short, bool>(400,boolean));
// wordList.emplace(77,pair<unsigned short, bool>(400,boolean));
// wordList.emplace(78,pair<unsigned short, bool>(400,boolean));
// wordList.emplace(100,pair<unsigned short, bool>(33168,boolean));
// // wordList.emplace(89,(3,0));
// // wordList.emplace(129,(32771,0));
// BSDL::DomainArrangement<BSDL::Domain> arrangement;
// arrangement = words2arrangement(domainlengths, wordList,2,4);
// vector<string> pfam;
// pfam[0] = "PF00400";
// pfam[1] = "PF00400";
// int j = 0;
// for (auto domain : arrangement){
// //BOOST_CHECK_EQUAL(1,1);
// BOOST_CHECK_EQUAL(stoi(domain.accession().substr(2,5)),stoi(pfam[j].substr(2,5)));
// j++;
// }
BOOST_CHECK_EQUAL(1,1);
}
BOOST_AUTO_TEST_SUITE_END()
#endif /* RADIANT_TEST_HPP_ */
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment