bayehem/rsem/detonate-1.11/ref-eval/test_re_kc.cpp
BOOST_AUTO_TEST_CASE(example_from_oases_mouse_chr1_cc_0)
{
  const char *seq = "ATAACAGTTACTTGTCTGGGTGTGTGTTAGGGGTCTCCGGTATGTCCTCGTATACCTAGGTTATGGGGGGGGGAGGGGCAAAGCAATGAGAAACATAACTAAATTTATGTGTAAGTTGGGGGTGTCANGAAAAAGCAACTTAG";
  size_t k = 76;
  size_t len = strlen(seq);
  const char *end = seq + len + 1 - k;
  for (size_t i = 0; i + k - 1 < len; ++i) {
    if (seq[i + k - 1] != 'N')
      BOOST_CHECK_EQUAL(skip_Ns(seq + i, end, k, i == 0), seq + i);
    else
      BOOST_CHECK_EQUAL(skip_Ns(seq + i, end, k, i == 0), end);
  }
}
// There is only one N in this sequence, and it occurs within 76 bases of the
// end, so either skip_Ns should return the current position, or it should skip
// past that N, which will result in us being at the end of the line.
There is only one N in this sequence, and it occurs within 76 bases of the
end, so either skip_Ns should return the current position, or it should skip
past that N, which will result in us being at the end of the line.
There is only one N in this sequence and it occurs within 76 bases of the end so either skip_Ns should return the current position or it should skip past that N which will result in us being at the end of the line .
BOOST_AUTO_TEST_CASE(example_from_oases_mouse_chr1_cc_0)
{
  const char *seq = "ATAACAGTTACTTGTCTGGGTGTGTGTTAGGGGTCTCCGGTATGTCCTCGTATACCTAGGTTATGGGGGGGGGAGGGGCAAAGCAATGAGAAACATAACTAAATTTATGTGTAAGTTGGGGGTGTCANGAAAAAGCAACTTAG";
  size_t k = 76;
  size_t len = strlen(seq);
  const char *end = seq + len + 1 - k;
  for (size_t i = 0; i + k - 1 < len; ++i) {
    if (seq[i + k - 1] != 'N')
      BOOST_CHECK_EQUAL(skip_Ns(seq + i, end, k, i == 0), seq + i);
    else
      BOOST_CHECK_EQUAL(skip_Ns(seq + i, end, k, i == 0), end);
  }
}
BOOST_AUTO_TEST_CASE ( example_from_oases_mouse_chr1_cc_0 ) { const char * seq = " " ; size_t k = 76 ; size_t len = strlen ( seq ) ; const char * end = seq + len + 1 - k ; for ( size_t i = 0 ; i + k - 1 < len ; ++ i ) { if ( seq [ i + k - 1 ] != ' ' ) BOOST_CHECK_EQUAL ( skip_Ns ( seq + i , end , k , i == 0 ) , seq + i ) ; else BOOST_CHECK_EQUAL ( skip_Ns ( seq + i , end , k , i == 0 ) , end ) ; } }
There is only one N in this sequence, and it occurs within 76 bases of the
end, so either skip_Ns should return the current position, or it should skip
past that N, which will result in us being at the end of the line.
There is only one N in this sequence and it occurs within 76 bases of the end so either skip_Ns should return the current position or it should skip past that N which will result in us being at the end of the line .