Browse Source

Fixed implicit type conversions.

cl-refactor
Tim Hughes 11 years ago
parent
commit
a5dba4d357
  1. 2
      test/hexPrefix.cpp
  2. 2
      test/trie.cpp

2
test/hexPrefix.cpp

@ -46,7 +46,7 @@ public:
cnote << i.first; cnote << i.first;
bytes v; bytes v;
for (auto& i: o["seq"].get_array()) for (auto& i: o["seq"].get_array())
v.push_back(i.get_int()); v.push_back((byte)i.get_int());
auto e = hexPrefixEncode(v, o["term"].get_bool()); auto e = hexPrefixEncode(v, o["term"].get_bool());
if (!o["out"].is_null() && o["out"].get_str() != asHex(e)) if (!o["out"].is_null() && o["out"].get_str() != asHex(e))
{ {

2
test/trie.cpp

@ -53,7 +53,7 @@ public:
vector<pair<string, string>> ss; vector<pair<string, string>> ss;
for (auto& i: o["in"].get_obj()) for (auto& i: o["in"].get_obj())
ss.push_back(make_pair(i.first, i.second.get_str())); ss.push_back(make_pair(i.first, i.second.get_str()));
for (unsigned j = 0; j < fac(ss.size()); ++j) for (unsigned j = 0; j < fac((unsigned)ss.size()); ++j)
{ {
next_permutation(ss.begin(), ss.end()); next_permutation(ss.begin(), ss.end());
BasicMap m; BasicMap m;

Loading…
Cancel
Save