merge `fibonacci.position` into `fibonacci.__getitem__` to provide 1-only way getting its value. about extmath HOT 3 CLOSED

the standard __getitem__ are design for list, so it need all 0 <= i < n exists in order to compute fibonacci at position n.

since position's algorithm see it as dictionary. i've try re-implement the InfiniteList as InfiniteDict to allowed the fibonacci use __getitem__ as native. this work flawlessly! but computation for many consecutive terms show significant time difference (sum up ~50k consecutive terms takes under 1 sec for old method, ~8 sec for the new one). so other approach shall be preferred.

from extmath.

testing n - len(fibonacci) >= large then choose subroutine should be avoid. since there might be the situation that ask for sum(fibonacci[i] for i in range(larger, largest)), its easily to see that if larger > large then every consecutive fibonacci[i] will be compute with the dictionary-way.

statistic analyse might be preferred to tell how much fibonacci[i] should be kept, and use dictionary-way after this no meter input n is.

from extmath.

just can't figure out how to achieve this, so done the __call__ way.

from extmath.