\r
Allocate memory spaces for data structures used in compression process\r
\r
-Argements: (VOID)\r
+Arguments: (VOID)\r
\r
Returns:\r
\r
\r
//\r
// We have just got a long match, the target tree\r
- // can be located by MatchPos + 1. Travese the tree\r
+ // can be located by MatchPos + 1. Traverse the tree\r
// from bottom up to get to a proper starting point.\r
// The usage of PERC_FLAG ensures proper node deletion\r
// in DeleteNode() later.\r
\r
Outputs rightmost n bits of x\r
\r
-Argments:\r
+Arguments:\r
\r
n - the rightmost n bits of the data is used\r
x - the data\r