Explore >> Select a destination


You are here

michaelscodingspot.com
| | blog.tdwright.co.uk
71.4 parsecs away

Travel
| | This year marks 15 years since FizzBuzz was popularised as an interview tool for developers. Im a big fan and have watched over 100 candidates try their hand at my version of the task. In to
| | deniskyashif.com
100.0 parsecs away

Travel
| | How to implement an assembly line concurrency model in .NET using channels.
| | druss.co
83.3 parsecs away

Travel
| | C# 6.0 become more asynchronous-friendly than before. Finally, you can use await keyword in catch and finally blocks
| | www.bazhenov.me
217.0 parsecs away

Travel
| Introduction Link to heading Varint is a widely recognized technique used for compressing integer streams. Essentially, it suggests that it can be more efficient to encode a number using a variable-length representation instead of a fixed-size binary representation. By removing leading zeros from the binary number, the overall representation size can be reduced. This technique works particularly well for encoding smaller numbers. In this article, I provide a brief introduction and rationale for varint encoding. Additionally, I describe the Stream VByte format, which enables fully vectorized decoding through SSSE3 instructions. I also share my findings from implementing this algorithm in Rust, which includes both encoding and decoding primitives and the ability to read data from both RAM and disk.