|
NAMEGtk2::TreeStore - wrapper for GtkTreeStoreHIERARCHYGlib::Object +----Gtk2::TreeStore INTERFACESGtk2::TreeModel Gtk2::TreeDragSource Gtk2::TreeDragDest Gtk2::TreeSortable Gtk2::Buildable METHODStreestore = Gtk2::TreeStore->new (...)
treeiter = $tree_store->append ($parent)
$tree_store->clear$tree_store->set_column_types (...)
$tree_store->set ($iter, $col1, $val1, ...)
treeiter = $tree_store->insert ($parent, $position)
treeiter = $tree_store->insert_after ($parent, $sibling)
treeiter = $tree_store->insert_before ($parent, $sibling)
treeiter = $tree_store->insert_with_values ($parent, $position, ...)
Like doing insert followed by set, except that insert_with_values emits only the row-inserted signal, rather than row-inserted, row-changed, and, if the store is sorted, rows-reordered as in the multiple-operation case. Since emitting the rows-reordered signal repeatedly can affect the performance of the program, insert_with_values should generally be preferred when inserting rows in a sorted tree store. Since: gtk+ 2.10 boolean = $tree_store->is_ancestor ($iter, $descendant)
integer = $tree_store->iter_depth ($iter)
boolean = $tree_store->iter_is_valid ($iter)
Since: gtk+ 2.2 $tree_store->move_after ($iter, $position)
Since: gtk+ 2.2 $tree_store->move_before ($iter, $position)
Since: gtk+ 2.2 treeiter = $tree_store->prepend ($parent)
boolean = $tree_store->remove ($iter)
The return is always a boolean in the style of Gtk 2.2.x and up, even when running on Gtk 2.0.x. $tree_store->reorder ($parent, ...)
Since: gtk+ 2.2 $tree_store->swap ($a, $b)
Since: gtk+ 2.2 $tree_store->set_value ($iter, $col1, $val1, ...)
Alias for Gtk2::TreeStore::set(). SEE ALSOGtk2, Glib::ObjectCOPYRIGHTCopyright (C) 2003-2011 by the gtk2-perl team.This software is licensed under the LGPL. See Gtk2 for a full notice.
Visit the GSP FreeBSD Man Page Interface. |