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

drop() [3/3] template<typename K , typename V , typename Hash = std::hash<K>> template<typename I > trie halcheck::lib::trie< K, V, Hash >::drop ( I first, I last ) const inline Gets a specific subtree. Template Parameters I The type of iterator pointing to a sequence of keys. Parameters first An iterator pointing to the beginning of a sequence of keys. last An iterator pointing one-past-the-end of a sequence of keys. Returns The subtree identified by the range (begin, end].