Class Index | File Index

Classes


Class core.RawDeflate


Defined in: RawDeflate.js.

Class Summary
Constructor Attributes Constructor Name and Description
 
Field Summary
Field Attributes Field Name and Description
<inner>  
========================================================================== Send a value on a given number of bits.
Method Summary
Method Attributes Method Name and Description
<inner>  
zip_ct_tally(dist, lc)
========================================================================== Save the match info and tally the frequency counts.
<inner>  
zip_D_CODE(dist)
Mapping from a distance to a distance code.
<inner>  
zip_deflate(str, level)
<inner>  
<inner>  
<inner>  
zip_head2(i, val)
<inner>  
zip_longest_match(cur_match)
========================================================================== Set match_start to the longest match starting at the given string and return its length.
<inner>  
<inner>  
zip_pqdownheap(tree, k)
========================================================================== Restore the heap property by moving down the tree starting at node k, exchanging a node with the smallest of its two sons if necessary, stopping when the heap property is re-established (each father smaller than its two sons).
<inner>  
put_byte is used for the compressed output, put_ubyte for the uncompressed output.
<inner>  
Output a 16 bit value, lsb first
<inner>  
zip_read_buff(buff, offset, n)
========================================================================== read string data
<inner>  
<inner>  
zip_send_bits(value, length)
<inner>  
zip_SEND_CODE(c, tree)
Send a code of the given tree.
<inner>  
zip_SMALLER(tree, n, m)
========================================================================== Compares to subtrees, using the tree depth as tie breaker when the subtrees have equal frequency.
Class Detail
core.RawDeflate()
Field Detail
<inner> zip_Buf_size
========================================================================== Send a value on a given number of bits. IN assertion: length <= 16 and value fits in length bits.
Method Detail
<inner> zip_ct_tally(dist, lc)
========================================================================== Save the match info and tally the frequency counts. Return true if the current block must be flushed.
Parameters:
dist
lc

<inner> zip_D_CODE(dist)
Mapping from a distance to a distance code. dist is the distance - 1 and must not have side effects. dist_code[256] and dist_code[257] are never used.
Parameters:
dist

<inner> {!string} zip_deflate(str, level)
Parameters:
{!string} str
{!number} level
Returns:
{!string}

<inner> zip_deflate_start(level)
Parameters:
{!number} level

<inner> zip_head1(i)
Parameters:
i

<inner> zip_head2(i, val)
Parameters:
i
val

<inner> zip_longest_match(cur_match)
========================================================================== Set match_start to the longest match starting at the given string and return its length. Matches shorter or equal to prev_length are discarded, in which case the result is equal to prev_length and match_start is garbage. IN assertions: cur_match is the head of the hash chain for the current string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
Parameters:
cur_match

<inner> zip_new_queue()

<inner> zip_pqdownheap(tree, k)
========================================================================== Restore the heap property by moving down the tree starting at node k, exchanging a node with the smallest of its two sons if necessary, stopping when the heap property is re-established (each father smaller than its two sons).
Parameters:
tree
k

<inner> zip_put_byte(c)
put_byte is used for the compressed output, put_ubyte for the uncompressed output. However unlzw() uses window for its suffix table instead of its output buffer, so it does not use put_ubyte (to be cleaned up).
Parameters:
c

<inner> zip_put_short(w)
Output a 16 bit value, lsb first
Parameters:
w

<inner> zip_read_buff(buff, offset, n)
========================================================================== read string data
Parameters:
buff
offset
n

<inner> zip_reuse_queue(p)
Parameters:
{!Zip_DeflateBuffer} p

<inner> zip_send_bits(value, length)
Parameters:
value
length

<inner> zip_SEND_CODE(c, tree)
Send a code of the given tree. c and tree must not have side effects
Parameters:
c
tree

<inner> zip_SMALLER(tree, n, m)
========================================================================== Compares to subtrees, using the tree depth as tie breaker when the subtrees have equal frequency. This minimizes the worst case length.
Parameters:
tree
n
m

Documentation generated by JsDoc Toolkit 2.4.0 on Tue Jan 28 2014 15:10:23 GMT+0100 (CET)