Lines Matching full:distance

81           3.2.5. Compressed blocks (length and distance codes) ...... 11
206    pair <length, backward distance>.  The representation used in the
522          Huffman codes for the literal/length and distance alphabets are
547                            decode distance from input stream
549                            move backwards distance bytes in the output
556          in a previous block; i.e., the backward distance may cross one
557          or more block boundaries.  However a distance cannot refer past
568          distance can refer to that part of the output stream anyway)
571          X and Y, a string reference with <length = 5, distance = 2>
589       3.2.5. Compressed blocks (length and distance codes)
594          byte values (0..255), or <length, backward distance> pairs,
595          where the length is drawn from (3..258) and the distance is
642              Code Bits Dist  Code Bits   Dist     Code Bits Distance
685          Distance codes 0-31 are represented by (fixed-length) 5-bit
687          shown in Paragraph 3.2.5, above.  Note that distance codes 30-
695          distance code.  Each code is defined by a sequence of code
714          the literal/length or distance alphabet will not occur in the
716          construction algorithm given earlier.  If only one distance
719          code.  One distance code of zero bits means that there are no
720          distance codes used at all (the data is all literals).
725                5 Bits: HDIST, # of Distance codes - 1        (1 - 32)
741                   corresponding symbol (literal/length or distance code
747                HDIST + 1 code lengths for the distance alphabet,
751                   encoded using the literal/length and distance Huffman