var searchIndex = {};
searchIndex["arena_tree"] = {"doc":"","items":[[3,"NodeRef","arena_tree","A reference to a node holding a value of type `T`. Nodes form a tree.",null,null],[3,"Arena","","An arena allocators for tree nodes.",null,null],[3,"Ref","","Wraps a `std::cell::Ref` for a node’s data.",null,null],[3,"RefMut","","Wraps a `std::cell::RefMut` for a node’s data.",null,null],[3,"Ancestors","","An iterator of references to the ancestors a given node.",null,null],[3,"PrecedingSiblings","","An iterator of references to the siblings before a given node.",null,null],[3,"FollowingSiblings","","An iterator of references to the siblings after a given node.",null,null],[3,"Children","","An iterator of references to the children of a given node.",null,null],[3,"ReverseChildren","","An iterator of references to the children of a given node, in reverse order.",null,null],[3,"Descendants","","An iterator of references to a given node and its descendants, in tree order.",null,null],[3,"Traverse","","An iterator of references to a given node and its descendants, in tree order.",null,null],[3,"ReverseTraverse","","An iterator of references to a given node and its descendants, in reverse tree order.",null,null],[4,"NodeEdge","","",null,null],[13,"Start","","Indicates that start of a node that has children.\nYielded by `Traverse::next` before the node’s descendants.\nIn HTML or XML, this corresponds to an opening tag like `<div>`",0,null],[13,"End","","Indicates that end of a node that has children.\nYielded by `Traverse::next` after the node’s descendants.\nIn HTML or XML, this corresponds to a closing tag like `</div>`",0,null],[11,"new","","",1,{"inputs":[],"output":{"name":"arena"}}],[11,"new_node","","Create a new node from its associated data.",1,null],[11,"clone","","",2,null],[11,"fmt","","",2,null],[11,"parent","","Return a reference to the parent node, unless this node is the root of the tree.",2,null],[11,"first_child","","Return a reference to the first child of this node, unless it has no child.",2,null],[11,"last_child","","Return a reference to the last child of this node, unless it has no child.",2,null],[11,"previous_sibling","","Return a reference to the previous sibling of this node, unless it is a first child.",2,null],[11,"next_sibling","","Return a reference to the previous sibling of this node, unless it is a first child.",2,null],[11,"borrow","","Return a shared reference to this node’s data",2,null],[11,"borrow_mut","","Return a unique/mutable reference to this node’s data",2,null],[11,"same_node","","Returns whether two references point to the same node.",2,null],[11,"ancestors","","Return an iterator of references to this node and its ancestors.",2,null],[11,"preceding_siblings","","Return an iterator of references to this node and the siblings before it.",2,null],[11,"following_siblings","","Return an iterator of references to this node and the siblings after it.",2,null],[11,"children","","Return an iterator of references to this node’s children.",2,null],[11,"reverse_children","","Return an iterator of references to this node’s children, in reverse order.",2,null],[11,"descendants","","Return an iterator of references to this node and its descendants, in tree order.",2,null],[11,"traverse","","Return an iterator of references to this node and its descendants, in tree order.",2,null],[11,"reverse_traverse","","Return an iterator of references to this node and its descendants, in tree order.",2,null],[11,"detach","","Detach a node from its parent and siblings. Children are not affected.",2,null],[11,"append","","Append a new child to this node, after existing children.",2,null],[11,"prepend","","Prepend a new child to this node, before existing children.",2,null],[11,"insert_after","","Insert a new sibling after this node.",2,null],[11,"insert_before","","Insert a new sibling before this node.",2,null],[11,"deref","","",3,null],[11,"deref","","",4,null],[11,"deref_mut","","",4,null],[11,"next","","# Panics",5,null],[11,"next","","# Panics",6,null],[11,"next","","# Panics",7,null],[11,"next","","# Panics",8,null],[11,"next","","# Panics",9,null],[11,"next","","# Panics",10,null],[11,"clone","","",0,null],[11,"fmt","","",0,null],[11,"next","","# Panics",11,null],[11,"next","","# Panics",12,null]],"paths":[[4,"NodeEdge"],[3,"Arena"],[3,"NodeRef"],[3,"Ref"],[3,"RefMut"],[3,"Ancestors"],[3,"PrecedingSiblings"],[3,"FollowingSiblings"],[3,"Children"],[3,"ReverseChildren"],[3,"Descendants"],[3,"Traverse"],[3,"ReverseTraverse"]]};
initSearch(searchIndex);