Examine individual changes
This page allows you to examine the variables generated by the Abuse Filter for an individual change.
Variables generated for this change
| Variable | Value |
|---|---|
Edit count of the user (user_editcount) | 1 |
Name of the user account (user_name) | 'Ello' |
Age of the user account (user_age) | 7390 |
Page ID (page_id) | 0 |
Page namespace (page_namespace) | 0 |
Page title (without namespace) (page_title) | 'Lime Squeezer' |
Full page title (page_prefixedtitle) | 'Lime Squeezer' |
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) | 'Lime Squeezer is an esoteric programming language created by [[User:Ello|Ello]]
==Basic Syntax==
Lime Squeezer uses 8-bit op-codes, has 2 8-bit stacks(both have a 16 kilobyte limit) and is run from bottom up, also, any operands, are written below(or in this case: above) the operations, for example:
opcode
operand1
there are no existing operations that take more than 1 operand
==Op-Codes==
00000000 | No Operation
00000001 | Puts the value on the next line on the first stack
00000011 | Puts the value on the next line on the second stack
00000010 | Puts the last value on the first stack on the second stack
00000110 | Puts the last value on the second stack on the first stack
00000101 | Adds the last values of the two stacks, removes the two values, and puts the the result on the first stack
00000111 | Adds the last values of the two stacks, removes the two values, and puts the the result on the second stack
00001000 | Squeezes the last value of the first stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the second stack (example: 00001000 >>> 00000001)
00001001 | Squeezes the last value of the second stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the first stack
00001011 | Outputs the last value of the first stack as a ascii symbol
00001010 | Outputs the last value of the second stack as an ascii symbol
00001110 | Deletes the last value of the first stack
00001111 | Deletes the last value of the second stack
00010000 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the first stack
00010001 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the second stack
00010011 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the first stack
00010010 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the second stack
==Examples:"Hello World!"==
The following code should print Hello World! to the console
00000001
01001000
00000001
01100101
00000001
01101100
00000001
01101100
00000001
01101111
00000001
00100000
00000001
01010111
00000001
01101111
00000001
01110010
00000001
01101100
00000001
01100100
00000001
00100001
00001011
00001011
00001011
00001011
00001011
00001011
00001011
00001011
00001011
00001011
00001011
00001011
==Implementation==
There is NO original implementation for Lime Squeezer, but, you party ppl are welcome to make one! :D
[[Category:Languages]] [[Category:Output_only]]' |
Unified diff of changes made by edit (edit_diff) | '@@ -1,0 +1,74 @@
+Lime Squeezer is an esoteric programming language created by [[User:Ello|Ello]]
+
+==Basic Syntax==
+
+Lime Squeezer uses 8-bit op-codes, has 2 8-bit stacks(both have a 16 kilobyte limit) and is run from bottom up, also, any operands, are written below(or in this case: above) the operations, for example:
+ opcode
+ operand1
+there are no existing operations that take more than 1 operand
+
+==Op-Codes==
+
+ 00000000 | No Operation
+ 00000001 | Puts the value on the next line on the first stack
+ 00000011 | Puts the value on the next line on the second stack
+ 00000010 | Puts the last value on the first stack on the second stack
+ 00000110 | Puts the last value on the second stack on the first stack
+ 00000101 | Adds the last values of the two stacks, removes the two values, and puts the the result on the first stack
+ 00000111 | Adds the last values of the two stacks, removes the two values, and puts the the result on the second stack
+ 00001000 | Squeezes the last value of the first stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the second stack (example: 00001000 >>> 00000001)
+ 00001001 | Squeezes the last value of the second stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the first stack
+ 00001011 | Outputs the last value of the first stack as a ascii symbol
+ 00001010 | Outputs the last value of the second stack as an ascii symbol
+ 00001110 | Deletes the last value of the first stack
+ 00001111 | Deletes the last value of the second stack
+ 00010000 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the first stack
+ 00010001 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the second stack
+ 00010011 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the first stack
+ 00010010 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the second stack
+
+==Examples:"Hello World!"==
+
+The following code should print Hello World! to the console
+ 00000001
+ 01001000
+ 00000001
+ 01100101
+ 00000001
+ 01101100
+ 00000001
+ 01101100
+ 00000001
+ 01101111
+ 00000001
+ 00100000
+ 00000001
+ 01010111
+ 00000001
+ 01101111
+ 00000001
+ 01110010
+ 00000001
+ 01101100
+ 00000001
+ 01100100
+ 00000001
+ 00100001
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+ 00001011
+
+==Implementation==
+
+There is NO original implementation for Lime Squeezer, but, you party ppl are welcome to make one! :D
+
+[[Category:Languages]] [[Category:Output_only]]
' |
New page size (new_size) | 2750 |
Old page size (old_size) | 0 |
Lines added in edit (added_lines) | [
0 => 'Lime Squeezer is an esoteric programming language created by [[User:Ello|Ello]]',
1 => '',
2 => '==Basic Syntax==',
3 => '',
4 => 'Lime Squeezer uses 8-bit op-codes, has 2 8-bit stacks(both have a 16 kilobyte limit) and is run from bottom up, also, any operands, are written below(or in this case: above) the operations, for example:',
5 => ' opcode',
6 => ' operand1',
7 => 'there are no existing operations that take more than 1 operand',
8 => '',
9 => '==Op-Codes==',
10 => '',
11 => ' 00000000 | No Operation',
12 => ' 00000001 | Puts the value on the next line on the first stack',
13 => ' 00000011 | Puts the value on the next line on the second stack',
14 => ' 00000010 | Puts the last value on the first stack on the second stack',
15 => ' 00000110 | Puts the last value on the second stack on the first stack',
16 => ' 00000101 | Adds the last values of the two stacks, removes the two values, and puts the the result on the first stack',
17 => ' 00000111 | Adds the last values of the two stacks, removes the two values, and puts the the result on the second stack',
18 => ' 00001000 | Squeezes the last value of the first stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the second stack (example: 00001000 >>> 00000001)',
19 => ' 00001001 | Squeezes the last value of the second stack, which means removing every zero, and then adding and equivalent of zeros at the left side of the value, and then puts the result on the first stack',
20 => ' 00001011 | Outputs the last value of the first stack as a ascii symbol',
21 => ' 00001010 | Outputs the last value of the second stack as an ascii symbol',
22 => ' 00001110 | Deletes the last value of the first stack',
23 => ' 00001111 | Deletes the last value of the second stack',
24 => ' 00010000 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the first stack',
25 => ' 00010001 | Subtracts the last values of the two stacks, removes the two values, and puts the the result on the second stack',
26 => ' 00010011 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the first stack',
27 => ' 00010010 | Multiplies the last values of the two stacks, removes the two values, and puts the the result on the second stack',
28 => '',
29 => '==Examples:"Hello World!"==',
30 => '',
31 => 'The following code should print Hello World! to the console',
32 => ' 00000001',
33 => ' 01001000',
34 => ' 00000001',
35 => ' 01100101',
36 => ' 00000001',
37 => ' 01101100',
38 => ' 00000001',
39 => ' 01101100',
40 => ' 00000001',
41 => ' 01101111',
42 => ' 00000001',
43 => ' 00100000',
44 => ' 00000001',
45 => ' 01010111',
46 => ' 00000001',
47 => ' 01101111',
48 => ' 00000001',
49 => ' 01110010',
50 => ' 00000001',
51 => ' 01101100',
52 => ' 00000001',
53 => ' 01100100',
54 => ' 00000001',
55 => ' 00100001',
56 => ' 00001011',
57 => ' 00001011',
58 => ' 00001011',
59 => ' 00001011',
60 => ' 00001011',
61 => ' 00001011',
62 => ' 00001011',
63 => ' 00001011',
64 => ' 00001011',
65 => ' 00001011',
66 => ' 00001011',
67 => ' 00001011',
68 => '',
69 => '==Implementation==',
70 => '',
71 => 'There is NO original implementation for Lime Squeezer, but, you party ppl are welcome to make one! :D',
72 => '',
73 => '[[Category:Languages]] [[Category:Output_only]]'
] |
Unix timestamp of change (timestamp) | '1754677772' |