2000-10-11 Christopher James Lahey <clahey@helixcode.com> * tests/test-tree-1.c, tests/test-tree-2.c, tests/test-tree-3.c: Changed these to match the new ETable system. * gal/Makefile.am: Added e-table-column-specification.lo, e-table-extras.lo, e-table-specification.lo, and e-table-state.lo. From gal/e-table/ChangeLog: 2000-10-11 Christopher James Lahey <clahey@helixcode.com> * Makefile.am: Added e-table-column-specification.c, e-table-column-specification.h, e-table-extras.c, e-table-extras.h, e-table-specification.c, e-table-specification.h, e-table-state.c, and e-table-state.h. Removed some duplicated .h files. * e-cell-tree.c: Ref, sink, and unref the subcell instead of destroying it when done. * e-table-column-specification.c, e-table-column-specification.h: New class which describes a column without having a table get instantiated. * e-table-config.c: Changed get_specification to get_state to get this to compile. * e-table-defines.h, e-table-item.h: Moved the definition of ETableCursorMode from e-table-item.h to e-table-defines.h. * e-table-extras.c, e-table-extras.h: New class which acts as a set of 3 hash tables. All from char * and to alternately, ECells, GCompareFuncs, and GdkPxibufs. * e-table-scrolled.c, e-table-scrolled.h: Changed this to match the new ETable function declarations. * e-table-sort-info.c, e-table-sort-info.h: Added functions for saving to and loading from xml. * e-table-specification.c, e-table-specification.h: New class which describes a table without having to instantiate it. * e-table-state.c, e-table-state.h: New class which describes the state of a table without having to instantiate the table. * e-table.c, e-table.h: Changed this to accept both a state and a specification instead of just a specification. You then save only the state. The specification stays exactly the same. Also, you no longer need to pass in an ETableHeader. Most of the information contained in the ETableHeader are in the specification. However you may need to translate some of the strings in the specification to objects. If you need anything other than the builtin choices, you need to create an ETableExtras and pass it in. * e-tree-model.c: Removed an unused variable. svn path=/trunk/; revision=5837
298 lines
7.1 KiB
C
298 lines
7.1 KiB
C
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
|
|
/*
|
|
* e-table-sort-info.c: a Table Model
|
|
*
|
|
* Author:
|
|
* Miguel de Icaza (miguel@gnu.org)
|
|
*
|
|
* (C) 1999 Helix Code, Inc.
|
|
*/
|
|
#include <config.h>
|
|
#include <gtk/gtksignal.h>
|
|
#include "e-table-sort-info.h"
|
|
#include "gal/util/e-util.h"
|
|
#include "gal/util/e-xml-utils.h"
|
|
|
|
#define ETM_CLASS(e) ((ETableSortInfoClass *)((GtkObject *)e)->klass)
|
|
|
|
#define PARENT_TYPE gtk_object_get_type ()
|
|
|
|
|
|
static GtkObjectClass *e_table_sort_info_parent_class;
|
|
|
|
enum {
|
|
SORT_INFO_CHANGED,
|
|
GROUP_INFO_CHANGED,
|
|
LAST_SIGNAL
|
|
};
|
|
|
|
static guint e_table_sort_info_signals [LAST_SIGNAL] = { 0, };
|
|
|
|
static void
|
|
etsi_destroy (GtkObject *object)
|
|
{
|
|
ETableSortInfo *etsi;
|
|
|
|
etsi = E_TABLE_SORT_INFO (object);
|
|
|
|
if (etsi->groupings)
|
|
g_free(etsi->groupings);
|
|
if (etsi->sortings)
|
|
g_free(etsi->sortings);
|
|
}
|
|
|
|
static void
|
|
e_table_sort_info_init (ETableSortInfo *info)
|
|
{
|
|
info->group_count = 0;
|
|
info->groupings = NULL;
|
|
info->sort_count = 0;
|
|
info->sortings = NULL;
|
|
info->frozen = 0;
|
|
info->sort_info_changed = 0;
|
|
info->group_info_changed = 0;
|
|
}
|
|
|
|
static void
|
|
e_table_sort_info_class_init (ETableSortInfoClass *klass)
|
|
{
|
|
GtkObjectClass *object_class;
|
|
|
|
e_table_sort_info_parent_class = gtk_type_class (gtk_object_get_type ());
|
|
|
|
object_class = GTK_OBJECT_CLASS(klass);
|
|
|
|
object_class->destroy = etsi_destroy;
|
|
|
|
e_table_sort_info_signals [SORT_INFO_CHANGED] =
|
|
gtk_signal_new ("sort_info_changed",
|
|
GTK_RUN_LAST,
|
|
object_class->type,
|
|
GTK_SIGNAL_OFFSET (ETableSortInfoClass, sort_info_changed),
|
|
gtk_marshal_NONE__NONE,
|
|
GTK_TYPE_NONE, 0);
|
|
|
|
e_table_sort_info_signals [GROUP_INFO_CHANGED] =
|
|
gtk_signal_new ("group_info_changed",
|
|
GTK_RUN_LAST,
|
|
object_class->type,
|
|
GTK_SIGNAL_OFFSET (ETableSortInfoClass, group_info_changed),
|
|
gtk_marshal_NONE__NONE,
|
|
GTK_TYPE_NONE, 0);
|
|
|
|
klass->sort_info_changed = NULL;
|
|
klass->group_info_changed = NULL;
|
|
|
|
gtk_object_class_add_signals (object_class, e_table_sort_info_signals, LAST_SIGNAL);
|
|
}
|
|
|
|
E_MAKE_TYPE(e_table_sort_info, "ETableSortInfo", ETableSortInfo,
|
|
e_table_sort_info_class_init, e_table_sort_info_init, PARENT_TYPE);
|
|
|
|
static void
|
|
e_table_sort_info_sort_info_changed (ETableSortInfo *info)
|
|
{
|
|
g_return_if_fail (info != NULL);
|
|
g_return_if_fail (E_IS_TABLE_SORT_INFO (info));
|
|
|
|
if (info->frozen) {
|
|
info->sort_info_changed = 1;
|
|
} else {
|
|
gtk_signal_emit (GTK_OBJECT (info),
|
|
e_table_sort_info_signals [SORT_INFO_CHANGED]);
|
|
}
|
|
}
|
|
|
|
static void
|
|
e_table_sort_info_group_info_changed (ETableSortInfo *info)
|
|
{
|
|
g_return_if_fail (info != NULL);
|
|
g_return_if_fail (E_IS_TABLE_SORT_INFO (info));
|
|
|
|
if (info->frozen) {
|
|
info->group_info_changed = 1;
|
|
} else {
|
|
gtk_signal_emit (GTK_OBJECT (info),
|
|
e_table_sort_info_signals [GROUP_INFO_CHANGED]);
|
|
}
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_freeze (ETableSortInfo *info)
|
|
{
|
|
info->frozen = 1;
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_thaw (ETableSortInfo *info)
|
|
{
|
|
info->frozen = 0;
|
|
if (info->sort_info_changed) {
|
|
info->sort_info_changed = 0;
|
|
e_table_sort_info_sort_info_changed(info);
|
|
}
|
|
if (info->group_info_changed) {
|
|
info->group_info_changed = 0;
|
|
e_table_sort_info_group_info_changed(info);
|
|
}
|
|
}
|
|
|
|
|
|
guint
|
|
e_table_sort_info_grouping_get_count (ETableSortInfo *info)
|
|
{
|
|
return info->group_count;
|
|
}
|
|
|
|
static void
|
|
e_table_sort_info_grouping_real_truncate (ETableSortInfo *info, int length)
|
|
{
|
|
if (length < info->group_count) {
|
|
info->group_count = length;
|
|
}
|
|
if (length > info->group_count) {
|
|
info->groupings = g_realloc(info->groupings, length * sizeof(ETableSortColumn));
|
|
info->group_count = length;
|
|
}
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_grouping_truncate (ETableSortInfo *info, int length)
|
|
{
|
|
e_table_sort_info_grouping_real_truncate(info, length);
|
|
e_table_sort_info_group_info_changed(info);
|
|
}
|
|
|
|
ETableSortColumn
|
|
e_table_sort_info_grouping_get_nth (ETableSortInfo *info, int n)
|
|
{
|
|
if (n < info->group_count) {
|
|
return info->groupings[n];
|
|
} else {
|
|
ETableSortColumn fake = {0, 0};
|
|
return fake;
|
|
}
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_grouping_set_nth (ETableSortInfo *info, int n, ETableSortColumn column)
|
|
{
|
|
if (n >= info->group_count) {
|
|
e_table_sort_info_grouping_real_truncate(info, n + 1);
|
|
}
|
|
info->groupings[n] = column;
|
|
e_table_sort_info_group_info_changed(info);
|
|
}
|
|
|
|
|
|
guint
|
|
e_table_sort_info_sorting_get_count (ETableSortInfo *info)
|
|
{
|
|
return info->sort_count;
|
|
}
|
|
|
|
static void
|
|
e_table_sort_info_sorting_real_truncate (ETableSortInfo *info, int length)
|
|
{
|
|
if (length < info->sort_count) {
|
|
info->sort_count = length;
|
|
}
|
|
if (length > info->sort_count) {
|
|
info->sortings = g_realloc(info->sortings, length * sizeof(ETableSortColumn));
|
|
info->sort_count = length;
|
|
}
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_sorting_truncate (ETableSortInfo *info, int length)
|
|
{
|
|
e_table_sort_info_sorting_real_truncate (info, length);
|
|
e_table_sort_info_sort_info_changed(info);
|
|
}
|
|
|
|
ETableSortColumn
|
|
e_table_sort_info_sorting_get_nth (ETableSortInfo *info, int n)
|
|
{
|
|
if (n < info->sort_count) {
|
|
return info->sortings[n];
|
|
} else {
|
|
ETableSortColumn fake = {0, 0};
|
|
return fake;
|
|
}
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_sorting_set_nth (ETableSortInfo *info, int n, ETableSortColumn column)
|
|
{
|
|
if (n >= info->sort_count) {
|
|
e_table_sort_info_sorting_real_truncate(info, n + 1);
|
|
}
|
|
info->sortings[n] = column;
|
|
e_table_sort_info_sort_info_changed(info);
|
|
}
|
|
|
|
|
|
ETableSortInfo *
|
|
e_table_sort_info_new (void)
|
|
{
|
|
return gtk_type_new (e_table_sort_info_get_type ());
|
|
}
|
|
|
|
void
|
|
e_table_sort_info_load_from_node (ETableSortInfo *info,
|
|
xmlNode *node)
|
|
{
|
|
int i;
|
|
xmlNode *grouping;
|
|
|
|
i = 0;
|
|
for (grouping = node->childs; grouping && !strcmp (grouping->name, "group"); grouping = grouping->childs) {
|
|
ETableSortColumn column;
|
|
column.column = e_xml_get_integer_prop_by_name (grouping, "column");
|
|
column.ascending = e_xml_get_integer_prop_by_name (grouping, "ascending");
|
|
e_table_sort_info_grouping_set_nth(info, i++, column);
|
|
}
|
|
i = 0;
|
|
for (; grouping && !strcmp (grouping->name, "leaf"); grouping = grouping->childs) {
|
|
ETableSortColumn column;
|
|
column.column = e_xml_get_integer_prop_by_name (grouping, "column");
|
|
column.ascending = e_xml_get_integer_prop_by_name (grouping, "ascending");
|
|
e_table_sort_info_sorting_set_nth(info, i++, column);
|
|
}
|
|
}
|
|
|
|
xmlNode *
|
|
e_table_sort_info_save_to_node (ETableSortInfo *info,
|
|
xmlNode *parent)
|
|
{
|
|
xmlNode *grouping;
|
|
xmlNode *node;
|
|
int i;
|
|
const int sort_count = e_table_sort_info_sorting_get_count (info);
|
|
const int group_count = e_table_sort_info_grouping_get_count (info);
|
|
|
|
grouping = xmlNewChild (parent, NULL, "grouping", NULL);
|
|
node = grouping;
|
|
|
|
for (i = 0; i < group_count; i++) {
|
|
ETableSortColumn column = e_table_sort_info_grouping_get_nth(info, i);
|
|
xmlNode *new_node = xmlNewChild(node, NULL, "group", NULL);
|
|
|
|
e_xml_set_integer_prop_by_name (new_node, "column", column.column);
|
|
e_xml_set_integer_prop_by_name (new_node, "ascending", column.ascending);
|
|
node = new_node;
|
|
}
|
|
|
|
for (i = 0; i < sort_count; i++) {
|
|
ETableSortColumn column = e_table_sort_info_sorting_get_nth(info, i);
|
|
xmlNode *new_node = xmlNewChild(node, NULL, "leaf", NULL);
|
|
|
|
e_xml_set_integer_prop_by_name (new_node, "column", column.column);
|
|
e_xml_set_integer_prop_by_name (new_node, "ascending", column.ascending);
|
|
node = new_node;
|
|
}
|
|
|
|
return grouping;
|
|
}
|
|
|