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

trie() [2/3] template<typename K , typename V , typename Hash = std::hash<K>> template<typename I > halcheck::lib::trie< K, V, Hash >::trie ( V value, I first, I last ) inlineexplicit Constructs a trie with a given value and set of children. Parameters value The value to assign to the root node. first A pointer to the beginning of a range of child trees. last A pointer to the end of a range of child trees. Postcondition trie(x, i, j) == trie(x, lib::subrange(i, j))