summaryrefslogtreecommitdiff
path: root/gtk/gtktreeview.h
diff options
context:
space:
mode:
authorPavel Holejsovsky <pholejs@src.gnome.org>2011-01-18 06:28:24 +0100
committerPavel Holejsovsky <pholejs@src.gnome.org>2011-01-18 17:20:32 +0100
commit729c82395539897e276f4dec41550de9b2a0db88 (patch)
tree8494100959c1ffd50741a9fe8909d6cca7e63745 /gtk/gtktreeview.h
parent714d9bc4078898bfb9513e5e17c2bb3c935eef5f (diff)
downloadgtk+-729c82395539897e276f4dec41550de9b2a0db88.tar.gz
[GI] Mark callbacks' context parameter with (closure) annotation.
Diffstat (limited to 'gtk/gtktreeview.h')
-rw-r--r--gtk/gtktreeview.h6
1 files changed, 3 insertions, 3 deletions
diff --git a/gtk/gtktreeview.h b/gtk/gtktreeview.h
index 9e2227b026..80aa134af6 100644
--- a/gtk/gtktreeview.h
+++ b/gtk/gtktreeview.h
@@ -129,7 +129,7 @@ struct _GtkTreeViewClass
* @column: The #GtkTreeViewColumn being dragged
* @prev_column: A #GtkTreeViewColumn on one side of @column
* @next_column: A #GtkTreeViewColumn on the other side of @column
- * @data: user data
+ * @data: (closure): user data
*
* Function type for determining whether @column can be dropped in a
* particular spot (as determined by @prev_column and @next_column). In
@@ -167,7 +167,7 @@ typedef void (* GtkTreeViewMappingFunc) (GtkTreeView *tree_vi
* @key: the key string to compare with
* @iter: a #GtkTreeIter pointing the row of @model that should be compared
* with @key.
- * @search_data: user data from gtk_tree_view_set_search_equal_func()
+ * @search_data: (closure): user data from gtk_tree_view_set_search_equal_func()
*
* A function used for checking whether a row in @model matches
* a search key string entered by the user. Note the return value
@@ -186,7 +186,7 @@ typedef gboolean (*GtkTreeViewSearchEqualFunc) (GtkTreeModel *model,
* GtkTreeViewRowSeparatorFunc:
* @model: the #GtkTreeModel
* @iter: a #GtkTreeIter pointing at a row in @model
- * @data: user data
+ * @data: (closure): user data
*
* Function type for determining whether the row pointed to by @iter should
* be rendered as a separator. A common way to implement this is to have a