Complexity of displaying lists seems to be at least quadratic
Displaying lists seems to have a complexity at least quadratic in the length of the list. See for instance the following example:
> n=5000; L=[|1,...,n|]; for i from 1 to n do L[i]="a"; time(r=""@L);
Warning: For at least 1 of the constants displayed in decimal, rounding has happened.
3.2858557999999999999999999999999999997992136782807e-2
> n=10000; L=[|1,...,n|]; for i from 1 to n do L[i]="a"; time(r=""@L);
Warning: For at least 1 of the constants displayed in decimal, rounding has happened.
9.3019989999999999999999999999999999988377283619521e-2
One would expect more something like linear complexity.