| 205 | //------------------------------------------------------------------------------ |
| 206 | |
| 207 | static inline bool GB_is_dense |
| 208 | ( |
| 209 | const GrB_Matrix A |
| 210 | ) |
| 211 | { |
| 212 | // check if A is competely dense: all entries present. |
| 213 | // zombies, pending tuples, and jumbled status are not considered. |
| 214 | // A can have any sparsity structure: hyper, sparse, bitmap, or full. |
| 215 | // It can be converted to full, if zombies/tuples/jumbled are discarded. |
| 216 | if (A == NULL) |
| 217 | { |
| 218 | return (false) ; |
| 219 | } |
| 220 | if (GB_IS_FULL (A)) |
| 221 | { |
| 222 | // A is full; the pattern is not present |
| 223 | return (true) ; |
| 224 | } |
| 225 | // A is sparse, hyper, or bitmap: check if all entries present |
| 226 | return (GB_nnz_full (A) == GB_nnz (A)) ; |
| 227 | } |
| 228 | |
| 229 | //------------------------------------------------------------------------------ |
| 230 | // GB_as_if_full |
no test coverage detected