{"push_id":1013024605,"size":2,"distinct_size":2,"ref":"refs/heads/sparsecopy","head":"e0e9d4c9dccf8191d59645cfd3a44594d1d1f21a","before":"83c194c6a556d32a16f611ef5dc77172ba3107c5","commits":[{"sha":"4679ad1ff65c939491d91bce5d348929ee9244a7","author":{"email":"0ce0c556b6530900bd67bca4d9994c2cbeaee60e@hsu-hh.de","name":"Martin Holters"},"message":"Implement sparse matrix copy! for unequal length.\n\nInstead of relying on copy!(::AbstractMatrix, ::AbstractMatrix), the\ndest matrix is prepared so that\nsparse_compute_reshaped_colptr_and_rowval() can then be applied.","distinct":true,"url":"https://api.github.com/repos/martinholters/julia/commits/4679ad1ff65c939491d91bce5d348929ee9244a7"},{"sha":"e0e9d4c9dccf8191d59645cfd3a44594d1d1f21a","author":{"email":"0ce0c556b6530900bd67bca4d9994c2cbeaee60e@hsu-hh.de","name":"Martin Holters"},"message":"Specialize copy! for SparseVectors.\n\nWhile the AbstractArray version works, treating sparse vectors special\nis much faster.","distinct":true,"url":"https://api.github.com/repos/martinholters/julia/commits/e0e9d4c9dccf8191d59645cfd3a44594d1d1f21a"}]}