parameters: (self, node_iter)
return_statement: return node_iter
docstring: Returns the last top level iter or None if the tree is empty
docstring_summary: Returns the last top level iter or None if the tree is empty
docstring_tokens: Returns the last top level iter or None if the tree is empty
function: def get_tree_iter_last_sibling(self, node_iter):
          """Returns the last top level iter or None if the tree is empty"""
          if node_iter == None:
              node_iter = self.treestore.get_iter_first()
              if node_iter == None: return None
          next_iter = self.treestore.iter_next(node_iter)
          while next_iter != None:
              node_iter = next_iter
              next_iter = self.treestore.iter_next(next_iter)
          return node_iter
function_tokens: def get_tree_iter_last_sibling ( self , node_iter ) : if node_iter == None : node_iter = self . treestore . get_iter_first ( ) if node_iter == None : return None next_iter = self . treestore . iter_next ( node_iter ) while next_iter != None : node_iter = next_iter next_iter = self . treestore . iter_next ( next_iter ) return node_iter