Christopher James Lahey
40d58afa7c
2001-02-23 Christopher James Lahey <clahey@ximian.com> * gal/Makefile.am (libgal_la_LIBADD): Added e-table/e-table-sorting-utils.lo. From gal/e-table/ChangeLog: 2001-02-23 Christopher James Lahey <clahey@ximian.com> * Makefile.am (libetable_la_SOURCES): Added e-table-sorting-utils.c. (libetableinclude_HEADERS): Added e-table-sorting-utils.h. * e-table-group-container.c: Implemented add_array method. Use add_array to implement add_all instead of using add. Did some general clean up. * e-table-group-leaf.c, e-table-group-leaf.h: Implemented add_array method. Changed everything to use an ETableSubset variable instead of an ETableSortedVariable. Implemented it as ETableSortedVariable if there's grouping involved and ETableSorted if there isn't. * e-table-group.c, e-table-group.h: Added add_array method. Added unused get_position code. * e-table-sorted-variable.c, e-table-sorted-variable.h: Moved a lot of the actual implementation of sorting to e-table-sorting-utils.c. Got rid of the signal handlers here since we weren't using them and ETableSubset has the proxy virtual methods. * e-table-sorted.c, e-table-sorted.h: Completely replaced these files with a variation on ETableSortedVariable that doesn't have the add methods and such but instead just mimics the source model's set of rows completely. * e-table-sorter.c, e-table-sorter.h: Added functions to get at the arrays here. * e-table-sorting-utils.c, e-table-sorting-utils.h: Utility functions for doing sorting. * e-table-subset-variable.c, e-table-subset-variable.h: Added add_array method. * e-table-subset.c, e-table-subset.h: Made it so that the signal hookups to the source model's signals are virtual methods. * e-table.c, e-table.h: Don't call add_all and add and remove type functions if not grouped. Don't rebuild for sort changes unless it was either grouped before or will be grouped now. svn path=/trunk/; revision=8374
64 lines
2.1 KiB
C
64 lines
2.1 KiB
C
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
|
|
#ifndef _E_TABLE_SORTER_H_
|
|
#define _E_TABLE_SORTER_H_
|
|
|
|
#include <gtk/gtkobject.h>
|
|
#include <gal/e-table/e-table-model.h>
|
|
#include <gal/e-table/e-table-subset-variable.h>
|
|
#include <gal/e-table/e-table-sort-info.h>
|
|
#include <gal/e-table/e-table-header.h>
|
|
|
|
BEGIN_GNOME_DECLS
|
|
|
|
#define E_TABLE_SORTER_TYPE (e_table_sorter_get_type ())
|
|
#define E_TABLE_SORTER(o) (GTK_CHECK_CAST ((o), E_TABLE_SORTER_TYPE, ETableSorter))
|
|
#define E_TABLE_SORTER_CLASS(k) (GTK_CHECK_CLASS_CAST((k), E_TABLE_SORTER_TYPE, ETableSorterClass))
|
|
#define E_IS_TABLE_SORTER(o) (GTK_CHECK_TYPE ((o), E_TABLE_SORTER_TYPE))
|
|
#define E_IS_TABLE_SORTER_CLASS(k) (GTK_CHECK_CLASS_TYPE ((k), E_TABLE_SORTER_TYPE))
|
|
|
|
typedef struct {
|
|
GtkObject base;
|
|
|
|
ETableModel *source;
|
|
ETableHeader *full_header;
|
|
ETableSortInfo *sort_info;
|
|
|
|
/* If needs_sorting is 0, then model_to_sorted and sorted_to_model are no-ops. */
|
|
int needs_sorting;
|
|
|
|
int *sorted;
|
|
int *backsorted;
|
|
|
|
int table_model_changed_id;
|
|
int table_model_row_changed_id;
|
|
int table_model_cell_changed_id;
|
|
int sort_info_changed_id;
|
|
} ETableSorter;
|
|
|
|
typedef struct {
|
|
GtkObjectClass parent_class;
|
|
} ETableSorterClass;
|
|
|
|
GtkType e_table_sorter_get_type (void);
|
|
ETableSorter *e_table_sorter_new (ETableModel *etm,
|
|
ETableHeader *full_header,
|
|
ETableSortInfo *sort_info);
|
|
|
|
gint e_table_sorter_model_to_sorted (ETableSorter *sorter,
|
|
int row);
|
|
gint e_table_sorter_sorted_to_model (ETableSorter *sorter,
|
|
int row);
|
|
|
|
void e_table_sorter_get_model_to_sorted_array (ETableSorter *sorter,
|
|
int **array,
|
|
int *count);
|
|
void e_table_sorter_get_sorted_to_model_array (ETableSorter *sorter,
|
|
int **array,
|
|
int *count);
|
|
|
|
gboolean e_table_sorter_needs_sorting (ETableSorter *sorter);
|
|
|
|
END_GNOME_DECLS
|
|
|
|
#endif /* _E_TABLE_SORTER_H_ */
|