Breaking News: Grepper is joining You.com. Read the official announcement!

Task Description interval_map<K,V> is a data structure that associates keys of type K with values of type V. It is designed to be used efficiently in situations where intervals of consecutive keys are associated with the same value. Your task is to implem

Clumsy Camel answered on February 22, 2024 Popularity 2/10 Helpfulness 3/10

answer Task Description interval_map<K,V> is a data structure that associates keys of type K with values of type V. It is designed to be used efficiently in situations where intervals of consecutive keys are associated with the same value. Your task is to implem

Task Description interval_map<K,V> is a data structure that associates keys of type K with values of type V. It is designed to be used efficiently in situations where intervals of consecutive keys are associated with the same value. Your task is to implem

Comment

void assign( K const& keyBegin, K const& keyEnd, V const& val ) {

        if (!(keyBegin < keyEnd))
            return;

        auto beginIt = m_map.lower_bound(keyBegin);
        auto endIt = m_map.upper_bound(keyEnd);
        auto endVal = (*this)[keyEnd]; //store endvalue for later use

        m_map.erase(beginIt, endIt);

        //insert new elements
        auto newIt = m_map.insert_or_assign(keyBegin, val).first; // equivalent to m_map[keyBegin] = val;
        auto it1 = newIt;
        //store the previous iterator if exists for canonical check
        if(--it1 == m_map.end()){
            it1 = newIt;
        }

        auto it2 = ++m_map.insert_or_assign(keyEnd, endVal).first; //store the next iterator for canonical check, equivalent to m_map[keyEnd] = endVal;

        //check for duplicated keys between our inserted elements and erase them
        V checkVal = it1->second;
        auto next_it = ++it1;
        do{
            next_it++;
            if(it1->second == checkVal){
                m_map.erase(it1);
            }else{
                checkVal = it1->second;
            }
            it1 = next_it;

        }while(it1 != it2);

        if(m_map.begin()->second == m_valBegin){
            m_map.erase(m_map.begin());
        }

    }

Popularity 2/10 Helpfulness 3/10 Language cpp

Source: stackoverflow.com

Tags: c++ k structure task

Link to this answer
Share Copy Link

Contributed on Feb 22 2024

Clumsy Camel

0 Answers Avg Quality 2/10

Task Description interval_map<K,V> is a data structure that associates keys of type K with values of type V. It is designed to be used efficiently in situations where intervals of consecutive keys are associated with the same value. Your task is to implem

Contents

More Related Answers

Task Description interval_map<K,V> is a data structure that associates keys of type K with values of type V. It is designed to be used efficiently in situations where intervals of consecutive keys are associated with the same value. Your task is to implem

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.