Usernames

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

Usernames is an esolang made for your usernames. to add a commands put your (or others') username, function for the command, and a note in the table below.

Anyone who wants to add their own usernames while seeing that their usernames is already occupied may change their usernames' command to what they want the command to be provided that they move the original command to a free username.

username	function	note	alt meaning
User:Esolang lover123	takes in input (in ASCII?) and puts it in the stack	note: if anyone adds in queue or something related to it you can also change mine to it	takes input in ASCII, and push it into current queue
User:PrySigneToFry	Pops the stack top and output it as is.		outputs, but do not pop
User:PrySigneToFryAltered	Pops the queue head and output it as is.		outputs, but do not pop
User:cleverxia	convert stack top to ASCII code if it's a character (takes first character if it's a string) and vice versa if it's an integer (round it towards 0 if it's a float number)		pop a, and roll the new top-of-stack a items down.
User:I am islptng x	Push a constant (x) into stack.		Push the constant into queue instead.
User:None1	pops the top of stack.	popping an empty stack gives a random number, and is the only way to get anything random.	Pop from the queue instead.
User:Dragoneater67	50% chance, infinite loop, 25% chance empty the stack, 25% chance push 147647.
User:Corbin	Let stack top be a. Push it to the stack again.		Let the stack bottom be stack top and other elements be shifted down 1 grid.
User:Dragoneater67mobile	duplicates second-to-top of stack		rolls bottom of stack to top
User:RaiseAfloppaFan3925	Pops a number (N) off of the stack, then pops the top N values off of the stack into a string of Usernames code (example: 65 66 67 3 becomes CBA) and pushes the code to the stack. If N is zero or negative, then it is popped off, then peeks N slots down from the stack top (which must be a code object) and runs it.	If the target (N < 0 or N = 0) is not code, then a null pointer is pushed to the stack. You may perform pointer arithmetic on it, but you may not dereference it. (until someone makes a pointer dereference instruction)	Performs surgery on the code blocks. Given a stack (top to bottom illustration) like this: start end replacement original Where start and end are non-negative integers and original and replacement are code blocks, original's characters (starting at zero) will be replaced by replacement. If end is out of range, then the extra characters are simply appended to extend the length of the code block. If replacement is empty, then the segment of original will be deleted instead.
User:Hammy	Jump to the (top of stack)th instruction.		Only run the next username if the top two values of the stack are the same.
User:MihaiEso	Take an integer ended by white character and push it into stack.		Reads a float instead.
User:yoyolin0409	Output the stack top as an integer and pop it.		Output as float instead.
User:ais523	Halt.	The default exit code is 0.	pop x, and exit with exit code x. If nothing is in stack, exit with exit code 0.
User:Hotcrystal0	Add the stack top and stack 2nd together (and pop them), and push the sum into the stack.		Let stack top be a and stack 2nd be b. Pop a, b and push a-b.
User:GUAqwq	Alter the function of the next command. Each username has a alternate function. default to pass		throws an error
User:Tommyaweosme	Let stack top be a and stack 2nd be b. Pop a, b and push a1/b.	Taking an even root of a negative number will return an error before version 1.4 and return sqrt(-x)i after version 1.4. In version 1.4, User:Esolangist and User:Hammy2 make the usage of complex numbers valid in program.	Let stack top be a and stack 2nd be b. Pop a, b and push logb(a). Taking the logarithm of a negative number will return an error. Taking the logarithm of 1 returns 0. Taking the logarithm of 0 returns negative infinity.
User:Aadenboy	Let stack top be a and stack 2nd be b. Pop a, b and push a×b.		Let stack top be a and stack 2nd be b. Pop a, b and push ab.
User:Yes	Let stack top be a. Pop a, and push -a.		a|. If a = x+yi, push sqrt(x^2+y^2).
User:No	Let stack top be a. Pop a, and push NOT a.
User:PythonshellDebugwindow	Interpret everything between the two User:PythonshellDebugwindow-s as Python 3.		does the same, but uses Python 2 instead
User:Oerjan	Let stack top be a and stack 2nd be b. Pop a, b and push a÷b.	Return only the quotient. Dividing by 0 returns an error.	Let stack top be a and stack 2nd be b. Pop a, b and push a mod b. Dividing by 0 returns a.
User:PkmnQ	Let stack top be a and stack 2nd be b. Pop a, b and push a÷b.	Keep decimals. Return NaN when divided by 0.	pops a, pushes floor(a)
User:Miui	Computes Mandelbrot at 0, if stack is > 0 coordinate plane is multiplied until nearest miu cardioid.	If dividing, reduces the numerator over 1.
User:Language	Changes language to User:Language.	yes, the user does exist	changes language to node.js
User:qazwsxplm	creates a new queue.		switch to the next queue
User:SoundOfScripting	pop stack and push to current queue		pop current queue and push to stack
User:Xyzzy	Create a new stack.		Switch to next stack.
User:XKCD Random Number	Literally just another word for 4.		Push 4 to the stack.
User:CodePentuplets48	Interpret the program again with Dodecahedron.	note: use two in a row for a Dodecahedron comment
User:Esolangist	Pop the top value of the stack and turn it into a complex number. Strings get converted to characters using User:cleverxia, which are then converted to numbers and finally complex numbers.		Switch to the previous stack.
User:Hammy2	Pop a value from the stack. If it is complex, push the real part to the stack.		Same, but get the imaginary part instead.
User:Im bad at naming	Let stack top be a . Pop a and push a.	That's just do nothing	Let stack top be b . Pop b and push b.
User:ColorfulGalaxy	Reads a RLE from STDIN and pushes the string to the stack.	If RLE was invalid, pushes the RLE of Kok's Galaxy instead.	Pops the stack top, treats it as a RLE, and opens it in LifeViewer. If no LifeViewer on the device, opens Golly instead. If no Golly either, does nothing, and pushes the RLE back to the stack top.
User:D	Calculates the current depth of the current stack, and push it onto the stack.		Calculates the current length of the current queue, and push it to the queue's tail.
User:tommyaweosmalt	Let stack top be a and stack 2nd be b. Pop a, b and push a AND b.		Pushes a NAND b instead.
User:Unname4798	Let stack top be a and stack 2nd be b. Pop a, b and push a OR b.		Pushes a NOR b instead.
User:YufangTSTSU	Let stack top be a and stack 2nd be b. Pop a, b and push a XOR b.		Pushes a NXOR b instead.
User:A	Make all the logical operations on bitwise and switch it back.
User:Helpeesl	Let stack top be a and stack 2nd be b. Pop a, b and push sgn(a-b).	Can be used to compare stack top and stack 2nd.	Only pops the stack top and pushes its sign.
User:5anz	Pop the stack top if it is a string and run it as a shell command of OS's.	If any errors detected, then push the command back to stack top.
User:TNPC {1} {2}	Execute 1. If error happened, execute 2 instead.
User:Cordership	Adds all the numerical elements in the stack together and pop the output out.	If any errors detected, push the two topmost elements of the stack out.
User:Yayimhere	The whole stack is popped in order top to down, and saved as a list L. Then the program is pushed to the stack(excluding this command), where each command is given a number, based on how many times its used + its first appearing index. If two commands have equal numbers, then those commands will in the actual program, be removed and saved as a string S, and will be removed from the numeric version of the program and discarded. The program is pushed with the start of the string at the top. Then, every number L is rounded down to the nearest command assigned number, and made into a string of commands, S is appended to its end, and then the program is replaced with this string.	If the stack is empty, L will become an empty list, and so empty string.
User:Gilbert189	Pops the top two items of the stack (call them a and b, with a being on top). If both a and b are falsy, nothing happens. If a is falsy but b is truthy, pops the top of the stack (call it c) and pushes ~c ^ c>>1. If a is truthy but b is falsy, pops the top of the stack and jumps to that instruction. If both a and b are truthy, halts the program.		Pushes "uuu".
User:ehird	prints 99 bottles of beer		disassemble a string or a code block: push all content of the string onto the stack, then its length. eg. "abc" pushes 65 66 67 3 onto the stack
User:Blashyrkh	Creates a tape and an pointer.	If followed by a number, jump to tape #x where x is that number. If x-th tape does not exist, mod it by current tape number and jump to tape #r where r is the remainder and 0 corresponds to the last tape.
User:Zopium	Detects the current system platform and pushes the result to the stack.		Do not push, but output instead. Note that "Darwin" corresponds to MacOS since there is no such operating system called DarwinOS.

Programs

User:Hammy's note: anything that isnt a username isnt counted by User:Hammy, and it is a comment (unless it is after User:I am islptng or User:MihaiEso)

One Time Cat

User:Esolang lover123 User:PrySigneToFry

Cat program

User:Esolang lover123 User:PrySigneToFry User:I am islptng 1 User:Hammy

Hello world

User:I am islptng "Hello, world!" User:PrySigneToFry

A+B Problem

User:MihaiEso User:MihaiEso User:Hotcrystal0 User:yoyolin0409

Pi (approximation)

User:I am islptng 2
User:I am islptng 0.00000000000000000001
User:Corbin
User:I am islptng 0.25
User:Hotcrystal0
User:Miui
User:GUAqwq User:Corbin
User:GUAqwq User:Corbin
User:Tommyaweosme
User:Aadenboy
User:GUAqwq User:yoyolin0409
User:ais523