Home
last modified time | relevance | path

Searched refs:reedSolomonMultiply (Results 1 – 12 of 12) sorted by relevance

/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/QR/java/src/main/java/io/nayuki/qrcodegen/
H A DQrCode.java743 result[j] = (byte)reedSolomonMultiply(result[j] & 0xFF, root); in reedSolomonComputeDivisor()
747 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
763 result[i] ^= reedSolomonMultiply(divisor[i] & 0xFF, factor); in reedSolomonComputeRemainder()
771 private static int reedSolomonMultiply(int x, int y) { in reedSolomonMultiply() method in QrCode
/dports/graphics/qr-code-generator/QR-Code-generator-67c6246/java/src/main/java/io/nayuki/qrcodegen/
H A DQrCode.java743 result[j] = (byte)reedSolomonMultiply(result[j] & 0xFF, root); in reedSolomonComputeDivisor()
747 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
763 result[i] ^= reedSolomonMultiply(divisor[i] & 0xFF, factor); in reedSolomonComputeRemainder()
771 private static int reedSolomonMultiply(int x, int y) { in reedSolomonMultiply() method in QrCode
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/QR/cpp/
H A DQrCode.cpp562 result.at(j) = reedSolomonMultiply(result.at(j), root); in reedSolomonComputeDivisor()
566 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
579 result.at(i) ^= reedSolomonMultiply(divisor.at(i), factor); in reedSolomonComputeRemainder()
585 uint8_t QrCode::reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function in qrcodegen::QrCode
H A DQrCode.hpp288 private: static std::uint8_t reedSolomonMultiply(std::uint8_t x, std::uint8_t y);
/dports/graphics/qr-code-generator/QR-Code-generator-67c6246/cpp/
H A DQrCode.cpp562 result.at(j) = reedSolomonMultiply(result.at(j), root); in reedSolomonComputeDivisor()
566 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
579 result.at(i) ^= reedSolomonMultiply(divisor.at(i), factor); in reedSolomonComputeRemainder()
585 uint8_t QrCode::reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function in qrcodegen::QrCode
H A DQrCode.hpp288 private: static std::uint8_t reedSolomonMultiply(std::uint8_t x, std::uint8_t y);
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/QR/typescript-javascript/
H A Dqrcodegen.ts657 result[j] = QrCode.reedSolomonMultiply(result[j], root);
661 root = QrCode.reedSolomonMultiply(root, 0x02);
674 result[i] ^= QrCode.reedSolomonMultiply(coef, factor));
682 private static reedSolomonMultiply(x: byte, y: byte): byte { method in qrcodegen.QrCode
/dports/graphics/qr-code-generator/QR-Code-generator-67c6246/typescript-javascript/
H A Dqrcodegen.ts657 result[j] = QrCode.reedSolomonMultiply(result[j], root);
661 root = QrCode.reedSolomonMultiply(root, 0x02);
674 result[i] ^= QrCode.reedSolomonMultiply(coef, factor));
682 private static reedSolomonMultiply(x: byte, y: byte): byte { method in qrcodegen.QrCode
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/QR/c/
H A Dqrcodegen.c64 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
372 result[j] = reedSolomonMultiply(result[j], root); in reedSolomonComputeDivisor()
376 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
393 result[j] ^= reedSolomonMultiply(generator[j], factor); in reedSolomonComputeRemainder()
402 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function
H A Dqrcodegen-test.c54 uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
357 assert(reedSolomonMultiply(tc[0], tc[1]) == tc[2]); in testReedSolomonMultiply()
/dports/graphics/qr-code-generator/QR-Code-generator-67c6246/c/
H A Dqrcodegen.c64 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
372 result[j] = reedSolomonMultiply(result[j], root); in reedSolomonComputeDivisor()
376 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
393 result[j] ^= reedSolomonMultiply(generator[j], factor); in reedSolomonComputeRemainder()
402 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function
H A Dqrcodegen-test.c54 uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
357 assert(reedSolomonMultiply(tc[0], tc[1]) == tc[2]); in testReedSolomonMultiply()