|
|
|
|
|
|
by lifthrasiir
638 days ago
|
|
|
The lookup table here would be indexed by a fixed number of lookahead bits, so it for example would duplicate shorter codes and put longer codes into side tables. So a tree structure, either represented as an array or a pointer-chasing structure would be much simpler. |
|
|