Lines Matching full:decoded
138 digesting the original (decoded) data as input, and a seed of zero.
295 in which case the frame may or may not need a dictionary to be decoded,
419 - Previous decoded data, up to a distance of `Window_Size`,
434 They can be decoded first, and then copied during [Sequence Execution],
435 or they can be decoded on the flow during [Sequence Execution].
543 to generate the decoded literals.
587 Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
599 When all _sequences_ are decoded,
689 The literals length is equal to the decoded `Baseline` plus
718 The match length is equal to the decoded `Baseline` plus
795 decoded previously from their normalized distribution.
805 After decoding the starting states, a single sequence is decoded
807 These sequences are decoded in order from first to last.
876 Once literals and sequences have been decoded,
877 they are combined to produce the decoded content of a block.
880 decoded as described in the [Sequences Section](#sequences-section).
882 from the decoded literals to the output.
884 Then `match_length` bytes are copied from previous decoded data.
893 Note that all offsets leading to previously decoded data
1064 - Value decoded : small values use 1 less bit :
1073 | Value read | Value decoded | Number of bits used |
1082 Probability is obtained from Value decoded by following formula :
1116 Each cell describes the symbol decoded,
1141 Each cell corresponds to a state value, which contains the symbol being decoded.
1228 The last symbol's `Weight` is deduced from previously decoded ones,
1323 symbols for each of the final states are decoded and the process is complete.
1338 Let's presume the following list of weights has been decoded :
1451 As long as the amount of data decoded from this frame is less than or
1453 than the total length of decoded output so far to reference back to the