Such code would make a fascinating test case for the various parts of element.pyx and parent.pyx that are relatively untested. If someone can afford the time, perhaps this could be developed into a short step-by-step "adding a new element type" tutorial?
Nick David Kohel wrote:
OK, I've created the following: sage: S = BinaryStrings() sage: S Free binary string monoid sage: (x,y) = S.gens() sage: x '0' sage: y '1' sage: x^7 * y^11 * x^17 * y^2 '0000000111111111110000000000000000011' sage: x^61 '0000000000000000000000000000000000000000000000000000000000000' sage: y^61 '1111111111111111111111111111111111111111111111111111111111111' Internally it just stores bits as int's, which generalizes easily to other numerical strings, and should be useful for more sophisticated conversions in, e.g. the AES, where 8-bit strings are alternately interpreted as module elements or finite field elements. I haven't implemented any sophisticated string operations like splicings, but the above is to me already a more satisfying multiplicative notation than that of Python str's. --David
--~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
