9#include <fei_macros.hpp>
10#include <snl_fei_RaggedTable_specialize.hpp>
16 : map_(firstKey, lastKey),
20 int len = lastKey-firstKey+1;
23 for(
int i=0; i<len; ++i) {
24 val.first = firstKey+i;
25 row_type* row = poolAllocatorSet_.allocate(1);
26 poolAllocatorSet_.construct(row,dummy);
43 iterator m_end = map_.end();
44 iterator m_iter = map_.lower_bound(row);
48 if (mapped_indices == NULL) {
49 throw std::runtime_error(
"RaggedTable<MapContig>, NULL row.");
52 for(
int i=0; i<numIndices; ++i) {
53 mapped_indices->
insert2(indices[i]);
63 iterator m_end = map_.end();
66 for(
int i=0; i<numRows; ++i) {
68 iterator m_iter = map_.lower_bound(row);
70 mapped_indices = (*m_iter).second;
71 if (mapped_indices == NULL) {
72 throw std::runtime_error(
"RaggedTable<MapContig>, NULL row.");
75 for(
int j=0; j<numIndices; ++j) {
76 mapped_indices->
insert2(indices[j]);
84 for(
int i=0; i<numIndices; ++i) {
std::pair< const_iterator, bool > insert(const T &item)
void insert2(const T &item)
std::pair< int, fei::ctg_set< int > * > value_type
fei::ctg_set< int > * mapped_type
void addIndices(int row, int numIndices, const int *indices)
void addDiagonals(int numIndices, const int *indices)
RaggedTable(int firstKey, int lastKey)