Combined() Task() Force()
Jump to navigation
Jump to search
- The title of this article is not correct because of technical limitations. The correct title is actually Combined() Task[] Force{}.
Combined() Task[] Force{} or just Combined Task Force is a esolang by User:Yayimhere based on the hierarchy of operations in arithmetic
memory
Combined() Task[] Force{} has these things:
- 4 equations
- 1 variable
- 3 arrays
- a pointer pointing to a function
the 4 equations are:
the variable is n which can be incremented decremented and used as a number argument. and the 3 arrays are:
- x
- y
- z
this is how the arrays update each iteration of the program:
- find a solution more than the last one for the equation pointed to for x, y, and z
- append this solution to the end of the array
this is my longest memory section lol
the stack
you know the hierarchy of operations in arithmetic? its represented as a trangle. but here when i say stack i mean the triangle since you could use a stack to represent it. like if the triangle was:
/\
/()\
/----\
/ .... \
/--------\
/ + - \
then the stack would be:
|+------+| || () || |+------+| |+------+| || .... || |+------+| |+------+| || +- || |+------+| \--------/
so when i say that stack this is what i mean
commands
| command | description |
|---|---|
(body)number |
do body when the numberth solution for current equation is found. if not in these braces the commands will just be done before any of the other logic |
{operator} |
apply operator to n. operator can be + and - and its obvious what they do to n. increment by 1 and decrement by 1
|
= |
halt |
<body>array |
if the last element of array is 0 do body |
: |
pop the top of stack and move to the bottom. this is the main command lol |
; |
switch the pointer to next function(the order is as they are ordered in the list of them) |
[array] |
delete the last element of array |
|array| |
append user input(as a number) to array |
the program loops until no more solutions can be found