fix code snippet showing how to use SparseMat
generate indices within the size limit (modulo)
This commit is contained in:
parent
1cd3c6f364
commit
c35b00a97e
@ -2359,15 +2359,16 @@ Elements can be accessed using the following methods:
|
|||||||
SparseMat::find), for example:
|
SparseMat::find), for example:
|
||||||
@code
|
@code
|
||||||
const int dims = 5;
|
const int dims = 5;
|
||||||
int size[] = {10, 10, 10, 10, 10};
|
int size[5] = {10, 10, 10, 10, 10};
|
||||||
SparseMat sparse_mat(dims, size, CV_32F);
|
SparseMat sparse_mat(dims, size, CV_32F);
|
||||||
for(int i = 0; i < 1000; i++)
|
for(int i = 0; i < 1000; i++)
|
||||||
{
|
{
|
||||||
int idx[dims];
|
int idx[dims];
|
||||||
for(int k = 0; k < dims; k++)
|
for(int k = 0; k < dims; k++)
|
||||||
idx[k] = rand()
|
idx[k] = rand() % size[k];
|
||||||
sparse_mat.ref<float>(idx) += 1.f;
|
sparse_mat.ref<float>(idx) += 1.f;
|
||||||
}
|
}
|
||||||
|
cout << "nnz = " << sparse_mat.nzcount() << endl;
|
||||||
@endcode
|
@endcode
|
||||||
- Sparse matrix iterators. They are similar to MatIterator but different from NAryMatIterator.
|
- Sparse matrix iterators. They are similar to MatIterator but different from NAryMatIterator.
|
||||||
That is, the iteration loop is familiar to STL users:
|
That is, the iteration loop is familiar to STL users:
|
||||||
|
Loading…
x
Reference in New Issue
Block a user