Changeset 3579
- Timestamp:
- Jan 16, 2017, 4:54:43 AM (7 years ago)
- Location:
- trunk
- Files:
-
- 12 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk
- Property svn:mergeinfo changed
/branches/0.14-stable (added) merged: 3565,3567-3570,3574-3577
- Property svn:mergeinfo changed
-
trunk/NEWS
r3566 r3579 10 10 yat 0.14.x series from http://dev.thep.lu.se/yat/svn/branches/0.14-stable 11 11 12 version 0.14 (released NOT YET)12 version 0.14 (released 16 January 2017) 13 13 - The concept 'Distance' now requires that operator() works on 14 14 iterator that are readable and forward traversal, i.e., the -
trunk/doc/concepts.doxygen
r3550 r3579 464 464 465 465 - \c theplu::yat::utility::weighted_iterator_traits<I> must work 466 well, which implies that iterator, \c I is a \readable_iterator. 466 well, which implies that iterator, \c I is a \readable_iterator 467 and \single_pass_iterator. 467 468 468 469 \section concept_data_iterator_implementations Implementations -
trunk/test/fasta.cc
r3497 r3579 1 1 // $Id$ 2 2 // 3 // Copyright (C) 2016 Peter Johansson3 // Copyright (C) 2016, 2017 Peter Johansson 4 4 // 5 5 // This program is free software; you can redistribute it and/or modify … … 47 47 // 'samtools fasta' is required to generate input fasta file 48 48 #ifndef HAVE_SAMTOOLS_FASTA_EXECUTABLE 49 suite.out() << "no samtools with 'samtools fasta' support found\n"; 49 50 exit (EXIT_SKIP); 50 51 #endif -
trunk/test/weighted_iterator_archetype.cc
r3550 r3579 2 2 3 3 /* 4 Copyright (C) 2014, 2015, 2016 Peter Johansson4 Copyright (C) 2014, 2015, 2016, 2017 Peter Johansson 5 5 6 6 This file is part of the yat library, http://dev.thep.lu.se/yat … … 167 167 // this is a compilation test - do not run 168 168 if (false) { 169 test1<boost::incrementable_traversal_tag>(); 169 // On some systems std::iterator_traits<>::value_type does not 170 // work, so we require concept Data Iterator to be single pass. 171 //test1<boost::incrementable_traversal_tag>(); 170 172 test1<boost::single_pass_traversal_tag>(); 171 173 test1<boost::forward_traversal_tag>(); -
trunk/yat/classifier/Target.cc
r2919 r3579 6 6 Copyright (C) 2007, 2008 Jari Häkkinen, Peter Johansson 7 7 Copyright (C) 2012 Peter Johansson 8 Copyright (C) 2017 Jari Häkkinen 8 9 9 10 This file is part of the yat library, http://dev.thep.lu.se/yat … … 85 86 while(ok) { 86 87 if(sep=='\0') 87 ok= (is>>word);88 ok=!(is>>word).fail(); 88 89 else 89 ok= getline(is, word, sep);90 ok=!getline(is, word, sep).fail(); 90 91 91 92 // ignore empty words -
trunk/yat/omic/BamFile.cc
r3484 r3579 19 19 along with this program. If not, see <http://www.gnu.org/licenses/>. 20 20 */ 21 22 #include <iostream>23 21 24 22 #include <config.h> -
trunk/yat/random/random.cc
r3469 r3579 3 3 /* 4 4 Copyright (C) 2005, 2006, 2007, 2008 Jari Häkkinen, Peter Johansson 5 Copyright (C) 2009, 2011, 2012, 2013, 2015, 2016 Peter Johansson5 Copyright (C) 2009, 2011, 2012, 2013, 2015, 2016, 2017 Peter Johansson 6 6 7 7 This file is part of the yat library, http://dev.thep.lu.se/yat … … 39 39 40 40 RNG* RNG::instance_=NULL; 41 boost::mutex RNG::init_mutex_; 41 42 42 43 RNG::RNG(void) … … 59 60 RNG* RNG::instance(void) 60 61 { 61 if (instance_==NULL) 62 instance_ = new RNG; 62 if (instance_==NULL) { 63 boost::unique_lock<boost::mutex> lock(init_mutex_); 64 if (instance_==NULL) 65 instance_ = new RNG; 66 } 63 67 return instance_; 64 68 } -
trunk/yat/random/random.h
r3518 r3579 6 6 /* 7 7 Copyright (C) 2005, 2006, 2007, 2008 Jari Häkkinen, Peter Johansson 8 Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Peter Johansson8 Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017 Peter Johansson 9 9 10 10 This file is part of the yat library, http://dev.thep.lu.se/yat … … 200 200 // guard needs to be mutable because major mission for it is to protect seed_ against multi-access, and seed_ is mutable... 201 201 mutable boost::mutex mutex_; 202 static boost::mutex init_mutex_; 202 203 }; 203 204 -
trunk/yat/utility/WeightedIteratorArchetype.h
r3550 r3579 123 123 124 124 TraversalCategory is one of the boost categories: 125 boost::incrementable_traversal_tag126 125 boost::single_pass_traversal_tag 127 126 boost::forward_traversal_tag -
trunk/yat/utility/concept_check.h
r3550 r3579 239 239 BOOST_CONCEPT_USAGE(DataIteratorConcept) 240 240 { 241 BOOST_CONCEPT_ASSERT((TrivialIterator<T>)); 241 BOOST_CONCEPT_ASSERT((boost_concepts::ReadableIterator<T>)); 242 BOOST_CONCEPT_ASSERT((boost_concepts::SinglePassIterator<T>)); 242 243 tag t; 243 244 constraints(t); -
trunk/yat/utility/utility.h
r3550 r3579 9 9 Copyright (C) 2007, 2008 Jari Häkkinen, Peter Johansson 10 10 Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Peter Johansson 11 Copyright (C) 2017 Jari Häkkinen 11 12 12 13 This file is part of the yat library, http://dev.thep.lu.se/yat … … 529 530 while(true) { 530 531 if(sep=='\0') 531 ok= (is>>element);532 ok=!(is>>element).fail(); 532 533 else 533 ok= getline(is, element, sep);534 ok=!getline(is, element, sep).fail(); 534 535 if(!ok) 535 536 break;
Note: See TracChangeset
for help on using the changeset viewer.