@@ -246,7 +246,7 @@ class BoundingMatrix: public SUPER
246
246
#pragma omp parallel num_threads(threadCount)
247
247
#endif
248
248
{
249
- int threadNum = getThreadNumber ();
249
+ intptr_t threadNum = getThreadNumber ();
250
250
for (intptr_t r=threadNum; r<row_count; r+=threadCount) {
251
251
sortRow (r,r,false ,sorters[threadNum]);
252
252
// copies the "left of the diagonal" portion of
@@ -311,7 +311,7 @@ class BoundingMatrix: public SUPER
311
311
* to sort), that is "owned" by the current thread.
312
312
* @note
313
313
*/
314
- void sortRow (intptr_t r /* row index*/ , int c /* upper bound on cluster index*/
314
+ void sortRow (size_t r /* row index*/ , size_t c /* upper bound on cluster index*/
315
315
, bool parallel, Sorter& sorter) {
316
316
// 1. copy data from a row of the D matrix into the S matrix
317
317
// (and write the cluster identifiers that correspond to
@@ -351,9 +351,9 @@ class BoundingMatrix: public SUPER
351
351
* @param r the row number
352
352
*/
353
353
void purgeRow (intptr_t r /* row index*/ ) const {
354
- T* values = entriesSorted.rows [r];
355
- int * clusterIndices = entryToCluster.rows [r];
356
- int c = rowToCluster[r];
354
+ T* values = entriesSorted.rows [r];
355
+ int * clusterIndices = entryToCluster.rows [r];
356
+ size_t c = rowToCluster[r];
357
357
intptr_t w = 0 ;
358
358
intptr_t i = 0 ;
359
359
for (; i<row_count ; ++i ) {
@@ -781,9 +781,9 @@ class VectorizedBoundingMatrix: public SUPER
781
781
// better min(Q).
782
782
783
783
Position<T> pos (row, 0 , infiniteDistance, 0 );
784
- const T* rowData = entriesSorted.rows [row];
785
- const int * toCluster = entryToCluster.rows [row];
786
- const int cluster = rowToCluster[row];
784
+ const T* rowData = entriesSorted.rows [row];
785
+ const int * toCluster = entryToCluster.rows [row];
786
+ const size_t cluster = rowToCluster[row];
787
787
788
788
size_t partners = indexOfFirstGreater
789
789
(rowData, clusterPartners[cluster], rowBound);
0 commit comments