Stephen, A couple questions.
Where does the problem arise? Can you show before-and-after examples of the change? Is computing the log of very large numbers efficient? (This isn't an issue if we only cover the first case) Since there are only a few cases might it be cheaper to compute the length of numbers by range and do u < 10 ==> 1 u < 100 ==> 2 u < 1000 ==> 3 rather than compute the log? The change seems quite benign so I don't see any problem. Tim _______________________________________________ Axiom-developer mailing list Axiom-developer@nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-developer
