Apple-2-Tools/dmolony-DiskBrowser
1
0
Fork 0
mirror of https://github.com/dmolony/DiskBrowser.git synced 2024-11-29 11:49:29 +00:00
Code Issues Projects Releases Wiki Activity

tidying

Browse Source
This commit is contained in:
Denis Molony 2016-08-16 19:04:17 +10:00
parent 0e852d2a77
commit 9ee9e0904a
1 changed files with 17 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/com/bytezone/diskbrowser/wizardry/Huffman.java
View File

@ -6,9 +6,9 @@ public class Huffman
private final byte[] left; private final byte[] left;
private final byte[] right; private final byte[] right;
private int bit = 0; private int bitNo = 0;
private int msgPtr = 0; private int msgPtr = 0;
private int b = 0; private int currentByte = 0;
private byte[] message; private byte[] message;
public Huffman (byte[] buffer) public Huffman (byte[] buffer)
@ -25,9 +25,9 @@ public class Huffman
public String getMessage (byte[] message) public String getMessage (byte[] message)
{ {
this.message = message; this.message = message;
bit = 0; bitNo = 0;
msgPtr = 0; msgPtr = 0;
b = 0; currentByte = 0;
int len = getChar (); int len = getChar ();
StringBuilder text = new StringBuilder (); StringBuilder text = new StringBuilder ();
@ -42,27 +42,27 @@ public class Huffman
while (true) while (true)
{ {
if (bit == 0) if (bitNo == 0)
{ {
bit = 8; bitNo = 8;
b = message[msgPtr++] & 0xFF; currentByte = message[msgPtr++] & 0xFF;
} }
int thisBit = b % 2; int currentBit = currentByte % 2;
b /= 2; currentByte /= 2;
bit--; bitNo--;
if (thisBit == 0) // take right path if (currentBit == 0) // take right path
{ {
if ((tree[treePtr] & 0x02) != 0) // if has right leaf if ((tree[treePtr] & 0x02) != 0) // if has right leaf...
return right[treePtr]; return right[treePtr]; // return that character
treePtr = right[treePtr] & 0xFF; // go to right node treePtr = right[treePtr] & 0xFF; // else go to right node
} }
else // take left path else // take left path
{ {
if ((tree[treePtr] & 0x01) != 0) // if has left leaf if ((tree[treePtr] & 0x01) != 0) // if has left leaf...
return left[treePtr]; return left[treePtr]; // return that character
treePtr = left[treePtr] & 0xFF; // go to left node treePtr = left[treePtr] & 0xFF; // else go to left node
} }
} }
} }