> You probably mean faster -- if "scan once" is slower > why to use it?
In List case, scan once is slower -- much slower, maybe because you have to advance 2 pointers or I wrote bad code. > but OTOH by not providing > them we may motiviate user to use more appropriate > data structures like doubly-linked lists or arrays, > or better algorithms, for example working on reversed > list. Right, maybe remove them from UnaryRecursiveAggregate and add to FiniteLinearAggregate? BTW, current implementation and doc says it returns a copy, do you think that's necessary? -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" 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 https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
