
2000-06-06 Christopher James Lahey <clahey@helixcode.com> * e-table-group-container.c, e-table-group-leaf.c, e-table-group.c, e-table-group.h, e-table-item.c, e-table-item.h, e-table.c, e-table.h: Added a right click signal. * e-table-sorted-variable.c: Fixed a buffer overrun. svn path=/trunk/; revision=3437
335 lines
10 KiB
C
335 lines
10 KiB
C
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
|
|
/*
|
|
* 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 <gtk/gtksignal.h>
|
|
#include <string.h>
|
|
#include "e-util/e-util.h"
|
|
#include "e-table-sorted-variable.h"
|
|
|
|
#define PARENT_TYPE E_TABLE_SUBSET_VARIABLE_TYPE
|
|
|
|
#define INCREMENT_AMOUNT 100
|
|
|
|
static ETableSubsetVariableClass *etsv_parent_class;
|
|
|
|
static void etsv_proxy_model_changed (ETableModel *etm, ETableSortedVariable *etsv);
|
|
static void etsv_proxy_model_row_changed (ETableModel *etm, int row, ETableSortedVariable *etsv);
|
|
static void etsv_proxy_model_cell_changed (ETableModel *etm, int col, int row, ETableSortedVariable *etsv);
|
|
static void etsv_sort_info_changed (ETableSortInfo *info, ETableSortedVariable *etsv);
|
|
static void etsv_sort (ETableSortedVariable *etsv);
|
|
static void etsv_add (ETableSubsetVariable *etssv, gint row);
|
|
static void etsv_add_all (ETableSubsetVariable *etssv);
|
|
|
|
static void
|
|
etsv_destroy (GtkObject *object)
|
|
{
|
|
ETableSortedVariable *etsv = E_TABLE_SORTED_VARIABLE (object);
|
|
ETableSubset *etss = E_TABLE_SUBSET (object);
|
|
|
|
gtk_signal_disconnect (GTK_OBJECT (etss->source),
|
|
etsv->table_model_changed_id);
|
|
gtk_signal_disconnect (GTK_OBJECT (etss->source),
|
|
etsv->table_model_row_changed_id);
|
|
gtk_signal_disconnect (GTK_OBJECT (etss->source),
|
|
etsv->table_model_cell_changed_id);
|
|
gtk_signal_disconnect (GTK_OBJECT (etsv->sort_info),
|
|
etsv->sort_info_changed_id);
|
|
|
|
if (etsv->sort_idle_id) {
|
|
g_source_remove(etsv->sort_idle_id);
|
|
}
|
|
|
|
etsv->table_model_changed_id = 0;
|
|
etsv->table_model_row_changed_id = 0;
|
|
etsv->table_model_cell_changed_id = 0;
|
|
|
|
if (etsv->sort_info)
|
|
gtk_object_unref(GTK_OBJECT(etsv->sort_info));
|
|
if (etsv->full_header)
|
|
gtk_object_unref(GTK_OBJECT(etsv->full_header));
|
|
|
|
GTK_OBJECT_CLASS (etsv_parent_class)->destroy (object);
|
|
}
|
|
|
|
static void
|
|
etsv_class_init (GtkObjectClass *object_class)
|
|
{
|
|
ETableSubsetVariableClass *etssv_class = E_TABLE_SUBSET_VARIABLE_CLASS(object_class);
|
|
|
|
etsv_parent_class = gtk_type_class (PARENT_TYPE);
|
|
|
|
object_class->destroy = etsv_destroy;
|
|
|
|
etssv_class->add = etsv_add;
|
|
etssv_class->add_all = etsv_add_all;
|
|
}
|
|
|
|
static void
|
|
etsv_init (ETableSortedVariable *etsv)
|
|
{
|
|
etsv->full_header = NULL;
|
|
etsv->sort_info = NULL;
|
|
|
|
etsv->table_model_changed_id = 0;
|
|
etsv->table_model_row_changed_id = 0;
|
|
etsv->table_model_cell_changed_id = 0;
|
|
etsv->sort_info_changed_id = 0;
|
|
|
|
etsv->sort_idle_id = 0;
|
|
}
|
|
|
|
E_MAKE_TYPE(e_table_sorted_variable, "ETableSortedVariable", ETableSortedVariable, etsv_class_init, etsv_init, PARENT_TYPE);
|
|
|
|
static gboolean
|
|
etsv_sort_idle(ETableSortedVariable *etsv)
|
|
{
|
|
gtk_object_ref(GTK_OBJECT(etsv));
|
|
etsv_sort(etsv);
|
|
etsv->sort_idle_id = 0;
|
|
gtk_object_unref(GTK_OBJECT(etsv));
|
|
return FALSE;
|
|
}
|
|
|
|
/* This takes source rows. */
|
|
static int
|
|
etsv_compare(ETableSortedVariable *etsv, int row1, int row2)
|
|
{
|
|
int j;
|
|
int sort_count = e_table_sort_info_sorting_get_count(etsv->sort_info);
|
|
int comp_val = 0;
|
|
int ascending = 1;
|
|
ETableSubset *etss = E_TABLE_SUBSET(etsv);
|
|
|
|
for (j = 0; j < sort_count; j++) {
|
|
ETableSortColumn column = e_table_sort_info_sorting_get_nth(etsv->sort_info, j);
|
|
ETableCol *col;
|
|
if (column.column > e_table_header_count (etsv->full_header))
|
|
col = e_table_header_get_column (etsv->full_header, e_table_header_count (etsv->full_header) - 1);
|
|
else
|
|
col = e_table_header_get_column (etsv->full_header, column.column);
|
|
comp_val = (*col->compare)(e_table_model_value_at (etss->source, col->col_idx, row1),
|
|
e_table_model_value_at (etss->source, col->col_idx, row2));
|
|
ascending = column.ascending;
|
|
if (comp_val != 0)
|
|
break;
|
|
}
|
|
if (comp_val == 0) {
|
|
if (row1 < row2)
|
|
comp_val = -1;
|
|
if (row1 > row2)
|
|
comp_val = 1;
|
|
}
|
|
if (!ascending)
|
|
comp_val = -comp_val;
|
|
return comp_val;
|
|
}
|
|
|
|
|
|
static void
|
|
etsv_add (ETableSubsetVariable *etssv,
|
|
gint row)
|
|
{
|
|
ETableModel *etm = E_TABLE_MODEL(etssv);
|
|
ETableSubset *etss = E_TABLE_SUBSET(etssv);
|
|
ETableSortedVariable *etsv = E_TABLE_SORTED_VARIABLE (etssv);
|
|
int i;
|
|
|
|
if (etss->n_map + 1 > etssv->n_vals_allocated) {
|
|
etssv->n_vals_allocated += INCREMENT_AMOUNT;
|
|
etss->map_table = g_realloc (etss->map_table, (etssv->n_vals_allocated) * sizeof(int));
|
|
}
|
|
if (row < e_table_model_row_count(etss->source) - 1)
|
|
for ( i = 0; i < etss->n_map; i++ )
|
|
if (etss->map_table[i] >= row)
|
|
etss->map_table[i] ++;
|
|
i = etss->n_map;
|
|
if (etsv->sort_idle_id == 0) {
|
|
i = 0;
|
|
while (i < etss->n_map && etsv_compare(etsv, etss->map_table[i], row) < 0)
|
|
i++;
|
|
memmove(etss->map_table + i + 1, etss->map_table + i, (etss->n_map - i) * sizeof(int));
|
|
}
|
|
etss->map_table[i] = row;
|
|
etss->n_map++;
|
|
if (!etm->frozen)
|
|
e_table_model_row_inserted (etm, i);
|
|
}
|
|
|
|
static void
|
|
etsv_add_all (ETableSubsetVariable *etssv)
|
|
{
|
|
ETableModel *etm = E_TABLE_MODEL(etssv);
|
|
ETableSubset *etss = E_TABLE_SUBSET(etssv);
|
|
ETableSortedVariable *etsv = E_TABLE_SORTED_VARIABLE (etssv);
|
|
int rows = e_table_model_row_count(etss->source);
|
|
int i;
|
|
|
|
if (etss->n_map + rows > etssv->n_vals_allocated){
|
|
etssv->n_vals_allocated += MAX(INCREMENT_AMOUNT, rows);
|
|
etss->map_table = g_realloc (etss->map_table, etssv->n_vals_allocated * sizeof(int));
|
|
}
|
|
for (i = 0; i < rows; i++)
|
|
etss->map_table[etss->n_map++] = i;
|
|
|
|
if (etsv->sort_idle_id == 0) {
|
|
etsv->sort_idle_id = g_idle_add_full(50, (GSourceFunc) etsv_sort_idle, etsv, NULL);
|
|
}
|
|
if (!etm->frozen)
|
|
e_table_model_changed (etm);
|
|
}
|
|
|
|
ETableModel *
|
|
e_table_sorted_variable_new (ETableModel *source, ETableHeader *full_header, ETableSortInfo *sort_info)
|
|
{
|
|
ETableSortedVariable *etsv = gtk_type_new (E_TABLE_SORTED_VARIABLE_TYPE);
|
|
ETableSubsetVariable *etssv = E_TABLE_SUBSET_VARIABLE (etsv);
|
|
|
|
if (e_table_subset_variable_construct (etssv, source) == NULL){
|
|
gtk_object_destroy (GTK_OBJECT (etsv));
|
|
return NULL;
|
|
}
|
|
|
|
etsv->sort_info = sort_info;
|
|
gtk_object_ref(GTK_OBJECT(etsv->sort_info));
|
|
etsv->full_header = full_header;
|
|
gtk_object_ref(GTK_OBJECT(etsv->full_header));
|
|
|
|
etsv->table_model_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_changed",
|
|
GTK_SIGNAL_FUNC (etsv_proxy_model_changed), etsv);
|
|
etsv->table_model_row_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_row_changed",
|
|
GTK_SIGNAL_FUNC (etsv_proxy_model_row_changed), etsv);
|
|
etsv->table_model_cell_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_cell_changed",
|
|
GTK_SIGNAL_FUNC (etsv_proxy_model_cell_changed), etsv);
|
|
etsv->sort_info_changed_id = gtk_signal_connect (GTK_OBJECT (sort_info), "sort_info_changed",
|
|
GTK_SIGNAL_FUNC (etsv_sort_info_changed), etsv);
|
|
|
|
return E_TABLE_MODEL(etsv);
|
|
}
|
|
|
|
static void
|
|
etsv_proxy_model_changed (ETableModel *etm, ETableSortedVariable *etsv)
|
|
{
|
|
if (!E_TABLE_MODEL(etsv)->frozen){
|
|
/* FIXME: do_resort (); */
|
|
}
|
|
}
|
|
|
|
static void
|
|
etsv_proxy_model_row_changed (ETableModel *etm, int row, ETableSortedVariable *etsv)
|
|
{
|
|
ETableSubsetVariable *etssv = E_TABLE_SUBSET_VARIABLE(etsv);
|
|
if (!E_TABLE_MODEL(etsv)->frozen){
|
|
if (e_table_subset_variable_remove(etssv, row))
|
|
e_table_subset_variable_add (etssv, row);
|
|
}
|
|
}
|
|
|
|
static void
|
|
etsv_proxy_model_cell_changed (ETableModel *etm, int col, int row, ETableSortedVariable *etsv)
|
|
{
|
|
ETableSubsetVariable *etssv = E_TABLE_SUBSET_VARIABLE(etsv);
|
|
if (!E_TABLE_MODEL(etsv)->frozen){
|
|
if (e_table_subset_variable_remove(etssv, row))
|
|
e_table_subset_variable_add (etssv, row);
|
|
}
|
|
}
|
|
|
|
static void
|
|
etsv_sort_info_changed (ETableSortInfo *info, ETableSortedVariable *etsv)
|
|
{
|
|
etsv_sort(etsv);
|
|
}
|
|
|
|
static ETableSortedVariable *etsv_closure;
|
|
void **vals_closure;
|
|
int cols_closure;
|
|
int *ascending_closure;
|
|
GCompareFunc *compare_closure;
|
|
|
|
/* FIXME: Make it not cache the second and later columns (as if anyone cares.) */
|
|
|
|
static int
|
|
qsort_callback(const void *data1, const void *data2)
|
|
{
|
|
gint row1 = *(int *)data1;
|
|
gint row2 = *(int *)data2;
|
|
int j;
|
|
int sort_count = e_table_sort_info_sorting_get_count(etsv_closure->sort_info);
|
|
int comp_val = 0;
|
|
int ascending = 1;
|
|
for (j = 0; j < sort_count; j++) {
|
|
comp_val = (*(compare_closure[j]))(vals_closure[cols_closure * row1 + j], vals_closure[cols_closure * row2 + j]);
|
|
ascending = ascending_closure[j];
|
|
if (comp_val != 0)
|
|
break;
|
|
}
|
|
if (comp_val == 0) {
|
|
if (row1 < row2)
|
|
comp_val = -1;
|
|
if (row1 > row2)
|
|
comp_val = 1;
|
|
}
|
|
if (!ascending)
|
|
comp_val = -comp_val;
|
|
return comp_val;
|
|
}
|
|
|
|
|
|
static void
|
|
etsv_sort(ETableSortedVariable *etsv)
|
|
{
|
|
ETableSubset *etss = E_TABLE_SUBSET(etsv);
|
|
static int reentering = 0;
|
|
int rows = E_TABLE_SUBSET(etsv)->n_map;
|
|
int total_rows = e_table_model_row_count(E_TABLE_SUBSET(etsv)->source);
|
|
int i;
|
|
int j;
|
|
int cols;
|
|
if (reentering)
|
|
return;
|
|
reentering = 1;
|
|
cols = e_table_sort_info_sorting_get_count(etsv->sort_info);
|
|
cols_closure = cols;
|
|
etsv_closure = etsv;
|
|
printf ("starting\n");
|
|
vals_closure = g_new(void *, total_rows * cols);
|
|
ascending_closure = g_new(int, cols);
|
|
compare_closure = g_new(GCompareFunc, cols);
|
|
for (j = 0; j < cols; j++) {
|
|
ETableSortColumn column = e_table_sort_info_sorting_get_nth(etsv->sort_info, j);
|
|
ETableCol *col;
|
|
if (column.column > e_table_header_count (etsv->full_header))
|
|
col = e_table_header_get_column (etsv->full_header, e_table_header_count (etsv->full_header) - 1);
|
|
else
|
|
col = e_table_header_get_column (etsv->full_header, column.column);
|
|
for (i = 0; i < rows; i++) {
|
|
#if 0
|
|
if( !(i & 0xff) ) {
|
|
while(gtk_events_pending())
|
|
gtk_main_iteration();
|
|
}
|
|
#endif
|
|
vals_closure[E_TABLE_SUBSET(etsv)->map_table[i] * cols + j] = e_table_model_value_at (etss->source, col->col_idx, E_TABLE_SUBSET(etsv)->map_table[i]);
|
|
}
|
|
compare_closure[j] = col->compare;
|
|
ascending_closure[j] = column.ascending;
|
|
}
|
|
printf("allocated\n");
|
|
qsort(E_TABLE_SUBSET(etsv)->map_table, rows, sizeof(int), qsort_callback);
|
|
printf ("sorted\n");
|
|
g_free(vals_closure);
|
|
g_free(ascending_closure);
|
|
g_free(compare_closure);
|
|
printf("freed\n");
|
|
e_table_model_changed (E_TABLE_MODEL(etsv));
|
|
reentering = 0;
|
|
}
|