356 ( Dim==1 ? j*
Stride : 0 );
362 ( Dim==1 ? j*
Stride : 0 ) +
363 ( Dim==2 ? k*Stride : 0 );
379 Stride = plugged.stride();
396 inline Index(
int f,
int l);
397 inline Index(
int f,
int l,
int s);
402 inline int min()
const;
403 inline int max()
const;
404 inline unsigned int length()
const;
405 inline int stride()
const;
406 inline int first()
const;
407 inline int last()
const;
408 inline bool empty()
const;
479 *
this =
Index(d[0], d[0] + (d[2] - 1)*d[1], d[1]);
std::ostream & operator<<(std::ostream &os, const Attribute &attr)
bool operator>=(const iterator &y) const
Index intersect(const Index &) const
cursor MakeExpression() const
bool containsAllPoints(const Index &b) const
friend Index operator-(const Index &, int)
cursor MakeExpression() const
Message & getMessage(Message &m)
Message & putMessage(Message &m) const
bool split(Index &l, Index &r) const
bool operator<(const iterator &y) const
bool operator<=(const iterator &y) const
friend Index operator+(const Index &, int)
unsigned int length() const
bool sameBase(const Index &) const
bool operator<(const Index &r) const
int offset(int i, int j) const
iterator(int current, int stride=1)
iterator & operator+=(int i)
static void findPut(const Index &, const Index &, const Index &, Index &, Index &)
iterator & operator-=(int i)
int offset(int i, int j, int k) const
friend Index operator/(const Index &, int)
Index general_intersect(const Index &) const
bool operator==(const iterator &y) const
Message & get(const T &cval)
bool touches(const Index &a) const
iterator operator+(int i) const
Message & put(const T &val)
bool operator>(const iterator &y) const
bool operator==(const Index &r) const
Index plugBase(const Index &) const
friend Index operator*(const Index &, int)
std::string::iterator iterator
bool plugBase(const Index &i, unsigned d=0)
int operator[](int i) const
bool contains(const Index &a) const
bool operator!=(const iterator &y) const
iterator operator-(int i) const