14bfde56c8
2000-02-24 Christopher James Lahey <clahey@helixcode.com> * test-table.c: Added duplicate_value and add_value. Use the new compare functions. Made it so we only create one model to better test model view stuff. Changed the test to not have as many extra, useless, columns. * test-cols.c, test-check.c: Added duplicate_value and add_value. Use the new compare functions. * e-table.c, e-table.h: Use all the new features of e-table-groups (sorting and grouping). Handle on the fly reorganization of groups in an idle loop. Compare functions now are to return -1 if the first item is greater, 0 if they are equal, or 1 if the second item is greater. * e-table-subset.c, e-table-subset.h: Made e-table-subset disconnect properly from its signals when it dies. * e-table-subset-variable.c, e-table-subset-variable.h: Virtualized the add and remove commands so that e_table_sorted_variable could override the add command to do sorting. * e-table-sorted.c: Fixed this to inherit properly from ETableSubset. * e-table-simple.h, e-table-simple.c: Added handling of duplicate_value and free_value; * e-table-model.c, e-table-model.h: Added duplicate_value and free_value for memory allocation of table elements outside the table. * e-table-item.c: Fixed a crashing bug. * e-table-group.c: Added sorting. Fixed destruction to delete the right things. * e-table-group-leaf.c, e-table-group-leaf.h: Pass column and sort order information into the e_table_sorted_variable. Properly destroy things when deleted. * e-table-group-container.c, e-table-group-container.h: Properly handle the list of subgroups. Handle proper sorting and grouping of subgroups. * e-table-sorted-variable.c, e-table-sorted-variable.h: Files to do a sorted model that stays sorted as you add and remove rows. * Makefile.am: Added e-table-sorted-variable.c and e-table-sorted-variable.h. svn path=/trunk/; revision=1930
90 lines
1.9 KiB
C
90 lines
1.9 KiB
C
/*
|
|
* E-table-sorted.c: Implements a table that sorts another table
|
|
*
|
|
* Author:
|
|
* Miguel de Icaza (miguel@gnu.org)
|
|
*
|
|
* (C) 1999 Helix Code, Inc.
|
|
*/
|
|
#include <config.h>
|
|
#include <stdlib.h>
|
|
#include "e-util/e-util.h"
|
|
#include "e-table-sorted.h"
|
|
|
|
#define PARENT_TYPE E_TABLE_SUBSET_TYPE
|
|
|
|
static ETableSubsetClass *ets_parent_class;
|
|
|
|
static void
|
|
ets_class_init (GtkObjectClass *klass)
|
|
{
|
|
ets_parent_class = gtk_type_class (PARENT_TYPE);
|
|
}
|
|
|
|
E_MAKE_TYPE(e_table_sorted, "ETableSorted", ETableSorted, ets_class_init, NULL, PARENT_TYPE);
|
|
|
|
static ETableSorted *sort_ets;
|
|
|
|
static int
|
|
my_sort (const void *a, const void *b)
|
|
{
|
|
ETableModel *source = E_TABLE_SUBSET (sort_ets)->source;
|
|
const int *ia = (const int *) a;
|
|
const int *ib = (const int *) b;
|
|
void *va, *vb;
|
|
|
|
va = e_table_model_value_at (source, sort_ets->sort_col, *ia);
|
|
vb = e_table_model_value_at (source, sort_ets->sort_col, *ib);
|
|
|
|
return (*sort_ets->compare) (va, vb);
|
|
}
|
|
|
|
static void
|
|
do_sort (ETableSorted *ets)
|
|
{
|
|
ETableSubset *etss = E_TABLE_SUBSET (ets);
|
|
g_assert (sort_ets == NULL);
|
|
|
|
sort_ets = ets;
|
|
qsort (etss->map_table, etss->n_map, sizeof (unsigned int), my_sort);
|
|
sort_ets = NULL;
|
|
}
|
|
|
|
ETableModel *
|
|
e_table_sorted_new (ETableModel *source, int col, GCompareFunc compare)
|
|
{
|
|
ETableSorted *ets = gtk_type_new (E_TABLE_SORTED_TYPE);
|
|
ETableSubset *etss = E_TABLE_SUBSET (ets);
|
|
const int nvals = e_table_model_row_count (source);
|
|
int i;
|
|
|
|
if (e_table_subset_construct (etss, source, nvals) == NULL){
|
|
gtk_object_destroy (GTK_OBJECT (ets));
|
|
return NULL;
|
|
}
|
|
|
|
ets->compare = compare;
|
|
ets->sort_col = col;
|
|
|
|
/* Init */
|
|
for (i = 0; i < nvals; i++)
|
|
etss->map_table [i] = i;
|
|
|
|
do_sort (ets);
|
|
|
|
return (ETableModel *) ets;
|
|
}
|
|
|
|
void
|
|
e_table_sorted_resort (ETableSorted *ets, int col, GCompareFunc compare)
|
|
{
|
|
if (col == -1 || compare == NULL)
|
|
do_sort (ets);
|
|
else {
|
|
ets->sort_col = col;
|
|
ets->compare = compare;
|
|
do_sort (ets);
|
|
}
|
|
}
|
|
|