Abuse filter log

Abuse Filter navigation (Home | Recent filter changes | Examine past edits | Abuse log)
Jump to navigation Jump to search
Details for log entry 8,749

13:19, 6 November 2024: Xyzzy (talk | contribs) triggered filter 16, performing the action "edit" on !@$%^&*()+=. Actions taken: Disallow; Filter description: the "User:" must not be hidden on links to userspace (examine)

Changes made in edit

{{Stub}}{{WIP}}
{{Stub}}{{WIP}}
This is a language based on [[!@$%^&*()+]].
This is a language based on [[!@$%^&*()+]].<br>
Because [[User:Xyzzy|the creator of this esolang]] did not have much time (he's still in school), he only left us with a text file for us to parse.<br>
Here's the text file. ALL OF IT.


NOTES:
In addition to the stack, an artificial memory is present. This behaves like normal memory except that each cell contains a number instead of a byte.
=========
~ bitwise not
` implementation dependent
! pops and output as number on stack
@ implementation dependent
# implementation dependent
$ bitwise xor
% double top of stack
^ manipulate: pops a number, and pushes the nth item on stack to top. if n is negative, pop the previously pushed stack element
& bitwise and
* multiplication
( if top of stack is zero goto matching ). pops top of stack.
) if top of stack is nonzero goto maching (. pops top of stack.
- subtraction (2nd on stack minus 1st on stack)
_ increment
+ addition
= push 1 if top of stack is 0, 0 otherwise.
[ like ( but if nonzero
] like ) but if zero
\ exit from loop
{ push code pointer to stack
} pop and set code pointer to top of stack
| bitwise or
: pop [addr], then push value at [addr] (MEMORY)
; pop [number] then pop [addr], set [addr] to [number] (MEMORY)
*NOTE FOR : AND ;* if [addr] is out of bounds, then the program halts. DO NOT MESS UP YOUR POINTERS
" implementation dependent
' implementation dependent
< push 1 if top of stack is larger than 0, 0 otherwise.
> push 1 if top of stack is smaller than 0, 0 otherwise.
? pushes input as number onto stack
, pushes input as char onto stack
. pop and output as char
/ floored divison (2nd on stack divided by 1st on stack)
[[Category:Languages]] [[Category:2024]]
[[Category:Languages]] [[Category:2024]]

Action parameters

VariableValue
Edit count of the user (user_editcount)
214
Name of the user account (user_name)
'Xyzzy'
Age of the user account (user_age)
74257495
Page ID (page_id)
21074
Page namespace (page_namespace)
0
Page title (without namespace) (page_title)
'!@$%^&*()+='
Full page title (page_prefixedtitle)
'!@$%^&*()+='
Action (action)
'edit'
Edit summary/reason (summary)
''
Old content model (old_content_model)
'wikitext'
New content model (new_content_model)
'wikitext'
Old page wikitext, before the edit (old_wikitext)
'{{Stub}}{{WIP}} This is a language based on [[!@$%^&*()+]]. [[Category:Languages]] [[Category:2024]]'
New page wikitext, after the edit (new_wikitext)
'{{Stub}}{{WIP}} This is a language based on [[!@$%^&*()+]].<br> Because [[User:Xyzzy|the creator of this esolang]] did not have much time (he's still in school), he only left us with a text file for us to parse.<br> Here's the text file. ALL OF IT. NOTES: In addition to the stack, an artificial memory is present. This behaves like normal memory except that each cell contains a number instead of a byte. ========= ~ bitwise not ` implementation dependent ! pops and output as number on stack @ implementation dependent # implementation dependent $ bitwise xor % double top of stack ^ manipulate: pops a number, and pushes the nth item on stack to top. if n is negative, pop the previously pushed stack element & bitwise and * multiplication ( if top of stack is zero goto matching ). pops top of stack. ) if top of stack is nonzero goto maching (. pops top of stack. - subtraction (2nd on stack minus 1st on stack) _ increment + addition = push 1 if top of stack is 0, 0 otherwise. [ like ( but if nonzero ] like ) but if zero \ exit from loop { push code pointer to stack } pop and set code pointer to top of stack | bitwise or : pop [addr], then push value at [addr] (MEMORY) ; pop [number] then pop [addr], set [addr] to [number] (MEMORY) *NOTE FOR : AND ;* if [addr] is out of bounds, then the program halts. DO NOT MESS UP YOUR POINTERS " implementation dependent ' implementation dependent < push 1 if top of stack is larger than 0, 0 otherwise. > push 1 if top of stack is smaller than 0, 0 otherwise. ? pushes input as number onto stack , pushes input as char onto stack . pop and output as char / floored divison (2nd on stack divided by 1st on stack) [[Category:Languages]] [[Category:2024]]'
Unified diff of changes made by edit (edit_diff)
'@@ -1,4 +1,42 @@ {{Stub}}{{WIP}} -This is a language based on [[!@$%^&*()+]]. +This is a language based on [[!@$%^&*()+]].<br> +Because [[User:Xyzzy|the creator of this esolang]] did not have much time (he's still in school), he only left us with a text file for us to parse.<br> +Here's the text file. ALL OF IT. + NOTES: + In addition to the stack, an artificial memory is present. This behaves like normal memory except that each cell contains a number instead of a byte. + ========= + ~ bitwise not + ` implementation dependent + ! pops and output as number on stack + @ implementation dependent + # implementation dependent + $ bitwise xor + % double top of stack + ^ manipulate: pops a number, and pushes the nth item on stack to top. if n is negative, pop the previously pushed stack element + & bitwise and + * multiplication + ( if top of stack is zero goto matching ). pops top of stack. + ) if top of stack is nonzero goto maching (. pops top of stack. + - subtraction (2nd on stack minus 1st on stack) + _ increment + + addition + = push 1 if top of stack is 0, 0 otherwise. + [ like ( but if nonzero + ] like ) but if zero + \ exit from loop + { push code pointer to stack + } pop and set code pointer to top of stack + | bitwise or + : pop [addr], then push value at [addr] (MEMORY) + ; pop [number] then pop [addr], set [addr] to [number] (MEMORY) + *NOTE FOR : AND ;* if [addr] is out of bounds, then the program halts. DO NOT MESS UP YOUR POINTERS + " implementation dependent + ' implementation dependent + < push 1 if top of stack is larger than 0, 0 otherwise. + > push 1 if top of stack is smaller than 0, 0 otherwise. + ? pushes input as number onto stack + , pushes input as char onto stack + . pop and output as char + / floored divison (2nd on stack divided by 1st on stack) [[Category:Languages]] [[Category:2024]] '
New page size (new_size)
1741
Old page size (old_size)
101
Lines added in edit (added_lines)
[ 0 => 'This is a language based on [[!@$%^&*()+]].<br>', 1 => 'Because [[User:Xyzzy|the creator of this esolang]] did not have much time (he's still in school), he only left us with a text file for us to parse.<br>', 2 => 'Here's the text file. ALL OF IT.', 3 => ' NOTES:', 4 => ' In addition to the stack, an artificial memory is present. This behaves like normal memory except that each cell contains a number instead of a byte.', 5 => ' =========', 6 => ' ~ bitwise not', 7 => ' ` implementation dependent', 8 => ' ! pops and output as number on stack', 9 => ' @ implementation dependent', 10 => ' # implementation dependent', 11 => ' $ bitwise xor', 12 => ' % double top of stack', 13 => ' ^ manipulate: pops a number, and pushes the nth item on stack to top. if n is negative, pop the previously pushed stack element ', 14 => ' & bitwise and', 15 => ' * multiplication', 16 => ' ( if top of stack is zero goto matching ). pops top of stack.', 17 => ' ) if top of stack is nonzero goto maching (. pops top of stack.', 18 => ' - subtraction (2nd on stack minus 1st on stack)', 19 => ' _ increment', 20 => ' + addition', 21 => ' = push 1 if top of stack is 0, 0 otherwise.', 22 => ' [ like ( but if nonzero', 23 => ' ] like ) but if zero', 24 => ' \ exit from loop', 25 => ' { push code pointer to stack', 26 => ' } pop and set code pointer to top of stack', 27 => ' | bitwise or', 28 => ' : pop [addr], then push value at [addr] (MEMORY)', 29 => ' ; pop [number] then pop [addr], set [addr] to [number] (MEMORY)', 30 => ' *NOTE FOR : AND ;* if [addr] is out of bounds, then the program halts. DO NOT MESS UP YOUR POINTERS', 31 => ' " implementation dependent', 32 => ' ' implementation dependent', 33 => ' < push 1 if top of stack is larger than 0, 0 otherwise.', 34 => ' > push 1 if top of stack is smaller than 0, 0 otherwise.', 35 => ' ? pushes input as number onto stack', 36 => ' , pushes input as char onto stack', 37 => ' . pop and output as char', 38 => ' / floored divison (2nd on stack divided by 1st on stack)' ]
Unix timestamp of change (timestamp)
'1730899169'