20 #include "SheafSystem/binary_index_space.h" 22 #include "SheafSystem/assert_contract.h" 44 for(lblock_id.
i=0; lblock_id.
i<i_size; lblock_id.
i++)
46 for(lblock_id.
j=0; lblock_id.
j<j_size; lblock_id.
j++)
53 for(ldelta.
i=-1; ldelta.
i<2; ldelta.
i++)
55 for(ldelta.
j=-1; ldelta.
j<2; ldelta.
j++)
57 lnbr_id = lblock_id + ldelta;
60 result->
push_back(to_row_major_offset(lnbr_id));
65 if(result->
row_ct() < size)
77 ensure(result->
row_ct() == size);
93 os <<
"i_size: " << xbis.
i_size 94 <<
" j_size: " << xbis.
j_size 95 <<
" size: " << xbis.
size;
unary_index j_size
Upper bound for the second index.
void push_back(const T &xvalue)
Add a value to the back of the back row.
index_type row_ct() const
The number of rows.
ragged_array< unary_index > * neighbor_list() const
Create a ragged array containing the row major offsets of the neighbors of each index in the index sp...
unary_index size
Number in the space.
A bounded domain for binary_index objects.
unary_index i
The first index.
unary_index j
The second index.
void new_back_row()
Creates a new last row.
A two index array with variable length rows.
unary_index i_size
Upper bound for the first index.
Namespace for the fiber_bundles component of the sheaf system.
SHEAF_DLL_SPEC std::ostream & operator<<(std::ostream &os, const binary_index &xbi)
Insert binary_index& xbi into ostream& os.