This file is indexed.

/usr/lib/perl5/Gtk2/TreeStore.pod is in libgtk2-perl-doc 2:1.249-2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
=head1 NAME

Gtk2::TreeStore - wrapper for GtkTreeStore

=cut

=head1 HIERARCHY

  Glib::Object
  +----Gtk2::TreeStore



=cut

=head1 INTERFACES

  Gtk2::TreeModel
  Gtk2::TreeDragSource
  Gtk2::TreeDragDest
  Gtk2::TreeSortable
  Gtk2::Buildable



=cut


=head1 METHODS

=head2 treestore = Gtk2::TreeStore-E<gt>B<new> (...)

=over

=item * ... (list) of strings, package names 

=back



=head2 treeiter = $tree_store-E<gt>B<append> ($parent)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=back

=head2 $tree_store-E<gt>B<clear> 

=head2 $tree_store-E<gt>B<set_column_types> (...)

=over

=item * ... (list) of strings, package names

=back



=head2 $tree_store-E<gt>B<set> ($iter, $col1, $val1, ...)

=over

=item * $iter (Gtk2::TreeIter) 

=item * $col1 (integer) the first column number

=item * $val1 (scalar) the first value

=item * ... (list) pairs of columns and values

=back



=head2 treeiter = $tree_store-E<gt>B<insert> ($parent, $position)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=item * $position (integer) 

=back

=head2 treeiter = $tree_store-E<gt>B<insert_after> ($parent, $sibling)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=item * $sibling (Gtk2::TreeIter or undef) 

=back

=head2 treeiter = $tree_store-E<gt>B<insert_before> ($parent, $sibling)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=item * $sibling (Gtk2::TreeIter or undef) 

=back

=head2 treeiter = $tree_store-E<gt>B<insert_with_values> ($parent, $position, ...)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=item * $position (integer) position to insert the new row

=item * ... (list) pairs of column numbers and values

=back

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

=head2 boolean = $tree_store-E<gt>B<is_ancestor> ($iter, $descendant)

=over

=item * $iter (Gtk2::TreeIter) 

=item * $descendant (Gtk2::TreeIter) 

=back

=head2 integer = $tree_store-E<gt>B<iter_depth> ($iter)

=over

=item * $iter (Gtk2::TreeIter) 

=back

=head2 boolean = $tree_store-E<gt>B<iter_is_valid> ($iter)

=over

=item * $iter (Gtk2::TreeIter) 

=back

Since: gtk+ 2.2

=head2 $tree_store-E<gt>B<move_after> ($iter, $position)

=over

=item * $iter (Gtk2::TreeIter) 

=item * $position (Gtk2::TreeIter or undef) 

=back

Since: gtk+ 2.2

=head2 $tree_store-E<gt>B<move_before> ($iter, $position)

=over

=item * $iter (Gtk2::TreeIter) 

=item * $position (Gtk2::TreeIter or undef) 

=back

Since: gtk+ 2.2

=head2 treeiter = $tree_store-E<gt>B<prepend> ($parent)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=back

=head2 boolean = $tree_store-E<gt>B<remove> ($iter)

=over

=item * $iter (Gtk2::TreeIter) 

=back

The return is always a boolean in the style of Gtk 2.2.x and up, even
when running on Gtk 2.0.x.

=head2 $tree_store-E<gt>B<reorder> ($parent, ...)

=over

=item * $parent (Gtk2::TreeIter or undef) 

=item * ... (list) of integer's, the new_order

=back



Since: gtk+ 2.2

=head2 $tree_store-E<gt>B<swap> ($a, $b)

=over

=item * $a (Gtk2::TreeIter) 

=item * $b (Gtk2::TreeIter) 

=back

Since: gtk+ 2.2

=head2 $tree_store-E<gt>B<set_value> ($iter, $col1, $val1, ...)

=over

=item * $iter (Gtk2::TreeIter) 

=item * $col1 (integer) the first column number

=item * $val1 (scalar) the first value

=item * ... (list) pairs of columns and values

=back

Alias for Gtk2::TreeStore::set().



=cut


=head1 SEE ALSO

L<Gtk2>, L<Glib::Object>


=cut


=head1 COPYRIGHT

Copyright (C) 2003-2011 by the gtk2-perl team.

This software is licensed under the LGPL.  See L<Gtk2> for a full notice.



=cut