>> Right, but the current library implementation is unnecessarily >> restrictive. >> >> I guess for "expand" we only need OrderedSet, a distinct element 1 >> (default step size) and an operation +. In fact, disregarding the "by" >> construction of a segment, a function next: %->% would be enough. > > Maybe we should try to lessen these restrictions? > What do you think about this, would it be feasible > or rather introduce new trouble somewhere?
I don't think that it would introduce trouble, but what you really want is a way to generate all the elements that are in the given segment. "expand" does this under the assumption of OrderedRing. In fact, "OrderedRing" is somehow builtin into the Segment domain when it comes to generating the elements in the segment. Think about to which type you could relax "OrderedRing". Do you find something more general? Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
