nyuuzyou/wikis huggingface dataset:
S.B.M.F.B

S.B.M.F.B(made by User: Yayimhere) stands for stack based memory for brainfuck. in S.B.M.F.B you have a stack to store brainfuck code inside. there are some simple commands in this program to add it to the stack
 €(): add the brainfuck code inside the brackets to the top of the stack
 run^: run the top of the stack
 runV:run the bottom of the stack
 shiftV: shift the bottom of the stack one up
 shift^: shift the top of the stack one down
 run: run the top of the stack as brainfuck code
==Examples==
===Hello, World!===
This program prints the message “Hello, World!”:
 €(+[-->-[>>+>-----<<]<--<---]>-.>>>+.>>..+++[.>]<<<<.+++.------.<<-.>>>>+.)run
===Cat program===
Prints your input and terminates:
 €(,)
 run
 shift^
 €([.,])
 run
==Interpreter==
* Common Lisp implementation of the S.B.M.F.B programming language. Please note that the concrete character set deployed constitutes a dependency on the Common Lisp implementation; in corollary, Unicode support may or may not be a feature incorporated in the personal environment. The interpreter at hand has been developed and tested with Steel Bank Common Lisp (SBCL) version 1.1.4 as part of the Lisp Cabinet 0.3.5 bundle.
Category:Languages
Category:Stack-based
Category:Cell-based
Category:Turing complete
Category:2024
Category:Implemented
Category:Brainfuck derivatives
S1LK

S1LK is an Esoteric programming language created by User:Buckets in 2022 about Having an Output Purely In Taste.
Commands 	Instructions
Set 	Sets the Next variable by the Next Number, example: Set blah 1, If you are Changing The tastes, Use numbers Between 0 to 1.
Create 	Create A new Variable and Name it,
Example: Create blah .
Change 	Changes the next Variable by the Next number, examples: Change blah 2, Change blah -3.
Sweet 	A Variable that is in the Taste catagory.
Sour 	A variable of the taste.
Salt 	A Salt tasting variable.
Bitter 	A variable of The catagory, Taste.
Umami 	A taste variable.
If 	If the Next variable is Equal to the Next Number, Then go to Y, Else N (To signify Which Y is to Which If, is By Indentation by counting upwards in Base 2 Which is made of Tabs and Spaces, For example If the 1st use of If will Go to (Space)Y).
Y 	Noop.
N 	Noop.
Submit 	Submits the Concoction of the main tastes.
PD 	Creates A variable named "Pd", That stores an Input, If used Multiple times It will change it to "Pd1", "Pd2" etc.
Toggle Mint 	Toggles Mint.
Toggle Spice	Toggles Spice.
(Spice and Mint is Automatically off.)
Cat Program*:
 PD Create back
 N Change Pd -1 Change Sweet 0.01
 Change Sour 0.01 Change Bitter
 0.01 Change Umami 0.01 Change Salt 0.01
 Change back 1 If Pd 0
 Y
 	N Toggle Mint Toggle Spice Change back -1
 If back 0
 	Y Submit
Truth-machine Program*:
 PD If Pd 0
 N Toggle Mint Toggle Spice Set Sweet 1
 Set Sour 1 Set Bitter 1 Set Salt 1
 Set Umami 1 Set Pd 1
 	Y Submit
 If Pd 1
 Y Submit
Category:Languages
Category:2022
Category:Joke languages
S3C (sssc)

== A self-updating language. ==
The language has a bug in it that allows for comments with no prefix like #, or //. This allows for easy error fixes. (it ignores any errors and treats them like comments.)
===Interpreters: ===
Every interpreter version of SSSC is written in Python.
Online interpreter*. Remember to replace what is in the read( ) function with your code like: "!poop haha;" or "=100/;" 
===== *Common-S3C version =====
== Versions 3.x and up now updates themselves! ==
=== Syntax: ===
* §: prints A or any input (see number 6) forever
* º: starts up a local testing environment on port 80
* ⨘: print a random number in between 0 and 10
* !hello;: prints what is inbetween `!` and `;`
* =1+1; accepts +, -, /, and * with two parameters of up to 243 characters in length.<be>
* !word;§ prints word forever.
* =100/34;§ prints 2.94117647059 forever
=== Examples: ===
 §
returns
 A
 A
 A
 A
 A
 A
etc.
==== "Hello World": ====
 !Hello, world!;
==== Math: ====
 =420/500;
 =1+1;
 =1*4;
 =1-3;
== Links: ==
Source code on Github
Online interpreter 
===== The TIO Version does NOT come with instructions. =====
SANTA

SANTA is a joke programming language created by User:Earthrulerr. The language is based off of the figure Saint Nick (commonly know as Santa Claus) To learn how to fully use SANTA refer to the #ReadMe on the GitHub: 
== Input ==
You run multiple commands on a single line as long as the PRINTER command is not in front of other commands.
 SANTA! 
 SANTA! PRINTER Example!
Using PRINTER before any other code on the same line will result in errors.
(also “MILK!” prints 99 glasses of milk on the wall, a play off of beer on the wall)
== Examples ==
Input:
 SANTA! PRINTER This is an example.
 COOKIES 25 MILK 5 DIV HOHOHO this will divide 25/5
 
Output: 
Hello, World!
This is an example.
5
-----
Input:
PRINTER Are you the age of:
COOKIES 2 MILK 10 MULTIPLY 
Output: 
Are you the age of:
20
== Implementation ==
* C++ implementation: - the source code can be found .
Category:2022
Category:Joke_languages
Category:Languages
Category:Total
Category:Pseudonatural
Category:Thematic
Category:Implemented
SARTRE

SARTRE was originally a fictional programming language invented as a joke by John Unger Zussman, published in a list of "lesser known programming languages" in 1982, named after Jean-Paul Sartre, a French existentialist philosopher. He described it like this:
: SARTRE is an extremely unstructured language. Statements in SARTRE have no purpose; they just are there. Thus, SARTRE programs are left to define their own functions. SARTRE programmers tend to be boring and depressed and are no fun at parties.net.general post from 1984
The joke was expanded by John Colagioia (sometime ca. 1998-2000) to describe a complete esoteric programming language, but no implementations are known to exist.
==External resources==
Category:Joke languages
Category:Unimplemented
Category:Before 1993
Category: Languages
SAS

SAS /sæs/ or Simple Assembly is an assembly language invented by User:None1 to be easy to implement and compile to another language, it is possible to write a C compiler to it.
==Memory==
There are infinite dialects of SAS: SAS-1, SAS-2, ... The number is the architecture number: the number of bits in a machine word. The most commonly-used ones are SAS-8, SAS-16, SAS-24 and SAS-32.
The memory in SAS-x consists of 2x machine words, each machine word is x bits. Each machine word is addressed 0 to 2x-1. At start of the program, the addresses 0 to x-1 store 2i, where i is the address, the addresses 2x-1 to 2x-x store 2x-22x-i-1, where i is the address, while other addresses are zero.
Machine words wrap ((2x-1)+1=0).
==Basic Commands==
 ADD x y
Add address y to address x.
 JMP x y
If address x is nonzero, jump to line y (line numbers start from 0).
 REF x y
Let x be the value addressed the value of address y.
Commands are case insensitive.
That's it.
==I/O Extensions (optional)==
 OUT x
Print address x modulo 256 as ASCII.
 INP x
Input address x as ASCII.
==Example Programs==
===Hello, World!===
The following works in SAS-8.
ADD 8 3
ADD 8 6
OUT 8
ADD 9 0
ADD 9 2
ADD 9 5
ADD 9 6
OUT 9
ADD 10 2
ADD 10 3
ADD 10 5
ADD 10 6
OUT 10
ADD 11 2
ADD 11 3
ADD 11 5
ADD 11 6
OUT 11
ADD 12 0
ADD 12 1
ADD 12 2
ADD 12 3
ADD 12 5
ADD 12 6
OUT 12
ADD 13 2
ADD 13 3
ADD 13 5
OUT 13
ADD 14 5
OUT 14
ADD 15 0
ADD 15 1
ADD 15 2
ADD 15 4
ADD 15 6
OUT 15
ADD 16 0
ADD 16 1
ADD 16 2
ADD 16 3
ADD 16 5
ADD 16 6
OUT 16
ADD 17 1
ADD 17 4
ADD 17 5
ADD 17 6
OUT 17
ADD 18 2
ADD 18 3
ADD 18 5
ADD 18 6
OUT 18
ADD 19 2
ADD 19 5
ADD 19 6
OUT 19
ADD 20 0
ADD 20 5
OUT 20
===Cat program===
 INP 0
 OUT 0
 JMP 0 0
===Truth Machine===
INP 8
ADD 9 8
ADD 8 251
ADD 8 250
OUT 9
JMP 8 4
==Computational class==
When the architecture number is near infinity, the esolang is Turing complete, but the architecture 
number cannot be infinity. Also the esolang is not Turing complete when architecture number is infinity.
==Implementations==
* Original Python 3 implementation, interprets SAS-8 by default, but you can change architecture number by changing the variable.
Category:Languages
Category:2024
Category:Implemented
SASM

SASM is a very simple derivative of assembly code.
==Commands==
===Aperçu===
Command 	Effect
mov destination, source 	Assigns the source to the destination. The destination may be a register or [bx]; the source may be a literal integer, a register, or [bx].
add destination, source 	Increments the destination by the source. The destination may be a register or [bx]; the source may be a literal integer, a register, or [bx].
sub destination, source 	Decrements the destination by the source. The destination may be a register or [bx]; the source may be a literal integer, a register, or [bx].
cmp left, right, destination	Compares the left and the right operand; if both are equal, the destination is set to 1, otherwise it is set to 0. The left and right operand may be a literal integer, a register, or [bx]; the destination may be a register or [bx].
je left, right, tag 	Compares the left and the right operand; if both are equal, the instruction pointer (IP) is relocated to the tag; otherwise no effect ensues. The left and right operand may be a literal integer, a register, or [bx]; the tag must be the name of a tag (label) defined in the program.
jne left, right, tag 	Compares the left and the right operand; if both are not equal, the instruction pointer (IP) is relocated to the tag; otherwise no effect ensues. The left and right operand may be a literal integer, a register, or [bx]; the tag must be the name of a tag (label) defined in the program.
tag: 	Defines a goto tag (label) with the name tag, which must be a valid identifier.
===mov===
It is just the = command in C.
It sets a register (ax, bx, cx, dx) to a value, or sets a register to another register's value.
But, BX can address the place(only BX can do that) by […]s. Like [bx].
It can set an address to a register.
 mov bx,dx
 mov ax,[bx]
===cmp===
It compares two things.
 cmp ax,bx,cx
Sets cx to 1 if ax = bx, 0 otherwise.
===je===
It means "Jump if equal" to a tag name in the selections.
===jne===
It means "Jump if not equal" to a tag name in the selections.
===add===
It means "Make the first register increment by the register or a value".
===sub===
It is equivalent to add, but it subtracts it.
===Last but not least===
It has tags, like this:
 mytag:
 ...
==Examples==
===Countdown===
This program counts down from ten (10) to zero (0):
 mov ax, 10
 mov bx, ax
 
 countdown:
 sub bx, 1
 jne bx, 0, countdown
===Indirect addressing===
The following code stores the value 100 at the memory address 2:
 mov bx, 2
 mov [bx], 100
===Truth-machine===
This program approximates a truth-machine. An input of zero (0) is simulated by choosing an initial program memory whose first cell, at the address 0, contains 0; an input of one (1), ensuing similiter, issues from a value of 1 at the address 0:
 je [bx], 0, _halt
 
 _goback:
 add bx, 1
 mov [bx], 1
 je [bx], 1, _goback
 
 _halt:
==Interpreter==
* Common Lisp implementation of the SASM programming language.
Category:Languages
Category:Turing tarpits
Category:Low-level
Category:Implemented
Category:2018
Category:No IO
SBFM

SBFM (Strange brainfuck minimalizations) are brainfuck minimalizations created by User:ChuckEsoteric08
==Notes==
Note that in all of them loops are only run if they are not empty
==SBFM-1==
 > - move pointer right
 { - flip bit and start while not zero loop
 } - end while not zero loop and move pointer left
1-bit brainfuck to SBFM-1:
 BF SMBFM-1
 -- -------
 > >
 * {}>
 < {}>{}
 [ {}>{
 ] }{}>{}
===Examples===
====Flip Bit====
This simple example stores the bit value one (1) in the first cell and terminates:
 {}
==SBFM-2==
 { - flip bit, move pointer left and start while not zero loop
 > - move pointer right
 ] - end while not zero loop
1-bit brainfuck to SBFM-2:
 BF SMBFM-2
 -- -------
 > >
 * {]>
 < {]>{]
 [ >{]>{
 ] ]
===Examples===
====Infinite Loop====
This program demonstrates a perpetually repeating loop:
 >{]>>{>{]]
==Interpreter==
* Common Lisp implementation of the SBFM programming language family.
Category:Languages Category:Brainfuck derivatives Category:Brainfuck Category:Turing complete Category:2023 Category:Implemented
SBN

SBN (Subtract and Branch if Negative) is an OISC low level language. It is described by Fotis Georgatos in "Coffee Making HOWTO", chapter 5.1 "An adequate assembly language". To be more exact, the SBN described in the Coffee Making HOWTO is for humorous effect chosen to be SBN2, which is an esoteric way to program a subtracting machine, to the point of distraction. 
If you want nicer programmability features, it is better to opt for SBN3 (known to play along nicely for setting up, say, a FORTH interpreter) or even SBN4, which is itself a more complete model, far more easy to build upon and clock it efficiently for general purpose usage. Here are some links for further study:
* SBN2: https://doi.org/10.1007/978-1-4615-0237-1_6
* SBN3: https://web.ece.ucsb.edu/~parhami/pubs_folder/parh88-ijeee-ultimate-risc.pdf
* SBN4: https://en.wikipedia.org/wiki/One-instruction_set_computer#subneg4
Category:2004
Category:OISC
Category:Low-level
Category:Turing complete
Category:Self-modifying
SCREAMCODE

Screamcode (stylized as SCREAMCODE) is a Trivial brainfuck substitution created by Baguette one night while taking a break from Codewars. Every instruction in Screamcode is a pained yell, reflecting how painful brainfuck and its derivatives are to code in. It has unlimited, unbounded tape.
==Overview==
Command	Description
AAAH 	Move the pointer to the right
AAAAGH 	Move the pointer to the left
FUCK 	Increment the memory cell at the pointer
SHIT 	Decrement the memory cell at the pointer
!!!!!! 	Output the character signified by the cell at the pointer
WHAT?! 	Input a character and store it in the cell at the pointer
OW 	Jump past the matching OWIE if the cell at the pointer is 0
OWIE 	Jump back to the matching OW if the cell at the pointer is nonzero
Instructions may be seperated by a space, newline, or both, although it is not required.
==Examples==
===Hello World===
 FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK
 OW AAAH FUCK FUCK FUCK FUCK FUCK FUCK FUCK AAAH
 FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK
 AAAH FUCK FUCK FUCK AAAH FUCK AAAAGH AAAAGH AAAAGH
 AAAAGH SHIT OWIE AAAH FUCK FUCK !!!!!! AAAH FUCK
 !!!!!! FUCK FUCK FUCK FUCK FUCK FUCK FUCK !!!!!!
 !!!!!! FUCK FUCK FUCK !!!!!! AAAH FUCK FUCK !!!!!!
 AAAAGH AAAAGH FUCK FUCK FUCK FUCK FUCK FUCK FUCK
 FUCK FUCK FUCK FUCK FUCK FUCK FUCK FUCK !!!!!! AAAH
 !!!!!! FUCK FUCK FUCK !!!!!! SHIT SHIT SHIT SHIT
 SHIT SHIT !!!!!! SHIT SHIT SHIT SHIT SHIT SHIT SHIT
 SHIT !!!!!! AAAH FUCK !!!!!! AAAH !!!!!!
==Trivial brainfuck substitution interpreter==
 #!/usr/bin/env ruby
 eval 'm=Hash.new(p=0);'+ARGF.read.gsub(
 /[!-~]+|./,
 'AAAH' => 'p+=1;',
 'AAAAGH' => 'p-=1;',
 'FUCK' => 'm[p]+=1;',
 'SHIT' => 'm[p]-=1;',
 '!!!!!!' => 'putc m[p];',
 'WHAT?!' => 'm[p]=STDIN.getbyte if !STDIN.eof;',
 'OW' => '(',
 'OWIE' => ')while((m[p]&=255)!=0);')
Category:Joke languages
Category:2020
Category:Brainfuck equivalents
Category:Low-level 
Category:Cell-based 
Category:Languages
Category:Turing complete
Category:Turing tarpits
Category:Brainfuck derivatives
SCRUBS4U

SCRUBS4U is a joke programming language, based on internet memes and specially gaming terms, as keywords. It is based on no real languages, though it has some similarities with Python. 
It is still under construction, but will hopefully soon be published.
== How to scrub ==
a program is executed with SCRUBS4U.py. A window will appear, where you type a file name. Only .cyka files are allowed. Just a name is needed, helloworld.cyka will need just helloworld to name it. It will be then executed in the same window.
The .cyka files are normal plain text files with a .cyka file extension. Editing is done just by opening the script with any text editor program, and translation is not needed at all.
== Keywords ==
Keyword 	Meaning
Scrub 	Variable making. Supports 4 of Python's data types.
Confirm 	Print command. Confirm Illuminati crashes program.
2nerdy 	Mathematical, multi-use command.
wtf 	If command.
omg 	Else command.
1_o_1 me 	Import add-on.
shitstorm! 	Begins an endless loop.
clevercomment	Multi-use, can stop shitstorm.
Blazeit 	Try statement.
420 	Except.
360 	Defines a function.
MLG 	Executes string as a program command.
MLGPR0 	Executes string as an OS command.
== Examples ==
:1_o_1 me microsoft!; # imports addon microsoft
:Srcub Int Value 10; # making an integer variable "Value" with value of 10
:Scrub Int Value2 9; #every line ends with ;
:Scrub Str Text "Noob"; #string variable
:confirm scrub Value; #prints Value, -> 10
:2nerdy 4me 10 + 2; #calculates 10+2 to terminal
:2nerdy 4scrub Value+=Value2; #calculates 10+9 into Value's value
:confirm 2nerdy 4scrub Value+=Value2; #calculates 19+9 into Value's value and prints it
:wtf 10+5 iz liek 23?; #If condition
: confirm sampletext Hello World; ''
:omg?; #Else
: confirm sampletext World Hello;
:shitstorm!; #endless loop
: 2nerdy 4scrubs Value+=1;
: wtf Value iz liek 12?;
: clevercomment; #stops endless loop
: windows's windows8; # kills the program
SELENE.

SELENE. is a language inspired by SELECT., but using hyperoperators instead of just exponentiation and logarithms.
Every command is separated by a space, with newlines able to be placed anywhere in between commands. Any line starting with { is a comment line. There are 3 pointers: the data pointer (DP), the base selector (B), and the rank selector (R). The current cell is the cell pointed at by DP. All cells are initially set to 1/2, and can hold any positive real number.
== Commands ==
Command	Function
left 	Move DP one space to the left
right 	Move the DP one space to the right
start 	If current cell is 0, jump 1 command past matching end
end 	If current cell isn't 0, jump 1 command past matching start
take 	Input either an integer (a string containing only 0-9, like 1234) or a fraction (2 integers divided by a /, like 12/34) and store it in the current cell
print 	Print the current cell's decimal expansion. If it repeats forever after a certain point, cut it after the first repetition. Remove trailing 0s
ascii 	Print the ASCII character corresponding to the current cell rounded to the nearest integer mod 128
setr 	Move R to current cell
setb 	Move B to current cell
power 	Set current cell to h(R,DP,B) (see Hyperoperations section)
root 	Set current cell to rt(R,DP,B) (see Hyperoperations section)
== Hyperoperations ==
The hyperoperations are defined as:
 h(0,a,b) = a+b
 h(r,a,≤1) {r∈N} = a
 h(r+1,a,b+1) {r∈N} = h(r,a,h(r+1,a,b))
 rt(r,a,b) is defined so that rt(r,h(r,a,b),b) = a
 m(r,a,b) {r∈N} = rt(r+1,h(r,a,b),2)
 m(m(0,x,y),a,b) {m(0,x,y)∉N} = L, where: 
 a(0) = a
 b(0) = b
 a(i+1) = m(x,a(i),b(i))
 b(i+1) = m(y,a(i),b(i))
 L = lim{x->inf}(a(i))
 M(r,a,b) is defined so that m(r,M(r,a,b),b) = a and m(r,M(r,a,b),a) = b
 h(r,a,b) {r∉N} = M(r,m(r,a,b),M(r,2,4))
 h(r,a,b) {r∉Q} = lim{x->r}(h(x,a,b))
== Example program: Truth-machine ==
 take start print end print
== External Resources ==
* Wikipedia:Hyperoperation
* Fractional hyperoperator definitions
Category:Languages Category:Unknown computational class Category:2021 Category:Unimplemented
SEPL

SEPL(Satan's Esoteric Programming Language) is an esolang by User:ChuckEsoteric08.
==Specification==
Instead of ASCII characters it uses "Table". It looks like this:
 ABCDEFGHIJKLMNOPQRSTUVWXYZ !@#$%^&*(){}[],.:;"'?/\=-_+|0123456789<>~`
Last two characters are newline and nothing (only used for I/O). Note that SEPL is case-insensitive, so a is A . This language stores data in a tape but also has four registers:
A and B - Accumulators
C - Code Pointer
D - Data Pointer
To have opcode it takes current character's value in Table, multiplies it by C+65 and divides it by (A+B)*32+6, taking the remainder. Note that if result of any operation is negative it would return 0.
Opcode 	Instruction
2 	D=[D]+B
6 	C=A*B
8 	B=A+6
12 	A=[B]+[D]
5 	[D]=A-10
3 	B+=[D]
11 	C=[C+[D]]
10 	B=Input
4 	[D]*=[C]; Output [D]. If value of [D] is larger than 70 don't output anything
7 	[A]=[D]
9 	NOP
1 	Stop
Anything else	A+=10-[D]
==Examples==
===Set A to 20===
I don't know how it works
 122
==External resourses==
Scratch interpreter
Category:Languages Category:Unknown computational class Category:Implemented
SESPOOL

SESPOOL (Simple Extensible Systems PrOgramming Orient Language) was a language developed at the Washington State University in the 1970s and was implemented on an IBM 360/67.
===Example===
 MAX: PROCEDURE (A,B) RETURNS (INTEGER);
 A,B,M :- INTEGER;
 ENDDECLS;
 IF A > B THEN M := A ELSE M := B ENDIF;
 PROCVAL IS M;
 ENDPROC;
==External resources==
* SESPOOL, a language for systems programming by Glen E. Newton and J.Denbigh Starkey, Computer Languages Volume 2, Issue 3, 1977, Pages 75-91
* SESPOOL: a simple extensible systems programming oriented language European Computing Conference on Software Systems Engineering, September, 1976, pgs 463-482
Category:Languages 
Category:Turing complete
Category:Before 1993
SETANDCOUNT

==Introduction & Syntax==
SETANDCOUNT (SAC for short) is a language for storing in an ordered list.There is SAC syntax:
*Numbers 1~6:Suppose that the first n values are added by one to form S(n),O(S(n)) represents the original value of the number of operations currently performed. The numbers 1-6 represent S(1)~S(6).When O(S(n)) (n represents any number from 1 to 6) is a non-positive number,The running result is equivalent to S(n+(-O(S(n))).
Tip: When the number in S() is greater than the number of elements in the list, there is an extra 1 in the last list.
-----------------------------------------
*Number 0:Jump to the position item of the number following 0 and set this item to the opposite of the second number following 0.
-----------------------------------------
*Number 9:If the list does not shrink before the instruction, the code jumps to the number represented by the number between the 9 and the first 0 after the 9.
-----------------------------------------
*Number 7 and Number 8:Input and Output.Store to the first unit. (stored in digital form)
I don't think the operation when the item is equal to 0 is really useful, so I may update its usage later.
==Some examples==
Calculation 8-2+1:
11111122329110
infinite loop:
910
Cat program:
78
Truth machine(Input 0 or 1 => 1 or 2)(and if you input 2 it will puts 3):
7218940
==Interpreter==
The interpreter written in Python follows.
l=[];pointer=0;cd="7218940";cp=0;c=1#The content of the variable cd is the code
while cp<len(cd):
 i=cd[cp];o=l[:]
 if i in "123456":
 f=[]
 t=(int(i),0) if int(i)<=len(l) else (len(l),1)
 for k in range(t[0]):
 if l[k]>0:l[k]+=1
 elif l[k]<0:f.append(str(-l[k])) 
 if t[1]:l.append(1)
 if len(f)>0:cd="".join(list(cd[:cp])+f+list(cd[cp:])) 
 pointer=0;l=list(set(l))
 l.sort()
 if len(o)>len(l):c=0
 if i=="0":
 pointer=int(cd[cp+1]);l[pointer]=-int(cd[cp+2])
 cp+=2
 l.sort()
 if len(o)>len(l):c=0
 if i=="9":
 tmp=cp+cd[cp:].index("0")
 if c:cp=int(cd[cp+1:cp+cd[cp:].index("0")])-2
 else:cp=tmp;c=1
 if i=="7":
 if len(l)>0:l[0]=ord(input()[0])
 else:l.append(ord(input()[0]))
 if i=="8":
 print(chr(l[-1])) 
 cp+=1 
#print(l)
==Something I wanted to say==
This esolang is inspired by Python's set type. It's stored roughly as a set in Python. However, sometimes you can't sort in the correct order. (For example, {7,8,9} will be converted to {8,9,7} and so on) .so I'm abandoning the set and using an ordered list store.It's a completely helpless move.
Good Luck.
Category:Languages Category:2024