D | katajainen.c | 106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) { in BoundaryPM() argument 123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain); in BoundaryPM() 126 if (lastcount < numsymbols && sum > leaves[lastcount].weight) { in BoundaryPM() 128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail, in BoundaryPM() 134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0); in BoundaryPM() 135 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0); in BoundaryPM() 146 NodePool* pool, const Node* leaves, int maxbits, Node* (*lists)[2]) { in InitLists() argument 150 InitNode(leaves[0].weight, 1, 0, node0); in InitLists() 151 InitNode(leaves[1].weight, 2, 0, node1); in InitLists() 163 static void ExtractBitLengths(Node* chain, Node* leaves, unsigned* bitlengths) { in ExtractBitLengths() argument [all …]
|