Code | Desmos

Run

Tick Action: "U" , "S" Subscript, "t" "e" "p" "I" "n" "t" "o" , Baseline , "U" Subscript, 2 , Baseline , "S" Subscript, "t" "e" "p" "I" "n" "t" "o" 2 , Baseline , "E" Subscript, "x" "i" "t" , Baseline

every

Min Step Time: 500

Expression 35: "q" Subscript, "p" "o" "p" , Baseline equals "q" to "q" left bracket, 1...length left parenthesis, "q" , right parenthesis minus 1 , right bracket

For a deque we just combine the two approaches

I have made a second graph showing off bitwise operators and won’t bother copying them here https://www.desmos.com/calculator/sqx1vsqagd

Sadly I wasn’t able to get it to work with binimals

Now let’s get to the actual coding interface

Sadly all actions run simultaneously so we'll have to run actions independently

Sike here is some trickery (Run the ticker)

Expression 42: "c" equals 0

negative 10

144

Expression 43: "l" Subscript, "i" "n" "e" , Baseline equals 67

negative 10

Expression 44: "U" equals "L" Subscript, 1 , Baseline , "L" Subscript, 2 , Baseline , "L" Subscript, 3 , Baseline

Expression 45: "S" Subscript, "t" "e" "p" "I" "n" "t" "o" , Baseline equals "l" Subscript, "i" "n" "e" , Baseline to "l" Subscript, "i" "n" "e" , Baseline plus 1

Expression 46: "L" Subscript, 1 , Baseline equals "c" to StartFraction, "c" Over 2 , EndFraction left brace, "l" Subscript, "i" "n" "e" , Baseline equals 1 , right brace

Expression 47: "L" Subscript, 2 , Baseline equals "c" to 3 "c" left brace, "l" Subscript, "i" "n" "e" , Baseline equals 2 , right brace

Expression 48: "L" Subscript, 3 , Baseline equals "c" to "c" squared left brace, "l" Subscript, "i" "n" "e" , Baseline equals 3 , right brace

Since we cant delay multiple actions in the same tick, we put them in seperate ticks, and use an action to choose which one should be run.

This way we can run all of them at once every tick, and only the ones "approved" will run

With some tirkcery we can also make fors and whiles

Expression 52: "R" Subscript, "e" "s" "e" "t" 2 , Baseline equals "l" Subscript, "i" "n" "e" 2 , Baseline to 0 , "k" to 1 , "v" Subscript, "a" "r" , Baseline to 1

Expression 53: "S" Subscript, "t" "e" "p" "I" "n" "t" "o" 2 , Baseline equals "l" Subscript, "i" "n" "e" 2 , Baseline to "l" Subscript, "i" "n" "e" 2 , Baseline plus 1 left brace, "l" Subscript, "i" "n" "e" 2 , Baseline minus 3 less than 0 , "l" Subscript, "i" "n" "e" 2 , Baseline minus 3 greater than 0 , right brace

Expression 54: "l" Subscript, "i" "n" "e" 2 , Baseline equals 0

negative 10

Expression 55: "k" equals 1

negative 10

Expression 56: "v" Subscript, "a" "r" , Baseline equals 1

negative 10

Expression 57: "U" Subscript, 2 , Baseline equals "L" Subscript, 1 "B" , Baseline , "L" Subscript, 2 "B" , Baseline , "L" Subscript, 3 "B" , Baseline

Begin for

Expression 59: "L" Subscript, 1 "B" , Baseline equals "k" to "k" plus 1 left brace, "l" Subscript, "i" "n" "e" 2 , Baseline equals 1 , right brace

Expression 60: "L" Subscript, 2 "B" , Baseline equals "v" Subscript, "a" "r" , Baseline to "v" Subscript, "a" "r" , Baseline times 2 left brace, "l" Subscript, "i" "n" "e" 2 , Baseline equals 2 , right brace

Expression 61: "L" Subscript, 3 "B" , Baseline equals "l" Subscript, "i" "n" "e" 2 , Baseline to 1 left brace, "k" less than 6 , right brace left brace, "l" Subscript, "i" "n" "e" 2 , Baseline equals 3 , right brace

Expression 62: "E" Subscript, "x" "i" "t" , Baseline equals "l" Subscript, "i" "n" "e" 2 , Baseline to "l" Subscript, "i" "n" "e" 2 , Baseline plus 1 left brace, "k" equals 6 , right brace left brace, "l" Subscript, "i" "n" "e" 2 , Baseline equals 3 , right brace

End for

This calculates 2^5 via repetitive multiplication

The for is actually more complicated then you would think. Since all actions are processed at the same time, updating a variable to 2 seperate values is a no-no, and so the ticker will stop running. We need to get around this by telling the Stepinto action to never run at the end of the for, and having a special function that takes us out of the for when the conditions are right.

A while is identical, the same way they are interchangeable in actual code.

And that's pretty much it. I think recursive functions might not be possible, which is sad, but oh well. Knowing you guys you will probably find something over the top and ridiculos that allows for this.

In the meantime, someone make Doom in Desmos

Expression 69:

Expression 70: