Home
last modified time | relevance | path

Searched refs:numRows (Results 1 – 25 of 2854) sorted by relevance

12345678910>>...115

/dports/databases/mariadb105-client/mariadb-10.5.15/storage/columnstore/columnstore/dbcon/joblist/
H A Dtdriver-filter.cpp151 for (i = 0; i < numRows; i++) in filterTest()
169 for (i = 0; i < numRows; i++) in filterTest()
202 if (numRows % 2 > 0) in filterTest()
211 if (numRows % 2 > 0) in filterTest()
223 assertCount = numRows - numRows % 2; in filterTest()
332 if (numRows % 2 > 0) in stringFilterTest()
341 if (numRows % 2 > 0) in stringFilterTest()
353 assertCount = numRows - numRows % 2; in stringFilterTest()
462 if (numRows % 2 > 0) in doubleFilterTest()
471 if (numRows % 2 > 0) in doubleFilterTest()
[all …]
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/columnstore/columnstore/dbcon/joblist/
H A Dtdriver-filter.cpp151 for (i = 0; i < numRows; i++) in filterTest()
169 for (i = 0; i < numRows; i++) in filterTest()
202 if (numRows % 2 > 0) in filterTest()
211 if (numRows % 2 > 0) in filterTest()
223 assertCount = numRows - numRows % 2; in filterTest()
332 if (numRows % 2 > 0) in stringFilterTest()
341 if (numRows % 2 > 0) in stringFilterTest()
353 assertCount = numRows - numRows % 2; in stringFilterTest()
462 if (numRows % 2 > 0) in doubleFilterTest()
471 if (numRows % 2 > 0) in doubleFilterTest()
[all …]
/dports/math/jtransforms/JTransforms/test/edu/emory/mathcs/jtransforms/fft/
H A DFloatFFT_2DTest.java104 private final int numRows; field in FloatFFT_2DTest
126 this.numRows = numRows; in FloatFFT_2DTest()
312 final int s = numRows * numCols; in testComplexInverseUnScaled1fInput()
359 final int s = numRows * numCols; in testComplexInverseUnScaled2fInput()
455 exp = expected[numRows / 2][0]; in testRealForward1fInput()
456 index = (numRows / 2) * numCols; in testRealForward1fInput()
557 exp = expected[numRows / 2][0]; in testRealForward2fInput()
558 act = actual[numRows / 2][0]; in testRealForward2fInput()
560 checked[numRows / 2][0] = true; in testRealForward2fInput()
563 act = actual[numRows / 2][1]; in testRealForward2fInput()
[all …]
H A DFloatFFT_3DTest.java135 this.numRows = numRows; in FloatFFT_3DTest()
458 list.add(new int[] { s, numRows / 2, 0, s, numRows / 2, 0 }); in testRealForward1fInput()
459 list.add(new int[] { s, numRows / 2, 1, s, numRows / 2, 1 }); in testRealForward1fInput()
465 list.add(new int[] { ss, numRows / 2, 0, ss, numRows / 2, in testRealForward1fInput()
480 list.add(new int[] { 0, numRows / 2, 0, 0, numRows / 2, 0 }); in testRealForward1fInput()
481 list.add(new int[] { 0, numRows / 2, 1, 0, numRows / 2, numCols }); in testRealForward1fInput()
588 list.add(new int[] { s, numRows / 2, 0, s, numRows / 2, 0 }); in testRealForward3fInput()
589 list.add(new int[] { s, numRows / 2, 1, s, numRows / 2, 1 }); in testRealForward3fInput()
595 list.add(new int[] { ss, numRows / 2, 0, ss, numRows / 2, in testRealForward3fInput()
610 list.add(new int[] { 0, numRows / 2, 0, 0, numRows / 2, 0 }); in testRealForward3fInput()
[all …]
H A DDoubleFFT_2DTest.java106 private final int numRows; field in DoubleFFT_2DTest
128 this.numRows = numRows; in DoubleFFT_2DTest()
145 for (int r = 0; r < numRows; r++) { in complexForward()
420 exp = expected[numRows / 2][0]; in testRealForward1dInput()
421 index = (numRows / 2) * numCols; in testRealForward1dInput()
499 act = actual[numRows - r][1]; in testRealForward2dInput()
519 exp = expected[numRows / 2][0]; in testRealForward2dInput()
520 act = actual[numRows / 2][0]; in testRealForward2dInput()
522 checked[numRows / 2][0] = true; in testRealForward2dInput()
525 act = actual[numRows / 2][1]; in testRealForward2dInput()
[all …]
H A DDoubleFFT_3DTest.java138 this.numRows = numRows; in DoubleFFT_3DTest()
444 list.add(new int[] { s, numRows / 2, 0, s, numRows / 2, 0 }); in testRealForward1dInput()
445 list.add(new int[] { s, numRows / 2, 1, s, numRows / 2, 1 }); in testRealForward1dInput()
451 list.add(new int[] { ss, numRows / 2, 0, ss, numRows / 2, in testRealForward1dInput()
466 list.add(new int[] { 0, numRows / 2, 0, 0, numRows / 2, 0 }); in testRealForward1dInput()
467 list.add(new int[] { 0, numRows / 2, 1, 0, numRows / 2, numCols }); in testRealForward1dInput()
561 list.add(new int[] { s, numRows / 2, 0, s, numRows / 2, 0 }); in testRealForward3dInput()
562 list.add(new int[] { s, numRows / 2, 1, s, numRows / 2, 1 }); in testRealForward3dInput()
568 list.add(new int[] { ss, numRows / 2, 0, ss, numRows / 2, in testRealForward3dInput()
583 list.add(new int[] { 0, numRows / 2, 0, 0, numRows / 2, 0 }); in testRealForward3dInput()
[all …]
/dports/devel/spark/spark-2.1.1/mllib-local/src/main/scala/org/apache/spark/ml/linalg/
H A DMatrices.scala37 def numRows: Int method
235 require(i >= 0 && i < numRows, s"Expected 0 <= i < $numRows, got i = $i.")
330 new DenseVector(values.slice(j * numRows, (j + 1) * numRows))
352 new DenseMatrix(numRows, numCols, new Array[Double](numRows * numCols))
365 new DenseMatrix(numRows, numCols, Array.fill(numRows * numCols)(1.0))
496 numRows: Int,
710 numRows: Int,
839 numRows: Int,
968 val numRows = matrices(0).numRows constant
1029 var numRows = 0 variable
[all …]
/dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/mllib/linalg/
H A DMatrices.scala43 def numRows: Int method
334 require(i >= 0 && i < numRows, s"Expected 0 <= i < $numRows, got i = $i.")
434 new DenseVector(values.slice(j * numRows, (j + 1) * numRows))
461 new DenseMatrix(numRows, numCols, new Array[Double](numRows * numCols))
474 new DenseMatrix(numRows, numCols, Array.fill(numRows * numCols)(1.0))
614 numRows: Int,
839 numRows: Int,
976 numRows: Int,
1105 val numRows = matrices(0).numRows constant
1166 var numRows = 0 variable
[all …]
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/
H A DGF2mMatrix.java54 int n = count * this.numRows; in GF2mMatrix()
90 numRows = other.numRows; in GF2mMatrix()
93 matrix = new int[numRows][]; in GF2mMatrix()
94 for (int i = 0; i < numRows; i++) in GF2mMatrix()
110 numRows = matrix.length; in GF2mMatrix()
155 for (int i = 0; i < numRows; i++) in isZero()
175 if (numRows != numColumns) in computeInverse()
181 int[][] tmpMatrix = new int[numRows][numRows]; in computeInverse()
188 int[][] invMatrix = new int[numRows][numRows]; in computeInverse()
196 for (int i = 0; i < numRows; i++) in computeInverse()
[all …]
H A DGF2Matrix.java90 numRows = matrix.length; in GF2Matrix()
202 numRows = m; in assignZeroMatrix()
222 numRows = n; in assignUnitMatrix()
248 numRows = n; in assignRandomLowerTriangularMatrix()
280 numRows = n; in assignRandomUpperTriangularMatrix()
322 numRows = n; in assignRandomRegularMatrix()
454 n *= numRows; in getEncoded()
612 int q = numRows >> 5; in getRightSubMatrix()
615 GF2Matrix result = new GF2Matrix(numRows, numColumns - numRows); in getRightSubMatrix()
656 GF2Matrix result = new GF2Matrix(numRows, numRows + numColumns); in extendRightCompactForm()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/lib/gpu/cudpp_mini/
H A Dscan_app.cu76 size_t numRows, in scanArrayRecursive() argument
91 if (numRows > 1) in scanArrayRecursive()
100 dim3 grid(numBlocks, numRows, 1); in scanArrayRecursive()
108 if (numRows > 1) traitsCode |= 2; in scanArrayRecursive()
241 size_t numRows = plan->m_numRows; in allocScanStorage() local
242 plan->m_numRowsAllocated = numRows; in allocScanStorage()
245 if (numRows > 1) in allocScanStorage()
260 if (numRows > 1) in allocScanStorage()
266 numRows)); in allocScanStorage()
325 size_t numRows, in cudppScanDispatch() argument
[all …]
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/gpu/cudpp_mini/
H A Dscan_app.cu76 size_t numRows, in scanArrayRecursive() argument
91 if (numRows > 1) in scanArrayRecursive()
100 dim3 grid(numBlocks, numRows, 1); in scanArrayRecursive()
108 if (numRows > 1) traitsCode |= 2; in scanArrayRecursive()
241 size_t numRows = plan->m_numRows; in allocScanStorage() local
242 plan->m_numRowsAllocated = numRows; in allocScanStorage()
245 if (numRows > 1) in allocScanStorage()
260 if (numRows > 1) in allocScanStorage()
266 numRows)); in allocScanStorage()
325 size_t numRows, in cudppScanDispatch() argument
[all …]
/dports/devel/spark/spark-2.1.1/sql/hive/src/test/resources/ql/src/test/queries/clientpositive/
H A Dannotate_stats_select.q36 -- numRows: 2 rawDataSize: 1514
39 -- numRows: 2 rawDataSize: 8
43 -- numRows: 2 rawDataSize: 8
46 -- numRows: 2 rawDataSize: 174
56 -- numRows: 2 rawDataSize: 0
59 -- numRows: 2 rawDataSize: 8
62 -- numRows: 2 rawDataSize: 16
65 -- numRows: 2 rawDataSize: 16
73 -- numRows: 2 rawDataSize: 96
101 -- numRows: 1 rawDataSize: 8
[all …]
H A Dannotate_stats_groupby.q17 -- numRows: 8 rawDataSize: 796
23 -- inner group by: map - numRows: 8 reduce - numRows: 4
24 -- outer group by: map - numRows: 4 reduce numRows: 2
39 -- map-side GBY: numRows: 8
43 -- map-side GBY numRows: 32 reduce-side GBY numRows: 16
46 -- map-side GBY numRows: 24 reduce-side GBY numRows: 12
49 -- map-side GBY numRows: 8 reduce-side GBY numRows: 4
52 -- map-side GBY numRows: 16 reduce-side GBY numRows: 8
55 -- map-side GBY numRows: 24 reduce-side GBY numRows: 12
58 -- map-side GBY numRows: 32 reduce-side GBY numRows: 16
[all …]
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/sparseMatrix/
H A DsparseMatrix.cpp99 numRows = expand * m1; in SparseMatrixOutline()
127 numRows += numAddedRows; in IncreaseNumRows()
623 if(numRows != mat2.numRows) in operator ==()
642 if(numRows != mat2.numRows) in SameStructure()
1151 if(endRow > numRows) in BuildSubMatrixIndices()
1318 istr[numRows] = num; in GenerateNAGFormat()
1459 numRows--; in RemoveRowColumn()
1486 while (dof < numRows) in RemoveRowsColumns()
1640 numRows--; in RemoveRow()
1844 numRows = newn; in IncreaseNumRows()
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DFilterTest.java57 int numRows = 16; in testSimpleSV16() local
78 int numRows = 32; in testSimpleSV16_AllMatched() local
84 int[] aValues = new int[numRows]; in testSimpleSV16_AllMatched()
87 int[] bValues = new int[numRows]; in testSimpleSV16_AllMatched()
90 int[] expected = new int[numRows]; in testSimpleSV16_AllMatched()
107 int numRows = 1000; in testSimpleSV16_GreaterThan64Recs() local
113 int[] aValues = new int[numRows]; in testSimpleSV16_GreaterThan64Recs()
116 int[] bValues = new int[numRows]; in testSimpleSV16_GreaterThan64Recs()
138 int numRows = 16; in testSimpleSV32() local
157 numRows, in verifyTestCase()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/OPTPP/src/Constraints/
H A DLinearConstraint.C23 numOfCons_( A.numRows() ), numOfVars_( A.numCols() ), nnzl_(0), nnzu_(0), in LinearConstraint()
24 A_(A), Ax_( A.numRows() ), lower_( A.numRows() ), upper_( A.numRows() ), in LinearConstraint()
25 cvalue_( A.numRows() ), cviolation_(0), in LinearConstraint()
39 A_(A), Ax_( A.numRows() ), lower_( b ), upper_( b ), in LinearConstraint()
40 cvalue_( A.numRows() ), cviolation_( A.numRows() ), in LinearConstraint()
56 A_(A), Ax_( A.numRows() ), lower_( A.numRows() ), upper_( A.numRows() ), in LinearConstraint()
57 cvalue_( A.numRows()), cviolation_( A.numRows() ), in LinearConstraint()
91 A_(A), Ax_( A.numRows() ), lower_( lower ), upper_( upper ), in LinearConstraint()
92 cvalue_( A.numRows()), cviolation_( A.numRows()) , in LinearConstraint()
95 int i, numconstraints = A.numRows(); in LinearConstraint()
[all …]
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/space/basisfunctionset/
H A Devaluatecallerdefaultimpl.hh17 template <class BaseFunctionSet, class Geometry, int dimRange, int numRows, int numCols>
35 template <class BaseFunctionSet, int dimRange, int numRows, int numCols>
36 struct EvaluateRanges<BaseFunctionSet, EmptyGeometry, dimRange, numRows, numCols >
59 int dimRange, int numRows, int numCols>
79 int dimRange, int numRows, int numCols>
104 int dimRange, int numRows, int numCols>
123 int dimRange, int numRows, int numCols>
124 struct AxpyRanges<BaseFunctionSet, EmptyGeometry, dimRange, numRows, numCols>
146 int dimRange, int numRows, int numCols>
166 int dimRange, int numRows, int numCols>
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DFilterTest.java93 int numRows = 16; in testSimpleInString() local
107 numRows, in testSimpleInString()
136 int numRows = 16; in testSimpleInInt() local
149 numRows, in testSimpleInInt()
177 int numRows = 16; in testSimpleSV16() local
198 int numRows = 32; in testSimpleSV16_AllMatched() local
227 int numRows = 1000; in testSimpleSV16_GreaterThan64Recs() local
258 int numRows = 16; in testSimpleSV32() local
279 int numRows = 16; in testSimpleFilterWithNoOptimisation() local
298 numRows, in verifyTestCase()
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/java/gandiva/src/test/java/org/apache/arrow/gandiva/evaluator/
H A DFilterTest.java93 int numRows = 16; in testSimpleInString() local
107 numRows, in testSimpleInString()
136 int numRows = 16; in testSimpleInInt() local
149 numRows, in testSimpleInInt()
177 int numRows = 16; in testSimpleSV16() local
198 int numRows = 32; in testSimpleSV16_AllMatched() local
227 int numRows = 1000; in testSimpleSV16_GreaterThan64Recs() local
258 int numRows = 16; in testSimpleSV32() local
279 int numRows = 16; in testSimpleFilterWithNoOptimisation() local
298 numRows, in verifyTestCase()
[all …]
/dports/graphics/dilay/dilay-1.9.0/lib/src/view/
H A Dtwo-column-grid.cpp17 unsigned int numRows; member
22 , numRows (0) in Impl()
37 this->layout.setRowStretch (this->numRows, 0); in add()
38 this->numRows++; in add()
50 this->layout.addWidget (&w1, this->numRows, 0); in add()
51 this->layout.addWidget (&w2, this->numRows, 1); in add()
52 this->layout.setRowStretch (this->numRows, 0); in add()
53 this->numRows++; in add()
75 this->numRows++; in addStacked()
93 this->numRows++; in addStacked()
[all …]
/dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/mllib/random/
H A DRandomRDDs.scala463 numRows: Long,
477 numRows: Long,
490 numRows: Long,
502 numRows: Long,
521 numRows: Long,
535 numRows: Long,
548 numRows: Long,
560 numRows: Long,
583 numRows: Long,
600 numRows: Long,
[all …]
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/sparseSolver/
H A DCGSolver.cpp36 numRows = A->GetNumRows(); in CGSolver()
49 for(int i=0; i<numRows; i++) in CGSolver()
54 for(int i=0; i<numRows; i++) in CGSolver()
90 for (int i=0; i<numRows; i++) in SolveLinearSystemWithoutPreconditioner()
109 for(int i=0; i<numRows; i++) in SolveLinearSystemWithoutPreconditioner()
142 for (int i=0; i<numRows; i++) in SolveLinearSystemWithPreconditioner()
159 for(int i=0; i<numRows; i++) in SolveLinearSystemWithPreconditioner()
208 for(int i=0; i<numRows; i++) in SolveLinearSystemWithJacobiPreconditioner()
214 for (int i=0; i<numRows; i++) in SolveLinearSystemWithJacobiPreconditioner()
269 for(int i=0; i<numRows; i++) in ComputeDotProduct()
[all …]
/dports/math/py-cryptominisat/cryptominisat-5.8.0/src/
H A Dpackedmatrix.h46 , numRows(0) in PackedMatrix()
74 numRows = num_rows; in resize()
80 assert((int)num_rows <= numRows); in resizeNumRows()
81 numRows = num_rows; in resizeNumRows()
86 if (numRows*(numCols+1) < b.numRows*(b.numCols+1)) {
96 numRows = b.numRows;
98 memcpy(mp, b.mp, sizeof(int)*numRows*(numCols+1));
106 assert(i <= numRows);
116 assert(i <= numRows);
187 return numRows; in getSize()
[all …]
/dports/math/cryptominisat/cryptominisat-5.8.0/src/
H A Dpackedmatrix.h46 , numRows(0) in PackedMatrix()
74 numRows = num_rows; in resize()
80 assert((int)num_rows <= numRows); in resizeNumRows()
81 numRows = num_rows; in resizeNumRows()
86 if (numRows*(numCols+1) < b.numRows*(b.numCols+1)) {
96 numRows = b.numRows;
98 memcpy(mp, b.mp, sizeof(int)*numRows*(numCols+1));
106 assert(i <= numRows);
116 assert(i <= numRows);
187 return numRows; in getSize()
[all …]

12345678910>>...115