76         base_node* new_node = (*iter).second->deep_copy();  in copy_into()  local
78             node->_children[(*iter).first] = new_node;  in copy_into()
80             delete new_node;  in copy_into()
148                                       new_node_hook new_node)  in lookup_rw()  argument
156                 static_cast< base_node* >(new_node()) :  in lookup_rw()
179             return child.lookup_rw(key, key_pos + 1, new_node);  in lookup_rw()
226     std::unique_ptr< inner_node > new_node(new static_inner_node());  in deep_copy()  local
227     copy_into(new_node.get());  in deep_copy()
228     return new_node.release();  in deep_copy()
246                                           new_node_hook new_node)  in define()  argument
253         _children.insert(children_map::value_type(key[key_pos], new_node()));  in define()
262             child_ptr->define(key, key_pos + 1, new_node);  in define()
267                 child.define(key, key_pos + 1, new_node);  in define()
289     std::unique_ptr< inner_node > new_node(new dynamic_inner_node());  in deep_copy()  local
290     copy_into(new_node.get());  in deep_copy()
291     return new_node.release();  in deep_copy()
307     std::unique_ptr< bool_node > new_node(new bool_node());  in deep_copy()  local
308     new_node->_value = _value;  in deep_copy()
309     return new_node.release();  in deep_copy()
346     std::unique_ptr< int_node > new_node(new int_node());  in deep_copy()  local
347     new_node->_value = _value;  in deep_copy()
348     return new_node.release();  in deep_copy()
385     std::unique_ptr< string_node > new_node(new string_node());  in deep_copy()  local
386     new_node->_value = _value;  in deep_copy()
387     return new_node.release();  in deep_copy()
424     std::unique_ptr< strings_set_node > new_node(new strings_set_node());  in deep_copy()  local
425     new_node->_value = _value;  in deep_copy()
426     return new_node.release();  in deep_copy()