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 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
|
/*
* Copyright (c) 2003 by the gtk2-perl team (see the file AUTHORS)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307 USA.
*
* $Header: /cvsroot/gtk2-perl/gtk2-perl-xs/Gtk2/xs/GtkListStore.xs,v 1.24 2005/09/29 22:28:45 kaffeetisch Exp $
*/
#include "gtk2perl.h"
MODULE = Gtk2::ListStore PACKAGE = Gtk2::ListStore PREFIX = gtk_list_store_
BOOT:
/* must prepend TreeModel in the hierarchy so that
* Gtk2::TreeModel::get isn't masked by Glib::Object::get.
* should we change the api to something unique, instead? */
gperl_prepend_isa ("Gtk2::ListStore", "Gtk2::TreeModel");
## GtkListStore* gtk_list_store_new (gint n_columns, ...);
=for apidoc
=for arg ... of strings
=cut
GtkListStore_noinc*
gtk_list_store_new (class, ...)
PREINIT:
GArray * typearray;
CODE:
GTK2PERL_STACK_ITEMS_TO_GTYPE_ARRAY (typearray, 1, items-1);
RETVAL = gtk_list_store_newv (typearray->len, (GType*)typearray->data);
g_array_free (typearray, TRUE);
OUTPUT:
RETVAL
# for initializing GListStores derived in perl
## void gtk_list_store_set_column_types (GtkListStore *list_store, gint n_columns, GType *types)
=for apidoc
=for arg ... of strings
=cut
void
gtk_list_store_set_column_types (list_store, ...)
GtkListStore *list_store
PREINIT:
GArray * typearray;
CODE:
GTK2PERL_STACK_ITEMS_TO_GTYPE_ARRAY (typearray, 1, items-1);
gtk_list_store_set_column_types (list_store, typearray->len,
(GType*)(typearray->data));
g_array_free (typearray, TRUE);
## void gtk_list_store_set (GtkListStore *list_store, GtkTreeIter *iter, ...)
=for apidoc Gtk2::ListStore::set_value
=for signature $list_store->set_value ($iter, $col, $val)
=for arg col (integer)
=for arg val (scalar)
=for arg col1 (__hide__)
=for arg val1 (__hide__)
=for arg ... (__hide__)
=cut
=for apidoc
=for arg col1 (integer) the first column number
=for arg val1 (scalar) the first value
=for arg ... pairs of column numbers and values
=cut
void
gtk_list_store_set (list_store, iter, col1, val1, ...)
GtkListStore *list_store
GtkTreeIter *iter
ALIAS:
Gtk2::ListStore::set_value = 1
PREINIT:
int i, ncols;
CODE:
PERL_UNUSED_VAR (ix);
/* require at least one pair --- that means there needs to be
* four items on the stack. also require that the stack has an
* even number of items on it. */
if (items < 4 || 0 != (items % 2)) {
/* caller didn't specify an even number of parameters... */
croak ("Usage: $liststore->set ($iter, column1, value1, column2, value2, ...)\n"
" there must be a value for every column number");
}
ncols = gtk_tree_model_get_n_columns (GTK_TREE_MODEL (list_store));
for (i = 2 ; i < items ; i+= 2) {
gint column;
GValue gvalue = {0, };
if (!looks_like_number (ST (i)))
croak ("Usage: $liststore->set ($iter, column1, value1, column2, value2, ...)\n"
" the first value in each pair must be a column number");
column = SvIV (ST (i));
/* warn (" %d %d %s\n", i, column, SvPV_nolen (ST (i+1))); */
if (column >= 0 && column < ncols) {
g_value_init (&gvalue,
gtk_tree_model_get_column_type
(GTK_TREE_MODEL (list_store),
column));
/* gperl_value_from_sv either succeeds or croaks. */
gperl_value_from_sv (&gvalue, ST (i+1));
gtk_list_store_set_value (GTK_LIST_STORE (list_store),
iter, column, &gvalue);
g_value_unset (&gvalue);
} else {
warn ("can't set value for column %d, model only has %d columns",
column, ncols);
}
}
## see Gtk2::ListStore::set
## void gtk_list_store_set_valist (GtkListStore *list_store, GtkTreeIter *iter, va_list var_args)
### we're trying to hide things like GValue from the perl level!
### void gtk_list_store_set_value (GtkListStore *list_store, GtkTreeIter *iter, gint column, GValue *value)
## gboolean gtk_list_store_remove (GtkListStore *list_store, GtkTreeIter *iter)
gboolean
gtk_list_store_remove (list_store, iter)
GtkListStore *list_store
GtkTreeIter *iter
CODE:
#if GTK_CHECK_VERSION(2,2,0)
RETVAL = gtk_list_store_remove (list_store, iter);
#else
/* void return in 2.0.x; always return FALSE from this function
* in that case; FIXME the alternative is to implement the missing
* functionality right here. */
gtk_list_store_remove (list_store, iter);
RETVAL = FALSE;
#endif
OUTPUT:
RETVAL
## void gtk_list_store_insert (GtkListStore *list_store, GtkTreeIter *iter, gint position)
GtkTreeIter_copy *
gtk_list_store_insert (list_store, position)
GtkListStore *list_store
gint position
PREINIT:
GtkTreeIter iter = {0,};
CODE:
gtk_list_store_insert (list_store, &iter, position);
RETVAL = &iter; /* the _copy on the return type means we'll copy
* this before the function returns. */
OUTPUT:
RETVAL
## void gtk_list_store_insert_before (GtkListStore *list_store, GtkTreeIter *iter, GtkTreeIter *sibling)
## void gtk_list_store_insert_after (GtkListStore *list_store, GtkTreeIter *iter, GtkTreeIter *sibling)
GtkTreeIter_copy *
gtk_list_store_insert_before (list_store, sibling)
GtkListStore * list_store
GtkTreeIter_ornull * sibling
ALIAS:
Gtk2::ListStore::insert_after = 1
PREINIT:
GtkTreeIter iter;
CODE:
if (ix == 0)
gtk_list_store_insert_before (list_store, &iter, sibling);
else
gtk_list_store_insert_after (list_store, &iter, sibling);
RETVAL = &iter;
OUTPUT:
RETVAL
#if GTK_CHECK_VERSION (2, 6, 0)
## void gtk_list_store_insert_with_values (GtkListStore *list_store, GtkTreeIter *iter, gint position, ...);
=for apidoc
=for arg position position to insert the new row
=for arg ... pairs of column numbers and values
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 list store.
=cut
GtkTreeIter_copy *
gtk_list_store_insert_with_values (GtkListStore *list_store, gint position, ...);
PREINIT:
gint n_cols, i;
GtkTreeIter iter;
gint * columns = NULL;
GValue * values = NULL;
gint n_values;
const char * errfmt = "Usage: $iter = $liststore->insert_with_values ($position, column1, value1, ...)\n %s";
CODE:
if (items < 2 || 0 != (items % 2))
croak (errfmt, "There must be a value for every column number");
/*
* we could jump through hoops to prevent leaking arrays and
* initialized GValues here on column validation croaks, but
* since gperl_value_from_sv() croaks (and we can't catch it
* without major work), and since column index validatio errors
* mean there's a programming error anyway, we won't worry about
* any of that.
*/
n_cols = gtk_tree_model_get_n_columns (GTK_TREE_MODEL (list_store));
n_values = (items - 2) / 2;
if (n_values > 0) {
columns = gperl_alloc_temp (sizeof (gint) * n_values);
/* gperl_alloc_temp() calls memset(), so we don't need to do
* anything else special to prepare these GValues. */
values = gperl_alloc_temp (sizeof (GValue) * n_values);
for (i = 0 ; i < n_values ; i ++) {
if (! looks_like_number (ST (2 + i*2)))
croak (errfmt, "The first value in each pair must be a column index number");
columns[i] = SvIV (ST (2 + i*2));
if (! (columns[i] >= 0 && columns[i] < n_cols))
croak (errfmt, form ("Bad column index %d, model only has %d columns",
columns[i], n_cols));
g_value_init (values + i,
gtk_tree_model_get_column_type
(GTK_TREE_MODEL (list_store),
columns[i]));
gperl_value_from_sv (values + i, ST (2 + i*2 + 1));
}
}
gtk_list_store_insert_with_valuesv (list_store, &iter, position,
columns, values, n_values);
for (i = 0 ; i < n_values ; i++)
g_value_unset (values + i);
RETVAL = &iter;
OUTPUT:
RETVAL
#endif
## void gtk_list_store_prepend (GtkListStore *list_store, GtkTreeIter *iter)
## void gtk_list_store_append (GtkListStore *list_store, GtkTreeIter *iter)
GtkTreeIter_copy *
gtk_list_store_prepend (list_store)
GtkListStore *list_store
ALIAS:
Gtk2::ListStore::append = 1
PREINIT:
GtkTreeIter iter;
CODE:
if (ix == 0)
gtk_list_store_prepend (list_store, &iter);
else
gtk_list_store_append (list_store, &iter);
RETVAL = &iter;
OUTPUT:
RETVAL
## void gtk_list_store_clear (GtkListStore *list_store)
void
gtk_list_store_clear (list_store)
GtkListStore *list_store
#if GTK_CHECK_VERSION(2,2,0)
## warning, slow, use only for debugging
## gboolean gtk_list_store_iter_is_valid (GtkListStore *list_store, GtkTreeIter *iter)
gboolean
gtk_list_store_iter_is_valid (list_store, iter)
GtkListStore *list_store
GtkTreeIter *iter
## void gtk_list_store_reorder (GtkListStore *store, gint *new_order)
=for apidoc
=for arg ... of integers the reordered posistions
Reorders store to follow the order indicated by new_order. Note that this
function only works with unsorted stores.
A list of position should be passed, one for each item in the list.
=cut
void
gtk_list_store_reorder (store, ...)
GtkListStore * store
PREINIT:
gint * new_order;
CODE:
if( (items-1) != store->length )
croak("xs: gtk_list_store_reorder: wrong number of "
"positions passed");
items--;
new_order = (gint*)g_new(gint, items);
for( ; items > 0; items-- )
new_order[items-1] = SvIV(ST(items));
gtk_list_store_reorder(store, new_order);
g_free(new_order);
## void gtk_list_store_swap (GtkListStore *store, GtkTreeIter *a, GtkTreeIter *b)
void
gtk_list_store_swap (store, a, b)
GtkListStore * store
GtkTreeIter * a
GtkTreeIter * b
## void gtk_list_store_move_after (GtkListStore *store, GtkTreeIter *iter, GtkTreeIter *position)
void
gtk_list_store_move_after (store, iter, position)
GtkListStore * store
GtkTreeIter * iter
GtkTreeIter_ornull * position
## void gtk_list_store_move_before (GtkListStore *store, GtkTreeIter *iter, GtkTreeIter *position)
void
gtk_list_store_move_before (store, iter, position)
GtkListStore * store
GtkTreeIter * iter
GtkTreeIter_ornull * position
#endif /* >= 2.2.0 */
|