96 lines
4 KiB
C
96 lines
4 KiB
C
|
|
||
|
|
/*+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
|
||
|
|
/* */
|
||
|
|
/* */
|
||
|
|
/* MV++ Numerical Matrix/Vector C++ Library */
|
||
|
|
/* MV++ Version 1.5 */
|
||
|
|
/* */
|
||
|
|
/* R. Pozo */
|
||
|
|
/* National Institute of Standards and Technology */
|
||
|
|
/* */
|
||
|
|
/* NOTICE */
|
||
|
|
/* */
|
||
|
|
/* Permission to use, copy, modify, and distribute this software and */
|
||
|
|
/* its documentation for any purpose and without fee is hereby granted */
|
||
|
|
/* provided that this permission notice appear in all copies and */
|
||
|
|
/* supporting documentation. */
|
||
|
|
/* */
|
||
|
|
/* Neither the Institution (National Institute of Standards and Technology) */
|
||
|
|
/* nor the author makes any representations about the suitability of this */
|
||
|
|
/* software for any purpose. This software is provided ``as is''without */
|
||
|
|
/* expressed or implied warranty. */
|
||
|
|
/* */
|
||
|
|
/*+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/
|
||
|
|
|
||
|
|
//
|
||
|
|
// mvvind.h MV_Vector Index class
|
||
|
|
|
||
|
|
#ifndef _MV_VEC_INDEX_H_
|
||
|
|
#define _MV_VEC_INDEX_H_
|
||
|
|
|
||
|
|
// A MV_VecIndex is an ordered pair (start,end) denoting a subvector
|
||
|
|
// region, similar to a Fortran 90 or Matlab colon notation. For example,
|
||
|
|
//
|
||
|
|
// MV_Vector_double A(10), B(20);
|
||
|
|
// MV_VecIndex I(2,4);
|
||
|
|
//
|
||
|
|
// A(I) = B(MV_VecIndex(0,2);
|
||
|
|
//
|
||
|
|
// sets the thrid through fifth elements of A to the first two elements
|
||
|
|
// of B. There is no stride argument, only contiguous regions are allowed.
|
||
|
|
//
|
||
|
|
|
||
|
|
// modif GR: passage d'unsigned à int normal
|
||
|
|
|
||
|
|
#include <assert.h>
|
||
|
|
#include "Sortie.h"
|
||
|
|
|
||
|
|
class MV_VecIndex
|
||
|
|
{
|
||
|
|
private:
|
||
|
|
// unsigned int start_;
|
||
|
|
// unsigned int end_;
|
||
|
|
int start_; // modif GR
|
||
|
|
int end_; // modif GR
|
||
|
|
char all_; // true if this index refers to the complete
|
||
|
|
// vector range. start_ and end_ are ignored.
|
||
|
|
public:
|
||
|
|
MV_VecIndex() : start_(0), end_(0), all_(1) {}
|
||
|
|
// MV_VecIndex(unsigned int i1) :start_(i1), end_(i1), all_(0) {}
|
||
|
|
// MV_VecIndex(unsigned int i1, unsigned int i2): start_(i1), end_(i2),
|
||
|
|
MV_VecIndex(int i1) :start_(i1), end_(i1), all_(0) {}
|
||
|
|
MV_VecIndex(int i1, int i2): start_(i1), end_(i2),
|
||
|
|
all_(0)
|
||
|
|
{
|
||
|
|
# ifdef MV_VECTOR_BOUNDS_CHECK
|
||
|
|
assert((i1 >= 0)&&(i2 >=0)); // modif GR
|
||
|
|
# endif
|
||
|
|
assert(i1 <= i2);
|
||
|
|
}
|
||
|
|
MV_VecIndex(const MV_VecIndex &s) : start_(s.start_), end_(s.end_),
|
||
|
|
all_(s.all_){}
|
||
|
|
|
||
|
|
|
||
|
|
int start() const { return (int) ((all_==1) ? 0 : start_);}
|
||
|
|
int end() const { return (int) ((all_ ==1) ? 0 : end_);}
|
||
|
|
int length() const {
|
||
|
|
return (int)((all_==1) ? 0 : (end_-start_+1));}
|
||
|
|
int all() const { return all_; }
|
||
|
|
MV_VecIndex& operator=(const MV_VecIndex& I)
|
||
|
|
{ start_=I.start_; end_ = I.end_; return *this;}
|
||
|
|
MV_VecIndex operator+(int i)
|
||
|
|
{ return MV_VecIndex(start_ +i, end_ +i); }
|
||
|
|
MV_VecIndex& operator+=(int i)
|
||
|
|
{ start_ += i; end_ += i; return *this; }
|
||
|
|
MV_VecIndex operator-(int i)
|
||
|
|
{ return MV_VecIndex(start_ -i, end_ -i); }
|
||
|
|
MV_VecIndex& operator-=(int i)
|
||
|
|
{ start_ -= i; end_ -= i; return *this; }
|
||
|
|
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|
||
|
|
// _INDEX_H_
|
||
|
|
|