I have "Graph" objects that are compile time. Expression "a * x b" gets represented with Graph<BinaryOp<BinaryOp<Input<"a">, Input<"x">, std::multiplied<>>, Input<"b">, std::plus<>>
This is definitely a mouthful! But users hopefully will not need to type it.
Why not just build a simple expression tree for yourself? Easy to build, parse and evaluate with simple recursive functions.
Literal, BinaryOp and UnaryOp. Add more as you need.
Starting to play with the new #UE5 Execution Flow Nodes now.
There are some extra stuff not available yer: WhileLoop, BinaryOp (in Math) and Less (like Blender LessThan ?).
We start the survey.
What topic would you like us to make a video on?
1. How to use the new application?
2. New strategy.
3. Tips for beginners.
4. Your option.
Leave your options in the comments. We will definitely listen and shoot a new video for you.
#optionstrading#BinaryOp
turns out that `traverse binaryOp xs x` is a really great way to apply `binaryOp x` to everything in `xs`!
arguably even nicer when written as
`for xs binaryOp x`
or for a concrete example
`for [1, 2, 3, 4] ( ) 4` -> `[5, 6, 7, 8]`