status-im
/
QR-Code-generator
mirror of https://github.com/status-im/QR-Code-generator.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Updated comment for multiply()/finiteFieldMultiply() in C++ and C code.

This commit is contained in:
Project Nayuki 2017-05-06 11:50:31 +00:00
parent 1a2b0065fe
commit 84dd6f4e07
2 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
c/qrcodegen.c
View File

@ -462,7 +462,8 @@ testable void calcReedSolomonRemainder(const uint8_t data[], int dataLen, const
} }
// Returns the product of the two given field elements modulo GF(2^8/0x11D). All argument values are valid. // Returns the product of the two given field elements modulo GF(2^8/0x11D).
// All inputs are valid. This could be implemented as a 256*256 lookup table.
testable uint8_t finiteFieldMultiply(uint8_t x, uint8_t y) { testable uint8_t finiteFieldMultiply(uint8_t x, uint8_t y) {
// Russian peasant multiplication // Russian peasant multiplication
uint8_t z = 0; uint8_t z = 0;

4
cpp/QrCode.hpp
View File

@ -283,8 +283,8 @@ class QrCode final {
/*-- Static function --*/ /*-- Static function --*/
// Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result // Returns the product of the two given field elements modulo GF(2^8/0x11D).
// are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8. // All inputs are valid. This could be implemented as a 256*256 lookup table.
private: static std::uint8_t multiply(std::uint8_t x, std::uint8_t y); private: static std::uint8_t multiply(std::uint8_t x, std::uint8_t y);
}; };