24 void Init(
const Index& imin,
const Index& imax);
25 void Set(
const T& val);
27 inline T& operator[](
const Index& i) {
return values[ElementIndex(i)]; }
28 inline const T& operator[](
const Index& i)
const {
return values[ElementIndex(i)]; }
30 int ElementIndex(
const Index& i)
const;
40 :grid(numDims,h),imin(numDims,0),imax(numDims,0),values(1)
45 :grid(h),imin(h.n,0),imax(h.n,0),values(1)
51 std::fill(imin.begin(),imin.end(),0);
52 std::fill(imax.begin(),imax.end(),0);
59 Assert(imin.size()==_imin.size());
60 Assert(imax.size()==_imax.size());
64 for(
size_t i=0;i<imin.size();i++) {
65 Assert(imax[i] >= imin[i]);
66 size *= (imax[i]-imin[i]+1);
74 fill(values.begin(),values.end(),val);
80 Assert(i.size()==imin.size());
82 for(
size_t k=0;k<imin.size();k++) {
83 index *= (imax[k]-imin[k]+1);
84 Assert(i[k] >= imin[k] && i[k] <= imax[k]);
85 index += i[k]-imin[k];
87 Assert(index >= 0 && index < (
int)values.size());
A table with entry T on a gridding of n-dimensional space.
Definition: GridTable.h:14
A gridding of n-dimensional space.
Definition: Grid.h:19
An integer tuple class.
Definition: IntTuple.h:14
Contains all definitions in the Geometry package.
Definition: AnyGeometry.h:11