Hi! At #15820, I aim at implementing sequences of bounded integers. If one knows a bound b such that all elements in a sequence S are integers between 0 and b, then (depending on b) one can store S in some "compressed" way, which also means that concatenation, comparison and so on can be rather efficient. My intended application is for an implementation of path algebras, but first I want to keep it abstract: Sequences of bounded integers may be generally useful.
Question to y'all: Where do you think the code should be put? sage.structure.bounded_integer_sequences? sage.misc.bounded_integer_sequences? sage.combinat.bounded_integer_sequences? Best regards, Simon -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
