namespace BinaryObjectScanner.Models.Compression.LZX { /// /// An aligned offset block is identical to the verbatim block except for the presence of the aligned offset /// tree preceding the other trees. /// /// public class AlignedOffsetBlock { /// /// Generic block header /// public BlockHeader Header; /// /// Aligned offset tree /// /// 8 elements, 3 bits each public byte[] AlignedOffsetTree; /// /// Pretree for first 256 elements of main tree /// /// 20 elements, 4 bits each public byte[] PretreeFirst256; /// /// Path lengths of first 256 elements of main tree /// /// Encoded using pretree public int[] PathLengthsFirst256; /// /// Pretree for remainder of main tree /// /// 20 elements, 4 bits each public byte[] PretreeRemainder; /// /// Path lengths of remaining elements of main tree /// /// Encoded using pretree public int[] PathLengthsRemainder; /// /// Pretree for length tree /// /// 20 elements, 4 bits each public byte[] PretreeLengthTree; /// /// Path lengths of elements in length tree /// /// Encoded using pretree public int[] PathLengthsLengthTree; // Entry Comments Size // --------------------------------------------------------------------------------------- // Token sequence (matches and literals) Specified in section 2.6 Variable } }