局域网行为监控软件核心：C++ 跳表算法高效日志索引方案

#include <iostream>
#include <vector>
#include <mutex>
#include <random>
#include <ctime>
#include <string>
#include <algorithm>
// 跳表节点模板类
template <typename K, typename V>
struct SkipListNode {
    K key;                  // 键值：日志时间戳+终端ID（组合键）
    V value;                // 存储日志数据
    std::vector<SkipListNode<K, V>*> forward;  // 各层前驱指针
    SkipListNode(K k, V v, int level) : key(k), value(v) {
        forward.resize(level, nullptr);
    }
};
// 跳表模板类
template <typename K, typename V>
class SkipList {
private:
    int max_level;          // 跳表最大层数
    int current_level;      // 当前跳表实际层数
    SkipListNode<K, V>* head;  // 头节点
    std::mt19937 rng;       // 随机数生成器
    std::shared_mutex rw_mutex;  // 读写锁，支持并发读写
    // 随机生成节点层数
    int randomLevel() {
        int level = 1;
        while (rng() % 2 == 0 && level < max_level) {
            level++;
        }
        return level;
    }
public:
    SkipList(int max_level = 16) : max_level(max_level), current_level(1) {
        rng.seed(time(nullptr));
        head = new SkipListNode<K, V>(K(), V(), max_level);
    }
    ~SkipList() {
        SkipListNode<K, V>* p = head;
        while (p != nullptr) {
            SkipListNode<K, V>* next = p->forward[0];
            delete p;
            p = next;
        }
    }
    // 插入日志数据
    void insert(K key, V value) {
        std::unique_lock<std::shared_mutex> lock(rw_mutex);
        SkipListNode<K, V>* update[max_level];  // 记录各层待更新节点
        SkipListNode<K, V>* p = head;
        // 从最高层向下查找插入位置
        for (int i = current_level - 1; i >= 0; i--) {
            while (p->forward[i] != nullptr && p->forward[i]->key < key) {
                p = p->forward[i];
            }
            update[i] = p;
        }
        // 生成新节点层数
        int new_level = randomLevel();
        if (new_level > current_level) {
            for (int i = current_level; i < new_level; i++) {
                update[i] = head;
            }
            current_level = new_level;
        }
        // 创建新节点并插入
        SkipListNode<K, V>* new_node = new SkipListNode<K, V>(key, value, new_level);
        for (int i = 0; i < new_level; i++) {
            new_node->forward[i] = update[i]->forward[i];
            update[i]->forward[i] = new_node;
        }
    }
    // 范围查询日志（[start_key, end_key]）
    std::vector<V> rangeQuery(K start_key, K end_key) {
        std::shared_lock<std::shared_mutex> lock(rw_mutex);
        std::vector<V> result;
        SkipListNode<K, V>* p = head;
        // 定位到起始键的前一个节点
        for (int i = current_level - 1; i >= 0; i--) {
            while (p->forward[i] != nullptr && p->forward[i]->key < start_key) {
                p = p->forward[i];
            }
        }
        p = p->forward[0];
        // 遍历获取范围内所有节点
        while (p != nullptr && p->key <= end_key) {
            result.push_back(p->value);
            p = p->forward[0];
        }
        return result;
    }
};
// 日志数据结构体
struct MonitorLog {
    std::string terminal_id;  // 终端ID
    std::string behavior;     // 行为描述（如"访问违规网站"）
    std::string target;       // 目标（如网址、文件名）
};
// 局域网行为监控软件日志索引模拟
int main() {
    // 初始化跳表（最大层数16）
    SkipList<uint64_t, MonitorLog> logSkipList(16);
    // 模拟插入1000条终端行为日志（键值：时间戳（秒级））
    uint64_t baseTimestamp = 1730000000;
    for (int i = 0; i < 1000; i++) {
        MonitorLog log = {
            "PC-" + std::to_string(i % 50),  // 50台终端循环
            i % 3 == 0 ? "访问网站" : (i % 3 == 1 ? "传输文件" : "启动应用"),
            i % 3 == 0 ? "www.test" + std::to_string(i) + ".com" : 
                         (i % 3 == 1 ? "data" + std::to_string(i) + ".pdf" : "app" + std::to_string(i) + ".exe")
        };
        logSkipList.insert(baseTimestamp + i, log);
    }
    // 查询指定时间范围内的日志（1730000100 至 1730000200）
    std::vector<MonitorLog> queryResult = logSkipList.rangeQuery(1730000100, 1730000200);
    std::cout << "查询到" << queryResult.size() << "条日志：" << std::endl;
    for (const auto& log : queryResult) {
        std::cout << "终端：" << log.terminal_id << " | 行为：" << log.behavior 
                  << " | 目标：" << log.target << std::endl;
    }
    return 0;
}