/dports/math/gambit/gambit-16.0.1/library/include/gambit/ |
H A D | array.h | 31 int mindex, maxdex; 39 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 93 data = (maxdex >= mindex) ? new T[maxdex -mindex + 1] - mindex : 0; in Array() 97 : mindex(a.mindex), maxdex(a.maxdex), in Array() 98 data((maxdex >= mindex) ? new T[maxdex - mindex + 1] - mindex : 0) in Array() 104 { if (maxdex >= mindex) delete [] (data + mindex); } in ~Array() 115 if (!data || (data && (mindex != a.mindex || maxdex != a.maxdex))) { 117 mindex = a.mindex; maxdex = a.maxdex; 118 data = (maxdex >= mindex) ? new T[maxdex - mindex + 1] - mindex : 0; 134 if (mindex != a.mindex || maxdex != a.maxdex) return false; [all …]
|
H A D | vector.imp | 68 { return (v.mindex == this->mindex && v.maxdex == this->maxdex ); } 77 for(int i=this->mindex; i<=this->maxdex; i++) 88 Vector<T> tmp(this->mindex,this->maxdex); 89 for(int i=this->mindex; i<=this->maxdex; i++) 99 Vector<T> tmp(this->mindex,this->maxdex); 100 for(int i=this->mindex; i<=this->maxdex; i++) 110 for(int i=this->mindex; i<=this->maxdex; i++) 120 for(int i=this->mindex; i<=this->maxdex; i++) 127 Vector<T> tmp(this->mindex,this->maxdex); 135 Vector<T> tmp(this->mindex,this->maxdex); [all …]
|
/dports/textproc/miller/miller-5.10.2/go/src/types/ |
H A D | mlrval_collections.go | 85 if mindex.mvtype != MT_INT { 107 if mindex.mvtype != MT_INT { 113 mindex.GetTypeName(), 188 if 1 <= mindex { 189 zindex := mindex - 1 195 } else if mindex <= -1 { 196 zindex := mindex + n 375 mindex := indices[0] 380 mindex.GetTypeName() + 504 mindex := indices[0] [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Core/ImageFunction/test/ |
H A D | itkInterpolateTest.cxx | 169 IndexType mindex; in itkInterpolateTest() local 191 mindex.CopyWithRound( cindex ); in itkInterpolateTest() 192 double expectedValue = mindex[0] + mindex[1] + mindex[2]; in itkInterpolateTest() 279 mindex.CopyWithRound( cindex ); in itkInterpolateTest() 280 expectedValue = mindex[0] + mindex[1] + mindex[2]; in itkInterpolateTest() 307 mindex.CopyWithRound( cindex ); in itkInterpolateTest() 308 expectedValue = mindex[0] + mindex[1] + mindex[2]; in itkInterpolateTest() 335 mindex.CopyWithRound( cindex ); in itkInterpolateTest() 336 expectedValue = mindex[0] + mindex[1] + mindex[2]; in itkInterpolateTest() 364 mindex.CopyWithRound( cindex ); in itkInterpolateTest() [all …]
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc48/gcc-4.8.5/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 9 protected:int mindex, maxdex; 13 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 15 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 18 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 25 if (maxdex >= mindex) in ~Array() 26 delete[](data + mindex); in ~Array()
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr27283.C | 8 protected:int mindex, maxdex; 12 T *new_data = new T[++this->maxdex - this->mindex + 1] - this->mindex; in InsertAt() 14 for (i = this->mindex; i <= n - 1; i++) in InsertAt() 17 public: Array (unsigned int len = 0):mindex (1), maxdex (len), 24 if (maxdex >= mindex) in ~Array() 25 delete[](data + mindex); in ~Array()
|