|
9 | 9 |
|
10 | 10 | #include "./patterns/main.h" |
11 | 11 |
|
12 | | -void destroyMatrix(char** matrix, int rows, int cols) { |
| 12 | +void destroy2DArray(char** arr, int rows, int cols) { |
13 | 13 | int i; |
14 | 14 |
|
15 | 15 | for (i = 0; i < rows; i++) { |
16 | | - free(*(matrix + i)); |
| 16 | + free(*(arr + i)); |
17 | 17 | } |
18 | 18 |
|
19 | | - free(matrix); |
| 19 | + free(arr); |
20 | 20 | } |
21 | 21 |
|
22 | 22 | char* getUserInputStr(char* message, char* onInvalidMessage, int strLength, |
@@ -53,31 +53,30 @@ int isStrIn(char* str, char* arr[], int size) { |
53 | 53 | return 0; |
54 | 54 | } |
55 | 55 |
|
56 | | -char** newMatrix(int rows, int cols) { |
57 | | - char** matrixRows; |
| 56 | +char** new2DArray(int rows, int cols) { |
| 57 | + char** bidimensionalArr; |
58 | 58 | int i; |
59 | 59 |
|
60 | | - matrixRows = malloc(rows * sizeof(char*)); |
61 | | - if (matrixRows == NULL) { |
| 60 | + bidimensionalArr = malloc(rows * sizeof(char*)); |
| 61 | + if (bidimensionalArr == NULL) { |
62 | 62 | printf("Memory allocation failed!\n"); |
63 | 63 | exit(EXIT_FAILURE); |
64 | 64 | } |
65 | 65 |
|
66 | 66 | for (i = 0; i < rows; i++) { |
67 | | - *(matrixRows + i) = malloc(cols * sizeof(char)); |
68 | | - if (*(matrixRows + i) == NULL) { |
| 67 | + *(bidimensionalArr + i) = malloc(cols * sizeof(char)); |
| 68 | + if (*(bidimensionalArr + i) == NULL) { |
69 | 69 | printf("Memory allocation failed!\n"); |
70 | 70 | exit(EXIT_FAILURE); |
71 | 71 | } |
72 | 72 | } |
73 | 73 |
|
74 | | - return matrixRows; |
| 74 | + return bidimensionalArr; |
75 | 75 | } |
76 | 76 |
|
77 | 77 | void sleep(int miliseconds) { |
78 | 78 | clock_t startTime = clock(); |
79 | | - while (clock() < (startTime + miliseconds)) |
80 | | - ; |
| 79 | + while (clock() < (startTime + miliseconds)); |
81 | 80 | } |
82 | 81 |
|
83 | 82 | int strcmpi(const char* str01, const char* str02) { |
|
0 commit comments