1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
|
//
// RapMap - Rapid and accurate mapping of short reads to transcriptomes using
// quasi-mapping.
// Copyright (C) 2015, 2016 Rob Patro, Avi Srivastava, Hirak Sarkar
//
// This file is part of RapMap.
//
// RapMap is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// RapMap is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with RapMap. If not, see <http://www.gnu.org/licenses/>.
//
#include <iostream>
#include <mutex>
#include <vector>
#include <random>
#include <unordered_map>
#include <fstream>
#include <algorithm>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <thread>
#include <tuple>
#include <sstream>
#include <fstream>
#include <iostream>
#include <tuple>
#include <memory>
#include <cstring>
#include "ScopedTimer.hpp"
#include <cereal/types/unordered_map.hpp>
#include <cereal/types/vector.hpp>
#include <cereal/types/string.hpp>
#include <cereal/archives/binary.hpp>
#include <cereal/archives/json.hpp>
#include "HitManager.hpp"
//#include "SIMDCompressionAndIntersection/intersection.h"
#include "xxhash.h"
#include "spdlog/spdlog.h"
#include "spdlog/sinks/ostream_sink.h"
#include "spdlog/fmt/ostr.h"
#include "spdlog/fmt/fmt.h"
#include "FastxParser.hpp"
#include "tclap/CmdLine.h"
#include "zstr/zstr.hpp"
/*extern "C" {
#include "kseq.h"
}
*/
#include "stringpiece.h"
#include "BooMap.hpp"
#include "FrugalBooMap.hpp"
#include "PairAlignmentFormatter.hpp"
#include "SingleAlignmentFormatter.hpp"
#include "RapMapUtils.hpp"
#include "RapMapSAIndex.hpp"
#include "RapMapFileSystem.hpp"
#include "RapMapConfig.hpp"
#include "ScopedTimer.hpp"
#include "SpinLock.hpp"
#include "IndexHeader.hpp"
#include "SASearcher.hpp"
#include "SACollector.hpp"
//#define __TRACK_CORRECT__
using paired_parser = fastx_parser::FastxParser<fastx_parser::ReadPair>;
using single_parser = fastx_parser::FastxParser<fastx_parser::ReadSeq>;
using TranscriptID = uint32_t;
using TranscriptIDVector = std::vector<TranscriptID>;
using KmerIDMap = std::vector<TranscriptIDVector>;
using TranscriptList = std::vector<uint32_t>;
using PositionList = std::vector<uint32_t>;
using KmerIndex = std::unordered_map<uint64_t, TranscriptList, rapmap::utils::KmerKeyHasher>;
using IntervalIndex = std::unordered_map<uint64_t, rapmap::utils::KmerInterval, rapmap::utils::KmerKeyHasher>;
using OccList = std::vector<uint64_t>;
using KmerInfoList = std::vector<rapmap::utils::KmerInfo>;
using EqClassList = std::vector<rapmap::utils::EqClass>;
using EqClassLabelVec = std::vector<uint32_t>;
using PositionListHelper = rapmap::utils::PositionListHelper;
#if defined __APPLE__
using SpinLockT = SpinLock;
#else
using SpinLockT = std::mutex;
#endif
using HitCounters = rapmap::utils::HitCounters;
using MateStatus = rapmap::utils::MateStatus;
using HitInfo = rapmap::utils::HitInfo;
using ProcessedHit = rapmap::utils::ProcessedHit;
using QuasiAlignment = rapmap::utils::QuasiAlignment;
using FixedWriter = rapmap::utils::FixedWriter;
struct MappingOpts {
std::string index;
std::string read1;
std::string read2;
std::string unmatedReads;
uint32_t numThreads{1};
uint32_t maxNumHits{200};
std::string outname;
double quasiCov{0.0};
bool pairedEnd{false};
bool noOutput{true};
bool sensitive{false};
bool strictCheck{false};
bool fuzzy{false};
bool consistentHits{false};
bool compressedOutput{false};
bool quiet{false};
int32_t maxMMPExtension{7};
};
template <typename RapMapIndexT, typename MutexT>
void processReadsSingleSA(single_parser * parser,
RapMapIndexT& rmi,
MutexT* iomutex,
std::shared_ptr<spdlog::logger> outQueue,
HitCounters& hctr,
MappingOpts* mopts) {
using OffsetT = typename RapMapIndexT::IndexType;
SACollector<RapMapIndexT> hitCollector(&rmi);
if (mopts->sensitive) {
hitCollector.disableNIP();
}
hitCollector.setStrictCheck(mopts->strictCheck);
if (mopts->quasiCov > 0.0) {
hitCollector.setCoverageRequirement(mopts->quasiCov);
}
auto logger = spdlog::get("stderrLog");
fmt::MemoryWriter sstream;
std::vector<QuasiAlignment> hits;
rapmap::hit_manager::HitCollectorInfo<rapmap::utils::SAIntervalHit<OffsetT>> hcInfo;
rapmap::utils::MappingConfig mc;
mc.consistentHits = false;
mc.doChaining = mopts->consistentHits;
if (mc.doChaining) {
hitCollector.setMaxMMPExtension(mopts->maxMMPExtension);
}
SingleAlignmentFormatter<RapMapIndexT*> formatter(&rmi);
SASearcher<RapMapIndexT> saSearcher(&rmi);
// Get the read group by which this thread will
// communicate with the parser (*once per-thread*)
auto rg = parser->getReadGroup();
while (parser->refill(rg)) {
for (auto& read : rg) {
read.seq.length();
++hctr.numReads;
hcInfo.clear();
hits.clear();
hitCollector(read.seq, saSearcher, hcInfo);
rapmap::hit_manager::hitsToMappingsSimple(rmi, mc,
MateStatus::SINGLE_END,
hcInfo, hits);
auto numHits = hits.size();
hctr.totHits += numHits;
if (hits.size() > 0 and !mopts->noOutput and hits.size() <= mopts->maxNumHits) {
/*
std::sort(hits.begin(), hits.end(),
[](const QuasiAlignment& a, const QuasiAlignment& b) -> bool {
return a.tid < b.tid;
});
*/
rapmap::utils::writeAlignmentsToStream(read, formatter,
hctr, hits, sstream);
}
if (hctr.numReads > hctr.lastPrint + 1000000) {
hctr.lastPrint.store(hctr.numReads.load());
if (!mopts->quiet and iomutex->try_lock()){
if (hctr.numReads > 0) {
#if defined(__DEBUG__) || defined(__TRACK_CORRECT__)
std::cerr << "\033[F\033[F\033[F";
#else
std::cerr << "\033[F\033[F";
#endif // __DEBUG__
}
std::cerr << "saw " << hctr.numReads << " reads\n";
std::cerr << "# hits per read = "
<< hctr.totHits / static_cast<float>(hctr.numReads) << "\n";
#if defined(__DEBUG__) || defined(__TRACK_CORRECT__)
std::cerr << "The true hit was in the returned set of hits "
<< 100.0 * (hctr.trueHits / static_cast<float>(hctr.numReads))
<< "% of the time\n";
#endif // __DEBUG__
iomutex->unlock();
}
}
} // for all reads in this job
// DUMP OUTPUT
if (!mopts->noOutput) {
std::string outStr(sstream.str());
// Get rid of last newline
if (!outStr.empty()) {
outStr.pop_back();
outQueue->info(std::move(outStr));
}
sstream.clear();
/*
iomutex->lock();
outStream << sstream.str();
iomutex->unlock();
sstream.clear();
*/
}
} // processed all reads
}
/**
* Map reads from a collection of paired-end files.
*/
template <typename RapMapIndexT, typename MutexT>
void processReadsPairSA(paired_parser* parser,
RapMapIndexT& rmi,
MutexT* iomutex,
std::shared_ptr<spdlog::logger> outQueue,
HitCounters& hctr,
MappingOpts* mopts) {
using OffsetT = typename RapMapIndexT::IndexType;
SACollector<RapMapIndexT> hitCollector(&rmi);
if (mopts->sensitive) {
hitCollector.disableNIP();
}
hitCollector.setStrictCheck(mopts->strictCheck);
if (mopts->quasiCov > 0.0) {
hitCollector.setCoverageRequirement(mopts->quasiCov);
}
auto logger = spdlog::get("stderrLog");
fmt::MemoryWriter sstream;
std::vector<QuasiAlignment> leftHits;
std::vector<QuasiAlignment> rightHits;
std::vector<QuasiAlignment> jointHits;
size_t readLen{0};
bool tooManyHits{false};
rapmap::hit_manager::HitCollectorInfo<rapmap::utils::SAIntervalHit<OffsetT>> leftHCInfo;
rapmap::hit_manager::HitCollectorInfo<rapmap::utils::SAIntervalHit<OffsetT>> rightHCInfo;
rapmap::utils::MappingConfig mc;
mc.consistentHits = false;//mopts->consistentHits;
mc.doChaining = mopts->consistentHits;
if (mc.doChaining) {
hitCollector.setMaxMMPExtension(mopts->maxMMPExtension);
}
// Create a formatter for alignments
PairAlignmentFormatter<RapMapIndexT*> formatter(&rmi);
SASearcher<RapMapIndexT> saSearcher(&rmi);
// Get the read group by which this thread will
// communicate with the parser (*once per-thread*)
auto rg = parser->getReadGroup();
while (parser->refill(rg)) {
for (auto& rpair : rg) {
tooManyHits = false;
readLen = rpair.first.seq.length();
++hctr.numReads;
leftHCInfo.clear();
rightHCInfo.clear();
jointHits.clear();
leftHits.clear();
rightHits.clear();
bool lh = hitCollector(rpair.first.seq,
saSearcher,
leftHCInfo);
bool rh = hitCollector(rpair.second.seq,
saSearcher,
rightHCInfo);
rapmap::hit_manager::hitsToMappingsSimple(rmi, mc,
MateStatus::PAIRED_END_LEFT,
leftHCInfo, leftHits);
rapmap::hit_manager::hitsToMappingsSimple(rmi, mc,
MateStatus::PAIRED_END_RIGHT,
rightHCInfo, rightHits);
if (mopts->fuzzy) {
rapmap::utils::mergeLeftRightHitsFuzzy(
lh, rh,
leftHits, rightHits, jointHits,
mc,
readLen, mopts->maxNumHits, tooManyHits, hctr);
} else {
rapmap::utils::mergeLeftRightHits(
leftHits, rightHits, jointHits,
readLen, mopts->maxNumHits, tooManyHits, hctr);
}
hctr.totHits += jointHits.size();
// If we have reads to output, and we're writing output.
if (jointHits.size() > 0 and !mopts->noOutput and jointHits.size() <= mopts->maxNumHits) {
rapmap::utils::writeAlignmentsToStream(rpair, formatter,
hctr, jointHits, sstream);
}
if (hctr.numReads > hctr.lastPrint + 1000000) {
hctr.lastPrint.store(hctr.numReads.load());
if (!mopts->quiet and iomutex->try_lock()) {
if (hctr.numReads > 0) {
std::cerr << "\r\r";
}
std::cerr << "saw " << hctr.numReads << " reads : "
<< "pe / read = " << hctr.peHits / static_cast<float>(hctr.numReads)
<< " : se / read = " << hctr.seHits / static_cast<float>(hctr.numReads) << ' ';
#if defined(__DEBUG__) || defined(__TRACK_CORRECT__)
std::cerr << ": true hit \% = "
<< (100.0 * (hctr.trueHits / static_cast<float>(hctr.numReads)));
#endif // __DEBUG__
iomutex->unlock();
}
}
} // for all reads in this job
// DUMP OUTPUT
if (!mopts->noOutput) {
std::string outStr(sstream.str());
// Get rid of last newline
if (!outStr.empty()) {
outStr.pop_back();
outQueue->info(std::move(outStr));
}
sstream.clear();
/*
iomutex->lock();
outStream << sstream.str();
iomutex->unlock();
sstream.clear();
*/
}
} // processed all reads
}
template <typename RapMapIndexT, typename MutexT>
bool spawnProcessReadsThreads(
uint32_t nthread,
paired_parser* parser,
RapMapIndexT& rmi,
MutexT& iomutex,
std::shared_ptr<spdlog::logger> outQueue,
HitCounters& hctr,
MappingOpts* mopts) {
std::vector<std::thread> threads;
for (size_t i = 0; i < nthread; ++i) {
threads.emplace_back(processReadsPairSA<RapMapIndexT, MutexT>,
parser,
std::ref(rmi),
&iomutex,
outQueue,
std::ref(hctr),
mopts);
}
for (auto& t : threads) { t.join(); }
return true;
}
template <typename RapMapIndexT, typename MutexT>
bool spawnProcessReadsThreads(
uint32_t nthread,
single_parser* parser,
RapMapIndexT& rmi,
MutexT& iomutex,
std::shared_ptr<spdlog::logger> outQueue,
HitCounters& hctr,
MappingOpts* mopts) {
std::vector<std::thread> threads;
for (size_t i = 0; i < nthread; ++i) {
threads.emplace_back(processReadsSingleSA<RapMapIndexT, MutexT>,
parser,
std::ref(rmi),
&iomutex,
outQueue,
std::ref(hctr),
mopts);
}
for (auto& t : threads) { t.join(); }
return true;
}
template <typename RapMapIndexT>
bool mapReads(RapMapIndexT& rmi,
std::shared_ptr<spdlog::logger> consoleLog,
MappingOpts* mopts) {
if (!mopts->quiet) { std::cerr << "\n\n\n\n"; }
bool pairedEnd = mopts->pairedEnd;//(read1.isSet() or read2.isSet());
// from: http://stackoverflow.com/questions/366955/obtain-a-stdostream-either-from-stdcout-or-stdofstreamfile
// set either a file or cout as the output stream
std::streambuf* outBuf;
std::ofstream outFile;
std::unique_ptr<std::ostream> outStream{nullptr};
bool haveOutputFile{false};
std::shared_ptr<spdlog::logger> outLog{nullptr};
if (!mopts->noOutput) {
if (mopts->outname == "") {
outBuf = std::cout.rdbuf();
} else {
outFile.open(mopts->outname);
outBuf = outFile.rdbuf();
haveOutputFile = true;
}
// Now set the output stream to the buffer, which is
// either std::cout, or a file.
if (mopts->compressedOutput) {
outStream.reset(new zstr::ostream(outBuf));
} else {
outStream.reset(new std::ostream(outBuf));
}
//std::ostream outStream(outBuf);
// Must be a power of 2
size_t queueSize{268435456};
spdlog::set_async_mode(queueSize);
auto outputSink = std::make_shared<spdlog::sinks::ostream_sink_mt>(*outStream);
outLog = std::make_shared<spdlog::logger>("rapmap::outLog", outputSink);
outLog->set_pattern("%v");
rapmap::utils::writeSAMHeader(rmi, outLog);
}
uint32_t nthread = mopts->numThreads;
std::unique_ptr<paired_parser> pairParserPtr{nullptr};
std::unique_ptr<single_parser> singleParserPtr{nullptr};
//for the parser
size_t chunkSize{10000};
SpinLockT iomutex;
{
ScopedTimer timer(!mopts->quiet);
HitCounters hctrs;
consoleLog->info("mapping reads . . . \n\n\n");
if (pairedEnd) {
std::vector<std::string> read1Vec = rapmap::utils::tokenize(mopts->read1, ',');
std::vector<std::string> read2Vec = rapmap::utils::tokenize(mopts->read2, ',');
if (read1Vec.size() != read2Vec.size()) {
consoleLog->error("The number of provided files for "
"-1 and -2 must be the same!");
std::exit(1);
}
uint32_t nprod = (read1Vec.size() > 1) ? 2 : 1;
pairParserPtr.reset(new paired_parser(read1Vec, read2Vec, nthread, nprod, chunkSize));
pairParserPtr->start();
spawnProcessReadsThreads(nthread, pairParserPtr.get(), rmi, iomutex,
outLog, hctrs, mopts);
pairParserPtr->stop();
} else {
std::vector<std::string> unmatedReadVec = rapmap::utils::tokenize(mopts->unmatedReads, ',');
uint32_t nprod = (unmatedReadVec.size() > 1) ? 2 : 1;
singleParserPtr.reset(new single_parser(unmatedReadVec, nthread, nprod, chunkSize));
singleParserPtr->start();
/** Create the threads depending on the collector type **/
spawnProcessReadsThreads(nthread, singleParserPtr.get(), rmi, iomutex,
outLog, hctrs, mopts);
singleParserPtr->stop();
}
if (!mopts->quiet) { std::cerr << "\n\n"; }
consoleLog->info("Done mapping reads.");
consoleLog->info("In total saw {:n} reads.", hctrs.numReads);
consoleLog->info("Final # hits per read = {}", hctrs.totHits / static_cast<float>(hctrs.numReads));
consoleLog->info("flushing output queue.");
if (outLog) {
outLog->flush();
}
/*
consoleLog->info("Discarded {} reads because they had > {} alignments",
hctrs.tooManyHits, maxNumHits.getValue());
*/
}
if (haveOutputFile) {
outFile.close();
}
return true;
}
void displayOpts(MappingOpts& mopts, spdlog::logger* log) {
fmt::MemoryWriter optWriter;
optWriter.write("\ncommand line options\n"
"====================\n");
optWriter.write("index: {}\n", mopts.index);
if (mopts.pairedEnd) {
optWriter.write("read(s) 1: {}\n", mopts.read1);
optWriter.write("read(s) 2: {}\n", mopts.read2);
} else {
optWriter.write("unmated read(s): {}\n", mopts.unmatedReads);
}
optWriter.write("output: {}\n", mopts.outname);
optWriter.write("num. threads: {}\n", mopts.numThreads);
optWriter.write("max num. hits: {}\n", mopts.maxNumHits);
optWriter.write("quasi-coverage: {}\n", mopts.quasiCov);
optWriter.write("no output: {}\n", mopts.noOutput);
optWriter.write("sensitive: {}\n", mopts.sensitive);
optWriter.write("strict check: {}\n", mopts.strictCheck);
optWriter.write("fuzzy intersection: {}\n", mopts.fuzzy);
optWriter.write("consistent hits: {}\n", mopts.consistentHits);
optWriter.write("====================");
log->info(optWriter.str());
}
int rapMapSAMap(int argc, char* argv[]) {
std::string versionString = rapmap::version;
TCLAP::CmdLine cmd(
"RapMap Mapper",
' ',
versionString);
cmd.getProgramName() = "rapmap";
TCLAP::ValueArg<std::string> index("i", "index", "The location of the quasiindex", true, "", "path");
TCLAP::ValueArg<std::string> read1("1", "leftMates", "The location of the left paired-end reads", false, "", "path");
TCLAP::ValueArg<std::string> read2("2", "rightMates", "The location of the right paired-end reads", false, "", "path");
TCLAP::ValueArg<std::string> unmatedReads("r", "unmatedReads", "The location of single-end reads", false, "", "path");
TCLAP::ValueArg<uint32_t> numThreads("t", "numThreads", "Number of threads to use", false, 1, "positive integer");
TCLAP::ValueArg<uint32_t> maxNumHits("m", "maxNumHits", "Reads mapping to more than this many loci are discarded", false, 200, "positive integer");
TCLAP::ValueArg<std::string> outname("o", "output", "The output file (default: stdout)", false, "", "path");
TCLAP::ValueArg<double> quasiCov("z", "quasiCoverage", "Require that this fraction of a read is covered by MMPs before it is considered mappable.", false, 0.0, "double in [0,1]");
TCLAP::SwitchArg noout("n", "noOutput", "Don't write out any alignments (for speed testing purposes)", false);
TCLAP::SwitchArg nosensitive("", "noSensitive", "Perform a less sensitive quasi-mapping by enabling NIP skipping", false);
TCLAP::SwitchArg noStrict("", "noStrictCheck", "Don't perform extra checks to try and assure that only equally \"best\" mappings for a read are reported", false);
TCLAP::SwitchArg fuzzy("f", "fuzzyIntersection", "Find paired-end mapping locations using fuzzy intersection", false);
TCLAP::SwitchArg consistent("c", "chaining", "Score the hits to find the best chain", false);
TCLAP::SwitchArg compressedOutput("x", "compressed", "Compress the output SAM file using zlib", false);
TCLAP::SwitchArg quiet("q", "quiet", "Disable all console output apart from warnings and errors", false);
cmd.add(index);
cmd.add(noout);
cmd.add(read1);
cmd.add(read2);
cmd.add(unmatedReads);
cmd.add(outname);
cmd.add(numThreads);
cmd.add(maxNumHits);
cmd.add(quasiCov);
cmd.add(nosensitive);
cmd.add(noStrict);
cmd.add(fuzzy);
cmd.add(consistent);
cmd.add(compressedOutput);
cmd.add(quiet);
auto consoleSink = std::make_shared<spdlog::sinks::ansicolor_stderr_sink_mt>();
auto consoleLog = spdlog::create("stderrLog", {consoleSink});
try {
cmd.parse(argc, argv);
// If we're supposed to be quiet, only print out warnings and above
if (quiet.getValue()) {
consoleLog->set_level(spdlog::level::warn);
}
bool pairedEnd = (read1.isSet() or read2.isSet());
if (pairedEnd and (read1.isSet() != read2.isSet())) {
consoleLog->error("You must set both the -1 and -2 arguments to align "
"paired end reads!");
std::exit(1);
}
if (pairedEnd and unmatedReads.isSet()) {
consoleLog->error("You cannot specify both paired-end and unmated "
"reads in the input!");
std::exit(1);
}
if (!pairedEnd and !unmatedReads.isSet()) {
consoleLog->error("You must specify input; either both paired-end "
"or unmated reads!");
std::exit(1);
}
std::string indexPrefix(index.getValue());
if (indexPrefix.back() != '/') {
indexPrefix += "/";
}
if (!rapmap::fs::DirExists(indexPrefix.c_str())) {
consoleLog->error("It looks like the index you provided [{}] "
"doesn't exist", indexPrefix);
std::exit(1);
}
MappingOpts mopts;
if (pairedEnd) {
mopts.read1 = read1.getValue();
mopts.read2 = read2.getValue();
mopts.pairedEnd = true;
} else {
mopts.unmatedReads = unmatedReads.getValue();
}
mopts.numThreads = numThreads.getValue();
mopts.maxNumHits = maxNumHits.getValue();
mopts.outname = (outname.isSet()) ? outname.getValue() : "";
mopts.quasiCov = quasiCov.getValue();
mopts.noOutput = noout.getValue();
mopts.sensitive = !nosensitive.getValue();
mopts.strictCheck = !noStrict.getValue();
mopts.consistentHits = consistent.getValue();
mopts.compressedOutput = compressedOutput.getValue();
mopts.fuzzy = fuzzy.getValue();
mopts.quiet = quiet.getValue();
if (quasiCov.isSet() and nosensitive.isSet()) {
consoleLog->info("The --quasiCoverage option is set to {}, but the --noSensitive flag was also set. The former forbids the later. Enabling sensitive mode.", quasiCov.getValue());
mopts.sensitive = true;
}
displayOpts(mopts, consoleLog.get());
IndexHeader h;
std::ifstream indexStream(indexPrefix + "header.json");
{
cereal::JSONInputArchive ar(indexStream);
ar(h);
}
indexStream.close();
if (h.indexType() != IndexType::QUASI) {
consoleLog->error("The index {} does not appear to be of the "
"appropriate type (quasi)", indexPrefix);
std::exit(1);
}
//std::unique_ptr<RapMapSAIndex<int32_t>> SAIdxPtr{nullptr};
//std::unique_ptr<RapMapSAIndex<int64_t>> BigSAIdxPtr{nullptr};
bool success{false};
if (h.bigSA()) {
//std::cerr << "Loading 64-bit suffix array index: \n";
//BigSAIdxPtr.reset(new RapMapSAIndex<int64_t>);
//BigSAIdxPtr->load(indexPrefix, h.kmerLen());
if (h.perfectHash()) {
RapMapSAIndex<int64_t, PerfectHashT<uint64_t, rapmap::utils::SAInterval<int64_t>>> rmi;
rmi.load(indexPrefix);
success = mapReads(rmi, consoleLog, &mopts);
} else {
RapMapSAIndex<int64_t,
RegHashT<uint64_t, rapmap::utils::SAInterval<int64_t>,
rapmap::utils::KmerKeyHasher>> rmi;
rmi.load(indexPrefix);
success = mapReads(rmi, consoleLog, &mopts);
}
} else {
//std::cerr << "Loading 32-bit suffix array index: \n";
//SAIdxPtr.reset(new RapMapSAIndex<int32_t>);
//SAIdxPtr->load(indexPrefix, h.kmerLen());
if (h.perfectHash()) {
RapMapSAIndex<int32_t, PerfectHashT<uint64_t, rapmap::utils::SAInterval<int32_t>>> rmi;
rmi.load(indexPrefix);
success = mapReads(rmi, consoleLog, &mopts);
} else {
RapMapSAIndex<int32_t,
RegHashT<uint64_t, rapmap::utils::SAInterval<int32_t>,
rapmap::utils::KmerKeyHasher>> rmi;
rmi.load(indexPrefix);
success = mapReads(rmi, consoleLog, &mopts);
}
}
return success ? 0 : 1;
} catch (TCLAP::ArgException& e) {
consoleLog->error("Exception [{}] when parsing argument {}", e.error(), e.argId());
return 1;
}
}
|