moparisthebest/rswiki-book
1
0
Fork 0
mirror of https://github.com/moparisthebest/rswiki-book synced 2024-11-22 09:02:16 -05:00
Code Issues Releases Wiki Activity

Update MediaWiki page '135 Protocol'

Browse Source
This commit is contained in:
S 2012-12-26 02:32:21 +00:00 committed by moparisthebest
parent 645135bc7f
commit 61a27ed82b
1 changed files with 20 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
135-Protocol.mediawiki
View File

@ -115,8 +115,8 @@ public static String decode_37(long l) {
Chat messages are encoded and decoded with the following methods: Chat messages are encoded and decoded with the following methods:
<pre>public static byte msgdata[] = new byte[100]; <pre>public static byte encodedmsg[] = new byte[100];
public static char msgchars[] = new char[100]; public static char decodedmsg[] = new char[100];
private static char charmap[] = { private static char charmap[] = {
' ', 'e', 't', 'a', 'o', 'i', 'h', 'n', 's', 'r', 'd', 'l', 'u', 'm', 'w', 'c', 'y', 'f', ' ', 'e', 't', 'a', 'o', 'i', 'h', 'n', 's', 'r', 'd', 'l', 'u', 'm', 'w', 'c', 'y', 'f',
'g', 'p', 'b', 'v', 'k', 'x', 'j', 'q', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', 'g', 'p', 'b', 'v', 'k', 'x', 'j', 'q', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8',
@ -124,58 +124,58 @@ private static char charmap[] = {
'=', '\243', '$', '%', '"', '[', ']' '=', '\243', '$', '%', '"', '[', ']'
}; };
public static String dec_msg(byte buffer[], int off, int len) { public static String decode_msg(byte buffer[], int off, int enclen) {
try { try {
int i = 0; int i = 0;
int j = -1; int j = -1;
for (int k = 0; k < len; k++) { for (int k = 0; k < enclen; k++) {
int l = buffer[off++] & 0xff; int l = buffer[off++] & 0xff;
int i1 = l >> 4 & 0xf; int i1 = l >> 4 & 0xf;
if (j == -1) { if (j == -1) {
if (i1 < 13) if (i1 < 13)
msgchars[i++] = charmap[i1]; decodedmsg[i++] = charmap[i1];
else else
j = i1; j = i1;
} else { } else {
msgchars[i++] = charmap[((j << 4) + i1) - 195]; decodedmsg[i++] = charmap[((j << 4) + i1) - 195];
j = -1; j = -1;
} }
i1 = l & 0xf; i1 = l & 0xf;
if (j == -1) { if (j == -1) {
if (i1 < 13) if (i1 < 13)
msgchars[i++] = charmap[i1]; decodedmsg[i++] = charmap[i1];
else else
j = i1; j = i1;
} else { } else {
msgchars[i++] = charmap[((j << 4) + i1) - 195]; decodedmsg[i++] = charmap[((j << 4) + i1) - 195];
j = -1; j = -1;
} }
} }
boolean flag = true; boolean flag = true;
for (int j1 = 0; j1 < i; j1++) { for (int j1 = 0; j1 < i; j1++) {
char c = msgchars[j1]; char c = decodedmsg[j1];
if (j1 > 4 && c == '@') if (j1 > 4 && c == '@')
msgchars[j1] = ' '; decodedmsg[j1] = ' ';
if (c == '%') if (c == '%')
msgchars[j1] = ' '; decodedmsg[j1] = ' ';
if (flag && c >= 'a' && c <= 'z') { if (flag && c >= 'a' && c <= 'z') {
msgchars[j1] += '\uFFE0'; decodedmsg[j1] += '\uFFE0';
flag = false; flag = false;
} }
if (c == '.' || c == '!') if (c == '.' || c == '!')
flag = true; flag = true;
} }
return new String(msgchars, 0, i); return new String(decodedmsg, 0, i);
} catch (Exception ex) { } catch (Exception ex) {
return "Cabbage"; return "Cabbage";
} }
} }
public static int enc_msg(String str) { public static int encode_msg(String str) {
if (str.length() > 80) if (str.length() > 80)
str = str.substring(0, 80); str = str.substring(0, 80);
str = str.toLowerCase(); str = str.toLowerCase();
int len = 0; int enclen = 0;
int i = -1; int i = -1;
for (int j = 0; j < str.length(); j++) { for (int j = 0; j < str.length(); j++) {
char c = str.charAt(j); char c = str.charAt(j);
@ -192,18 +192,18 @@ public static int enc_msg(String str) {
if (k < 13) if (k < 13)
i = k; i = k;
else else
msgdata[len++] = (byte) k; encodedmsg[enclen++] = (byte) k;
} else if (k < 13) { } else if (k < 13) {
msgdata[len++] = (byte) ((i << 4) + k); encodedmsg[enclen++] = (byte) ((i << 4) + k);
i = -1; i = -1;
} else { } else {
msgdata[len++] = (byte) ((i << 4) + (k >> 4)); encodedmsg[enclen++] = (byte) ((i << 4) + (k >> 4));
i = k & 0xf; i = k & 0xf;
} }
} }
if (i != -1) if (i != -1)
msgdata[len++] = (byte) (i << 4); encodedmsg[enclen++] = (byte) (i << 4);
return len; return enclen;
}</pre> }</pre>
== '''Login''' == == '''Login''' ==