update() [1/2]

template<typename Key, typename Value, fl::size N>

bool fl::unsorted_map_fixed< Key, Value, N >::update ( const Key & key, const Value & value, bool insert_if_missing = true )

inline

Definition at line 169 of file map.h.

                                               {
        iterator it = find(key);
        if (it != end()) {
            it->second = value;
            return true;
        } else if (insert_if_missing) {
            return insert(key, value).first;
        }
        return false;
    }

References end(), find(), insert(), and fl::type_rank< T >::value.

Here is the call graph for this function: