Similar to std::set<>::insert() Extends the array by inserting a new element, but only if it cannot be found in the array already. Assumes that the array is sorted with std::less Insertion using this function will maintain order. @retval A pair, with its member pair::first set an iterator pointing to either the newly inserted element, or to the equiv
source not stored for this graph (policy: none)
no test coverage detected