lib/ruby/truffle/pr-zlib/lib/pr/rbzlib.rb
# Send the header for a block using dynamic Huffman trees: the counts, the
# lengths of the bit length codes, the literal tree and the distance tree.
# IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
Send the header for a block using dynamic Huffman trees: the counts, the
lengths of the bit length codes, the literal tree and the distance tree.
IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
Send the header for a block using dynamic Huffman trees : the counts the lengths of the bit length codes the literal tree and the distance tree . IN assertion : lcodes > = 257 dcodes > = 1 blcodes > = 4 .
def send_all_trees(s,lcodes,dcodes,blcodes)
    send_bits(s, lcodes-257, 5)
    send_bits(s, dcodes-1,   5)
    send_bits(s, blcodes-4,  4)
    for rank in 0 ... blcodes
      send_bits(s, s.bl_tree[@@bl_order[rank]].dl, 3)
    end
    send_tree(s, s.dyn_ltree, lcodes-1)
    send_tree(s, s.dyn_dtree, dcodes-1)
  end
def send_all_trees ( s , lcodes , dcodes , blcodes ) send_bits ( s , lcodes - 257 , 5 ) send_bits ( s , dcodes - 1 , 5 ) send_bits ( s , blcodes - 4 , 4 ) for rank in 0 ... blcodes send_bits ( s , s . bl_tree [ @@bl_order [ rank ] ] . dl , 3 ) end send_tree ( s , s . dyn_ltree , lcodes - 1 ) send_tree ( s , s . dyn_dtree , dcodes - 1 ) end
Send the header for a block using dynamic Huffman trees: the counts, the
lengths of the bit length codes, the literal tree and the distance tree.
Send the header for a block using dynamic Huffman trees : the counts the lengths of the bit length codes the literal tree and the distance tree .
s
<not_specific>
lcodes
<not_specific>
dcodes
<not_specific>
blcodes
<not_specific>