From 40d58afa7ce854ae8154a7f0ce32997f57d99ea4 Mon Sep 17 00:00:00 2001 From: Christopher James Lahey Date: Fri, 23 Feb 2001 23:00:09 +0000 Subject: Added e-table/e-table-sorting-utils.lo. 2001-02-23 Christopher James Lahey * 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 * 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 --- widgets/table/e-table-sorting-utils.c | 372 ++++++++++++++++++++++++++++++++++ 1 file changed, 372 insertions(+) create mode 100644 widgets/table/e-table-sorting-utils.c (limited to 'widgets/table/e-table-sorting-utils.c') diff --git a/widgets/table/e-table-sorting-utils.c b/widgets/table/e-table-sorting-utils.c new file mode 100644 index 0000000000..c5f58b8795 --- /dev/null +++ b/widgets/table/e-table-sorting-utils.c @@ -0,0 +1,372 @@ +/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */ + +#include +#include + +#define d(x) + +static ETableSortInfo *sort_info_closure; + +static void **vals_closure; +static int cols_closure; +static int *ascending_closure; +static 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(sort_info_closure); + 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; +} + +struct _subinfo { + int start; + GArray *rowsort; /* an array of row info's */ +}; + +struct _rowinfo { + int row; + struct _subinfo *subinfo; + struct _group_info *groupinfo; +}; + +static int +qsort_callback_complex(const void *data1, const void *data2) +{ + gint row1 = ((struct _rowinfo *)data1)->row; + gint row2 = ((struct _rowinfo *)data2)->row; + int j; + int sort_count = e_table_sort_info_sorting_get_count(sort_info_closure); + 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; +} + +/* if sortgroup is like: +0 1 1 1 +1 1 2 2 +2 2 3 2 +3 2 4 3 +4 3 5 3 +5 2 6 1 +6 1 0 1 + + Want to sort the 1's first + Then sort each group of 2's, offsetting into the output by the new root 1 location + ... Recursively ... +*/ + +struct _group_info { + char *group; + int row; +}; + +#ifdef DEBUG +#undef DEBUG +#endif +/*#define DEBUG*/ + +#ifdef DEBUG +static int total=0; +static int total_sorted=0; +#endif + +/* builds the info needed to sort everything */ +static struct _subinfo * +etsu_sort_build_subset(int rows, struct _group_info *groupinfo, int start, int *end) +{ + int i, lastinsert; + GArray *rowsort = g_array_new(0, 0, sizeof(struct _rowinfo)); + struct _subinfo *subinfo, *newsub; + char *id, *newid; + int idlen, newidlen; + int cmp; + int cmplen; + + subinfo = g_malloc0(sizeof(*subinfo)); + subinfo->rowsort = rowsort; + subinfo->start = start; + lastinsert = -1; + id = groupinfo[start].group; + newid = strrchr(id, '/'); + idlen = strlen(id); + if (newid) + cmplen = newid-id; + else + cmplen = idlen; + d(printf("%d scanning level %s\n", start, id)); + for (i=start;ilen; + g_array_append_val(rowsort, rowinfo); +#ifdef DEBUG + total++; +#endif + } else if (newidlen > idlen) { + /* must be a new subtree */ + d(printf("%d checking subtree instead\n", start)); + newsub = etsu_sort_build_subset(rows, groupinfo, i, &i); + d(printf("found %d nodes in subtree\n", newsub->rowsort->len)); + g_array_index(rowsort, struct _rowinfo, lastinsert).subinfo = newsub; + } else { + i--; + break; + } + } + if (end) + *end = i; + d(printf("finished level %s start was %d end was %d\n", id, start, i)); + return subinfo; +} + +/* sort each level, and then sort each level below that level (once we know + where the sublevel will fit in the overall list) */ +static int +etsu_sort_subset(int *map_table, struct _subinfo *subinfo, int startoffset) +{ + GArray *rowsort = subinfo->rowsort; + int offset, i; + + d(printf("sorting subset start %d rows %d\n", startoffset, rowsort->len)); + + /* first, sort the actual data */ + qsort(rowsort->data, rowsort->len, sizeof(struct _rowinfo), qsort_callback_complex); + + /* then put it back in the map table, where appropriate */ + offset = startoffset; + for (i=0;ilen;i++) { + struct _rowinfo *rowinfo; + + d(printf("setting offset %d\n", offset)); + + rowinfo = &g_array_index(rowsort, struct _rowinfo, i); + map_table[offset] = rowinfo->row; + if (rowinfo->subinfo) { + offset = etsu_sort_subset(map_table, rowinfo->subinfo, offset+1); + } else + offset += 1; + } + d(printf("end sort subset start %d\n", startoffset)); + + return offset; +} + +static void +etsu_sort_free_subset(struct _subinfo *subinfo) +{ + int i; + + for (i=0;irowsort->len;i++) { + struct _rowinfo *rowinfo; + + rowinfo = &g_array_index(subinfo->rowsort, struct _rowinfo, i); + if (rowinfo->subinfo) + etsu_sort_free_subset(rowinfo->subinfo); + } + g_array_free(subinfo->rowsort, TRUE); + g_free(subinfo); +} + +static int +sort_groups_compare(const void *ap, const void *bp) +{ + struct _group_info *a = (struct _group_info *)ap; + struct _group_info *b = (struct _group_info *)bp; + + return strcmp(a->group, b->group); +} + +#ifdef DEBUG +static void +print_id(int key, int val, void *data) +{ + printf("gained id %d\n", key); +} +#endif + +/* use the sort group to select subsorts */ +static void +etsu_sort_by_group(ETableModel *source, int *map_table, int rows) +{ + struct _group_info *groups; + struct _subinfo *subinfo; + int i; +#ifdef DEBUG + GHashTable *members = g_hash_table_new(0, 0); + + total = 0; + total_sorted = 0; +#endif + + d(printf("sorting %d rows\n", rows)); + + if (rows == 0) + return; + + /* get the subset rows */ + groups = g_malloc(sizeof(struct _group_info) * rows); + for (i=0;icol_idx, map_table[i]); + } + compare_closure[j] = col->compare; + ascending_closure[j] = column.ascending; + } + + if (e_table_model_has_sort_group(source)) { + etsu_sort_by_group(source, map_table, rows); + } else { + qsort(map_table, rows, sizeof(int), qsort_callback); + } + g_free(vals_closure); + g_free(ascending_closure); + g_free(compare_closure); +} + +gboolean +e_table_sorting_utils_affects_sort (ETableModel *source, + ETableSortInfo *sort_info, + ETableHeader *full_header, + int col) +{ + int j; + int cols; + + g_return_val_if_fail(source != NULL, TRUE); + g_return_val_if_fail(E_IS_TABLE_MODEL(source), TRUE); + g_return_val_if_fail(sort_info != NULL, TRUE); + g_return_val_if_fail(E_IS_TABLE_SORT_INFO(sort_info), TRUE); + g_return_val_if_fail(full_header != NULL, TRUE); + g_return_val_if_fail(E_IS_TABLE_HEADER(full_header), TRUE); + + cols = e_table_sort_info_sorting_get_count(sort_info); + + for (j = 0; j < cols; j++) { + ETableSortColumn column = e_table_sort_info_sorting_get_nth(sort_info, j); + ETableCol *tablecol; + tablecol = e_table_header_get_column_by_col_idx(full_header, column.column); + if (tablecol == NULL) + tablecol = e_table_header_get_column (full_header, e_table_header_count (full_header) - 1); + if (col == tablecol->col_idx) + return TRUE; + } + return FALSE; +} -- cgit v1.2.3