mirror of
https://github.com/varun-r-mallya/sysprof.git
synced 2025-12-31 20:36:25 +00:00
Add forked copies of gtktreestore.[ch] and gtktreedatalist.[ch]
This commit is contained in:
@ -41,6 +41,10 @@ if BUILD_GUI
|
||||
|
||||
sysprof_SOURCES = \
|
||||
$(SYSPROF_CORE) \
|
||||
footreestore.c \
|
||||
footreestore.h \
|
||||
footreedatalist.h \
|
||||
footreedatalist.c \
|
||||
treeviewutils.h \
|
||||
treeviewutils.c \
|
||||
sysprof.c
|
||||
|
||||
555
footreedatalist.c
Normal file
555
footreedatalist.c
Normal file
@ -0,0 +1,555 @@
|
||||
/* gtktreedatalist.c
|
||||
* Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
|
||||
*
|
||||
* 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 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.
|
||||
*
|
||||
* This file contains code shared between GtkTreeStore and GtkListStore. Please
|
||||
* do not use it.
|
||||
*/
|
||||
|
||||
#include "footreedatalist.h"
|
||||
#include <string.h>
|
||||
|
||||
/* node allocation
|
||||
*/
|
||||
FooTreeDataList *
|
||||
_foo_tree_data_list_alloc (void)
|
||||
{
|
||||
FooTreeDataList *list;
|
||||
|
||||
list = g_slice_new0 (FooTreeDataList);
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
void
|
||||
_foo_tree_data_list_free (FooTreeDataList *list,
|
||||
GType *column_headers)
|
||||
{
|
||||
FooTreeDataList *tmp, *next;
|
||||
gint i = 0;
|
||||
|
||||
tmp = list;
|
||||
|
||||
while (tmp)
|
||||
{
|
||||
next = tmp->next;
|
||||
if (g_type_is_a (column_headers [i], G_TYPE_STRING))
|
||||
g_free ((gchar *) tmp->data.v_pointer);
|
||||
else if (g_type_is_a (column_headers [i], G_TYPE_OBJECT) && tmp->data.v_pointer != NULL)
|
||||
g_object_unref (tmp->data.v_pointer);
|
||||
else if (g_type_is_a (column_headers [i], G_TYPE_BOXED) && tmp->data.v_pointer != NULL)
|
||||
g_boxed_free (column_headers [i], (gpointer) tmp->data.v_pointer);
|
||||
|
||||
g_slice_free (FooTreeDataList, tmp);
|
||||
i++;
|
||||
tmp = next;
|
||||
}
|
||||
}
|
||||
|
||||
gboolean
|
||||
_foo_tree_data_list_check_type (GType type)
|
||||
{
|
||||
gint i = 0;
|
||||
static const GType type_list[] =
|
||||
{
|
||||
G_TYPE_BOOLEAN,
|
||||
G_TYPE_CHAR,
|
||||
G_TYPE_UCHAR,
|
||||
G_TYPE_INT,
|
||||
G_TYPE_UINT,
|
||||
G_TYPE_LONG,
|
||||
G_TYPE_ULONG,
|
||||
G_TYPE_INT64,
|
||||
G_TYPE_UINT64,
|
||||
G_TYPE_ENUM,
|
||||
G_TYPE_FLAGS,
|
||||
G_TYPE_FLOAT,
|
||||
G_TYPE_DOUBLE,
|
||||
G_TYPE_STRING,
|
||||
G_TYPE_POINTER,
|
||||
G_TYPE_BOXED,
|
||||
G_TYPE_OBJECT,
|
||||
G_TYPE_INVALID
|
||||
};
|
||||
|
||||
if (! G_TYPE_IS_VALUE_TYPE (type))
|
||||
return FALSE;
|
||||
|
||||
|
||||
while (type_list[i] != G_TYPE_INVALID)
|
||||
{
|
||||
if (g_type_is_a (type, type_list[i]))
|
||||
return TRUE;
|
||||
i++;
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
static inline GType
|
||||
get_fundamental_type (GType type)
|
||||
{
|
||||
GType result;
|
||||
|
||||
result = G_TYPE_FUNDAMENTAL (type);
|
||||
|
||||
if (result == G_TYPE_INTERFACE)
|
||||
{
|
||||
if (g_type_is_a (type, G_TYPE_OBJECT))
|
||||
result = G_TYPE_OBJECT;
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
void
|
||||
_foo_tree_data_list_node_to_value (FooTreeDataList *list,
|
||||
GType type,
|
||||
GValue *value)
|
||||
{
|
||||
g_value_init (value, type);
|
||||
|
||||
switch (get_fundamental_type (type))
|
||||
{
|
||||
case G_TYPE_BOOLEAN:
|
||||
g_value_set_boolean (value, (gboolean) list->data.v_int);
|
||||
break;
|
||||
case G_TYPE_CHAR:
|
||||
g_value_set_char (value, (gchar) list->data.v_char);
|
||||
break;
|
||||
case G_TYPE_UCHAR:
|
||||
g_value_set_uchar (value, (guchar) list->data.v_uchar);
|
||||
break;
|
||||
case G_TYPE_INT:
|
||||
g_value_set_int (value, (gint) list->data.v_int);
|
||||
break;
|
||||
case G_TYPE_UINT:
|
||||
g_value_set_uint (value, (guint) list->data.v_uint);
|
||||
break;
|
||||
case G_TYPE_LONG:
|
||||
g_value_set_long (value, list->data.v_long);
|
||||
break;
|
||||
case G_TYPE_ULONG:
|
||||
g_value_set_ulong (value, list->data.v_ulong);
|
||||
break;
|
||||
case G_TYPE_INT64:
|
||||
g_value_set_int64 (value, list->data.v_int64);
|
||||
break;
|
||||
case G_TYPE_UINT64:
|
||||
g_value_set_uint64 (value, list->data.v_uint64);
|
||||
break;
|
||||
case G_TYPE_ENUM:
|
||||
g_value_set_enum (value, list->data.v_int);
|
||||
break;
|
||||
case G_TYPE_FLAGS:
|
||||
g_value_set_flags (value, list->data.v_uint);
|
||||
break;
|
||||
case G_TYPE_FLOAT:
|
||||
g_value_set_float (value, (gfloat) list->data.v_float);
|
||||
break;
|
||||
case G_TYPE_DOUBLE:
|
||||
g_value_set_double (value, (gdouble) list->data.v_double);
|
||||
break;
|
||||
case G_TYPE_STRING:
|
||||
g_value_set_string (value, (gchar *) list->data.v_pointer);
|
||||
break;
|
||||
case G_TYPE_POINTER:
|
||||
g_value_set_pointer (value, (gpointer) list->data.v_pointer);
|
||||
break;
|
||||
case G_TYPE_BOXED:
|
||||
g_value_set_boxed (value, (gpointer) list->data.v_pointer);
|
||||
break;
|
||||
case G_TYPE_OBJECT:
|
||||
g_value_set_object (value, (GObject *) list->data.v_pointer);
|
||||
break;
|
||||
default:
|
||||
g_warning ("%s: Unsupported type (%s) retrieved.", G_STRLOC, g_type_name (value->g_type));
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
_foo_tree_data_list_value_to_node (FooTreeDataList *list,
|
||||
GValue *value)
|
||||
{
|
||||
switch (get_fundamental_type (G_VALUE_TYPE (value)))
|
||||
{
|
||||
case G_TYPE_BOOLEAN:
|
||||
list->data.v_int = g_value_get_boolean (value);
|
||||
break;
|
||||
case G_TYPE_CHAR:
|
||||
list->data.v_char = g_value_get_char (value);
|
||||
break;
|
||||
case G_TYPE_UCHAR:
|
||||
list->data.v_uchar = g_value_get_uchar (value);
|
||||
break;
|
||||
case G_TYPE_INT:
|
||||
list->data.v_int = g_value_get_int (value);
|
||||
break;
|
||||
case G_TYPE_UINT:
|
||||
list->data.v_uint = g_value_get_uint (value);
|
||||
break;
|
||||
case G_TYPE_LONG:
|
||||
list->data.v_long = g_value_get_long (value);
|
||||
break;
|
||||
case G_TYPE_ULONG:
|
||||
list->data.v_ulong = g_value_get_ulong (value);
|
||||
break;
|
||||
case G_TYPE_INT64:
|
||||
list->data.v_int64 = g_value_get_int64 (value);
|
||||
break;
|
||||
case G_TYPE_UINT64:
|
||||
list->data.v_uint64 = g_value_get_uint64 (value);
|
||||
break;
|
||||
case G_TYPE_ENUM:
|
||||
list->data.v_int = g_value_get_enum (value);
|
||||
break;
|
||||
case G_TYPE_FLAGS:
|
||||
list->data.v_uint = g_value_get_flags (value);
|
||||
break;
|
||||
case G_TYPE_POINTER:
|
||||
list->data.v_pointer = g_value_get_pointer (value);
|
||||
break;
|
||||
case G_TYPE_FLOAT:
|
||||
list->data.v_float = g_value_get_float (value);
|
||||
break;
|
||||
case G_TYPE_DOUBLE:
|
||||
list->data.v_double = g_value_get_double (value);
|
||||
break;
|
||||
case G_TYPE_STRING:
|
||||
g_free (list->data.v_pointer);
|
||||
list->data.v_pointer = g_value_dup_string (value);
|
||||
break;
|
||||
case G_TYPE_OBJECT:
|
||||
if (list->data.v_pointer)
|
||||
g_object_unref (list->data.v_pointer);
|
||||
list->data.v_pointer = g_value_dup_object (value);
|
||||
break;
|
||||
case G_TYPE_BOXED:
|
||||
if (list->data.v_pointer)
|
||||
g_boxed_free (G_VALUE_TYPE (value), list->data.v_pointer);
|
||||
list->data.v_pointer = g_value_dup_boxed (value);
|
||||
break;
|
||||
default:
|
||||
g_warning ("%s: Unsupported type (%s) stored.", G_STRLOC, g_type_name (G_VALUE_TYPE (value)));
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
FooTreeDataList *
|
||||
_foo_tree_data_list_node_copy (FooTreeDataList *list,
|
||||
GType type)
|
||||
{
|
||||
FooTreeDataList *new_list;
|
||||
|
||||
g_return_val_if_fail (list != NULL, NULL);
|
||||
|
||||
new_list = _foo_tree_data_list_alloc ();
|
||||
new_list->next = NULL;
|
||||
|
||||
switch (get_fundamental_type (type))
|
||||
{
|
||||
case G_TYPE_BOOLEAN:
|
||||
case G_TYPE_CHAR:
|
||||
case G_TYPE_UCHAR:
|
||||
case G_TYPE_INT:
|
||||
case G_TYPE_UINT:
|
||||
case G_TYPE_LONG:
|
||||
case G_TYPE_ULONG:
|
||||
case G_TYPE_INT64:
|
||||
case G_TYPE_UINT64:
|
||||
case G_TYPE_ENUM:
|
||||
case G_TYPE_FLAGS:
|
||||
case G_TYPE_POINTER:
|
||||
case G_TYPE_FLOAT:
|
||||
case G_TYPE_DOUBLE:
|
||||
new_list->data = list->data;
|
||||
break;
|
||||
case G_TYPE_STRING:
|
||||
new_list->data.v_pointer = g_strdup (list->data.v_pointer);
|
||||
break;
|
||||
case G_TYPE_OBJECT:
|
||||
case G_TYPE_INTERFACE:
|
||||
new_list->data.v_pointer = list->data.v_pointer;
|
||||
if (new_list->data.v_pointer)
|
||||
g_object_ref (new_list->data.v_pointer);
|
||||
break;
|
||||
case G_TYPE_BOXED:
|
||||
if (list->data.v_pointer)
|
||||
new_list->data.v_pointer = g_boxed_copy (type, list->data.v_pointer);
|
||||
else
|
||||
new_list->data.v_pointer = NULL;
|
||||
break;
|
||||
default:
|
||||
g_warning ("Unsupported node type (%s) copied.", g_type_name (type));
|
||||
break;
|
||||
}
|
||||
|
||||
return new_list;
|
||||
}
|
||||
|
||||
gint
|
||||
_foo_tree_data_list_compare_func (GtkTreeModel *model,
|
||||
GtkTreeIter *a,
|
||||
GtkTreeIter *b,
|
||||
gpointer user_data)
|
||||
{
|
||||
gint column = GPOINTER_TO_INT (user_data);
|
||||
GType type = gtk_tree_model_get_column_type (model, column);
|
||||
GValue a_value = {0, };
|
||||
GValue b_value = {0, };
|
||||
gint retval;
|
||||
const gchar *stra, *strb;
|
||||
|
||||
gtk_tree_model_get_value (model, a, column, &a_value);
|
||||
gtk_tree_model_get_value (model, b, column, &b_value);
|
||||
|
||||
switch (get_fundamental_type (type))
|
||||
{
|
||||
case G_TYPE_BOOLEAN:
|
||||
if (g_value_get_boolean (&a_value) < g_value_get_boolean (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_boolean (&a_value) == g_value_get_boolean (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_CHAR:
|
||||
if (g_value_get_char (&a_value) < g_value_get_char (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_char (&a_value) == g_value_get_char (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_UCHAR:
|
||||
if (g_value_get_uchar (&a_value) < g_value_get_uchar (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_uchar (&a_value) == g_value_get_uchar (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_INT:
|
||||
if (g_value_get_int (&a_value) < g_value_get_int (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_int (&a_value) == g_value_get_int (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_UINT:
|
||||
if (g_value_get_uint (&a_value) < g_value_get_uint (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_uint (&a_value) == g_value_get_uint (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_LONG:
|
||||
if (g_value_get_long (&a_value) < g_value_get_long (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_long (&a_value) == g_value_get_long (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_ULONG:
|
||||
if (g_value_get_ulong (&a_value) < g_value_get_ulong (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_ulong (&a_value) == g_value_get_ulong (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_INT64:
|
||||
if (g_value_get_int64 (&a_value) < g_value_get_int64 (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_int64 (&a_value) == g_value_get_int64 (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_UINT64:
|
||||
if (g_value_get_uint64 (&a_value) < g_value_get_uint64 (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_uint64 (&a_value) == g_value_get_uint64 (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_ENUM:
|
||||
/* this is somewhat bogus. */
|
||||
if (g_value_get_enum (&a_value) < g_value_get_enum (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_enum (&a_value) == g_value_get_enum (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_FLAGS:
|
||||
/* this is even more bogus. */
|
||||
if (g_value_get_flags (&a_value) < g_value_get_flags (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_flags (&a_value) == g_value_get_flags (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_FLOAT:
|
||||
if (g_value_get_float (&a_value) < g_value_get_float (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_float (&a_value) == g_value_get_float (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_DOUBLE:
|
||||
if (g_value_get_double (&a_value) < g_value_get_double (&b_value))
|
||||
retval = -1;
|
||||
else if (g_value_get_double (&a_value) == g_value_get_double (&b_value))
|
||||
retval = 0;
|
||||
else
|
||||
retval = 1;
|
||||
break;
|
||||
case G_TYPE_STRING:
|
||||
stra = g_value_get_string (&a_value);
|
||||
strb = g_value_get_string (&b_value);
|
||||
if (stra == NULL) stra = "";
|
||||
if (strb == NULL) strb = "";
|
||||
retval = g_utf8_collate (stra, strb);
|
||||
break;
|
||||
case G_TYPE_POINTER:
|
||||
case G_TYPE_BOXED:
|
||||
case G_TYPE_OBJECT:
|
||||
default:
|
||||
g_warning ("Attempting to sort on invalid type %s\n", g_type_name (type));
|
||||
retval = FALSE;
|
||||
break;
|
||||
}
|
||||
|
||||
g_value_unset (&a_value);
|
||||
g_value_unset (&b_value);
|
||||
|
||||
return retval;
|
||||
}
|
||||
|
||||
|
||||
GList *
|
||||
_foo_tree_data_list_header_new (gint n_columns,
|
||||
GType *types)
|
||||
{
|
||||
GList *retval = NULL;
|
||||
|
||||
gint i;
|
||||
|
||||
for (i = 0; i < n_columns; i ++)
|
||||
{
|
||||
GtkTreeDataSortHeader *header;
|
||||
|
||||
header = g_slice_new (GtkTreeDataSortHeader);
|
||||
|
||||
retval = g_list_prepend (retval, header);
|
||||
header->sort_column_id = i;
|
||||
header->func = _foo_tree_data_list_compare_func;
|
||||
header->destroy = NULL;
|
||||
header->data = GINT_TO_POINTER (i);
|
||||
}
|
||||
return g_list_reverse (retval);
|
||||
}
|
||||
|
||||
void
|
||||
_foo_tree_data_list_header_free (GList *list)
|
||||
{
|
||||
GList *tmp;
|
||||
|
||||
for (tmp = list; tmp; tmp = tmp->next)
|
||||
{
|
||||
GtkTreeDataSortHeader *header = (GtkTreeDataSortHeader *) tmp->data;
|
||||
|
||||
if (header->destroy)
|
||||
{
|
||||
GDestroyNotify d = header->destroy;
|
||||
|
||||
header->destroy = NULL;
|
||||
d (header->data);
|
||||
}
|
||||
|
||||
g_slice_free (GtkTreeDataSortHeader, header);
|
||||
}
|
||||
g_list_free (list);
|
||||
}
|
||||
|
||||
GtkTreeDataSortHeader *
|
||||
_foo_tree_data_list_get_header (GList *header_list,
|
||||
gint sort_column_id)
|
||||
{
|
||||
GtkTreeDataSortHeader *header = NULL;
|
||||
|
||||
for (; header_list; header_list = header_list->next)
|
||||
{
|
||||
header = (GtkTreeDataSortHeader*) header_list->data;
|
||||
if (header->sort_column_id == sort_column_id)
|
||||
return header;
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
|
||||
GList *
|
||||
_foo_tree_data_list_set_header (GList *header_list,
|
||||
gint sort_column_id,
|
||||
GtkTreeIterCompareFunc func,
|
||||
gpointer data,
|
||||
GDestroyNotify destroy)
|
||||
{
|
||||
GList *list = header_list;
|
||||
GtkTreeDataSortHeader *header = NULL;
|
||||
|
||||
for (; list; list = list->next)
|
||||
{
|
||||
header = (GtkTreeDataSortHeader*) list->data;
|
||||
if (header->sort_column_id == sort_column_id)
|
||||
break;
|
||||
header = NULL;
|
||||
|
||||
if (list->next == NULL)
|
||||
break;
|
||||
}
|
||||
|
||||
if (header == NULL)
|
||||
{
|
||||
header = g_slice_new0 (GtkTreeDataSortHeader);
|
||||
header->sort_column_id = sort_column_id;
|
||||
if (list)
|
||||
list = g_list_append (list, header);
|
||||
else
|
||||
header_list = g_list_append (header_list, header);
|
||||
}
|
||||
|
||||
if (header->destroy)
|
||||
{
|
||||
GDestroyNotify d = header->destroy;
|
||||
|
||||
header->destroy = NULL;
|
||||
d (header->data);
|
||||
}
|
||||
|
||||
header->func = func;
|
||||
header->data = data;
|
||||
header->destroy = destroy;
|
||||
|
||||
return header_list;
|
||||
}
|
||||
82
footreedatalist.h
Normal file
82
footreedatalist.h
Normal file
@ -0,0 +1,82 @@
|
||||
/* gtktreedatalist.h
|
||||
* Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
|
||||
*
|
||||
* 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 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.
|
||||
*/
|
||||
|
||||
#ifndef __GTK_TREE_DATA_LIST_H__
|
||||
#define __GTK_TREE_DATA_LIST_H__
|
||||
|
||||
#include <gtk/gtk.h>
|
||||
|
||||
typedef struct _FooTreeDataList FooTreeDataList;
|
||||
struct _FooTreeDataList
|
||||
{
|
||||
FooTreeDataList *next;
|
||||
|
||||
union {
|
||||
gint v_int;
|
||||
gint8 v_char;
|
||||
guint8 v_uchar;
|
||||
guint v_uint;
|
||||
glong v_long;
|
||||
gulong v_ulong;
|
||||
gint64 v_int64;
|
||||
guint64 v_uint64;
|
||||
gfloat v_float;
|
||||
gdouble v_double;
|
||||
gpointer v_pointer;
|
||||
} data;
|
||||
};
|
||||
|
||||
typedef struct _GtkTreeDataSortHeader
|
||||
{
|
||||
gint sort_column_id;
|
||||
GtkTreeIterCompareFunc func;
|
||||
gpointer data;
|
||||
GDestroyNotify destroy;
|
||||
} GtkTreeDataSortHeader;
|
||||
|
||||
FooTreeDataList *_foo_tree_data_list_alloc (void);
|
||||
void _foo_tree_data_list_free (FooTreeDataList *list,
|
||||
GType *column_headers);
|
||||
gboolean _foo_tree_data_list_check_type (GType type);
|
||||
void _foo_tree_data_list_node_to_value (FooTreeDataList *list,
|
||||
GType type,
|
||||
GValue *value);
|
||||
void _foo_tree_data_list_value_to_node (FooTreeDataList *list,
|
||||
GValue *value);
|
||||
|
||||
FooTreeDataList *_foo_tree_data_list_node_copy (FooTreeDataList *list,
|
||||
GType type);
|
||||
|
||||
/* Header code */
|
||||
gint _foo_tree_data_list_compare_func (GtkTreeModel *model,
|
||||
GtkTreeIter *a,
|
||||
GtkTreeIter *b,
|
||||
gpointer user_data);
|
||||
GList * _foo_tree_data_list_header_new (gint n_columns,
|
||||
GType *types);
|
||||
void _foo_tree_data_list_header_free (GList *header_list);
|
||||
GtkTreeDataSortHeader *_foo_tree_data_list_get_header (GList *header_list,
|
||||
gint sort_column_id);
|
||||
GList *_foo_tree_data_list_set_header (GList *header_list,
|
||||
gint sort_column_id,
|
||||
GtkTreeIterCompareFunc func,
|
||||
gpointer data,
|
||||
GDestroyNotify destroy);
|
||||
|
||||
#endif /* __GTK_TREE_DATA_LIST_H__ */
|
||||
3337
footreestore.c
Normal file
3337
footreestore.c
Normal file
File diff suppressed because it is too large
Load Diff
159
footreestore.h
Normal file
159
footreestore.h
Normal file
@ -0,0 +1,159 @@
|
||||
/* gtktreestore.h
|
||||
* Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
|
||||
*
|
||||
* 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 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.
|
||||
*/
|
||||
|
||||
#if defined(GTK_DISABLE_SINGLE_INCLUDES) && !defined (__GTK_H_INSIDE__) && !defined (GTK_COMPILATION)
|
||||
#error "Only <gtk/gtk.h> can be included directly."
|
||||
#endif
|
||||
|
||||
#ifndef __GTK_TREE_STORE_H__
|
||||
#define __GTK_TREE_STORE_H__
|
||||
|
||||
#include <gdkconfig.h>
|
||||
#include <gtk/gtktreemodel.h>
|
||||
#include <gtk/gtktreesortable.h>
|
||||
#include <stdarg.h>
|
||||
|
||||
|
||||
G_BEGIN_DECLS
|
||||
|
||||
|
||||
#define GTK_TYPE_TREE_STORE (gtk_tree_store_get_type ())
|
||||
#define GTK_TREE_STORE(obj) (G_TYPE_CHECK_INSTANCE_CAST ((obj), GTK_TYPE_TREE_STORE, GtkTreeStore))
|
||||
#define GTK_TREE_STORE_CLASS(klass) (G_TYPE_CHECK_CLASS_CAST ((klass), GTK_TYPE_TREE_STORE, GtkTreeStoreClass))
|
||||
#define GTK_IS_TREE_STORE(obj) (G_TYPE_CHECK_INSTANCE_TYPE ((obj), GTK_TYPE_TREE_STORE))
|
||||
#define GTK_IS_TREE_STORE_CLASS(klass) (G_TYPE_CHECK_CLASS_TYPE ((klass), GTK_TYPE_TREE_STORE))
|
||||
#define GTK_TREE_STORE_GET_CLASS(obj) (G_TYPE_INSTANCE_GET_CLASS ((obj), GTK_TYPE_TREE_STORE, GtkTreeStoreClass))
|
||||
|
||||
typedef struct _GtkTreeStore GtkTreeStore;
|
||||
typedef struct _GtkTreeStoreClass GtkTreeStoreClass;
|
||||
|
||||
struct _GtkTreeStore
|
||||
{
|
||||
GObject parent;
|
||||
|
||||
gint GSEAL (stamp);
|
||||
gpointer GSEAL (root);
|
||||
gpointer GSEAL (last);
|
||||
gint GSEAL (n_columns);
|
||||
gint GSEAL (sort_column_id);
|
||||
GList *GSEAL (sort_list);
|
||||
GtkSortType GSEAL (order);
|
||||
GType *GSEAL (column_headers);
|
||||
GtkTreeIterCompareFunc GSEAL (default_sort_func);
|
||||
gpointer GSEAL (default_sort_data);
|
||||
GDestroyNotify GSEAL (default_sort_destroy);
|
||||
guint GSEAL (columns_dirty) : 1;
|
||||
};
|
||||
|
||||
struct _GtkTreeStoreClass
|
||||
{
|
||||
GObjectClass parent_class;
|
||||
|
||||
/* Padding for future expansion */
|
||||
void (*_gtk_reserved1) (void);
|
||||
void (*_gtk_reserved2) (void);
|
||||
void (*_gtk_reserved3) (void);
|
||||
void (*_gtk_reserved4) (void);
|
||||
};
|
||||
|
||||
|
||||
GType gtk_tree_store_get_type (void) G_GNUC_CONST;
|
||||
GtkTreeStore *gtk_tree_store_new (gint n_columns,
|
||||
...);
|
||||
GtkTreeStore *gtk_tree_store_newv (gint n_columns,
|
||||
GType *types);
|
||||
void gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
|
||||
gint n_columns,
|
||||
GType *types);
|
||||
|
||||
/* NOTE: use gtk_tree_model_get to get values from a GtkTreeStore */
|
||||
|
||||
void gtk_tree_store_set_value (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
gint column,
|
||||
GValue *value);
|
||||
void gtk_tree_store_set (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
...);
|
||||
void gtk_tree_store_set_valuesv (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
gint *columns,
|
||||
GValue *values,
|
||||
gint n_values);
|
||||
void gtk_tree_store_set_valist (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
va_list var_args);
|
||||
gboolean gtk_tree_store_remove (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter);
|
||||
void gtk_tree_store_insert (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent,
|
||||
gint position);
|
||||
void gtk_tree_store_insert_before (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent,
|
||||
GtkTreeIter *sibling);
|
||||
void gtk_tree_store_insert_after (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent,
|
||||
GtkTreeIter *sibling);
|
||||
void gtk_tree_store_insert_with_values (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent,
|
||||
gint position,
|
||||
...);
|
||||
void gtk_tree_store_insert_with_valuesv (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent,
|
||||
gint position,
|
||||
gint *columns,
|
||||
GValue *values,
|
||||
gint n_values);
|
||||
void gtk_tree_store_prepend (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent);
|
||||
void gtk_tree_store_append (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *parent);
|
||||
gboolean gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *descendant);
|
||||
gint gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter);
|
||||
void gtk_tree_store_clear (GtkTreeStore *tree_store);
|
||||
gboolean gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter);
|
||||
void gtk_tree_store_reorder (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *parent,
|
||||
gint *new_order);
|
||||
void gtk_tree_store_swap (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *a,
|
||||
GtkTreeIter *b);
|
||||
void gtk_tree_store_move_before (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *position);
|
||||
void gtk_tree_store_move_after (GtkTreeStore *tree_store,
|
||||
GtkTreeIter *iter,
|
||||
GtkTreeIter *position);
|
||||
|
||||
|
||||
G_END_DECLS
|
||||
|
||||
|
||||
#endif /* __GTK_TREE_STORE_H__ */
|
||||
Reference in New Issue
Block a user