On Thursday, August 13, 2015 at 12:32:27 AM UTC+2, Nils Bruin wrote:
>
> Do you really just want equality and hash on FP groups to be what we have
> on the covering free presentation? GAP doesn't do that itself (and as a
> result computations there can lead to unbounded running times and outright
> failures)
>
The GAP language doesn't have many associative containers to start with;
E.g. dictionary ("rec") keys must be strings there. Unless you
intentionally create a GAP Set you won't accidentally invoke comparison
under the hood. Thats fundamentally different in Python. It does make
implementing fast algorithms so much easier in Python, but only if you can
actually compare stuff.
--
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 http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
