subsref2: often faster than subsref for C=A(i,j) when A is sparse: All Files - File Exchange

Code covered by the BSD License

subsref2 (A,i,j) SUBSREF2 often a faster way to compute C=A(i,j) when A is sparse.
View all files

from subsref2: often faster than subsref for C=A(i,j) when A is sparse by Tim Davis
subsref2 is a replacement for subsref, performing the computation C=A(i,j).

All files for subsref2: often faster than subsref for C=A(i,j) when A is sparse
/license.txt /subsref2.m