1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
//------------------------------------------------------------------------------
// GB_nnz.h: number of entries in a matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
#ifndef GB_NNZ_H
#define GB_NNZ_H
// GB_nnz(A): # of entries in any matrix: includes zombies for hypersparse
// and sparse, but excluding entries flagged as not present in a bitmap.
int64_t GB_nnz (GrB_Matrix A) ;
// GB_nnz_full(A): # of entries in A if A is full
int64_t GB_nnz_full (GrB_Matrix A) ;
// GB_nnz_held(A): # of entries held in the data structure, including
// zombies and all entries in a bitmap. For hypersparse, sparse, and full,
// GB_nnz(A) and GB_nnz_held(A) are the same. For bitmap, GB_nnz_held(A)
// is the same as the # of entries in a full matrix (# rows times #
// columns).
int64_t GB_nnz_held (GrB_Matrix A) ;
// GB_nnz_max(A): max number of entries that can be held in a matrix.
// For iso full matrices, GB_nnz_max(A) can be less than GB_nnz_full(A),
// and is typically 1.
int64_t GB_nnz_max (GrB_Matrix A) ;
// Upper bound on nnz(A) when the matrix has zombies and pending tuples;
// does not need GB_MATRIX_WAIT(A) first.
#define GB_NNZ_UPPER_BOUND(A) \
(GB_nnz ((GrB_Matrix) A) - (A)->nzombies + GB_Pending_n (A))
#endif
|
