提交 0820dc0c 编写于 作者: A Alexey Milovidov

Optimization of sorting heap

上级 9960a79b
...@@ -217,7 +217,7 @@ public: ...@@ -217,7 +217,7 @@ public:
SortingHeap() = default; SortingHeap() = default;
template <typename Cursors> template <typename Cursors>
SortingHeap(const Cursors & cursors) SortingHeap(Cursors & cursors)
{ {
size_t size = cursors.size(); size_t size = cursors.size();
queue.reserve(size); queue.reserve(size);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册