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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
//------------------------------------------------------------------------------
// GB_nnz_max.c: max number of entries that can be held in a matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// GB_nnz_max(A) is the maximum number of entries that can be held in the data
// structure, including zombies and all entries in a bitmap, but not including
// pending tuples. For iso full matrices, GB_nnz_max (A) can be less than
// GB_nnz_full (A), and is typically 1.
#include "GB.h"
int64_t GB_nnz_max
(
GrB_Matrix A
)
{
if (A == NULL || A->x == NULL || A->type == NULL)
{
// A is empty
return (0) ;
}
int64_t nnz_max ;
int64_t xmax = A->x_size / A->type->size ;
if (A->p != NULL)
{
// A is sparse (p,i,x) or hypersparse (p,h,i,x):
size_t isize = (A->i_is_32) ? sizeof (uint32_t) : sizeof (uint64_t) ;
nnz_max = (A->i == NULL) ? 0 : (A->i_size / isize) ;
if (!A->iso)
{
nnz_max = GB_IMIN (nnz_max, xmax) ;
}
}
else if (A->b != NULL)
{
// A is bitmap (b,x):
nnz_max = A->b_size / sizeof (bool) ;
if (!A->iso)
{
nnz_max = GB_IMIN (nnz_max, xmax) ;
}
}
else
{
// A is full (x only):
nnz_max = xmax ;
}
return (nnz_max) ;
}
|
