request: provide iterative function sample

[Ryder17z]

i.e. TI style:

:For(I,0,9)
:Disp I
:End

[JordanL2]

You can already call a function on an array of numbers:
https://github.com/JordanL2/ModularCalculator/wiki/Arrays
https://github.com/JordanL2/ModularCalculator/wiki/Inline-functions
https://github.com/JordanL2/ModularCalculator/wiki/Using-arrays-with-operations

Example of calling a function with an array, a simple function which just doubles the input:

f = {
    PARAM1 * 2
}

a = [1 .. 4]

@f(a)

[JordanL2]

The main limitation is that generally, there is no control flow (IF statements, WHILE loops, FOR loops) because I don't want to implement a full programming language, because at that point you should just use Python or something. But a lot of things you'd use FOR loops for can just be done with arrays.

[Ryder17z]

I was more interested in an example like that yes.
But since you mentioned python, perhaps this would be an option;

normal stuff goes here

python(
#code here is saved as a temporary file and executed by the app.
#no further scripting features added to the app, instead it's more like a wrapper
)

I don't know of a good way to do this, but if the app can call out to Python to do more things and retrieve results, then I think it would be worth the investment. (since you are not building a scripting language into the app)

[JordanL2]

Perhaps there could be a way to execute external programs/scripts as a function, passing in function parameters as command line arguments. Similarly to the user-defined functions. Maybe something like:

f = 'execute:python3 /path/to/script.py'
@f(123)

This would execute the command in f after the 'execute:' prefix, passing in "123" as a command line argument. Whatever the program prints to STDOUT is the result of the function call.

[Ryder17z]

That would be perfectly viable IMO.

Ideally the result should be possible to store as an array or something, so that it can be processed by the application (it would be nice to have, but I know it does introduce additional complexity)