/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/ |
H A D | DenseMatrix.C | 109 myNumColsValue(NumCols) in DenseMatBase() 422 if (NumCols > myNumColsValue) in myResize() 428 if (NumCols < myNumColsValue) in myResize() 449 myNumColsValue = NumCols; in myResize() 511 const long NumCols = len(VV[0]); in NewDenseMat() local 525 const long NumCols = len(VV[0]); in NewDenseMat() local 566 const long NumCols = len(VV); in NewDenseMatTranspose() local 580 const long NumCols = len(VV); in NewDenseMatTranspose() local 594 const long NumCols = len(VV); in NewDenseMatTranspose() local 608 const long NumCols = len(VV); in NewDenseMatTranspose() local [all …]
|
H A D | MatrixOps.C | 78 for (long j=0; j < NumCols(M); ++j) in GetRow() 118 if (NumRows(M) != NumCols(M)) in inverse() 133 const long Ncols = NumCols(M); in PseudoInverse() 183 const long Mcols = NumCols(M); in LinSolveByGauss() 218 const long Mcols = NumCols(M); in LinKerByGauss() 268 if (NumRows(M) != NumCols(M)) in InverseByGauss() 335 if (NumRows(M) != NumCols(M)) in IsSymmetric() 343 if (NumRows(M) != NumCols(M)) in IsAntiSymmetric() 351 if (NumRows(M) != NumCols(M)) in IsDiagonal() 359 if (NumRows(M) != NumCols(M)) in IsUpperTriangular() [all …]
|
H A D | MatrixOps-arith.C | 74 if (NumCols(Mleft) != NumRows(Mright)) 86 const long N = NumCols(Mleft); 88 const long Ncols = NumCols(Mright); 109 const long Ncols = NumCols(Mleft); 111 if (NumCols(Mright) != Ncols) CoCoA_THROW_ERROR(ERR::BadMatrixSize, FnName); 135 const long Ncols = NumCols(Mleft); 137 if (NumCols(Mright) != Ncols) CoCoA_THROW_ERROR(ERR::BadMatrixSize, FnName); 200 const long Ncols = NumCols(M); 236 const long Ncols = NumCols(M); 277 const long Ncols = NumCols(M); [all …]
|
H A D | MatrixForOrdering.C | 52 const long c = NumCols(M); in MakeCopyOverZZ() 73 const long ncols = NumCols(M); in ColCheck() 114 if (NumCols(M) != NumRows(M)) in IsTermOrdering() 140 for (long col=0; col < NumCols(M); ++col) in MakeNonNeg() 159 for (long col=0; col < NumCols(M); ++col) in CommonDenomOfRow() 177 for (long col=0; col < NumCols(IntMat); ++col) in ClearDenomByRow() 187 CoCoA_ASSERT(NumRows(M) >= NumCols(M)); in RemoveRedundantRows() 189 long NC = NumCols(M); in RemoveRedundantRows() 193 matrix MM(NewDenseMat(RingZZ(), NumCols(M), NumCols(M))); in RemoveRedundantRows() 197 for (long col=0; col<NumCols(M); ++col) in RemoveRedundantRows() [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/ |
H A D | DenseMatrix.C | 109 myNumColsValue(NumCols) in DenseMatBase() 422 if (NumCols > myNumColsValue) in myResize() 428 if (NumCols < myNumColsValue) in myResize() 449 myNumColsValue = NumCols; in myResize() 511 const long NumCols = len(VV[0]); in NewDenseMat() local 525 const long NumCols = len(VV[0]); in NewDenseMat() local 566 const long NumCols = len(VV); in NewDenseMatTranspose() local 580 const long NumCols = len(VV); in NewDenseMatTranspose() local 594 const long NumCols = len(VV); in NewDenseMatTranspose() local 608 const long NumCols = len(VV); in NewDenseMatTranspose() local [all …]
|
H A D | MatrixOps.C | 126 const long N = NumCols(Mleft); 178 if (NumCols(M1) != NumRows(M2)) in mul() 180 if ( NumRows(lhs) != NumRows(M1) || NumCols(lhs) != NumCols(M2) ) in mul() 208 const long Ncols = NumCols(M); 232 const long Ncols = NumCols(M); 262 const long Ncols = NumCols(M); 300 const long Ncols = NumCols(M); in power() 367 if (NumRows(M) != NumCols(M)) in det() 378 if (NumRows(M) != NumCols(M)) in IsZeroDet() 394 if (NumRows(M) != NumCols(M)) in inverse() [all …]
|
H A D | MatrixForOrdering.C | 52 const long c = NumCols(M); in MakeCopyOverZZ() 73 const long ncols = NumCols(M); in ColCheck() 114 if (NumCols(M) != NumRows(M)) in IsTermOrdering() 140 for (long col=0; col < NumCols(M); ++col) in MakeNonNeg() 159 for (long col=0; col < NumCols(M); ++col) in CommonDenomOfRow() 177 for (long col=0; col < NumCols(IntMat); ++col) in ClearDenomByRow() 187 CoCoA_ASSERT(NumRows(M) >= NumCols(M)); in RemoveRedundantRows() 189 long NC = NumCols(M); in RemoveRedundantRows() 193 matrix MM(NewDenseMat(RingZZ(), NumCols(M), NumCols(M))); in RemoveRedundantRows() 197 for (long col=0; col<NumCols(M); ++col) in RemoveRedundantRows() [all …]
|
H A D | MatrixSpecial.C | 88 if (NumCols(A) > numeric_limits<long>::max() /NumCols(B)) //avoid overflow in TensorMat() 92 matrix ans = NewDenseMat(RingOf(A), NumRows(A)*NumRows(B), NumCols(A)*NumCols(B)); in TensorMat() 94 for (long jA=0; jA < NumCols(A); ++jA) in TensorMat() 96 for (long jB=0; jB < NumCols(B); ++jB) in TensorMat() 97 SetEntry(ans, iA*NumRows(B)+iB, jA*NumCols(B)+jB, A(iA, jA)*B(iB, jB)); in TensorMat() 105 const long ncols = NumCols(M); in LawrenceMat()
|
/dports/devel/bullet/bullet3-3.21/examples/ThirdPartyLibs/BussIK/ |
H A D | MatrixRmn.cpp | 163 assert(A.NumRows <= NumRows && A.NumCols <= NumCols); in LoadAsSubmatrix() 182 assert(A.NumRows <= NumCols && A.NumCols <= NumRows); in LoadAsSubmatrixTranspose() 287 assert(A.NumCols == B.NumRows && A.NumRows == dst.NumRows && B.NumCols == dst.NumCols); in Multiply() 288 long length = A.NumCols; in Multiply() 310 assert(A.NumRows == B.NumRows && A.NumCols == dst.NumRows && B.NumCols == dst.NumCols); in TransposeMultiply() 333 assert(A.NumCols == B.NumCols && A.NumRows == dst.NumRows && B.NumRows == dst.NumCols); in MultiplyTranspose() 334 long length = A.NumCols; in MultiplyTranspose() 407 long lenRowLeft = NumCols; in ConvertToRefNoFree() 511 assert(idx1 != idx2 && 0 <= idx1 && idx1 < NumCols && 0 <= idx2 && idx2 < NumCols); in PostApplyGivens() 534 …Rows == NumRows && V.NumCols == NumCols && U.NumRows == U.NumCols && V.NumRows == V.NumCols && w.G… in ComputeSVD() [all …]
|
H A D | MatrixRmn.h | 174 NumCols = 0; in MatrixRmn() 182 NumCols = 0; in MatrixRmn() 206 NumCols = numCols; in SetSize() 222 assert(i < NumRows && j < NumCols); in Get() 263 assert(i < NumRows && j < NumCols); in GetPtr() 272 assert(0 <= j && j < NumCols); in GetColumnPtr() 280 assert(0 <= j && j < NumCols); in GetColumnPtr() 319 assert(NumRows == NumCols); in SetIdentity() 336 assert(NumRows == B.NumRows && NumCols == B.NumCols); in AddScaled() 348 assert(NumRows == B.NumRows && NumCols == B.NumCols); [all …]
|
/dports/devel/py-bullet3/bullet3-3.21/examples/ThirdPartyLibs/BussIK/ |
H A D | MatrixRmn.cpp | 163 assert(A.NumRows <= NumRows && A.NumCols <= NumCols); in LoadAsSubmatrix() 182 assert(A.NumRows <= NumCols && A.NumCols <= NumRows); in LoadAsSubmatrixTranspose() 287 assert(A.NumCols == B.NumRows && A.NumRows == dst.NumRows && B.NumCols == dst.NumCols); in Multiply() 288 long length = A.NumCols; in Multiply() 310 assert(A.NumRows == B.NumRows && A.NumCols == dst.NumRows && B.NumCols == dst.NumCols); in TransposeMultiply() 333 assert(A.NumCols == B.NumCols && A.NumRows == dst.NumRows && B.NumRows == dst.NumCols); in MultiplyTranspose() 334 long length = A.NumCols; in MultiplyTranspose() 407 long lenRowLeft = NumCols; in ConvertToRefNoFree() 511 assert(idx1 != idx2 && 0 <= idx1 && idx1 < NumCols && 0 <= idx2 && idx2 < NumCols); in PostApplyGivens() 534 …Rows == NumRows && V.NumCols == NumCols && U.NumRows == U.NumCols && V.NumRows == V.NumCols && w.G… in ComputeSVD() [all …]
|
H A D | MatrixRmn.h | 174 NumCols = 0; in MatrixRmn() 182 NumCols = 0; in MatrixRmn() 206 NumCols = numCols; in SetSize() 222 assert(i < NumRows && j < NumCols); in Get() 263 assert(i < NumRows && j < NumCols); in GetPtr() 272 assert(0 <= j && j < NumCols); in GetColumnPtr() 280 assert(0 <= j && j < NumCols); in GetColumnPtr() 319 assert(NumRows == NumCols); in SetIdentity() 336 assert(NumRows == B.NumRows && NumCols == B.NumCols); in AddScaled() 348 assert(NumRows == B.NumRows && NumCols == B.NumCols); [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/structure/cd_utils/ |
H A D | cuMatrix.cpp | 49 int NumCols = Max(m_NumCols, ColIndex+1); in BEGIN_SCOPE() local 50 AMatrix_base NewMatrix(NumRows, NumCols); in BEGIN_SCOPE() 80 if (NumRows > 0 && NumCols > 0) { in Shrink() 82 AMatrix_base tmpMatrix(NumRows, NumCols); in Shrink() 84 for (j = 0; j < NumCols; ++j) { in Shrink() 92 Allocate(NumRows, NumCols); in Shrink() 94 for (j = 0; j < NumCols; ++j) { in Shrink() 118 m_Array[i] = new double[NumCols]; in Allocate() 122 m_ColumnFlags = new bool[NumCols]; in Allocate() 123 memset(m_ColumnFlags, 0, NumCols*sizeof(bool)); in Allocate() [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/algo/structure/cd_utils/ |
H A D | cuMatrix.hpp | 60 AMatrix_base(const int NumRows, const int NumCols) { in AMatrix_base() argument 62 assert(NumCols >= 0); in AMatrix_base() 63 Allocate(NumRows, NumCols); in AMatrix_base() 79 void GetSize(int& NumRows, int& NumCols) { in GetSize() argument 81 NumCols = m_NumCols; in GetSize() 101 bool Shrink(const int NumRows, const int NumCols); 103 void ReSize(const int NumRows, const int NumCols) { in ReSize() argument 104 MakeSureArrayIsBigEnough(NumRows-1, NumCols-1); in ReSize() 138 void Allocate(const int NumRows, const int NumCols); 165 AMatrix(const int NumRows, const int NumCols) : AMatrix_base(NumRows, NumCols) {} in AMatrix() argument
|
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/toonzlib/ |
H A D | ikjacobian.cpp | 175 assert(A.NumRows <= NumRows && A.NumCols <= NumCols); in LoadAsSubmatrix() 195 assert(A.NumRows <= NumCols && A.NumCols <= NumRows); in LoadAsSubmatrixTranspose() 288 long length = A.NumCols; in MultiplyScalar() 307 B.NumCols == dst.NumCols); in Multiply() 328 B.NumCols == dst.NumCols); in TransposeMultiply() 349 assert(A.NumCols == B.NumCols && A.NumRows == dst.NumRows && in MultiplyTranspose() 351 long length = A.NumCols; in MultiplyTranspose() 372 assert(NumRows == NumCols && NumCols == xVec->GetLength() && in Solve() 516 idx2 < NumCols); in PostApplyGivens() 541 assert(U.NumRows == NumRows && V.NumCols == NumCols && in ComputeSVD() [all …]
|
/dports/graphics/povray36/povray-3.6.1/scenes/animations/life/ |
H A D | life.pov | 18 #declare NumCols=60; 22 #declare LifeGrid=array[NumRows][NumCols] 29 #while (Column<NumCols) 41 #declare NC2=-NumCols/2; 48 #while (Column < NumCols) 73 #write (LifeNext, "#declare NumCols=",str(NumCols,4,0),";\n") 75 #write (LifeNext, "#declare LifeGrid=array[NumRows][NumCols]\n") 87 #while (Column < NumCols) 98 #declare X3=mod(XX+NumCols,NumCols);
|
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/include/toonz/ |
H A D | ikjacobian.h | 416 NumCols = 0; in MatrixRmn() 423 NumCols = 0; in MatrixRmn() 443 NumCols = numCols; in SetSize() 456 assert(i < NumRows && j < NumCols); in Get() 490 assert(i < NumRows && j < NumCols); in GetPtr() 498 assert(0 <= j && j < NumCols); in GetColumnPtr() 505 assert(0 <= j && j < NumCols); in GetColumnPtr() 542 assert(NumRows == NumCols); in SetIdentity() 556 assert(NumRows == B.NumRows && NumCols == B.NumCols); in AddScaled() 566 assert(NumRows == B.NumRows && NumCols == B.NumCols); [all …]
|
/dports/math/giacxcas/giac-1.6.0/src/ |
H A D | TmpFGLM.C | 79 …void UpdateMatrixMap(map<PPMonoidElem, struct MatrixMapEntry>& MatrixMap, size_t& NumCols, QBGener… in UpdateMatrixMap() argument 91 NewEntry.VarIndices.push_back(NumCols); in UpdateMatrixMap() 97 entry->second.VarIndices.push_back(NumCols); in UpdateMatrixMap() 101 ++NumCols; in UpdateMatrixMap() 141 size_t NumCols = 1; in FGLMBasisConversion() local 170 UpdateMatrixMap(MatrixMap, NumCols, NewQB, h, t); in FGLMBasisConversion() 187 matrix M = NewDenseMat(K, MatrixMap.size(), NumCols), in FGLMBasisConversion() 205 matrix x = NewDenseMat(K, NumCols, 1); in FGLMBasisConversion() 212 for (size_t i = 0; i < NumCols; ++i) in FGLMBasisConversion() 220 UpdateMatrixMap(MatrixMap, NumCols, NewQB, h, t); in FGLMBasisConversion()
|
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/genFunction/ |
H A D | matrix_ops.cpp | 192 vec_ZZ t_Coeffs; t_Coeffs.SetLength(A.NumCols() - offset); in eliminationRow() 194 g = A[offset][A.NumCols() - 1]; //last element in row in eliminationRow() 195 t_Coeffs[A.NumCols() - offset - 1] = to_ZZ(1); in eliminationRow() 199 XGCD(g, r, s, A[offset][A.NumCols() - i], g); in eliminationRow() 200 t_Coeffs[A.NumCols() - offset - i] = r; in eliminationRow() 206 for (int j = 1; j < A.NumCols() - offset; j++) in eliminationRow() 213 for (int j = offset + 1; j < A.NumCols(); j++) in eliminationRow() 270 for (int j = 1; j < A.NumCols() - offset; j++) in eliminationCol() 276 for (int i = offset + 1; i < A.NumCols(); i++) in eliminationCol() 307 for (int i = offset + 1; i < A.NumCols(); i++) in diagonalizationIn() [all …]
|
/dports/math/ntl/ntl-11.5.1/src/ |
H A D | mat_ZZ_p.cpp | 36 long l = A.NumCols(); in plain_mul_aux() 37 long m = B.NumCols(); in plain_mul_aux() 96 long l = A.NumCols(); in plain_mul_transpose_aux() 99 if (l != B.NumCols()) in plain_mul_transpose_aux() 180 long m = A.NumCols(); in RawConvert() 195 long m = A.NumCols(); in RawConvertTranspose() 209 long m = A.NumCols(); in RawConvert() 225 long m = A.NumCols(); in to_mat_ZZ_p_crt_rep() 420 long l = A.NumCols(); in multi_modular_mul() 489 long NumCols() const in NumCols() function [all …]
|
H A D | mat_RR.cpp | 11 long m = A.NumCols(); in add() 27 long m = A.NumCols(); in sub() 43 long l = A.NumCols(); in mul_aux() 44 long m = B.NumCols(); in mul_aux() 83 long l = A.NumCols(); in mul_aux() 119 long l = B.NumCols(); in mul_aux() 274 long m = A.NumCols(); in transpose() 307 if (A.NumCols() != n) in solve() 403 if (A.NumCols() != n) in inv() 504 long m = A.NumCols(); in mul() [all …]
|
H A D | mat_GF2.cpp | 13 long m = A.NumCols(); in add() 37 long l = A.NumCols(); in mul_aux() 67 long l = B.NumCols(); in mul_aux() 113 long l = A.NumCols(); in mul_aux() 114 long m = B.NumCols(); in mul_aux() 264 long m = x.NumCols(); in AddToCol() 293 long m = A.NumCols(); in transpose_aux() 322 if (A.NumCols() != n) in solve_impl() 422 if (A.NumCols() != n) in inv() 521 long m = M.NumCols(); in gauss() [all …]
|
/dports/biology/avida/avida-2.12.4-src/libs/apto/unittests/stat/ |
H A D | ContingencyTable.cc | 39 EXPECT_EQ(3, t1.NumCols()); in TEST() 43 EXPECT_EQ(4, t2.NumCols()); in TEST() 120 EXPECT_EQ(3, t2.NumCols()); in TEST() 121 …for (int i = 0; i < t2.NumRows(); i++) for (int j = 0; j < t2.NumCols(); j++) EXPECT_EQ(i + (10 - … in TEST() 125 EXPECT_EQ(3, t3.NumCols()); in TEST() 126 …for (int i = 0; i < t3.NumRows(); i++) for (int j = 0; j < t3.NumCols(); j++) EXPECT_EQ(i + (10 - … in TEST()
|
/dports/math/ntl/ntl-11.5.1/include/NTL/ |
H A D | matrix.h | 50 long NumCols() const { return _mat__numcols; } in NumCols() function 73 return a.fixed() && a.length() == NumCols() && position1(a) != -1; in alias() 137 if (src.NumCols() == 0) 138 SetDims(src.NumRows(), src.NumCols()); 139 else if (NumCols() != src.NumCols()) { 250 if (a.NumCols() != b.NumCols()) 304 x.SetDims(a.NumRows(), a.NumCols()); in conv()
|
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/ |
H A D | test-matrix4.C | 51 matrix NewMatrixFromC(ring K, int* cmat, long NumRows, long NumCols) in NewMatrixFromC() argument 53 matrix M(NewDenseMat(K,NumRows,NumCols)); in NewMatrixFromC() 56 for (long j=0; j < NumCols; ++j) in NewMatrixFromC() 57 SetEntry(M, i, j, cmat[i*NumCols+j]); in NewMatrixFromC() 83 const long c = NumCols(M); in TestFlatten()
|