Lines Matching refs:decoded

130 digesting the original (decoded) data as input, and a seed of zero.
392 - Previous decoded data, up to a distance of `Window_Size`,
393   or all previously decoded data when `Single_Segment_flag` is set.
401 They can be decoded first, and then copied during [Sequence Execution],
402 or they can be decoded on the flow during [Sequence Execution].
505 to generate the decoded literals.
543 Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
555 When all _sequences_ are decoded,
639 The literals length is equal to the decoded `Baseline` plus
668 The match length is equal to the decoded `Baseline` plus
744 decoded previously from their normalized distribution.
754 After decoding the starting states, a single sequence is decoded
756 These sequences are decoded in order from first to last.
825 Once literals and sequences have been decoded,
826 they are combined to produce the decoded content of a block.
829 decoded as described in the [Sequences Section](#sequences-section).
833 Then `match_length` bytes are copied from previous decoded data.
842 Note that all offsets leading to previously decoded data
965 - Value decoded : small values use 1 less bit :
974   | Value read | Value decoded | Number of bits used |
983 Probability is obtained from Value decoded by following formula :
1017 Each cell describes the symbol decoded,
1124 The last symbol's `Weight` is deduced from previously decoded ones,
1208 the symbols for each of the final states are decoded and the process is complete.
1222 Let's presume the following list of weights has been decoded :
1330               As long as the amount of data decoded from this frame is less than or
1332               than the total length of decoded output so far to reference back to the