1d4662f5dc
60f61f9 Tighten up bech32::Decode(); add tests. (murrayn)
Pull request description:
Just a few minor optimizations to bech32::Decode():
1) optimize the order and logic of the conditionals
2) get rid of subsequent '(c < 33 || c > 126)' check which is redundant (already performed above)
3) add a couple more bech32 tests (mixed-case)
Tree-SHA512: e41af834c8f6b7d34c22c28b724df42c60f72e00df616e70a12efbc4271d15d80627fe1bc36845caf29f615c238499a566298a863cbe119fef457287231053c8
69 lines
2.1 KiB
C++
69 lines
2.1 KiB
C++
// Copyright (c) 2017 Pieter Wuille
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <bech32.h>
|
|
#include <test/test_bitcoin.h>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
BOOST_FIXTURE_TEST_SUITE(bech32_tests, BasicTestingSetup)
|
|
|
|
static bool CaseInsensitiveEqual(const std::string &s1, const std::string &s2)
|
|
{
|
|
if (s1.size() != s2.size()) return false;
|
|
for (size_t i = 0; i < s1.size(); ++i) {
|
|
char c1 = s1[i];
|
|
if (c1 >= 'A' && c1 <= 'Z') c1 -= ('A' - 'a');
|
|
char c2 = s2[i];
|
|
if (c2 >= 'A' && c2 <= 'Z') c2 -= ('A' - 'a');
|
|
if (c1 != c2) return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(bip173_testvectors_valid)
|
|
{
|
|
static const std::string CASES[] = {
|
|
"A12UEL5L",
|
|
"a12uel5l",
|
|
"an83characterlonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1tt5tgs",
|
|
"abcdef1qpzry9x8gf2tvdw0s3jn54khce6mua7lmqqqxw",
|
|
"11qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqc8247j",
|
|
"split1checkupstagehandshakeupstreamerranterredcaperred2y9e3w",
|
|
"?1ezyfcl",
|
|
};
|
|
for (const std::string& str : CASES) {
|
|
auto ret = bech32::Decode(str);
|
|
BOOST_CHECK(!ret.first.empty());
|
|
std::string recode = bech32::Encode(ret.first, ret.second);
|
|
BOOST_CHECK(!recode.empty());
|
|
BOOST_CHECK(CaseInsensitiveEqual(str, recode));
|
|
}
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(bip173_testvectors_invalid)
|
|
{
|
|
static const std::string CASES[] = {
|
|
" 1nwldj5",
|
|
"\x7f""1axkwrx",
|
|
"\x80""1eym55h",
|
|
"an84characterslonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1569pvx",
|
|
"pzry9x0s0muk",
|
|
"1pzry9x0s0muk",
|
|
"x1b4n0q5v",
|
|
"li1dgmt3",
|
|
"de1lg7wt\xff",
|
|
"A1G7SGD8",
|
|
"10a06t8",
|
|
"1qzzfhee",
|
|
"a12UEL5L",
|
|
"A12uEL5L",
|
|
};
|
|
for (const std::string& str : CASES) {
|
|
auto ret = bech32::Decode(str);
|
|
BOOST_CHECK(ret.first.empty());
|
|
}
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|