\r
Allocate memory spaces for data structures used in compression process\r
\r
-Argements:\r
+Arguments:\r
VOID\r
\r
Returns:\r
if (mMatchLen >= 4) {\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