.\" Automatically generated by Pod::Man 4.10 (Pod::Simple 3.35) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is >0, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .\" .\" Avoid warning from groff about undefined register 'F'. .de IX .. .nr rF 0 .if \n(.g .if rF .nr rF 1 .if (\n(rF:(\n(.g==0)) \{\ . if \nF \{\ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{\ . nr % 0 . nr F 2 . \} . \} .\} .rr rF .\" ======================================================================== .\" .IX Title "Gtk2::TreeStore 3pm" .TH Gtk2::TreeStore 3pm "2019-09-16" "perl v5.28.1" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" Gtk2::TreeStore \- wrapper for GtkTreeStore .SH "HIERARCHY" .IX Header "HIERARCHY" .Vb 2 \& Glib::Object \& +\-\-\-\-Gtk2::TreeStore .Ve .SH "INTERFACES" .IX Header "INTERFACES" .Vb 5 \& Gtk2::TreeModel \& Gtk2::TreeDragSource \& Gtk2::TreeDragDest \& Gtk2::TreeSortable \& Gtk2::Buildable .Ve .SH "METHODS" .IX Header "METHODS" .SS "treestore = Gtk2::TreeStore\->\fBnew\fP (...)" .IX Subsection "treestore = Gtk2::TreeStore->new (...)" .IP "\(bu" 4 \&... (list) of strings, package names .ie n .SS "treeiter = $tree_store\->\fBappend\fP ($parent)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBappend\fP ($parent)" .IX Subsection "treeiter = $tree_store->append ($parent)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .ie n .SS "$tree_store\->\fBclear\fP" .el .SS "\f(CW$tree_store\fP\->\fBclear\fP" .IX Subsection "$tree_store->clear" .ie n .SS "$tree_store\->\fBset_column_types\fP (...)" .el .SS "\f(CW$tree_store\fP\->\fBset_column_types\fP (...)" .IX Subsection "$tree_store->set_column_types (...)" .IP "\(bu" 4 \&... (list) of strings, package names .ie n .SS "$tree_store\->\fBset\fP ($iter, $col1, $val1, ...)" .el .SS "\f(CW$tree_store\fP\->\fBset\fP ($iter, \f(CW$col1\fP, \f(CW$val1\fP, ...)" .IX Subsection "$tree_store->set ($iter, $col1, $val1, ...)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$col1\fR (integer) the first column number .IP "\(bu" 4 \&\f(CW$val1\fR (scalar) the first value .IP "\(bu" 4 \&... (list) pairs of columns and values .ie n .SS "treeiter = $tree_store\->\fBinsert\fP ($parent, $position)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBinsert\fP ($parent, \f(CW$position\fP)" .IX Subsection "treeiter = $tree_store->insert ($parent, $position)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .IP "\(bu" 4 \&\f(CW$position\fR (integer) .ie n .SS "treeiter = $tree_store\->\fBinsert_after\fP ($parent, $sibling)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBinsert_after\fP ($parent, \f(CW$sibling\fP)" .IX Subsection "treeiter = $tree_store->insert_after ($parent, $sibling)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .IP "\(bu" 4 \&\f(CW$sibling\fR (Gtk2::TreeIter or undef) .ie n .SS "treeiter = $tree_store\->\fBinsert_before\fP ($parent, $sibling)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBinsert_before\fP ($parent, \f(CW$sibling\fP)" .IX Subsection "treeiter = $tree_store->insert_before ($parent, $sibling)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .IP "\(bu" 4 \&\f(CW$sibling\fR (Gtk2::TreeIter or undef) .ie n .SS "treeiter = $tree_store\->\fBinsert_with_values\fP ($parent, $position, ...)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBinsert_with_values\fP ($parent, \f(CW$position\fP, ...)" .IX Subsection "treeiter = $tree_store->insert_with_values ($parent, $position, ...)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .IP "\(bu" 4 \&\f(CW$position\fR (integer) position to insert the new row .IP "\(bu" 4 \&... (list) pairs of column numbers and values .PP 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. .PP Since: gtk+ 2.10 .ie n .SS "boolean = $tree_store\->\fBis_ancestor\fP ($iter, $descendant)" .el .SS "boolean = \f(CW$tree_store\fP\->\fBis_ancestor\fP ($iter, \f(CW$descendant\fP)" .IX Subsection "boolean = $tree_store->is_ancestor ($iter, $descendant)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$descendant\fR (Gtk2::TreeIter) .ie n .SS "integer = $tree_store\->\fBiter_depth\fP ($iter)" .el .SS "integer = \f(CW$tree_store\fP\->\fBiter_depth\fP ($iter)" .IX Subsection "integer = $tree_store->iter_depth ($iter)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .ie n .SS "boolean = $tree_store\->\fBiter_is_valid\fP ($iter)" .el .SS "boolean = \f(CW$tree_store\fP\->\fBiter_is_valid\fP ($iter)" .IX Subsection "boolean = $tree_store->iter_is_valid ($iter)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .PP Since: gtk+ 2.2 .ie n .SS "$tree_store\->\fBmove_after\fP ($iter, $position)" .el .SS "\f(CW$tree_store\fP\->\fBmove_after\fP ($iter, \f(CW$position\fP)" .IX Subsection "$tree_store->move_after ($iter, $position)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$position\fR (Gtk2::TreeIter or undef) .PP Since: gtk+ 2.2 .ie n .SS "$tree_store\->\fBmove_before\fP ($iter, $position)" .el .SS "\f(CW$tree_store\fP\->\fBmove_before\fP ($iter, \f(CW$position\fP)" .IX Subsection "$tree_store->move_before ($iter, $position)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$position\fR (Gtk2::TreeIter or undef) .PP Since: gtk+ 2.2 .ie n .SS "treeiter = $tree_store\->\fBprepend\fP ($parent)" .el .SS "treeiter = \f(CW$tree_store\fP\->\fBprepend\fP ($parent)" .IX Subsection "treeiter = $tree_store->prepend ($parent)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .ie n .SS "boolean = $tree_store\->\fBremove\fP ($iter)" .el .SS "boolean = \f(CW$tree_store\fP\->\fBremove\fP ($iter)" .IX Subsection "boolean = $tree_store->remove ($iter)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .PP The return is always a boolean in the style of Gtk 2.2.x and up, even when running on Gtk 2.0.x. .ie n .SS "$tree_store\->\fBreorder\fP ($parent, ...)" .el .SS "\f(CW$tree_store\fP\->\fBreorder\fP ($parent, ...)" .IX Subsection "$tree_store->reorder ($parent, ...)" .IP "\(bu" 4 \&\f(CW$parent\fR (Gtk2::TreeIter or undef) .IP "\(bu" 4 \&... (list) of integer's, the new_order .PP Since: gtk+ 2.2 .ie n .SS "$tree_store\->\fBswap\fP ($a, $b)" .el .SS "\f(CW$tree_store\fP\->\fBswap\fP ($a, \f(CW$b\fP)" .IX Subsection "$tree_store->swap ($a, $b)" .IP "\(bu" 4 \&\f(CW$a\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$b\fR (Gtk2::TreeIter) .PP Since: gtk+ 2.2 .ie n .SS "$tree_store\->\fBset_value\fP ($iter, $col1, $val1, ...)" .el .SS "\f(CW$tree_store\fP\->\fBset_value\fP ($iter, \f(CW$col1\fP, \f(CW$val1\fP, ...)" .IX Subsection "$tree_store->set_value ($iter, $col1, $val1, ...)" .IP "\(bu" 4 \&\f(CW$iter\fR (Gtk2::TreeIter) .IP "\(bu" 4 \&\f(CW$col1\fR (integer) the first column number .IP "\(bu" 4 \&\f(CW$val1\fR (scalar) the first value .IP "\(bu" 4 \&... (list) pairs of columns and values .PP Alias for \fBGtk2::TreeStore::set()\fR. .SH "SEE ALSO" .IX Header "SEE ALSO" Gtk2, Glib::Object .SH "COPYRIGHT" .IX Header "COPYRIGHT" Copyright (C) 2003\-2011 by the gtk2\-perl team. .PP This software is licensed under the \s-1LGPL.\s0 See Gtk2 for a full notice.