Hi Florent! On Dec 10, 10:56 am, Florent Hivert <florent.hiv...@univ-rouen.fr> wrote: > > AFAIK, a set is internally represented by a sorted binary tree that, > > ideally, is balanced. > > I think that's not true. It is implemented as a hash table. Indeed, when you > put something into a set, you need the element to be hashable be not ordered > (only __hash__ and == are used)...
Ah, you are right! Sorry for my confusing things. Cheers, Simon -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
