Abuse filter log

Details for log entry 9,716

16:19, 20 March 2026: Rainwave (talk | contribs) triggered filter 16, performing the action "edit" on .dot-hyphen. Actions taken: Disallow; Filter description: the "User:" must not be hidden on links to userspace (examine)

Changes made in edit

Action parameters

Variable	Value
Edit count of the user `(user_editcount)`	2
Name of the user account `(user_name)`	'Rainwave'
Age of the user account `(user_age)`	4739860
Page ID `(page_id)`	0
Page namespace `(page_namespace)`	0
Page title (without namespace) `(page_title)`	'.dot-hyphen'
Full page title `(page_prefixedtitle)`	'.dot-hyphen'
Action `(action)`	'edit'
Edit summary/reason `(summary)`	''
Old content model `(old_content_model)`	''
New content model `(new_content_model)`	'wikitext'
Old page wikitext, before the edit `(old_wikitext)`	''
New page wikitext, after the edit `(new_wikitext)`	''''.dot-hyphen''' is an esoteric programming language created by [[User:Rainwave]] in [[:Category:2026\|2026]]. The language came to be as a result of [[User:Rainwave\|Rainwave]] toying with the fact that <math>-(-x)=+x</math>. The language also draws some inspiration from [[Lambda-calculus\|Lambda Calculus]] for the philosophy that everything is an expression, although as you'll see, the language is inherently impure unlike most calculus-like languages. == Memory Model == '''.dot-hyphen''' operates of a single unbounded-length array consisting of unbounded-valued '''signed''' integers, all of which are initialized to <code>0</code>. The address space of the array can be negative. == Syntax and semantics == The language only has two syntax constructions, both of which are expressions: 1. <code>.x-y</code>: Can be interpreted as <code>array[x] -= y; return array[x]</code> in other languages. The order of evaluation is <code>x</code>, then <code>y</code>, then <code>.x-y</code>. 2. Non-negative integers: <code>0</code>, <code>1</code>, <code>2</code>, ... The entire program is basically a giant nested-expression made using these two constructions. The root expression is evaluated nonstop. At each evaluation, if the result of the root expression is within the ASCII range, it is outputted as an ASCII character.'
Unified diff of changes made by edit `(edit_diff)`	'@@ -1,0 +1,17 @@ +'''.dot-hyphen''' is an esoteric programming language created by [[User:Rainwave]] in [[:Category:2026\|2026]]. The language came to be as a result of [[User:Rainwave\|Rainwave]] toying with the fact that <math>-(-x)=+x</math>. The language also draws some inspiration from [[Lambda-calculus\|Lambda Calculus]] for the philosophy that everything is an expression, although as you'll see, the language is inherently impure unlike most calculus-like languages. + +== Memory Model == + +'''.dot-hyphen''' operates of a single unbounded-length array consisting of unbounded-valued '''signed''' integers, all of which are initialized to <code>0</code>. The address space of the array can be negative. + +== Syntax and semantics == + +The language only has two syntax constructions, both of which are expressions: + +1. <code>.x-y</code>: Can be interpreted as <code>array[x] -= y; return array[x]</code> in other languages. The order of evaluation is <code>x</code>, then <code>y</code>, then <code>.x-y</code>. + +2. Non-negative integers: <code>0</code>, <code>1</code>, <code>2</code>, ... + +The entire program is basically a giant nested-expression made using these two constructions. + +The root expression is evaluated nonstop. At each evaluation, if the result of the root expression is within the ASCII range, it is outputted as an ASCII character. '
New page size `(new_size)`	1335
Old page size `(old_size)`	0
Lines added in edit `(added_lines)`	[ 0 => ''''.dot-hyphen''' is an esoteric programming language created by [[User:Rainwave]] in [[:Category:2026\|2026]]. The language came to be as a result of [[User:Rainwave\|Rainwave]] toying with the fact that <math>-(-x)=+x</math>. The language also draws some inspiration from [[Lambda-calculus\|Lambda Calculus]] for the philosophy that everything is an expression, although as you'll see, the language is inherently impure unlike most calculus-like languages.', 1 => '', 2 => '== Memory Model ==', 3 => '', 4 => ''''.dot-hyphen''' operates of a single unbounded-length array consisting of unbounded-valued '''signed''' integers, all of which are initialized to <code>0</code>. The address space of the array can be negative. ', 5 => '', 6 => '== Syntax and semantics ==', 7 => '', 8 => 'The language only has two syntax constructions, both of which are expressions:', 9 => '', 10 => '1. <code>.x-y</code>: Can be interpreted as <code>array[x] -= y; return array[x]</code> in other languages. The order of evaluation is <code>x</code>, then <code>y</code>, then <code>.x-y</code>.', 11 => '', 12 => '2. Non-negative integers: <code>0</code>, <code>1</code>, <code>2</code>, ...', 13 => '', 14 => 'The entire program is basically a giant nested-expression made using these two constructions.', 15 => '', 16 => 'The root expression is evaluated nonstop. At each evaluation, if the result of the root expression is within the ASCII range, it is outputted as an ASCII character.' ]
Unix timestamp of change `(timestamp)`	'1774023576'

+'''.dot-hyphen''' is an esoteric programming language created by [[User:Rainwave]] in [[:Category:2026|2026]]. The language came to be as a result of [[User:Rainwave|Rainwave]] toying with the fact that <math>-(-x)=+x</math>. The language also draws some inspiration from [[Lambda-calculus|Lambda Calculus]] for the philosophy that everything is an expression, although as you'll see, the language is inherently impure unlike most calculus-like languages.
+== Memory Model ==
+'''.dot-hyphen''' operates of a single unbounded-length array consisting of unbounded-valued '''signed''' integers, all of which are initialized to <code>0</code>. The address space of the array can be negative.
+== Syntax and semantics ==
+The language only has two syntax constructions, both of which are expressions:
+. <code>.x-y</code>: Can be interpreted as <code>array[x] -= y; return array[x]</code> in other languages. The order of evaluation is <code>x</code>, then <code>y</code>, then <code>.x-y</code>.
+. Non-negative integers: <code>0</code>, <code>1</code>, <code>2</code>, ...
+The entire program is basically a giant nested-expression made using these two constructions.
+The root expression is evaluated nonstop. At each evaluation, if the result of the root expression is within the ASCII range, it is outputted as an ASCII character.

Abuse filter log

Changes made in edit

Action parameters

Navigation menu

Search