| Wed, 22 May 2013 15:02:17 +0100 |
Chris Cannam |
Implement and test sparse resizedTo; some tidying
|
| Wed, 22 May 2013 13:54:15 +0100 |
Chris Cannam |
Rename and reorder args of at and slice functions in matrix and vector for consistency with std module equivalents
|
| Wed, 22 May 2013 09:22:10 +0100 |
Chris Cannam |
Make concat also return sparse when all its inputs are sparse
|
| Wed, 22 May 2013 08:56:51 +0100 |
Chris Cannam |
Replace matrix thresholded with a more general filter function that works for sparse matrices too
|
| Tue, 21 May 2013 22:37:28 +0100 |
Chris Cannam |
Make sum, difference, scaled and abs use sparse operations and return sparse matrices if all inputs are sparse
|
| Tue, 21 May 2013 22:36:39 +0100 |
Chris Cannam |
Implement add, subtract, scaled, abs
|
| Tue, 21 May 2013 21:58:34 +0100 |
Chris Cannam |
Add general enumerate, ensure zeros fed in to makeSparse are not retained in non-zero lists; test
|
| Tue, 21 May 2013 17:40:33 +0100 |
Chris Cannam |
Using hashes is simpler, but turns out to be mostly no faster and sometimes much slower. Not one to merge back.
sparse
|
| Tue, 21 May 2013 16:00:21 +0100 |
Chris Cannam |
Merge from default branch
sparse
|
| Tue, 21 May 2013 14:29:22 +0100 |
Chris Cannam |
Another minor improvement
|
| Tue, 21 May 2013 12:11:40 +0100 |
Chris Cannam |
Proper sparse*sparse multiply, more efficient makeSparse. Still loads of room for improvement, but the timings are more predictable now at least.
|
| Mon, 20 May 2013 22:17:35 +0100 |
Chris Cannam |
Merge from sparse branch
|
| Mon, 20 May 2013 22:17:19 +0100 |
Chris Cannam |
A reasonable sparse multiply, and a bit quicker dense one
sparse
|
| Mon, 20 May 2013 18:11:44 +0100 |
Chris Cannam |
Add speed tests
sparse
|
| Mon, 20 May 2013 18:11:36 +0100 |
Chris Cannam |
Sparsity is actually density
sparse
|
| Mon, 20 May 2013 18:11:20 +0100 |
Chris Cannam |
Sparsity is actually density
sparse
|
| Mon, 20 May 2013 16:48:44 +0100 |
Chris Cannam |
Add newSparseMatrix to api (needs test)
sparse
|
| Mon, 20 May 2013 16:46:38 +0100 |
Chris Cannam |
ColMajor -> ColumnMajor
sparse
|
| Mon, 20 May 2013 16:45:34 +0100 |
Chris Cannam |
Separate out thresholding from toSparse. Not entirely sure this is a good thing
sparse
|
| Mon, 20 May 2013 16:22:17 +0100 |
Chris Cannam |
Add and test sparsity
sparse
|
| Mon, 20 May 2013 16:01:43 +0100 |
Chris Cannam |
Fix comparator for sparse matrices; sprinkle some zeros in test data to exercise sparsity
sparse
|
| Mon, 20 May 2013 15:08:14 +0100 |
Chris Cannam |
Fix sparse matrix enumerate
sparse
|
| Mon, 20 May 2013 14:40:52 +0100 |
Chris Cannam |
Sparse fixes
sparse
|
| Mon, 20 May 2013 14:18:14 +0100 |
Chris Cannam |
Implement sparse matrix construction, add tests for sparse matrices (currently failing)
sparse
|
| Sun, 19 May 2013 22:21:47 +0100 |
Chris Cannam |
A few fixes
sparse
|
| Sun, 19 May 2013 22:16:02 +0100 |
Chris Cannam |
Extract values and slices (rows, columns) from sparse matrices
sparse
|
| Sun, 19 May 2013 21:13:48 +0100 |
Chris Cannam |
Sparse enumerate
sparse
|
| Sun, 19 May 2013 19:16:18 +0100 |
Chris Cannam |
Embark on sparse-matrix support
sparse
|
| Sun, 19 May 2013 18:42:10 +0100 |
Chris Cannam |
A more sophisticated bitdepth comparator, but something is still wrong here
|
| Fri, 17 May 2013 20:24:44 +0100 |
Chris Cannam |
Plot the (first few) values and difference from the audiofile read test when they aren't within tolerance
|
