使用map默認(rèn)會(huì)根據(jù)key排序的原理作緩存，隊(duì)列滿了依次推出，拋棄掉過時(shí)的數(shù)據(jù)文章來源地址http://www.zghlxwxcb.cn/news/detail-628268.html
#include <functional>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <tuple>
#include <vector>
template <typename V> class SortQueue {
private:
std::function<void(const int, V &)> callback;
std::map<int, V> m;
int max_size;
int last;
public:
SortQueue(int max) : max_size(max), last(0) {}
~SortQueue() {}
void setCallback(std::function<void(const int, V &)> callback) {
this->callback = callback;
}
void push(int k, V &v) {
if (k < last)
return;
m.emplace(std::make_pair(k, std::move(v)));
if (m.size() > max_size) {
auto it = m.begin();
if (callback) {
callback(it->first, it->second);
last = it->first;
}
m.erase(it);
}
}
};
std::vector<int> r(int start, int end, int size) {
std::set<int> generated_nums; // 存儲(chǔ)已生成的隨機(jī)數(shù)
std::vector<int> nums;
std::random_device rd;
std::mt19937 gen(rd());
std::uniform_int_distribution<int> dis(start, end);
while (generated_nums.size() < size) { // 生成10個(gè)不重復(fù)的隨機(jī)數(shù)
int random_num = dis(gen);
if (generated_nums.find(random_num) == generated_nums.end()) {
generated_nums.insert(random_num);
nums.push_back(random_num);
}
}
return std::move(nums);
}
void p(std::vector<int> &arr) {
std::string result;
for (int i = 0; i < arr.size(); ++i) {
result += std::to_string(arr[i]) + " ";
if ((i + 1) % 10 == 0) {
result += "\n";
}
}
std::cout << "拼接后的字符串: \n" << result << std::endl;
}
int main(int argc, char *argv[]) {
std::vector<int> nums;
int start = 1;
int end = 0;
int size = 10;
for (int i = 0; i < 5; i++) {
start = i * size + 1;
end = i * size + 10;
std::vector<int> temp = r(start, end, size);
nums.insert(nums.end(), temp.begin(), temp.end());
}
// std::vector<int> nums = r(1, 50, 50);
p(nums);
SortQueue<int> sq(5);
sq.setCallback(
[](const int k, int &v) { std::cout << "K: " << k << std::endl; });
for (int num : nums) {
sq.push(num, num);
}
return 0;
}
文章來源：http://www.zghlxwxcb.cn/news/detail-628268.html
到了這里，關(guān)于C++ 緩存再排序，解決多線程處理后的亂序問題，不知道思路對(duì)不對(duì)[撓下巴]的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
