mirror of
https://github.com/IT4Change/gradido.git
synced 2025-12-13 07:45:54 +00:00
Ulf Gebhardt
ac99a7097e
git-subtree-dir: login_server git-subtree-mainline: 09ebb40de21084bb10ee466429d900a5e757d349 git-subtree-split: ca71af1817a801db9a108c205bc298250d498c4b
68 lines
1.4 KiB
C++
68 lines
1.4 KiB
C++
#ifndef DR_MNEMONIC_H
|
|
#define DR_MNEMONIC_H
|
|
|
|
/*!
|
|
*
|
|
* @author: einhornimmond
|
|
*
|
|
* @date: 16.06.19
|
|
*
|
|
* @desc: Class for handling mnemonic word list, unpacking, reverse lookup
|
|
*
|
|
*/
|
|
|
|
#include "../lib/DRHashList.h"
|
|
#include <string>
|
|
#include <shared_mutex>
|
|
#include <map>
|
|
#include <list>
|
|
|
|
#include "Poco/JSON/Array.h"
|
|
|
|
#define PHRASE_WORD_COUNT 24
|
|
|
|
|
|
class Mnemonic
|
|
{
|
|
public:
|
|
Mnemonic();
|
|
~Mnemonic();
|
|
|
|
int init(void(*fill_words_func)(unsigned char*), unsigned int original_size, unsigned int compressed_size);
|
|
|
|
const char* getWord(short index) const;
|
|
short getWordIndex(const char* word) const;
|
|
inline bool isWordExist(const std::string& word) const {
|
|
std::shared_lock<std::shared_mutex> _lock(mWorkingMutex);
|
|
return getWordIndex(word.data()) != -1;
|
|
}
|
|
// using only for debugging
|
|
std::string getCompleteWordList();
|
|
|
|
std::string getCompleteWordListSorted();
|
|
|
|
Poco::JSON::Array getSortedWordList();
|
|
|
|
void printToFile(const char* filename);
|
|
|
|
protected:
|
|
|
|
void clear();
|
|
|
|
struct HashCollisionWords {
|
|
DHASH hash;
|
|
std::vector<std::string> words;
|
|
};
|
|
|
|
char* mWords[2048];
|
|
//DRHashList mWordHashIndices;
|
|
typedef std::pair<DHASH, unsigned short> WordHashEntry;
|
|
typedef std::pair<std::string, unsigned short> HashCollideWordEntry;
|
|
std::map<DHASH, unsigned short> mWordHashIndices;
|
|
std::map<DHASH, std::map<std::string, unsigned short>> mHashCollisionWords;
|
|
mutable std::shared_mutex mWorkingMutex;
|
|
|
|
};
|
|
|
|
#endif //DR_MNEMONIC_H
|