1. I agree that "discrete" was a poor name choice 2. Would we want to add a package that implements a single (very elementary) class? (no) 3. I, for one, would like to keep Sage's documentation apolitical -- I'd rather to see some mathematical examples than those provided.
On Thu, Sep 26, 2013 at 12:03 PM, Nils Bruin <nbr...@sfu.ca> wrote: > On Wednesday, September 25, 2013 9:59:46 AM UTC-7, Tom wrote: >> >> For iso/automorphisms of graphs, I often wish that dictionaries were >> both callable and invertible. In general, yes, I think >> DiscreteFunction and DiscreteBijection classes would be very useful. > > > Does https://pypi.python.org/pypi/bidict scratch this itch? > Incidentally, aren't these FiniteFunction and FiniteBijection? I'd say that > the function > x :-> x^2 from Z to Z is discrete, but I don't think the approaches > suggested here would apply. > > -- > 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/groups/opt_out. -- 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/groups/opt_out.
