[英]sorted container that is not a priority queue
我们需要一个容器,在添加新元素时,该容器可以按元素的优先级对元素进行排序,并且能够根据给定的ID来检索元素。
(优先级队列的问题是它不能让您根据ID而不是优先级来检索元素)
谢谢
boost多索引容器使您能够具有优先级的排序视图和ID的排序视图。
一个小例子:
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index/member.hpp>
#include <iostream>
#include <vector>
#include <cstddef>
#include <iterator>
struct elem {
std::size_t id;
int priority;
};
int main()
{
using namespace boost::multi_index;
typedef multi_index_container<
elem,
indexed_by<
ordered_unique<member<elem,std::size_t,&elem::id> >,
ordered_non_unique<member<elem,int,&elem::priority> >
>
> elem_container;
// just for show
std::vector<elem> elems =
{{0, 25},
{1, 10},
{2, 100},
{3, 6}
};
elem_container elemc(begin(elems), end(elems));
// by id
std::cout << "By ID: " << std::endl;
for(auto& x : elemc.get<0>()) {
std::cout << "id: " << x.id << "priority: " << x.priority << std::endl;
}
// by priority
std::cout << "By Priority: " << std::endl;
for(auto& x : elemc.get<1>()) {
std::cout << "id: " << x.id << "priority: " << x.priority << std::endl;
}
return 0;
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.