> > > It is quite inefficient, as it needs to build a new list of > all > > > arguments on > > > each call: > > Well i see ways how it could be speed up it up in assembly but only by > > adding > > lots of complexity.
> Yes. I'm afraid it needs very much complexity! > Interestingly, 'foldr' would probably be extremely > simple and efficient compared > to that. Here is an idea: implement foldl by reverse and foldr > but I *feel* it must > be something along the line: (de foldr (F I . @) (pass mapc '(@ (setq I (pass F I)))) ) This gives us a new was to make large numbers: (foldr '** 2 (range 1 10)) # wanted to post it but converting to decimal took way to long. > Am I right? you are incredible! I do not even understand how it works fully ... > ☺/ A!ex -- UNSUBSCRIBE: mailto:[email protected]?subject=Unsubscribe
