Huffman coding: Difference between revisions

Content added Content deleted
m (→‎{{header|Haskell}}: ( restoring point-free pattern of freq ))
Line 5,828: Line 5,828:


tree=tree[0][1].pump(List,fcn(i){ // flatten rather than traverse
tree=tree[0][1].pump(List,fcn(i){ // flatten rather than traverse
if(T.isType(i))return(Void.Void,i,self.fcn); i });
if(T.isType(i))return(Void.Recurse,i,self.fcn); i });
encodeTable:=tree.toDictionary(); // symbol:Huffman code
encodeTable:=tree.toDictionary(); // symbol:Huffman code
decodeTable:=encodeTable.pump(Dictionary(),"reverse"); // code:symbol
decodeTable:=encodeTable.pump(Dictionary(),"reverse"); // code:symbol