I understood that I have to avoid changing values of const items, not a prob. But there is no const item.
I found that std::set is always provoking const values. But how to avoid this? I'm in need of this include for the rest f the code ...
You'll have to redesign. An std::set doesn't allow its elements to be modified in any way because it doesn't understand the comparison function. If you modify a member of the object and this modification alters the order of the object within the collection, this leaves the set in an inconsistent state.
You could change the std::set<V> into an std::map<K, V>, where there exists a function K f(V) such that a < b if and only if f(a) < f(b). If you post the definition of your class and your comparison function maybe we can figure something out.