提交 9a0e05a6 authored 作者: Thomas Mueller's avatar Thomas Mueller

--no commit message

--no commit message
上级 4ff133e3
...@@ -522,4 +522,4 @@ camel council merges spelled adaptive pull controller abstractions workarounds d ...@@ -522,4 +522,4 @@ camel council merges spelled adaptive pull controller abstractions workarounds d
thousands ridvan incremented slots debugging inherit agar fulvio invisible biondi hundreds occupied remap retrieved involved thousands ridvan incremented slots debugging inherit agar fulvio invisible biondi hundreds occupied remap retrieved involved
turkish fulfils iapi filesync turkish fulfils iapi filesync
compares packets destroying echo homed hosts clock countries validated catches turning staging kills distance morning performs internationalization simulator constructed nicer compares packets destroying echo homed hosts clock countries validated catches turning staging kills distance morning performs internationalization simulator constructed nicer
echo callablestatement procid homed getstart staging prices echo callablestatement procid homed getstart staging prices meantime qujd qujdra qui
\ No newline at end of file \ No newline at end of file
...@@ -34,7 +34,7 @@ public class Base64 { ...@@ -34,7 +34,7 @@ public class Base64 {
private static void check(String a, String b) { private static void check(String a, String b) {
if (!a.equals(b)) { if (!a.equals(b)) {
throw new Error("missmatch: " + a + " <> " + b); throw new Error("mismatch: " + a + " <> " + b);
} }
} }
...@@ -180,7 +180,7 @@ public class Base64 { ...@@ -180,7 +180,7 @@ public class Base64 {
byte[] bin = new byte[size]; byte[] bin = new byte[size];
int fast = size / 3 * 3, i = 0, j = 0; int fast = size / 3 * 3, i = 0, j = 0;
for (; i < fast; i += 3, j += 4) { for (; i < fast; i += 3, j += 4) {
int a = (rev[enc[j] & 255] << 18) + (rev[enc[j + 1] & 255] << 12) + int a = (rev[enc[j] & 255] << 18) + (rev[enc[j + 1] & 255] << 12) +
(rev[enc[j + 2] & 255] << 6) + rev[enc[j + 3] & 255]; (rev[enc[j + 2] & 255] << 6) + rev[enc[j + 3] & 255];
bin[i] = (byte) (a >> 16); bin[i] = (byte) (a >> 16);
bin[i + 1] = (byte) (a >> 8); bin[i + 1] = (byte) (a >> 8);
...@@ -203,7 +203,7 @@ public class Base64 { ...@@ -203,7 +203,7 @@ public class Base64 {
byte[] bin = new byte[size]; byte[] bin = new byte[size];
int fast = size / 3 * 3, i = 0, j = 0; int fast = size / 3 * 3, i = 0, j = 0;
for (; i < fast; i += 3, j += 4) { for (; i < fast; i += 3, j += 4) {
int a = (rev[enc[j] & 255] << 18) + (rev[enc[j + 1] & 255] << 12) + int a = (rev[enc[j] & 255] << 18) + (rev[enc[j + 1] & 255] << 12) +
(rev[enc[j + 2] & 255] << 6) + rev[enc[j + 3] & 255]; (rev[enc[j + 2] & 255] << 6) + rev[enc[j + 3] & 255];
bin[i] = (byte) (a >> 16); bin[i] = (byte) (a >> 16);
bin[i + 1] = (byte) (a >> 8); bin[i + 1] = (byte) (a >> 8);
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论