How to use of set::insert safely and efficiently

[positron96]

As I see from documentation and code, just calling set::insert can result in undefined behavior:

Inserts values in to the set. If the set is full then emits an etl::set_full error. If asserts or exceptions are not enabled then undefined behaviour occurs.

So to have a defined behavior when inserting something, I need to use something similar to this snippet:

auto i = myset.find(obj);
if(i != myset.end()) {
    /* already present */
} else if(myset.full()) { 
    /* full */ 
} else {
    myset.insert(obj); 
} 

But internals for insert method will do checks for full and find again.
Is there a way to insert values without these double checks? (with exceptions and asserts turned off, which it seems is the default setting)

I think the question also applies to map and unordered variants.

[jwellbelove]

I have a plan to look at this issue at some time.
A while ago I added additional ETL_ASSERT macro that can force a return, optionally with a value.
I need to go through all of the ETL_ASSERTs one day to allow defined behaviour on error, wherever possible.