easyhuff.pas 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256
  1. Uses Buffered;
  2. Type
  3. PTree = ^TTree;
  4. TTree = record
  5. info : byte;
  6. ti : longint;
  7. Left : PTree;
  8. Right: PTree;
  9. end;
  10. ps = ^el;
  11. el = record
  12. data : PTree;
  13. prev : ps;
  14. end;
  15. CONST
  16. fname : string[13] = 'input.txt';
  17. fout : string[13] = 'input.huf';
  18. VAR
  19. counts : array [0..255] of longint;
  20. table : array [0..255] of longint;
  21. tbllens : array [0..255] of byte;
  22. INP,OUT : FILE;
  23. Nums : ps;
  24. THead : PTree;
  25. {-----}
  26. Code : longint;
  27. CodeLen : byte;
  28. {-----}
  29. GO,GNum : byte;
  30. done : boolean;
  31. Size,Csize : longint;
  32. {---------------------------------}
  33. Procedure DelBranch(br:PTree);
  34. begin
  35. if br^.left <> nil then DelBranch(br^.left);
  36. if br^.right <> nil then DelBranch(br^.right);
  37. Dispose(br);
  38. end;{DelBranch}
  39. {---------------------------------}
  40. Procedure SetTimes(var F:File);
  41. var
  42. curpos,rsize : word;
  43. ch : byte;
  44. begin
  45. FillChar(counts,256,0);
  46. CurPos := FilePos(F);
  47. Seek(F,0);
  48. RBFirst:=true;
  49. RBLast:=false;
  50. while FreadBuf(F,ch) do inc(counts[ch]);
  51. RBLast:=true;
  52. FReadBuf(F,ch);
  53. Seek(F,CurPos);
  54. end;{SetTimes}
  55. {---------------------------------}
  56. Procedure AddItem(var HEAD:ps; VAL : PTree);
  57. var
  58. c,NEWs : ps;
  59. Begin
  60. c := HEAD;
  61. New(News);
  62. News^.data := VAL;
  63. News^.prev := nil;
  64. if c=nil then
  65. begin
  66. HEAD := NEWs;
  67. exit
  68. end;
  69. if val^.ti <= C^.DATA^.ti then
  70. begin
  71. News^.prev:=C;
  72. HEAD:=News;
  73. exit
  74. end;
  75. while (c^.prev <> nil) and
  76. (not ((val^.ti>C^.data^.ti) and
  77. (val^.ti<=C^.prev^.data^.ti))) do c:=c^.prev;
  78. News^.prev := c^.prev;
  79. C^.prev := News;
  80. end;{AddItem}
  81. {---------------------------------}
  82. Procedure RemoveItem(var HEAD:ps; VAL : PTree);
  83. var
  84. c,cur : ps;
  85. Begin
  86. c := HEAD;
  87. if c=nil then exit;
  88. if c^.data = val then
  89. begin
  90. HEAD:=C^.prev;
  91. Dispose(C);
  92. exit
  93. end;
  94. while (c^.prev <> nil) and (C^.prev^.data <> val) do c:=c^.prev;
  95. if c^.prev^.data <> val then exit;
  96. cur := c^.prev;
  97. C^.prev := cur^.prev;
  98. Dispose(cur);
  99. end;{RemoveItem}
  100. {---------------------------------}
  101. Procedure DeleteAll(var HEAD:ps);
  102. var
  103. c:ps;
  104. begin
  105. while HEAD <> nil do
  106. begin
  107. c:=HEAD^.prev;
  108. Dispose(HEAD);
  109. HEAD := C;
  110. end;
  111. end;{DeleteAll}
  112. {---------------------------------}
  113. Procedure CreateTree;
  114. var
  115. i : byte;
  116. News : PTree;
  117. begin
  118. for i := 0 to 255 do
  119. if counts[i] <> 0 then
  120. begin
  121. New(News);
  122. News^.info:=i;
  123. News^.ti:=counts[i];
  124. News^.Left:=nil;News^.Right:=nil;
  125. AddItem(Nums,News);
  126. end;
  127. while NUMS^.prev <> nil do
  128. begin
  129. New(News);
  130. News^.ti := NUMS^.data^.ti+NUMS^.prev^.data^.ti;
  131. News^.left := Nums^.data;
  132. News^.right := Nums^.prev^.data;
  133. RemoveItem(NUMS,NUMS^.data);
  134. RemoveItem(NUMS,NUMS^.data);
  135. AddItem(NUMS,News);
  136. end;
  137. THead := News;
  138. RemoveItem(NUMS,News);
  139. end;{CreateTree}
  140. {---------------------------------}
  141. Procedure GetCode(VAL:Byte;BRA:PTree;cur:longint;len:byte);
  142. begin
  143. if (Bra^.left=nil) and (Bra^.right=nil) and (BRA^.info = VAL) then
  144. begin
  145. Code := cur;
  146. CodeLen:=len;
  147. end;
  148. if (Bra^.left<>nil) then begin
  149. GetCode(val,Bra^.left,(cur shl 1) + 1,len+1);
  150. GetCode(val,Bra^.right,(cur shl 1),len+1)
  151. end;
  152. end;{GetCode}
  153. {---------------------------------}
  154. Procedure SetTable;
  155. var i : byte;
  156. begin
  157. for i := 0 to 255 do
  158. if counts[i] <> 0 then
  159. begin
  160. GetCode(i,THead,0,0);
  161. table[i] := Code;
  162. tbllens[i] := codelen;
  163. end;
  164. end;{SetTable}
  165. {---------------------------------}
  166. Procedure PutTimes(var F:file);
  167. begin BlockWrite(F,counts,256*4) end;{GetTimes}
  168. {---------------------------------}
  169. Procedure IfNeedWrite(var gg:longint;var num:byte;var F:FILE);
  170. var
  171. FFF : byte;
  172. begin
  173. while num >= 8 do
  174. begin
  175. FWriteBuf(F,((gg shl (32-num)) and $FF000000) shr 24);
  176. dec(num,8);
  177. end;
  178. end;{IfNeedWrite}
  179. {---------------------------------}
  180. VAR
  181. CURCODE : longint;
  182. curlen : byte;
  183. CUR : byte;
  184. i : byte;
  185. Ctr : Ptree;
  186. BEGIN
  187. if (ParamCount<1) then
  188. begin
  189. WriteLn('Usage: HUF.exe <FILENAME.EXT> [OUTNAME.ext]');
  190. Halt(10);
  191. end;
  192. Fname := ParamStr(1);
  193. for size := 1 to Length(Fname) do
  194. fname[size] := UpCase(fname[size]);
  195. if Paramcount = 2 then fout := ParamStr(2)
  196. else fout := Copy(Fname,1,pos('.',Fname)) + 'HUF';
  197. Assign(INP,Fname);
  198. Reset(INP,1);
  199. { Size:=FileSize(INP);}
  200. SetTimes(INP);
  201. CreateTree;
  202. SetTable;
  203. DelBranch(THead);
  204. Assign(OUT,Fout);
  205. Rewrite(OUT,1);
  206. PutTimes(OUT);
  207. curcode:=0;
  208. curlen:=0;
  209. RBFirst:=true;
  210. RBLast:=false;
  211. WBFirst:=true;
  212. WBLast:=false;
  213. while FreadBuf(inp,cur) do
  214. begin
  215. if ((curlen mod 8) + tbllens[cur])< 32 then
  216. begin
  217. if (curlen+tbllens[cur]) > 32 then ifNeedWrite(curcode,curlen,OUT);
  218. curcode := (curcode shl tbllens[cur]) + table[cur];
  219. inc(curlen,tbllens[cur]);
  220. end
  221. else
  222. begin
  223. for i := 1 to tbllens[cur] do
  224. begin
  225. if curlen >= 8 then IfNeedWrite(curcode,curlen,OUT);
  226. curcode := (curcode shl 1) +
  227. ((table[cur] shr (tbllens[cur]-i)) and 1);
  228. inc(curlen);
  229. end;
  230. end;
  231. end;
  232. if (curlen mod 8) <> 0 then
  233. begin
  234. cur := 8-(curlen mod 8);
  235. curcode := curcode shl (cur);
  236. inc(curlen,cur);
  237. end;
  238. ifNeedWrite(curcode,curlen,OUT);
  239. FWriteBuf(OUT,cur);
  240. RBLast:=true;
  241. FReadBuf(INP,cur);
  242. WBLast:=true;
  243. FWriteBuf(OUT,0);
  244. Close(OUT);
  245. Close(INP);
  246. END.