4b331159df
Remove testcase generating code from util_SettingsMerge so it can be reused in
new tests.
The hash value expected in util_SettingsMerge changes as a result of this, but
only because the testcases are generated in a different order, not because any
cases are added or removed. It is possible to verify this with:
SETTINGS_MERGE_TEST_OUT=new.txt test/test_bitcoin --run_test=util_tests/util_SettingsMerge
git checkout HEAD~1
make test/test_bitcoin
SETTINGS_MERGE_TEST_OUT=old.txt test/test_bitcoin --run_test=util_tests/util_SettingsMerge
diff -u <(sort old.txt) <(sort new.txt)
The new output is a little more readable, with simpler testcases sorted first.
70 lines
2.1 KiB
C++
70 lines
2.1 KiB
C++
// Copyright (c) 2019 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#ifndef BITCOIN_TEST_UTIL_H
|
|
#define BITCOIN_TEST_UTIL_H
|
|
|
|
#include <memory>
|
|
#include <string>
|
|
|
|
class CBlock;
|
|
class CScript;
|
|
class CTxIn;
|
|
class CWallet;
|
|
|
|
// Constants //
|
|
|
|
extern const std::string ADDRESS_BCRT1_UNSPENDABLE;
|
|
|
|
// Lower-level utils //
|
|
|
|
/** Returns the generated coin */
|
|
CTxIn MineBlock(const CScript& coinbase_scriptPubKey);
|
|
/** Prepare a block to be mined */
|
|
std::shared_ptr<CBlock> PrepareBlock(const CScript& coinbase_scriptPubKey);
|
|
|
|
|
|
// RPC-like //
|
|
|
|
/** Import the address to the wallet */
|
|
void importaddress(CWallet& wallet, const std::string& address);
|
|
/** Returns a new address from the wallet */
|
|
std::string getnewaddress(CWallet& w);
|
|
/** Returns the generated coin */
|
|
CTxIn generatetoaddress(const std::string& address);
|
|
|
|
/**
|
|
* Increment a string. Useful to enumerate all fixed length strings with
|
|
* characters in [min_char, max_char].
|
|
*/
|
|
template <typename CharType, size_t StringLength>
|
|
bool NextString(CharType (&string)[StringLength], CharType min_char, CharType max_char)
|
|
{
|
|
for (CharType& elem : string) {
|
|
bool has_next = elem != max_char;
|
|
elem = elem < min_char || elem >= max_char ? min_char : CharType(elem + 1);
|
|
if (has_next) return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
/**
|
|
* Iterate over string values and call function for each string without
|
|
* successive duplicate characters.
|
|
*/
|
|
template <typename CharType, size_t StringLength, typename Fn>
|
|
void ForEachNoDup(CharType (&string)[StringLength], CharType min_char, CharType max_char, Fn&& fn) {
|
|
for (bool has_next = true; has_next; has_next = NextString(string, min_char, max_char)) {
|
|
int prev = -1;
|
|
bool skip_string = false;
|
|
for (CharType c : string) {
|
|
if (c == prev) skip_string = true;
|
|
if (skip_string || c < min_char || c > max_char) break;
|
|
prev = c;
|
|
}
|
|
if (!skip_string) fn();
|
|
}
|
|
}
|
|
|
|
#endif // BITCOIN_TEST_UTIL_H
|