分享好友 维修大全首页 维修大全分类 切换频道

吉日象维修app

实现C++中支持多线程访问的线程安全红黑树

2024-10-209030

#include <iostream>#include <mutex>#include <thread>#include <chrono>#include <random>#include <condition_variable>enum Color {    RED,    BLACK};template <typename T>class Node {public:    T key;    Node<T>* left;    Node<T>* right;    Node<T>* parent;    Color color;    Node(T key) : key(key), left(nullptr), right(nullptr), parent(nullptr), color(RED) {}};template <typename T>class RedBlackTree {private:    Node<T>* root;    std::mutex m;public:    RedBlackTree() : root(nullptr) {}    void insert(T key) {        std::lock_guard<std::mutex> lock(m);        Node<T>* newNode = new Node<T>(key);        if (root == nullptr) {            root = newNode;            root->color = BLACK;            return;        }        Node<T>* current = root;        Node<T>* parent = nullptr;        while (current != nullptr) {            parent = current;            if (key < current->key) {                current = current->left;            } else {                current = current->right;            }        }        newNode->parent = parent;        if (key < parent->key) {            parent->left = newNode;        } else {            parent->right = newNode;        }        fixViolation(newNode);    }    void printInOrder() {        std::lock_guard<std::mutex> lock(m);        printInOrderHelper(root);        std::cout << std::endl;    }private:    void fixViolation(Node<T>* newNode) {        Node<T>* parent = nullptr;        Node<T>* grandparent = nullptr;        while (newNode != root && newNode->color != BLACK && newNode->parent->color == RED) {            parent = newNode->parent;            grandparent = parent->parent;            if (parent == grandparent->left) {                Node<T>* uncle = grandparent->right;                if (uncle != nullptr && uncle->color == RED) {                    grandparent->color = RED;                    parent->color = BLACK;                    uncle->color = BLACK;                    newNode = grandparent;                } else {                    if (newNode == parent->right) {                        rotateLeft(parent);                        newNode = parent;                        parent = newNode->parent;                    }                    rotateRight(grandparent);                    std::swap(parent->color, grandparent->color);                    newNode = parent;                }            } else {                Node<T>* uncle = grandparent->left;                if (uncle != nullptr && uncle->color == RED) {                    grandparent->color = RED;                    parent->color = BLACK;                    uncle->color = BLACK;                    newNode = grandparent;                } else {                    if (newNode == parent->left) {                        rotateRight(parent);                        newNode = parent;                        parent = newNode->parent;                    }                    rotateLeft(grandparent);                    std::swap(parent->color, grandparent->color);                    newNode = parent;                }            }        }        root->color = BLACK;    }    void rotateLeft(Node<T>* newNode) {        Node<T>* rightChild = newNode->right;        newNode->right = rightChild->left;        if (newNode->right != nullptr) {            newNode->right->parent = newNode;        }        rightChild->parent = newNode->parent;        if (newNode->parent == nullptr) {            root = rightChild;        } else if (newNode == newNode->parent->left) {            newNode->parent->left = rightChild;        } else {            newNode->parent->right = rightChild;        }        rightChild->left = newNode;        newNode->parent = rightChild;    }    void rotateRight(Node<T>* newNode) {        Node<T>* leftChild = newNode->left;        newNode->left = leftChild->right;        if (newNode->left != nullptr) {            newNode->left->parent = newNode;        }        leftChild->parent = newNode->parent;        if (newNode->parent == nullptr) {            root = leftChild;        } else if (newNode == newNode->parent->left) {            newNode->parent->left = leftChild;        } else {            newNode->parent->right = leftChild;        }        leftChild->right = newNode;        newNode->parent = leftChild;    }    void printInOrderHelper(Node<T>* current) {        if (current == nullptr) {            return;        }        printInOrderHelper(current->left);        std::cout << current->key << " ";        printInOrderHelper(current->right);    }};int main() {    RedBlackTree<int> tree;    std::vector<std::thread> threads;    for (int i = 0;

举报
打赏
打赏主播是什么意思
打赏主播是指观众(用户)在观看网络直播节目时,自愿通过直播平台提供的支付渠道,将一定数额的金钱或虚拟礼物赠送给主播的行为

0评论2025-03-26870

主打是什么意思
“主打” 这个词常见的有以下几种意思:一、在商业、产品领域主要营销、重点推广当我们说某产品是公司的 “主打产品” 时,是指

0评论2025-03-26636

电台路是什么意思
“电台路” 通常是因与电台相关的因素而得名的道路,以下是一些具体例子:上海电台路:位于宝山区顾村镇,呈南北走向,南起宝安

0评论2025-03-26335

打狙的窍门是什么意思
“打狙的窍门” 通常是指在射击游戏或实际射击场景中,使用狙击步枪时能够提高射击准确性、效率和生存能力等的一些技巧和方法。

0评论2025-03-26647

路上的创作原声是什么意思
“路上的创作原声” 通常是指以 “在路上” 的状态、经历、感悟等为主题或灵感来源而创作的原始声音作品,在不同艺术领域有不同

0评论2025-03-26375

打印照片回执是什么意思
打印照片回执是指在完成照片拍摄并经相关系统审核通过后,将记录照片合格信息以及个人身份等相关内容的电子凭证,通过打印机输出

0评论2025-03-26283

棒打鸳鸯是什么意思
“棒打鸳鸯” 是一个汉语成语,意思是用木棒打散一对鸳鸯,比喻拆散恩爱的夫妻或情侣。该成语的来源和用法如下:来源与出处:出

0评论2025-03-26672

主打三棺是什么意思
“主打三棺” 是一种网络用语,用反语的方式讽刺人们没有正常的思维观念和底线。该梗起源于贴吧网友之间的讽刺话语,具体出自抗

0评论2025-03-26220

常用香料是什么意思
常用香料是指在烹饪、食品加工、香水制作、药品生产等领域中经常使用的具有独特香气和味道的物质。它们可以增添风味、改善气味、

0评论2025-03-26963

潮汕话香芋是什么意思
在潮汕话中,“香芋” 通常指的就是芋头。不过,潮汕方言中芋头的发音是 “麦筲”(mài shāo)。芋头在潮汕地区的饮食文化和民

0评论2025-03-26504

关于我们  |  网站留言
(c)2026 吉日象维修app www.mykuaidi.com