On Nov 21, 2014 5:27 PM, "Jean Bétréma" <jean.betr...@gmail.com> wrote:
>
> Le mercredi 19 novembre 2014 00:03:27 UTC+1, William a écrit :
>>
>> >
>> > lM = Map[If[# == 0, 0, 1] &, M[[2]][[#[[2]] & /@ M[[3]], #[[2]] & /@
>> > M[[4]]]], {2}];
>>
>> Holy f*2}];ng s&/@!
>
>
> Sure this answer by Sage is less cryptic:
>
> sage: p=Permutation([4,1,2,5,3])
> sage: type(p)
> <class
'sage.combinat.permutation.StandardPermutations_all_with_category.element_class'>
>
> but it prevents me (and perhaps others) to do any development in such a
system :-(
>Hi, I am quite confused by this. Having a good type system at hand is really helpful, in my opinion. What do you actually expect to get here instead? Sage already changes some of Python to make it more useful, but I think those basics should stay as they are. H -- 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.
