On Friday, June 13, 2014 6:18:19 PM UTC+1, Nils Bruin wrote: > > This is also where we see that FiniteEnumeratedSet is horrible for > caching: its computation is totally trivial. >
Thats generally the case for parents. The point is not that constructing a parent is super-difficult, but that it provides an object that plays nicely with the rest of Sage and is a natural point at which to attach more functionality (which can then be costly to compute). Finitely presented groups are parents, construction is trivial, but investigating their properties is not. -- 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.
