Changeset 3391 for trunk/yat/utility/SmithWaterman.h
- Timestamp:
- Mar 16, 2015, 8:51:09 AM (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yat/utility/SmithWaterman.h
r3342 r3391 25 25 #include "Aligner.h" 26 26 #include "Matrix.h" 27 28 #include <boost/concept_check.hpp> 27 29 28 30 #include <cstddef> // size_t … … 97 99 reference_end-reference_begin where the element ij is 1.0 if 98 100 reference_begin[i] == query_begin[j] and -mismatch otherwise. 101 102 Type Requirements: 103 - \c RandomAccessIterator1 is a \readable_iterator 104 - \c RandomAccessIterator1 is a \random_access_traversal_iterator 105 - \c RandomAccessIterator2 is a \readable_iterator 106 - \c RandomAccessIterator2 is a \random_access_traversal_iterator 99 107 */ 100 108 template<typename RandomAccessIterator1, typename RandomAccessIterator2> … … 121 129 double mismatch) 122 130 { 131 using boost_concepts::ReadableIterator; 132 using boost_concepts::RandomAccessTraversal; 133 BOOST_CONCEPT_ASSERT((ReadableIterator<RandomAccessIterator1>)); 134 BOOST_CONCEPT_ASSERT((RandomAccessTraversal<RandomAccessIterator1>)); 135 BOOST_CONCEPT_ASSERT((ReadableIterator<RandomAccessIterator2>)); 136 BOOST_CONCEPT_ASSERT((RandomAccessTraversal<RandomAccessIterator2>)); 123 137 Matrix dot(reference_end-reference_begin, query_end-query_begin, -mismatch); 124 138 for (size_t i=0; i<dot.rows(); ++i)
Note: See TracChangeset
for help on using the changeset viewer.