[bug #50796] calling find on diagonal matrix is slower than full matrix

Please use the bug tracker to post updates to a bug report.  The mailing list is intended as a read-only notification stream.  Info posted to this mailing list address won't appear in the tracker database where it is most useful.

Update of bug #50796 (group octave):

                  Status:          Ready For Test => Fixed
             Open/Closed:                    Open => Closed
           Fixed Release:                    None => 11.1.0 (current stable)

    _______________________________________________________

Follow-up Comment #10:

I'm getting the following timings with Octave 11.0.92:

octave:8> d = eye (10000);
octave:9> f = full (eye (10000));
octave:10> for i=1:10, find (d); endfor, t = cputime (); for i=1:100*10000,
find (d); endfor, (cputime () - t) / 10000
ans = 1.5047e-03
octave:11> for i=1:10, find (f); endfor, t = cputime (); for i=1:100, find
(f); endfor, cputime () - t
ans = 8.8750
octave:12> for i=1:10, find (full (d)); endfor, t = cputime (); for i=1:100,
find (full (d)); endfor, cputime () - t
ans = 9.0938
octave:13>


That is in line for full matrices with what I got with Octave 10.3.0. So, it
doesn't look like that affected the performance for the full matrix case
significantly (if at all).

Since there were no further comments in more than a month, I'm closing the
report as fixed.





    _______________________________________________________

Reply to this item at:

  <https://savannah.gnu.org/bugs/?50796>

_______________________________________________
Message sent via Savannah
https://savannah.gnu.org/

-----BEGIN PGP SIGNATURE-----

iHUEABYIAB0WIQQk97aszIMMAvLLwm6qLAuaBUf3TgUCaYYUtwAKCRCqLAuaBUf3
TvUiAQDhBREmHmAnKynTBCleZSVR6XpW2Cp6ge02dt/QT3/EQwD/cjKWqLcqoYs1
BezSttLEVT2bVth6JjeKx3xsc9cSGww=
=Awx8
-----END PGP SIGNATURE-----