| Commit message (Collapse) | Author | Age |
| |
|
|
|
|
|
|
|
|
| |
- transpose swaps dimensions
- transpose sets variable to indicate it has been transposed
- matrix_at acts accordingly
- matrix_foreach_idx now uses matrix_at to set the iterator to allow
iterating over a transposed matrix
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Renamed 'matrix_freen' to 'matrix_free_many1'. Frees a dynamic array of
matrices.
|
| |
|
|
|
|
|
| |
Freeing the resulting vector resulted in an 'invalid pointer'
exception.
|
| |
|
|
|
|
|
|
|
| |
Also added tag 'Matrix' to struct 'Matrix'. Makes forwards declaration
available for 'Matrix'.
Avoids having to import matrix.h in vector.h (and the other way around),
when accessing matrix functionality.
|
| |
|
| |
|
|
|
|
| |
It's completely based on the existing matrix struct and its functions.
|
|
|
|
|
| |
Calloc initializes the elements with 0 instead of possibly undefined
behavior. 'matrix_const(..., ..., 0)' is not needed anymore
|
|
|
|
|
|
|
|
| |
Added more versions of existing functions with suffix '1' that take a matrix
as argument and perform the action (e.g. filling a matrix with random
entries) to the passed matrix.
'matrix_add' and 'matrix_scale' save the result in the matrix passed
first.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
This avoids having to write double for-loops again and again.
- 'matrix_loop' just replaces the loops and gives access to the indices i
and j
- 'matrix_foreach' initializes a double pointer to the current element
- 'matrix_foreach_idx' is combination of the two above
All for-loops that simply iterate over a matrix have been replaced.
|
|
|
|
|
|
|
|
| |
The performance of functions (with one or two matrix arguments) can now
be benchmarked. To time and analyse most functions, the user does not
have to handle the memory or pass matrices. Just provide the dimensions,
function name, (optional) string with details, and missing arguments to
the function.
|
|
|
|
|
| |
Seems to solve the empty argument problem for macros with variadic
argument lists. GCC only
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|