Set is an associative container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Sets are usually implemented as árvores rubro-negras.

The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.