| Directory: | ./ |
|---|---|
| File: | s21_mult_number.c |
| Date: | 2025-08-15 23:01:21 |
| Exec | Total | Coverage | |
|---|---|---|---|
| Lines: | 9 | 9 | 100.0% |
| Branches: | 8 | 8 | 100.0% |
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "s21_matrix.h" | ||
| 2 | |||
| 3 | 14 | int s21_mult_number(matrix_t *A, double number, matrix_t *result) { | |
| 4 |
4/4✓ Branch 1 taken 12 times.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 2 times.
✓ Branch 4 taken 10 times.
|
14 | if (s21_check_matrix_is_invalid(A) || result == NULL) { |
| 5 | 4 | return ERROR; | |
| 6 | } | ||
| 7 | |||
| 8 | 10 | int code = OK; | |
| 9 | 10 | s21_create_matrix(A->rows, A->columns, result); | |
| 10 | |||
| 11 |
2/2✓ Branch 0 taken 30 times.
✓ Branch 1 taken 10 times.
|
40 | for (int i = 0; i < A->rows; i++) { |
| 12 |
2/2✓ Branch 0 taken 88 times.
✓ Branch 1 taken 30 times.
|
118 | for (int j = 0; j < A->columns; j++) { |
| 13 | 88 | result->matrix[i][j] = A->matrix[i][j] * number; | |
| 14 | } | ||
| 15 | } | ||
| 16 | |||
| 17 | 10 | return code; | |
| 18 | } | ||
| 19 |