> My policy concerning optimizations was mostly reactive. > I look at profile data and try to eliminate expensive > part.
This is List, the most basic data structure used everywhere in FriCAS, it's worth to optimize List whenever possible. > Spreading out copies in different places makes it harder to notice > that code is the same. Reuse code in different categories is awkward too. I don't know why HyperTeX shows List uses map from IndexedAggregate and map! from URAGG. > BTW2: In case of 'map' or 'map!' with explicit functional > argument best optimizations is to inline definition of map > into current code, then inline functional argument into > it. With good low level optimizer this can give 10-100 > time speedup, much more than speeding up 'map' can > give. I didn't realize that compiled map can be this slow. I do a simple benchmark shows in the most simple case, map is 1x slower than for loops. -- 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.
