问题描述
我发现 std::set 上的更新操作很乏味，因为 cppreference.所以我目前做的是这样的:
I find the update operation on std::set tedious since there's no such an API on cppreference. So what I currently do is something like this:
//find element in set by iterator
Element copy = *iterator;
... // update member value on copy, varies
Set.erase(iterator);
Set.insert(copy);
基本上Set返回的迭代器是一个const_iterator，你不能直接改变它的值.
Basically the iterator return by Set is a const_iterator and you can't change its value directly.
有没有更好的方法来做到这一点?或者也许我应该通过创建我自己的来覆盖 std::set(我不知道它究竟是如何工作的......)
Is there a better way to do this? Or maybe I should override std::set by creating my own (which I don't know exactly how it works..)
推荐答案
set 返回 const_iterators (标准说setcode> 是 const，并且 set 和 set 实际上可能是同一类型- 请参阅 n3000.pdf 中的 23.2.4/6)，因为它是一个有序容器.如果它返回一个常规的 iterator，您将被允许从容器下更改 items 值，这可能会改变排序.
set returns const_iterators (the standard says set<T>::iterator is const, and that set<T>::const_iterator and set<T>::iterator may in fact be the same type - see 23.2.4/6 in n3000.pdf) because it is an ordered container. If it returned a regular iterator, you'd be allowed to change the items value out from under the container, potentially altering the ordering.
您的解决方案是更改set 中的项目的惯用方法.
Your solution is the idiomatic way to alter items in a set.
这篇关于C++ std::set 更新很乏味:我无法就地更改元素的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！