barry: Your go-to motif accountant  0.0-1
Full enumeration of sample space and fast count of sufficient statistics for binary arrays
barray-iterator.hpp
Go to the documentation of this file.
1 // #include <vector>
2 // #include <unordered_map>
3 // #include "typedefs.hpp"
4 // #include "barray-bones.hpp"
5 
6 #ifndef BARRAY_ITERATOR_HPP
7 #define BARRAY_ITERATOR_HPP 1
8 
9 template<typename Cell_Type, typename Data_Type>
11 public:
12 
16 
18 
19  // Finding the first entry of the iterator
20  for (size_t i = 0u; i < Array->nrow(); ++i)
21  if (A_ROW(i).size() != 0u) {
22  iter = A_ROW(i).begin();
23  break;
24  }
25 
26  return;
27 
28  };
30 
31  // operat
32 
33 };
34 
35 #endif
size_t nrow() const noexcept
ConstBArrayRowIter(const BArray< Cell_Type, Data_Type > *Array_)
Row_type< Cell_Type >::const_iterator iter
const BArray< Cell_Type, Data_Type > * Array
size_t i
Map< size_t, Cell< Cell_Type > > Row_type
Definition: typedefs.hpp:67