gtk.TreeStore.set_value

    def set_value(iter, column, value)

The set_value() method sets the data in the cell specified by iter and column to the value specified by value. The type of value must be convertible to the type of the column.

gtk.TreeStore.set

    def set(iter, ...)

The set() method sets the value of one or more cells in the row referenced by iter. The argument list following iter should contain pairs of integer column numbers followed by the value to be set. For example, to set column 0 with type gobject.TYPE_STRING to "Foo", you would write:

  store.set(iter, 0, "Foo")

gtk.TreeStore.remove

    def remove(iter)

The remove() method removes the row pointed to by iter from the treestore. After being removed, iter is set to the next valid row at that level, or invalidated if it previously pointed to the last one.

gtk.TreeStore.insert

    def insert(parent, position, row=None)

The insert() method inserts a new row at position. If parent is not None, then the row will be made a child of parent. Otherwise, the row will be created at the toplevel. If position is larger than the number of rows at that level, then the new row will be inserted to the end of the list. This method returns a gtk.TreeIter pointing at the new row. If row is not None it must be a tuple or list containing ordered column values that are used to set values in the columns of the row.

gtk.TreeStore.insert_before

    def insert_before(parent, sibling, row=None)

The insert_before() method inserts a new row before the row pointed to by sibling. If sibling is None, then the row will be appended to the children of the row pointed to by parent. If parent and sibling are None, the row will be appended to the toplevel. If both sibling and parent are set, then parent must be the parent of sibling. When sibling is set, parent is optional. This method returns a gtk.TreeIter pointing at the new row. If row is not None it must be a tuple or list containing ordered column values that are used to set values in the columns of the row.

gtk.TreeStore.insert_after

    def insert_after(parent, sibling, row=None)

The insert_after() method inserts a new row after the row pointed to by sibling. If sibling is None, then the row will be prepended to the beginning of the children of parent. If parent and sibling are None, then the row will be prepended to the toplevel. If both sibling and parent are set, parent must be the parent of sibling. When sibling is set, parent is optional. This method returns a gtk.TreeIter pointing at the new row. If row is not None it must be a tuple or list containing ordered column values that are used to set values in the columns of the row.

gtk.TreeStore.prepend

    def prepend(parent, row=None)

The prepend() method prepends a new row to the treestore. If parent is not None, the new row will be prepended before the first child of parent, otherwise it will prepend a row to the top level. This method returns a gtk.TreeIter pointing at the new row. If row is not None it must be a tuple or list containing ordered column values that are used to set values in the columns of the row.

gtk.TreeStore.append

    def append(parent, row=None)

The append() method appends a new row to the treestore. If parent is not None, the new row will be prepended after the last child of parent, otherwise it will append a row to the top level. This method returns a gtk.TreeIter pointing at the new row. If row is not None it must be a tuple or list containing ordered column values that are used to set values in the columns of the row.

gtk.TreeStore.is_ancestor

    def is_ancestor(iter, descendant)

The is_ancestor() method returns True if the row pointed to by iter is an ancestor of the row pointed to by descendant. That is, iter is the parent (or grandparent or great-grandparent) of descendant.

gtk.TreeStore.iter_depth

    def iter_depth(iter)

The iter_depth() method returns the depth of the row pointed to by iter. This will be 0 for anything on the root level, 1 for anything down a level, etc.

gtk.TreeStore.clear

    def clear()

The clear() method removes all rows from the treestore.

gtk.TreeStore.iter_is_valid

    def iter_is_valid(iter)

The iter_is_valid() method returns True if iter is a valid gtk.TreeIter for the tree store.

gtk.TreeStore.reorder

    def reorder(parent, new_order)

The reorder() method reorders the children of the tree store node pointed to by parent to match the order of the list of row numbers contained in new_order. The child nodes will be rearranged so that the gtk.TreeStore node that is at position index new_order[i] will be located at position index i. Note that this method only works with unsorted stores.

gtk.TreeStore.swap

    def swap(a, b)

The swap() method swaps the tree store nodes pointed to by a and b in the same level of the tree store. Note that this method only works with unsorted stores.

gtk.TreeStore.move_after

    def move_after(iter, position)

The move_after() method moves the tree store node specified by iter to the position after the node specified by position. iter and position should be in the same level. Note that this method only works with unsorted stores. If position is None, iter will be moved to the start of the level.

gtk.TreeStore.move_before

    def move_before(iter, position)

The move_before() method moves the tree store node pointed to by iter to the position before the node specified by position. iter and position should be in the same level. Note that this method only works with unsorted stores. If position is None, iter will be moved to the end of the level.