eosswedenorg/antelope-keygen
1
0
Fork 0
mirror of https://github.com/eosswedenorg/antelope-keygen synced 2026-06-17 03:50:03 +02:00
Code Issues Releases Activity

key_search: refactor into a KeySearch class.

Browse source
This commit is contained in:
Henrik Hautakoski 2020-01-15 17:02:53 +01:00
parent 418949f26f
commit 35bb2302dd
4 changed files with 96 additions and 29 deletions
Download patch file Download diff file Expand all files Collapse all files

22
src/main.cpp
View file

@ -44,33 +44,29 @@ bool option_l33t = false;
if (n_threads < 2) { \
n_threads = 2; \
} \
}
} \
ks.setThreadCount(n_threads);
#define n_thread_outp << ", Using: " << n_threads << " threads"
#define call_search key_search_mt(words, n, n_threads)
#else
#define n_thread_decl
#define n_thread_argv
#define n_thread_outp
#define call_search key_search(words, n)
#endif /* HAVE_THREADS */
void cmd_search(int argc, char **argv) {
int n = 100;
n_thread_decl;
std::string search(argv[0]);
strlist_t words;
std::string input(argv[0]);
KeySearch ks;
if (option_l33t) {
strlist_t tmp = strsplitwords(search);
strlist_t tmp = strsplitwords(input);
for(int i = 0; i < tmp.size(); i++) {
strlist_t list = l33twords(base58_strip(tmp[i]));
words.reserve(words.size() + list.size());
words.insert(words.end(), list.begin(), list.end());
ks.addList(l33twords(tmp[i]));
}
} else {
words = strsplitwords(strtolower(search));
base58_strip(words);
ks.addList(strsplitwords(input));
}
if (argc > 1) {
@ -83,11 +79,11 @@ void cmd_search(int argc, char **argv) {
n_thread_argv;
std::cout << "Searching for " << n
<< " keys containing: " << strjoin(words, ",")
<< " keys containing: " << strjoin(ks.getList(), ",")
n_thread_outp
<< std::endl;
call_search;
ks.find(n);
}
void usage(const char *name) {