DragonX/dragonx
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 2 Wiki Activity

Remove broken links

Browse Source
This commit is contained in:
Duke Leto
2021-09-03 12:05:20 -04:00
parent 9e643ba7e9
commit ae9b87740d
3 changed files with 3 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/cc/dapps/zmigrate.c
View File

@@ -1044,8 +1044,8 @@ int32_t itemvalid(char *refcoin,int64_t *refundedp,int64_t *waitingp,struct clai
*refundedp = *waitingp = 0; *refundedp = *waitingp = 0;
if ( item->refundvalue < 0 ) if ( item->refundvalue < 0 )
return(-1); return(-1);
// change "kmd" -> %s, tolowerstr(refcoin)
sprintf(url,"https://kmd.explorer.dexstats.info/insight-api-komodo/addr/%s",item->destaddr); sprintf(url,"https://explorer.hush.is/api/addr/%s",item->destaddr);
if ( (retstr= send_curl(url,"/tmp/itemvalid")) != 0 ) if ( (retstr= send_curl(url,"/tmp/itemvalid")) != 0 )
{ {
if ( (curljson= cJSON_Parse(retstr)) != 0 ) if ( (curljson= cJSON_Parse(retstr)) != 0 )

8
src/test-hush/test_eval_notarization.cpp
View File

@@ -3,7 +3,6 @@
// file COPYING or https://www.gnu.org/licenses/gpl-3.0.en.html // file COPYING or https://www.gnu.org/licenses/gpl-3.0.en.html
#include <cryptoconditions.h> #include <cryptoconditions.h>
#include <gtest/gtest.h> #include <gtest/gtest.h>
#include "cc/betprotocol.h" #include "cc/betprotocol.h"
#include "cc/eval.h" #include "cc/eval.h"
#include "base58.h" #include "base58.h"
@@ -14,16 +13,12 @@
#include "primitives/transaction.h" #include "primitives/transaction.h"
#include "script/interpreter.h" #include "script/interpreter.h"
#include "script/serverchecker.h" #include "script/serverchecker.h"
#include "testutils.h" #include "testutils.h"
extern int32_t hush_notaries(uint8_t pubkeys[64][33],int32_t height,uint32_t timestamp); extern int32_t hush_notaries(uint8_t pubkeys[64][33],int32_t height,uint32_t timestamp);
namespace TestEvalNotarization { namespace TestEvalNotarization {
class EvalMock : public Eval class EvalMock : public Eval
{ {
public: public:
@@ -86,7 +81,6 @@ namespace TestEvalNotarization {
} }
// https://kmd.explorer.supernet.org/tx/5b8055d37cff745a404d1ae45e21ffdba62da7b28ed6533c67468d7379b20bae
// inputs have been dropped // inputs have been dropped
static auto rawNotaryTx = "01000000000290460100000000002321020e46e79a2a8d12b9b5d12c7a91adb4e454edfae43c0a0cb805427d2ac7613fd9ac0000000000000000506a4c4dae8e0f3e6e5de498a072f5967f3c418c4faba5d56ac8ce17f472d029ef3000008f2e0100424f545300050ba773f0bc31da5839fc7cb9bd7b87f3b765ca608e5cf66785a466659b28880500000000000000"; static auto rawNotaryTx = "01000000000290460100000000002321020e46e79a2a8d12b9b5d12c7a91adb4e454edfae43c0a0cb805427d2ac7613fd9ac0000000000000000506a4c4dae8e0f3e6e5de498a072f5967f3c418c4faba5d56ac8ce17f472d029ef3000008f2e0100424f545300050ba773f0bc31da5839fc7cb9bd7b87f3b765ca608e5cf66785a466659b28880500000000000000";
CTransaction notaryTx; CTransaction notaryTx;
@@ -201,6 +195,4 @@ TEST(TestEvalNotarization, testInvalidNotarizationInputNotCheckSig)
ASSERT_FALSE(eval.GetNotarizationData(notary.GetHash(), data)); ASSERT_FALSE(eval.GetNotarizationData(notary.GetHash(), data));
} }
} /* namespace TestEvalNotarization */ } /* namespace TestEvalNotarization */

2
src/wallet/test/wallet_tests.cpp
View File

@@ -211,7 +211,7 @@ BOOST_AUTO_TEST_CASE(coin_selection_tests)
BOOST_CHECK( wallet.SelectCoinsMinConf(1 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet,0)); BOOST_CHECK( wallet.SelectCoinsMinConf(1 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet,0));
BOOST_CHECK_EQUAL(nValueRet, 1 * CENT); // we should get the exact amount BOOST_CHECK_EQUAL(nValueRet, 1 * CENT); // we should get the exact amount
// run the 'mtgox' test (see http://blockexplorer.com/tx/29a3efd3ef04f9153d47a990bd7b048a4b2d213daaa5fb8ed670fb85f13bdbcf) // run the 'mtgox' test
// they tried to consolidate 10 50k coins into one 500k coin, and ended up with 50k in change // they tried to consolidate 10 50k coins into one 500k coin, and ended up with 50k in change
empty_wallet(); empty_wallet();
for (int i = 0; i < 20; i++) for (int i = 0; i < 20; i++)