Scaffolding
0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
|
#include <utils.hpp>
Public Member Functions | |
diagonal_counter (const size_t _max_x, const size_t _max_y) | |
diagonal_counter (const size_t _max_x, const size_t _max_y, const size_t _x, const size_t _y) | |
bool | step_forward () |
advance forward (NE) through the matrix | |
bool | step_back () |
advance backwrd (SW) through the matrix | |
bool | at_beginning () |
check if we're at the beginning, that is (0,0) | |
bool | at_end () |
check if we're at the end, that is (#columns, #rows) | |
Public Attributes | |
const size_t | max_x |
number of columns in the matrix | |
const size_t | max_y |
number of rows in the matrix | |
size_t | x |
current x coordinate | |
size_t | y |
current y coordinate | |
a counter for a pair of integers that runs diagonally through a matrix Each time the counter is incremented, x is incremented and y is decremented until either x > #columns (in which case x is set to 0) or y < 0 (in which case y is set to #rows). If either bound is hit, the sum x+y is incremented.
Thus, the counter always runs in directed North East.