Re: broken coordinate_matrix::sort with gcc 4.7 (was: patches for #7297, #7296, #6514, #6511 on trunk - please verify)
sguazt <[email protected]>
| Newsgroups | gmane.comp.lib.boost.ublas |
|---|---|
| Message-ID | <CABbE_O4pukSTA3vgJ35iMMMxCW3JuZNyMhToDc1-3C1PxH8=dQ@mail.gmail.com> |
On Tue, Aug 28, 2012 at 9:46 PM, Thomas Klimpel <[email protected]> wrote: > Gunter Winkler wrote: >> Looks like this hack does not work with gcc 4.7 any more. Maybe we can >> improve coordinate_matrix::sort() somehow to use the zip_iterator. (see >> storage_sparse.hpp:4396) > > My conclusion in <http://lists.boost.org/MailArchives/ublas/2011/12/5123.php> was that we need an implementation of "std::inplace_merge" guaranteed to accept our iterators. Basically any existing implementation could be used, as long as the licensing conditions allow this. > > As a side note, inplace_merge is cheating anyway, allocates temporary memory, and will only fall back to a true inplace_merge if this fails. > > Regards, > Thomas Hi, After having done "svn update" (rev 80290), I've compiled the following tests with GCC 4.7.0: begin_end comp_mat_erase concepts num_columns num_rows placement_new size sparse_view_test test_assignment test_complex_norms test_coordinate_matrix_sort test_inplace_solve test_lu test_triangular triangular_access triangular_layout All test succeeded except: test_assignment test_coordinate_matrix_sort (as expected) test_inplace_solve Cheers, -- Marco _______________________________________________ ublas mailing list [email protected] http://lists.boost.org/mailman/listinfo.cgi/ublas Sent to: [email protected]