2021-06-25 16:52:27 +03:00
|
|
|
#pragma once
|
2021-08-19 03:18:42 +03:00
|
|
|
|
|
|
|
#include <unordered_map>
|
2021-07-22 03:07:00 +03:00
|
|
|
#include <memory>
|
2022-01-10 20:13:41 +03:00
|
|
|
#include <flipper_file.h>
|
2021-06-25 16:52:27 +03:00
|
|
|
|
|
|
|
class IrdaAppBruteForce {
|
|
|
|
const char* universal_db_filename;
|
|
|
|
std::string current_record;
|
2022-01-10 20:13:41 +03:00
|
|
|
FlipperFile* ff;
|
2021-06-25 16:52:27 +03:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int index;
|
|
|
|
int amount;
|
|
|
|
} Record;
|
|
|
|
|
|
|
|
// 'key' is record name, because we have to search by both, index and name,
|
|
|
|
// but index search has place once per button press, and should not be
|
|
|
|
// noticed, but name search should occur during entering universal menu,
|
|
|
|
// and will go through container for every record in file, that's why
|
|
|
|
// more critical to have faster search by record name.
|
|
|
|
std::unordered_map<std::string, Record> records;
|
|
|
|
|
|
|
|
public:
|
|
|
|
bool calculate_messages();
|
|
|
|
void stop_bruteforce();
|
2021-07-16 19:43:54 +03:00
|
|
|
bool send_next_bruteforce();
|
2021-06-25 16:52:27 +03:00
|
|
|
bool start_bruteforce(int index, int& record_amount);
|
|
|
|
void add_record(int index, const char* name);
|
|
|
|
|
2021-08-11 20:51:06 +03:00
|
|
|
IrdaAppBruteForce(const char* filename)
|
|
|
|
: universal_db_filename(filename) {
|
|
|
|
}
|
|
|
|
~IrdaAppBruteForce() {
|
|
|
|
}
|
2021-06-25 16:52:27 +03:00
|
|
|
};
|