// Copyright 2008, 2009, 2010, 2011, 2012, 2013, 2014 Martin C. Frith

#include "LastalArguments.hh"
#include "stringify.hh"
#include "getoptUtil.hh"

#include <math.h>

#include <algorithm>  // max
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <cctype>
#include <cstring>  // strtok
#include <cstdlib>  // EXIT_SUCCESS

#define ERR(x) throw std::runtime_error(x)

const double default_D = 1e6;

static void badopt( char opt, const char* arg ){
  ERR( std::string("bad option value: -") + opt + ' ' + arg );
}

static void badopt(const char *opt, const char *arg) {
  ERR(std::string("bad option value: --") + opt  + '=' + arg);
}

static void parseIntList(const char *in, std::vector<int> &out) {
  std::istringstream s(in);
  out.clear();
  int x;
  while (s >> x) {
    out.push_back(x);
    s.ignore();
  }
  if (!s.eof()) {
    ERR(std::string("bad option value: ") + in);
  }
}

static void writeIntList(std::ostream &s, const std::vector<int> &v) {
  for (size_t i = 0; i < v.size(); ++i) {
    if (i) s << ',';
    s << v[i];
  }
}

static char parseOutputFormat( const char* text ){
  std::string s = text;
  for( size_t i = 0; i < s.size(); ++i ){
    s[i] = std::tolower( s[i] );
  }
  if( s == "tab" || s == "0" ) return 't';
  if( s == "maf" || s == "1" ) return 'm';
  if( s == "blasttab" )        return 'b';
  if( s == "blasttab+" )       return 'B';
  return 0;
}

static int parseScoreAndSuffix(const std::string &s, char &suffix) {
  char c = 0;
  int x;
  std::istringstream i(s);
  if (!(i >> x) || x < 0 || (i >> c && i >> c)) {
    ERR("bad value: " + s);
  }
  suffix = c;
  return x;
}

namespace cbrc{

LastalArguments::LastalArguments() :
  outputFormat('m'),
  outputType(3),
  scoreType(-1),
  strand(-1),  // depends on the alphabet
  isReverseQuerySequences(false),
  isQueryStrandMatrix(false),
  isGreedy(false),
  globality(0),
  isPairedQuerySequences(false),
  isKeepLowercase(true),  // depends on the option used with lastdb
  tantanSetting(-1),  // depends on the option used with lastdb
  maxRepeatUnit(-1),
  maskLowercase(-1),  // depends on the lowercase option used with lastdb
  expectedAlignments(0),
  expectedPerSquareGiga(0),
  queryLettersPerRandomAlignment(0),
  minScoreGapped(-1),  // depends on the alphabet
  minScoreGapless(-1),  // depends on minScoreGapped and the outputType
  matchScore(-1),  // depends on the alphabet
  mismatchCost(-1),  // depends on the alphabet
  gapPairCost(-1),  // this means: OFF
  matrixFile(""),
  ambiguousLetterOpt(0),
  maxDropGapped(100),  // depends on maxDropFinal
  maxDropGappedSuffix('%'),
  maxDropGapless(-1),  // depends on the score matrix
  maxDropFinal(100),  // depends on minScoreGapped
  maxDropFinalSuffix('%'),
  inputFormat(sequenceFormat::fasta),
  minHitDepth(1),
  maxHitDepth(-1),
  oneHitMultiplicity(10),
  maxGaplessAlignmentsPerQueryPosition(0),  // depends on oneHitMultiplicity
  maxAlignmentsPerQueryStrand(-1),
  cullingLimitForGaplessAlignments(0),
  cullingLimitForFinalAlignments(-1),
  queryStep(1),
  minimizerWindow(0),  // depends on the reference's minimizer window
  batchSize(0),  // depends on voluming
  numOfThreads(1),
  maxRepeatDistance(1000),  // sufficiently conservative?
  temperature(-1),  // depends on the score matrix
  gamma(1),
  geneticCodeFile("1"),
  verbosity(0),
  gumbelSimSequenceLength(0),
  gumbelSimAlignmentCount(50),  // from Y-K Yu, R Bundschuh, T Hwa, 2002
  isSplit(false){}

void LastalArguments::fromArgs( int argc, char** argv, bool optionsOnly ){
  programName = argv[0];
  std::string usage = "Usage: " + std::string(programName) +
    " [options] lastdb-name fasta-sequence-file(s)\n\
Find and align similar sequences.\n\
\n\
Cosmetic options:\n\
 -h, --help     show all options and their default settings, and exit\n\
 -V, --version  show version information, and exit\n\
 -v             be verbose: write messages about what lastal is doing\n\
 -2             paired query sequences\n\
 -f             output format: TAB, MAF, BlastTab, BlastTab+ (default: MAF)";

  std::string help = usage + "\n\
\n\
E-value options (default settings):\n\
 -D  query letters per random alignment (default: "
    + stringify(default_D) + ")\n\
 -H  expected total number of random alignments for all the sequences\n\
 -E  max EG2: expected number of random alignments per square giga\n\
\n\
Score options (default settings):\n\
 -r  match score   (2 if -M, else 1)\n\
 -q  mismatch cost (3 if -M, else 1)\n\
 -p  match/mismatch score matrix (DNA-DNA: HUMSUM, protein-protein: BLOSUM62,\n\
                                  DNA-protein: BLOSUM80)\n\
 -X  N/X is ambiguous in: 0=neither sequence, 1=reference, 2=query, 3=both ("
    + stringify(ambiguousLetterOpt) + ")\n\
 -a  gap existence cost (24 if HUMSUM, else 11 if protein reference, else 7)\n\
 -b  gap extension cost ( 1 if HUMSUM, else  2 if protein reference, else 1)\n\
 -A  insertion existence cost (a)\n\
 -B  insertion extension cost (b)\n\
 -c  unaligned residue pair cost (off)\n\
 -F  frameshift cost(s) (off)\n\
 -x  maximum score drop for preliminary gapped alignments (z)\n\
 -y  maximum score drop for gapless alignments (min[t*10, x])\n\
 -z  maximum score drop for final gapped alignments (e-1)\n\
 -d  minimum score for gapless alignments (min[e, 2500/n query letters per hit])\n\
 -e  minimum score for gapped alignments\n\
\n\
Initial-match options (default settings):\n\
 -m  maximum initial matches per query position ("
    + stringify(oneHitMultiplicity) + ")\n\
 -l  minimum length for initial matches ("
    + stringify(minHitDepth) + ")\n\
 -L  maximum length for initial matches (infinity)\n\
 -k  use initial matches starting at every k-th position in each query ("
    + stringify(queryStep) + ")\n\
 -W  use \"minimum\" positions in sliding windows of W consecutive positions\n\
\n\
Miscellaneous options (default settings):\n\
 -P  number of parallel threads (default: "
    + stringify(numOfThreads) + ")\n\
 -K  omit alignments whose query range lies in >= K others with > score (off)\n\
 -C  omit gapless alignments in >= C others with > score-per-length (off)\n\
 -s  strand: 0=reverse, 1=forward, 2=both (2 if DNA and not lastdb -S2, else 1)\n\
 --reverse  reverse the query sequences\n\
 -S  use score matrix: 0=as-is, 1=on query forward strands ("
    + stringify(isQueryStrandMatrix) + ")\n\
 -i  query batch size (64M if multi-volume, else off)\n\
 -M  find minimum-difference alignments (faster but cruder)\n\
 -T  type of alignment: 0=local, 1=overlap (default: "
    + stringify(globality) + ")\n\
 -n  maximum gapless alignments per query position (infinity if m=0, else m)\n\
 -N  stop after the first N alignments per query strand\n\
 -R  lowercase & simple-sequence options (the same as was used by lastdb)\n\
 -U  maximum tandem repeat unit length (100 if --codon else same as lastdb)\n\
 -u  mask lowercase during extensions: 0=never, 1=gapless,\n\
     2=gapless+postmask, 3=always (2 if lastdb -c and Q!=pssm, else 0)\n\
 -w  suppress repeats inside exact matches, offset by <= this distance ("
    + stringify(maxRepeatDistance) + ")\n\
 -G  genetic code (default: " + geneticCodeFile + ")\n\
 -t  'temperature' for calculating probabilities (1/lambda)\n\
 -g  'gamma' parameter for gamma-centroid and LAMA (default: "
    + stringify(gamma) + ")\n\
 -j  output type: 0=match counts, 1=gapless, 2=redundant gapped, 3=gapped,\n\
                  4=column ambiguity estimates, 5=gamma-centroid, 6=LAMA,\n\
                  7=expected counts (default: "
    + stringify(outputType) + ")\n\
 -J  score type: 0=ordinary, 1=full (1 for new-style frameshifts, else 0)\n\
 -Q  input format: fastx, keep, sanger, solexa, illumina, prb, pssm\n\
                   (default: fasta)\n\
\n\
Split options:\n\
 --split         do split alignment\n\
 --splice        do spliced alignment\n\
 --split-f=FMT   " + LastSplitOptions::helpf + "\n\
 --split-d=D     " + LastSplitOptions::helpd + "\n\
 --split-c=PROB  " + LastSplitOptions::helpc + "\n\
 --split-t=PROB  " + LastSplitOptions::helpt + "\n\
 --split-M=MEAN  " + LastSplitOptions::helpM + "\n\
 --split-S=SDEV  " + LastSplitOptions::helpS + "\n\
 --split-m=PROB  " + LastSplitOptions::helpm + "\n\
 --split-s=INT   " + LastSplitOptions::helps + "\n\
 --split-n       " + LastSplitOptions::helpn + "\n\
 --split-b=B     " + LastSplitOptions::helpb + "\n\
";

  static const char sOpts[] =
    "hVv2f:"
    "r:q:p:X:a:b:A:B:c:F:x:y:z:d:e:"
    "D:E:H:"
    "s:S:MT:m:l:L:n:N:C:K:k:W:i:P:R:U:u:w:t:g:G:j:J:Q:";

  static struct option lOpts[] = {
    { "help",    no_argument,       0, 'h' },
    { "version", no_argument,       0, 'V' },
    { "reverse", no_argument,          0, 'R' - 'A' },
    { "gumbel-len", required_argument, 0, 'L' - 'A' },
    { "gumbel-num", required_argument, 0, 'N' - 'A' },
    { "split",   no_argument,       0, 128 + 0 },
    { "splice",  no_argument,       0, 128 + 1 },
    { "split-f", required_argument, 0, 128 + 'f' },
    { "split-d", required_argument, 0, 128 + 'd' },
    { "split-c", required_argument, 0, 128 + 'c' },
    { "split-t", required_argument, 0, 128 + 't' },
    { "split-M", required_argument, 0, 128 + 'M' },
    { "split-S", required_argument, 0, 128 + 'S' },
    { "split-m", required_argument, 0, 128 + 'm' },
    { "split-s", required_argument, 0, 128 + 's' },
    { "split-n", no_argument,       0, 128 + 'n' },
    { "split-b", required_argument, 0, 128 + 'b' },
    { 0, 0, 0, 0}
  };

  int c, lOptsIndex;
  while ((c = getopt_long(argc, argv, sOpts, lOpts, &lOptsIndex)) != -1) {
    switch(c){
    case 'h':
      std::cout << help;
      throw EXIT_SUCCESS;
    case 'V':
      std::cout << "lastal "
#include "version.hh"
	"\n";
      throw EXIT_SUCCESS;
    case 'v':
      ++verbosity;
      break;
    case '2':
      isPairedQuerySequences = true;
      break;
    case 'f':
      outputFormat = parseOutputFormat( optarg );
      if( !outputFormat ) badopt( c, optarg );
      break;

    case 'r':
      unstringify( matchScore, optarg );
      if( matchScore <= 0 ) badopt( c, optarg );
      break;
    case 'q':
      unstringify( mismatchCost, optarg );
      if( mismatchCost < 0 ) badopt( c, optarg );  // allow 0 for Fujibuchi-san
      break;
    case 'p':
      matrixFile = optarg;
      break;
    case 'X':
      unstringify(ambiguousLetterOpt, optarg);
      if (ambiguousLetterOpt < 0 || ambiguousLetterOpt > 3) badopt(c, optarg);
      break;
    case 'a':
      parseIntList(optarg, delOpenCosts);
      break;
    case 'b':
      parseIntList(optarg, delGrowCosts);
      break;
    case 'A':
      parseIntList(optarg, insOpenCosts);
      break;
    case 'B':
      parseIntList(optarg, insGrowCosts);
      break;
    case 'c':
      unstringify( gapPairCost, optarg );
      if( gapPairCost <= 0 ) badopt( c, optarg );
      break;
    case 'F':
      parseIntList(optarg, frameshiftCosts);
      if (frameshiftCosts.size() != 4 &&
	  (frameshiftCosts.size() != 1 || frameshiftCosts[0] < 0))
	badopt(c, optarg);
      break;
    case 'x':
      maxDropGapped = parseScoreAndSuffix(optarg, maxDropGappedSuffix);
      break;
    case 'y':
      unstringify( maxDropGapless, optarg );
      if( maxDropGapless < 0 ) badopt( c, optarg );
      break;
    case 'z':
      maxDropFinal = parseScoreAndSuffix(optarg, maxDropFinalSuffix);
      break;
    case 'd':
      unstringify( minScoreGapless, optarg );
      if( minScoreGapless < 0 ) badopt( c, optarg );
      break;
    case 'e':
      unstringify( minScoreGapped, optarg );
      if( minScoreGapped < 0 ) badopt( c, optarg );
      break;

    case 'D':
      unstringify( queryLettersPerRandomAlignment, optarg );
      if( queryLettersPerRandomAlignment <= 0 ) badopt( c, optarg );
      break;
    case 'E':
      unstringify(expectedPerSquareGiga, optarg);
      if (expectedPerSquareGiga <= 0) badopt(c, optarg);
      break;
    case 'H':
      unstringify(expectedAlignments, optarg);
      if (expectedAlignments <= 0) badopt(c, optarg);
      break;

    case 'm':
      unstringify( oneHitMultiplicity, optarg );
      break;
    case 'l':
      unstringify( minHitDepth, optarg );
      break;
    case 'L':
      unstringify( maxHitDepth, optarg );
      break;
    case 'k':
      unstringify( queryStep, optarg );
      if( queryStep <= 0 ) badopt( c, optarg );
      break;
    case 'W':
      unstringify( minimizerWindow, optarg );  // allow 0, meaning "default"
      break;

    case 's':
      strand = LastSplitOptions::parseStrand(optarg);
      if (strand < 0) badopt(c, optarg);
      if (strand > 2) isPairedQuerySequences = true;
      break;
    case 'S':
      unstringify( isQueryStrandMatrix, optarg );
      break;
    case 'M':
      isGreedy = true;
      break;
    case 'T':
      unstringify( globality, optarg );
      if( globality < 0 || globality > 1 ) badopt( c, optarg );
      break;
    case 'n':
      unstringify( maxGaplessAlignmentsPerQueryPosition, optarg );
      if( maxGaplessAlignmentsPerQueryPosition <= 0 ) badopt( c, optarg );
      break;
    case 'N':
      unstringify( maxAlignmentsPerQueryStrand, optarg );
      break;
    case 'C':
      unstringify( cullingLimitForGaplessAlignments, optarg );
      break;
    case 'K':
      unstringify( cullingLimitForFinalAlignments, optarg );
      break;
    case 'i':
      unstringifySize( batchSize, optarg );
      if( batchSize <= 0 ) badopt( c, optarg );  // 0 means "not specified"
      break;
    case 'P':
      unstringify( numOfThreads, optarg );
      break;
    case 'R':
      if( optarg[0] < '0' || optarg[0] > '1' ) badopt( c, optarg );
      if( optarg[1] < '0' || optarg[1] > '3' ) badopt( c, optarg );
      if( optarg[2] ) badopt( c, optarg );
      isKeepLowercase = optarg[0] - '0';
      tantanSetting = optarg[1] - '0';
      break;
    case 'U':
      unstringify(maxRepeatUnit, optarg);
      if (maxRepeatUnit < 0) badopt(c, optarg);
      break;
    case 'u':
      unstringify( maskLowercase, optarg );
      if( maskLowercase < 0 || maskLowercase > 3 ) badopt( c, optarg );
      break;
    case 'w':
      unstringify( maxRepeatDistance, optarg );
      break;
    case 't':
      unstringify( temperature, optarg );
      if( temperature <= 0 ) badopt( c, optarg );
      break;
    case 'g':
      unstringify( gamma, optarg );
      if( gamma <= 0 ) badopt( c, optarg );
      break;
    case 'G':
      geneticCodeFile = optarg;
      break;
    case 'j':
      unstringify( outputType, optarg );
      if( outputType < 0 || outputType > 7 ) badopt( c, optarg );
      break;
    case 'J':
      unstringify(scoreType, optarg);
      if (scoreType < 0 || scoreType > 1) badopt(c, optarg);
      break;
    case 'Q':
      unstringify( inputFormat, optarg );
      break;

    case 'R' - 'A':
      isReverseQuerySequences = true;
      break;
    case 'L' - 'A':
      unstringify(gumbelSimSequenceLength, optarg);
      if (gumbelSimSequenceLength <= 0) badopt(lOpts[lOptsIndex].name, optarg);
      break;
    case 'N' - 'A':
      unstringify(gumbelSimAlignmentCount, optarg);
      if (gumbelSimAlignmentCount <= 0) badopt(lOpts[lOptsIndex].name, optarg);
      break;

    case 128 + 1:
      splitOpts.isSplicedAlignment = true;
      break;
    case 128 + 'f':
      splitOpts.format = LastSplitOptions::parseOutputFormat(optarg);
      break;
    case 128 + 'd':
      splitOpts.isSplicedAlignment = true;
      splitOpts.direction = LastSplitOptions::parseStrand(optarg);
      if (splitOpts.direction < 0) badopt(lOpts[lOptsIndex].name, optarg);
      if (splitOpts.direction > 2) isPairedQuerySequences = true;
      break;
    case 128 + 'c':
      splitOpts.isSplicedAlignment = true;
      unstringify(splitOpts.cis, optarg);
      break;
    case 128 + 't':
      splitOpts.isSplicedAlignment = true;
      unstringify(splitOpts.trans, optarg);
      break;
    case 128 + 'M':
      splitOpts.isSplicedAlignment = true;
      unstringify(splitOpts.mean, optarg);
      break;
    case 128 + 'S':
      splitOpts.isSplicedAlignment = true;
      unstringify(splitOpts.sdev, optarg);
      break;
    case 128 + 'm':
      unstringify(splitOpts.mismap, optarg);
      break;
    case 128 + 's':
      unstringify(splitOpts.score, optarg);
      break;
    case 128 + 'n':
      splitOpts.no_split = true;
      break;
    case 128 + 'b':
      unstringifySize(splitOpts.bytes, optarg);
      break;

    case '?':
      ERR( "bad option" );
    }

    if (c >= 128) isSplit = true;
  }

  if( maskLowercase == 1 && inputFormat == 5 )
    ERR( "can't combine option -u 1 with option -Q 5" );

  if( maskLowercase == 2 && inputFormat == 5 )
    ERR( "can't combine option -u 2 with option -Q 5" );

  if( isTranslated() && inputFormat == 5 )
    ERR( "can't combine option -F with option -Q 5" );

  if (frameshiftCosts.size() == 1 && frameshiftCosts[0] > 0) {
    if (outputType > 3) ERR("can't combine option -F > 0 with option -j > 3");
    if (scoreType == 1) ERR("can't combine option -F > 0 with option -J 1");
  }

  if( isFrameshift() && outputType > 4 && outputType < 7 )
    ERR( "can't combine option -F > 0 with option -j > 3" );

  if( isFrameshift() && globality == 1 )
    ERR( "can't combine option -F > 0 with option -T 1" );

  if( isTranslated() && isQueryStrandMatrix )
    ERR( "can't combine option -F with option -S 1" );

  if (isGreedy) {
    if (outputType > 3) ERR("can't combine option -M with option -j > 3");
    if (scoreType == 1) ERR("can't combine option -M with option -J 1");
    if (globality == 1) ERR("can't combine option -M with option -T 1");
    if (maskLowercase == 3) ERR("can't combine option -M with option -u 3");
  }

  if( gapPairCost > 0 && outputType > 3 )
    ERR( "can't combine option -c with option -j > 3" );

  if (tantanSetting > 0 && maxRepeatUnit == 0) {
    ERR("can't find repeats with maximum unit length 0");
  }

  if( !optionsOnly ){
    if( optind >= argc )
      ERR( "please give me a database name and sequence file(s)\n\n" + usage );
    lastdbName = argv[optind++];
    inputStart = optind;
    if (splitOpts.isSplicedAlignment) splitOpts.genome = lastdbName;
  }

  resetGetopt();
}

void LastalArguments::fromLine( const std::string& line ){
  const char* delimiters = " \t";
  const char* s = line.c_str();
  std::vector<char> args( s, s + line.size() + 1 );
  std::vector<char*> argv;
  char* i = std::strtok( &args[0], delimiters );
  argv.push_back(i);
  while( i ){
    i = std::strtok( 0, delimiters );
    argv.push_back(i);
  }
  fromArgs( argv.size() - 1, &argv[0], true );
}

void LastalArguments::fromString( const std::string& s ){
  std::string trigger = "#last";
  std::istringstream iss(s);
  std::string line;
  while( std::getline( iss, line ) )
    if( line.compare( 0, trigger.size(), trigger ) == 0 )
      fromLine( line );
}

void LastalArguments::setDefaultsFromAlphabet(bool isDna, bool isProtein,
					      int refStrand,
					      bool isKeepRefLowercase,
					      int refTantanSetting,
					      bool isCaseSensitiveSeeds,
					      bool isVolumes,
					      size_t refMinimizerWindow) {
  if (strand < 0) strand = 1 + ((isDna || isTranslated()) && refStrand < 2);

  if (expectedAlignments <= 0 && expectedPerSquareGiga <= 0 &&
      queryLettersPerRandomAlignment <= 0) {
    queryLettersPerRandomAlignment = default_D;
  }

  if( isGreedy ){
    if( matchScore     < 0 ) matchScore     =   2;
    if( mismatchCost   < 0 ) mismatchCost   =   3;
    int gapGrowCost = mismatchCost + matchScore / 2;
    delOpenCosts.assign(1, 0);
    delGrowCosts.assign(1, gapGrowCost);
    insOpenCosts.assign(1, 0);
    insGrowCosts.assign(1, gapGrowCost);
    if (isFrameshift()) frameshiftCosts.assign(1, 0);
    if( matchScore % 2 )
      ERR( "with option -M, the match score (option -r) must be even" );
  } else {
    if (matchScore   < 0) matchScore   = 1;
    if (mismatchCost < 0) mismatchCost = 1;
    if (delOpenCosts.empty()) delOpenCosts.assign(1, isProtein ? 11 : 7);
    if (delGrowCosts.empty()) delGrowCosts.assign(1, isProtein ?  2 : 1);
  }

  if (insOpenCosts.empty()) insOpenCosts = delOpenCosts;
  if (insGrowCosts.empty()) insGrowCosts = delGrowCosts;

  if( tantanSetting < 0 ){
    isKeepLowercase = isKeepRefLowercase;
    tantanSetting = (refTantanSetting < 3) ? refTantanSetting : 1;
    if (maxRepeatUnit == 0) tantanSetting = 0;
    if (maxRepeatUnit > 0 && refTantanSetting < 1) tantanSetting = 1;
  }

  if( maskLowercase < 0 ){
    if( isCaseSensitiveSeeds && inputFormat != sequenceFormat::pssm )
      maskLowercase = 2;
    else
      maskLowercase = 0;
  }

  if (batchSize == 0 && isVolumes) batchSize = 0x4000000;  // 64 Mbytes (?)

  if( maxGaplessAlignmentsPerQueryPosition == 0 )
    maxGaplessAlignmentsPerQueryPosition =
      (oneHitMultiplicity > 0) ? oneHitMultiplicity : -1;

  if( minimizerWindow == 0 ) minimizerWindow = refMinimizerWindow;

  if (delOpenCosts.size() != delGrowCosts.size() ||
      insOpenCosts.size() != insGrowCosts.size()) {
    ERR("bad gap costs");
  }

  if (delOpenCosts.size() > 1 || insOpenCosts.size() > 1) {
    ERR("piecewise linear gap costs not implemented");
  }

  if (scoreType < 0) scoreType = (frameshiftCosts.size() > 1);

  if (scoreType == 0 && frameshiftCosts.size() > 1)
    ERR("can't combine option -J0 with new-style frameshifts");

  if (gumbelSimSequenceLength == 0) {
    gumbelSimSequenceLength = isTranslated() ? 200 : 400;
    // xxx long enough to avoid edge effects ???
  }

  if (frameshiftCosts.size() == 1 && frameshiftCosts[0] > 0) {
    if (frameshiftCosts[0] < delGrowCosts[0])
      ERR("the frameshift cost must not be less than the gap extension cost");

    if (insOpenCosts[0] != delOpenCosts[0] ||
	insGrowCosts[0] != delGrowCosts[0]) {
      ERR("can't combine option -F > 0 with option -A or -B");
    }
  }
}

static int percent(int val, int percentage) {
  return (percentage == 100) ? val : val * percentage / 100;
}

void LastalArguments::setDefaultsFromMatrix(double lambda, double minScore,
					    double perSquareGigaDefault) {
  if (expectedPerSquareGiga <= 0) expectedPerSquareGiga = perSquareGigaDefault;
  if( outputType < 2 && minScoreGapped < 0 ) minScoreGapped = minScoreGapless;
  if( minScoreGapped < 0 ){
    if( outputType > 0 && minScore < 0 )
      ERR("can't calculate E-values.\n\
To proceed without E-values, set a score threshold with option -e.");
    minScoreGapped = minScore;
  }

  if (minScoreGapped > INT_MAX)
    ERR("the alignment score threshold is too big");

  if (outputType < 2) minScoreGapless = ceil(minScoreGapped);

  if( temperature < 0 ) temperature = 1 / lambda;

  int defaultMaxScoreDrop = std::max(ceil(minScoreGapped) - 1, 0.0);  // xxx
  defaultMaxScoreDrop = std::max(defaultMaxScoreDrop, maxDropGapless);

  if (maxDropFinalSuffix == '%') {
    maxDropFinal = percent(defaultMaxScoreDrop, maxDropFinal);
  } else if (maxDropFinalSuffix == 'g') {
    maxDropFinal = std::min(minGapCost(maxDropFinal), defaultMaxScoreDrop);
  }

  if (maxDropGappedSuffix == '%') {
    maxDropGapped = percent(maxDropFinal, maxDropGapped);
  } else if (maxDropGappedSuffix == 'g') {
    maxDropGapped = std::min(minGapCost(maxDropGapped), maxDropFinal);
  }

  if( maxDropGapless < 0 ){  // should it depend on temperature or ...?
    if( temperature < 0 ) maxDropGapless = 0;  // shouldn't happen
    else                  maxDropGapless = int( 10.0 * temperature + 0.5 );
    maxDropGapless = std::min( maxDropGapless, maxDropGapped );
  }

  if (isSplit) {
    if (outputFormat != 'm')
      ERR("can't do split alignment with non-MAF output");
    if (isTranslated())
      ERR("can't do split DNA-protein alignment");
    if (gapPairCost > 0)
      ERR("can't do split alignment with option -c");
    if (scoreType == 1)  // the split score threshold would be too high
      ERR("can't do split alignment with option -J 1");
    if (verbosity > 1) splitOpts.verbose = true;
    splitOpts.setUnspecifiedValues(minScoreGapped, temperature);
  }
}

void LastalArguments::writeCommented( std::ostream& stream ) const{
  stream << '#';
  stream << " a="; writeIntList(stream, delOpenCosts);
  stream << " b="; writeIntList(stream, delGrowCosts);
  stream << " A="; writeIntList(stream, insOpenCosts);
  stream << " B="; writeIntList(stream, insGrowCosts);
  if( gapPairCost > 0 )
    stream << " c=" << gapPairCost;
  if (isTranslated()) {
    stream << " F=";
    writeIntList(stream, frameshiftCosts);
  }
  stream << " e=" << minScoreGapped;
  stream << " d=" << minScoreGapless;
  stream << " x=" << maxDropGapped;
  stream << " y=" << maxDropGapless;
  stream << " z=" << maxDropFinal;
  if (expectedAlignments > 0)
    stream << " H=" << expectedAlignments;
  if (queryLettersPerRandomAlignment > 0)
    stream << " D=" << queryLettersPerRandomAlignment;
  if (expectedPerSquareGiga >= 0)
    stream << " E=" << expectedPerSquareGiga;
  stream << '\n';

  stream << '#';
  stream << " R=" << isKeepLowercase << tantanSetting;
  stream << " u=" << maskLowercase;
  stream << " s=";
  LastSplitOptions::printStrand(strand);
  stream << " S=" << isQueryStrandMatrix;
  stream << " M=" << isGreedy;
  stream << " T=" << globality;
  stream << " m=" << oneHitMultiplicity;
  stream << " l=" << minHitDepth;
  if( maxHitDepth + 1 > 0 )
    stream << " L=" << maxHitDepth;
  stream << " n=" << maxGaplessAlignmentsPerQueryPosition;
  if( maxAlignmentsPerQueryStrand + 1 > 0 )
    stream << " N=" << maxAlignmentsPerQueryStrand;
  if( cullingLimitForGaplessAlignments )
    stream << " C=" << cullingLimitForGaplessAlignments;
  if( cullingLimitForFinalAlignments + 1 > 0 )
    stream << " K=" << cullingLimitForFinalAlignments;
  stream << " k=" << queryStep;
  if( minimizerWindow > 1 )
    stream << " W=" << minimizerWindow;
  stream << " w=" << maxRepeatDistance;
  stream << " t=" << temperature;
  if( outputType > 4 && outputType < 7 )
    stream << " g=" << gamma;
  stream << " j=" << outputType;
  stream << " Q=" << (inputFormat < sequenceFormat::fasta ? inputFormat : 0);
  stream << '\n';

  stream << "# " << lastdbName << '\n';
}

}  // end namespace cbrc
