Explore >> Select a destination
|
You are here 
|
www.thanassis.space | ||
| | | | |
tia.mat.br
|
|
| | | | | [AI summary] The blog post discusses the implementation of a Huffman decoder for HTTP/2's HPACK compression, focusing on efficiently decoding variable-length codes. It describes the use of multiple tables to handle different code lengths, the process of reading and parsing the Huffman table from an RFC document, and generating C code for the decoder. The author also outlines the structure of the decoder, including handling of different code lengths, table chaining, and the use of bit manipulation techniques. The post highlights the challenges and considerations in implementing the decoder, such as memory management, performance optimization, and code generation. The author acknowledges the need for further testing and refinement before the decoder can be use... | |
| | | | |
blog.spiraldb.com
|
|
| | | | | Random access string compression with FSST and Rust | |
| | | | |
www.euccas.me
|
|
| | | | | ||
| | | | |
blog.nuculabs.de
|
|
| | | Introduction A linked list is a fundamental data structure which consists of Nodes that are connected to each other. Other variations are: Double linked list Circular linked list (circular buffer) The Singly Linked List To visualize the data structure, if you want to store two integers 10 and 20 you will have a 2 node linked list that will have: [Node 1, Value 10] -> [Node 2, Value: 20] -> [null] | ||
