begin drop drop drop empty end find operator* operator[] set set size trie trie trie

set() [2/2] template<typename K , typename V , typename Hash = std::hash<K>> template<typename I > trie halcheck::lib::trie< K, V, Hash >::set ( I first, I last, V value ) const inline Constructs a new trie with a specific value replaced. Template Parameters I The type of iterator pointing into a sequence of keys. Parameters first An iterator pointing to the first element of a sequence of keys. last An iterator pointing past the last element of a sequence of keys. value The value to assign. Returns A new trie with the value of the node identified by range changed to value.