FastPatternsScanner.cpp is a C++ implementation of a fast pattern scanner. It includes a class CFastPatternsScanner that allows efficient searching for patterns in data.
To use this package, you can clone the repository and compile it using a C++ compiler:
git clone https://github.com/NIR3X/FastPatternsScanner.cpp
cd FastPatternsScanner.cpp
makeTo use the CFastPatternsScanner class, follow these steps:
- Include the
FastPatternsScanner.hheader file in your C++ project. - Create a
std::unordered_set<std::vector<uint8_t>>containing the patterns you want to search for. - Instantiate a
CFastPatternsScannerobject with the patterns. - Use the
ContainsAnymethod to search for patterns in your data.
Example usage:
#include "FastPatternsScanner.h"
#include <cassert>
#include <iostream>
int main() {
std::vector<std::vector<uint8_t>> patternsList = { {1}, {1, 2}, {1, 2, 3}, {48} };
CFastPatternsScanner fastPatternsScanner({ patternsList.begin(), patternsList.end() });
assert(fastPatternsScanner.ContainsAny(std::vector<uint8_t> {4, 1, 5, 6, 7}) == patternsList[0]);
assert(fastPatternsScanner.ContainsAny(std::vector<uint8_t> {4, 5, 1, 2, 6}) == patternsList[1]);
assert(fastPatternsScanner.ContainsAny(std::vector<uint8_t> {4, 5, 1, 2, 3}) == patternsList[2]);
assert(fastPatternsScanner.ContainsAny("9876543210") == patternsList[3]);
std::cout << "PASS" << std::endl;
}The search complexity of CFastPatternsScanner is O(n*m), where n is the length of the data and m is the length of the longest pattern. This represents the maximum complexity of the algorithm in the worst case scenario.
This program is Free Software: You can use, study share and improve it at your will. Specifically you can redistribute and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.