A COBS encoder and decoder including tests. It runs in O(n) time complexity and O(1) space complexity, making it embedded friendly. Output buffer size can be calculated in compile time using the constexpr function worstCaseEncodedLen. Documentation is provided as well as a proof for the formula in worstCaseEncodedLen. Also has a simple way of detecting and giving the user a simply way of skipping over broken frames (if optionally needed).
Why: General implementation, which could be useful else where.
Tests: Some testcases are implemented covering all errors and hopefully edgecases.
A COBS encoder and decoder including tests. It runs in O(n) time complexity and O(1) space complexity, making it embedded friendly. Output buffer size can be calculated in compile time using the constexpr function `worstCaseEncodedLen`. Documentation is provided as well as a proof for the formula in `worstCaseEncodedLen`. Also has a simple way of detecting and giving the user a simply way of skipping over broken frames (if optionally needed).
Why: General implementation, which could be useful else where.
Tests: Some testcases are implemented covering all errors and hopefully edgecases.
Blocking a user prevents them from interacting with repositories, such as opening or commenting on pull requests or issues. Learn more about blocking a user.
A COBS encoder and decoder including tests. It runs in O(n) time complexity and O(1) space complexity, making it embedded friendly. Output buffer size can be calculated in compile time using the constexpr function
worstCaseEncodedLen. Documentation is provided as well as a proof for the formula inworstCaseEncodedLen. Also has a simple way of detecting and giving the user a simply way of skipping over broken frames (if optionally needed).Why: General implementation, which could be useful else where.
Tests: Some testcases are implemented covering all errors and hopefully edgecases.