std::set<Key,Compare,Allocator>::extract (3) - Linux Manuals

std::set<Key,Compare,Allocator>::extract: std::set<Key,Compare,Allocator>::extract

NAME

std::set<Key,Compare,Allocator>::extract - std::set<Key,Compare,Allocator>::extract

Synopsis

node_type extract( const_iterator position ); (1) (since C++17)
node_type extract( const key_type& x ); (2) (since C++17)

1) Unlinks the node that contains the element pointed to by position and returns a node_handle that owns it
2) If the container has an element with key equivalent to x, unlinks the node that contains that element from the container and returns a node_handle that owns it. Otherwise, returns an empty node handle.
In either case, no elements are copied or moved, only the internal pointers of the container nodes are repointed (rebalancing may occur, as with erase())
Extracting a node invalidates the iterators to the extracted element. Pointers and references to the extracted element remain valid, but cannot be used while element is owned by a node handle: they become usable if the element is inserted into a container.

Parameters

position - a valid iterator into this container
x - a key to identify the node to be extracted

Return value

A node_handle that owns the extracted element, or empty node handle in case the element is not found in overload (2)

Complexity

1) amortized constant
2) log(a.size())

Notes

extract is the only way to take a move-only object out of a set

  set<move_only_type> s;
  s.emplace(...);
  move_only_type mot = move(s.extract(s.begin()).value());

Example

 This section is incomplete
 Reason: no example