Assignment operators

Synopses

Declared in <bslstl_unorderedset.h>

Assign to this object the value, hash function, and equality comparator of the specified rhs object, propagate to this object the allocator of rhs if the ALLOCATOR type has trait propagate_on_container_copy_assignment, and return a reference providing modifiable access to this object. If an exception is thrown, *this is left in a valid but unspecified state. This method requires that the (template parameter) type KEY be copy‐assignable and 'copy‐insertable" into this set (see {Requirements on KEY}).

Assign to this object the value, hash function, and equality comparator of the specified rhs object, propagate to this object the allocator of rhs if the ALLOCATOR type has trait propagate_on_container_move_assignment, and return a reference providing modifiable access to this object. The contents of rhs are moved (in constant time) to this set if get_allocator() == rhs.get_allocator() (after accounting for the aforementioned trait); otherwise, all elements in this set are either destroyed or move‐assigned to and each additional element in rhs is move‐inserted into this set. rhs is left in a valid but unspecified state, and if an exception is thrown, *this is left in a valid but unspecified state. This method requires that the (template parameter) type KEY be both move‐assignable and move‐insertable into this set (see {Requirements on KEY}).

Assign to this object the value resulting from first clearing this unordered set and then inserting each value_type object in the specified values initializer list, ignoring those keys having a value equivalent to that which appears earlier in the list; return a reference providing modifiable access to this object. This method requires that the (template parameter) type KEY type be copy‐insertable into this set (see {Requirements on KEY}).

unordered_set<KEY, HASH, EQUAL, ALLOCATOR>&
operator=(std::initializer_list<KEY> values);

Created with MrDocs