Compare commits

3 Commits
Author SHA1 Message Date
maxgrf 54ca7acca2 Kommentare angepasst 2025-11-20 14:27:47 +01:00
maxgrf b998717e19 angepasste Kommentare 2025-11-20 14:12:47 +01:00
maxgrf 89262e4763 weitere Absicherung multiply 2025-11-18 13:18:29 +01:00
+22 -24
View File
@@ -6,18 +6,18 @@
Matrix createMatrix(unsigned int rows, unsigned int cols)
{
Matrix m = {NULL, 0, 0};
Matrix matrix = {NULL, 0, 0};
if (rows == 0 || cols == 0)
return m;
return matrix; //gibt leere Matrix zurück
m.buffer = (MatrixType *)calloc(rows * cols, sizeof(MatrixType));
if (m.buffer == NULL)
return m;
matrix.buffer = (MatrixType *)calloc(rows * cols, sizeof(MatrixType));
if (matrix.buffer == NULL) //auf verfügbaren Speicherplatz prüfen
return matrix;
m.rows = rows;
m.cols = cols;
return m;
matrix.rows = rows;
matrix.cols = cols;
return matrix; //Matrix zurückgeben
}
void clearMatrix(Matrix *matrix)
@@ -25,18 +25,18 @@ void clearMatrix(Matrix *matrix)
if (matrix != NULL)
{
free(matrix->buffer);
matrix->buffer = NULL;
free(matrix->buffer); //Speicherplatz bereinigen
matrix->buffer = NULL; //Werte auf 0 setzen
matrix->rows = 0;
matrix->cols = 0;
}
}
void setMatrixAt(MatrixType value, Matrix matrix, unsigned int rowIdx, unsigned int colIdx)
// Matrix matrix zu Matrix *matrix, empfehlung
{
if (rowIdx < matrix.rows && colIdx < matrix.cols && matrix.buffer != NULL)
if (rowIdx < matrix.rows && colIdx < matrix.cols && matrix.buffer != NULL) //Prüft ob Zugriff möglich
matrix.buffer[rowIdx * matrix.cols + colIdx] = value;
//schreibt 2D element in 1D Liste: Element_Reihe*Matrix_Spalten + Element_Spalte
}
MatrixType getMatrixAt(const Matrix matrix, unsigned int rowIdx, unsigned int colIdx)
@@ -47,11 +47,10 @@ MatrixType getMatrixAt(const Matrix matrix, unsigned int rowIdx, unsigned int co
}
// TODO: Funktionen implementieren
Matrix add(const Matrix matrix1, const Matrix matrix2)
{
// check, equal rows
// "Elementweise Addition": test, if two matrix has exact size
// immer Probe, gleiche Zeilen der Matrizen
// "Elementweise Addition": Probe, ob matrix gleiche größe hat
if (matrix1.rows == matrix2.rows && matrix1.cols == matrix2.cols)
{
Matrix result_add = createMatrix(matrix1.rows, matrix1.cols);
@@ -66,7 +65,7 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
}
return result_add;
}
// "Broadcasting": matrix1 has 1 collum
// "Broadcasting": matrix1 hat 1 Spalte
if (matrix1.rows == matrix2.rows && matrix1.cols == 1)
{
Matrix result_add = createMatrix(matrix1.rows, matrix2.cols);
@@ -80,7 +79,7 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
}
return result_add;
}
// "Broadcasting": matrix2 has 1 collum
// "Broadcasting": matrix2 hat 1 Spalte
if (matrix1.rows == matrix2.rows && matrix2.cols == 1)
{
Matrix result_add = createMatrix(matrix1.rows, matrix1.cols);
@@ -100,13 +99,14 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
Matrix multiply(const Matrix matrix1, const Matrix matrix2)
{
// Needed: rows/Zeilen, collums/Spalten
MatrixType buffer_add;
// Probe ob Spalten1 = Zeilen2
if (matrix1.cols != matrix2.rows)
if (!matrix1.buffer || !matrix2.buffer) // Probe ob leere Matrize vorliegt
return createMatrix(0, 0);
if (matrix1.cols != matrix2.rows) // Probe ob Spalten1 = Zeilen2
return createMatrix(0, 0);
Matrix result_mul = createMatrix(matrix1.rows, matrix2.cols); // ""
Matrix result_mul = createMatrix(matrix1.rows, matrix2.cols);
for (unsigned int index = 0; index < matrix1.rows; index++)
{
@@ -115,11 +115,9 @@ Matrix multiply(const Matrix matrix1, const Matrix matrix2)
buffer_add = 0;
for (unsigned int skalar = 0; skalar < matrix1.cols; skalar++)
{
// buffer_add += matrix1[index][skalar]*matrix2[skalar][shift];
buffer_add += getMatrixAt(matrix1, index, skalar) * getMatrixAt(matrix2, skalar, shift);
}
// matrix_mul[index][shift] = buffer_add;
setMatrixAt(buffer_add, result_mul, index, shift); // result als Pointer, also mit &result
setMatrixAt(buffer_add, result_mul, index, shift);
}
}
return result_mul;