Changeset 4308


Ignore:
Timestamp:
Feb 10, 2023, 3:40:22 AM (4 months ago)
Author:
Peter
Message:

merge release 0.20.1 into trunk.

Location:
trunk
Files:
8 edited
1 copied

Legend:

Unmodified
Added
Removed
  • trunk

  • trunk/NEWS

    r4279 r4308  
    1111
    1212yat 0.20.x series from http://dev.thep.lu.se/yat/svn/branches/0.20-stable
     13
     14version 0.20.1 (released 10 February 2023)
     15  - Aligner::needleman_wunsch and NeedlemanWunsch functions were
     16    previously buggy for non-zero gap penalties (bug #993)
     17  - VcfHeaer::add_program_command now outputs Date (bug #994)
     18
     19  A complete list of closed tickets can be found here [[br]]
     20  http://dev.thep.lu.se/yat/query?status=closed&milestone=yat+0.20.1
    1321
    1422version 0.20 (released 18 November 2022)
     
    598606Copyright (C) 2010, 2011 Peter Johansson
    599607Copyright (C) 2012 Jari Häkkinen, Peter Johansson
    600 Copyright (C) 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 Peter Johansson
     608Copyright (C) 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 Peter Johansson
    601609
    602610This file is part of yat library, http://dev.thep.lu.se/yat
  • trunk/m4/version.m4

    r4252 r4308  
    22#
    33# Copyright (C) 2008, 2009 Jari Häkkinen, Peter Johansson
    4 # Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015, 2017, 2018, 2019, 2020, 2021, 2022 Peter Johansson
     4# Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015, 2017, 2018, 2019, 2020, 2021, 2022, 2023 Peter Johansson
    55#
    66# This file is part of the yat library, http://dev.thep.lu.se/yat
     
    101101# yat-0.19.2 16:2:0
    102102# yat-0.20   17:0:0
     103# yat-0.20.1 17:1:0
    103104#
    104105# *Accidently, the libtool number was not updated for yat 0.5
  • trunk/test/Makefile.am

    r4289 r4308  
    55# Copyright (C) 2005 Jari Häkkinen, Peter Johansson
    66# Copyright (C) 2006, 2007, 2008 Jari Häkkinen, Peter Johansson, Markus Ringnér
    7 # Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 Peter Johansson
     7# Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 Peter Johansson
    88#
    99# This file is part of the yat library, http://dev.thep.lu.se/yat
     
    108108  test/nbc.test \
    109109  test/ncc.test \
     110  test/needleman_wunsch.test \
    110111  test/negative_binomial.test \
    111112  test/negative_binomial_mixture.test \
  • trunk/test/vcf_header.cc

    r3999 r4308  
    22
    33/*
    4   Copyright (C) 2018, 2020 Peter Johansson
     4  Copyright (C) 2018, 2020, 2023 Peter Johansson
    55
    66  This program is free software; you can redistribute it and/or modify
     
    2323
    2424#include "yat/omic/VcfHeader.h"
     25
     26#include "yat/utility/split.h"
     27#include "yat/utility/utility.h"
    2528
    2629#include <iostream>
     
    8386  suite.out() << hdr.line(4) << "\n";
    8487
     88  // test VcfHeader::add_program_command
     89  suite.out() << "test ::add_program_command:\n";
     90  hdr.add_program_command(argc, argv);
     91  bool found_command=false;
     92  for (size_t i=0; i<hdr.size(); ++i) {
     93    if (utility::contains(hdr.line(i), "vcf_header.testCommand")) {
     94      suite.out() << hdr.line(i) << "\n";
     95      std::vector<std::string> vec;
     96      utility::split(vec, hdr.line(i), ';');
     97      for (size_t j=0; j<vec.size(); ++j) {
     98        if (utility::contains(vec[j], "Date")) {
     99          found_command = true;
     100          suite.out() << "date: '" << vec[j] << "'\n";
     101          if (vec[j].size() < 20) {
     102            suite.err() << "date value too short\n";
     103            suite.add(false);
     104          }
     105        }
     106      }
     107    }
     108  }
     109  suite.add(found_command);
     110
    85111  return suite.return_value();
    86112}
  • trunk/yat/omic/VcfCompare.h

    r3759 r4308  
    55
    66/*
    7   Copyright (C) 2018 Peter Johansson
     7  Copyright (C) 2018, 2023 Peter Johansson
    88
    99  The yat library is free software; you can redistribute it and/or
     
    5858
    5959       The following criteria are used to compare the two objects:
    60        1) chromosome (as defined din constructor)
     60       1) chromosome (as defined in constructor)
    6161       2) position \c POS
    6262       3) reference allele \c REF
  • trunk/yat/omic/VcfHeader.cc

    r4041 r4308  
    22
    33/*
    4   Copyright (C) 2018, 2020, 2021 Peter Johansson
     4  Copyright (C) 2018, 2020, 2021, 2023 Peter Johansson
    55
    66  The yat library is free software; you can redistribute it and/or
     
    2828#include <algorithm>
    2929#include <cassert>
     30#include <ctime>
    3031#include <istream>
    3132#include <iterator>
     
    142143  {
    143144    std::string key = utility::basename(argv[0]) + "Command";
    144     std::string val;
     145    std::stringstream ss;
     146
    145147    for (int i=1; i<argc; ++i) {
    146148      if (i!=1)
    147         val += ' ';
    148       val += argv[i];
    149     }
    150     val += "; Date=";
    151     //    val += current_time("%a %b %e %H:%M:%S %Y");
     149        ss << ' ';
     150      ss << argv[i];
     151    }
     152    ss << "; Date=";
     153    std::time_t time = std::time(nullptr);
     154    ss << std::asctime(std::localtime(&time));
     155
     156    std::string val;
     157    getline(ss, val);
     158
    152159    add(key, val);
    153160  }
  • trunk/yat/utility/Aligner.cc

    r4207 r4308  
    22
    33/*
    4   Copyright (C) 2012, 2014, 2016, 2019, 2020, 2022 Peter Johansson
     4  Copyright (C) 2012, 2014, 2016, 2019, 2020, 2022, 2023 Peter Johansson
    55
    66  This file is part of the yat library, http://dev.thep.lu.se/yat
     
    5757    // Init upper and left border of matrix
    5858    for (size_t i=1; i<m.rows(); i++)
    59       m(i,0) = -i * vertical_gap_ - open_vertical_gap_;
     59      m(i,0) = - (i * vertical_gap_ + open_vertical_gap_);
    6060    for (size_t i=1; i<m.columns(); i++)
    61       m(0,i) = -i * horizon_gap_ - open_horizon_gap_;
     61      m(0,i) = - (i * horizon_gap_ + open_horizon_gap_);
    6262    (*this)(s, m);
    6363    // return lower right corner element
Note: See TracChangeset for help on using the changeset viewer.