I agree. Then I have to remove the local import.
Am Freitag, 15. September 2017 21:50:01 UTC+2 schrieb Travis Scrimshaw:
>
>
>
> On Friday, September 15, 2017 at 2:39:29 PM UTC-5, Martin R wrote:
>>
>> I haven't done any "professional" profiling, but it seems to me that the
>> 10% are stable, i.e., roughly independent of the size of the permutation.
>>
>> I just found a much faster alternative: simply bypass MatrixSpace.matrix
>> completely:
>>
>> entries = { (v-1, i): 1 for i, v in enumerate(self) }
>> M = MatrixSpace(ZZ, len(self), sparse = True)
>> return Matrix_integer_sparse(M, entries, False, False)
>>
>> I am not completely sure what's better in the long run... It somehow
>> feels stupid that in order to optimize a function I have to inline it by
>> hand, even if it's only one line. I really miss FriCAS/Aldor.
>>
>
> In general, I would say it's not a good idea to directly construct the
> element class other than M.element_class (if it exists) to stay compatible
> with the category framework.
>
> Best,
> Travis
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
