diff options
| -rw-r--r-- | widgets/e-table/ChangeLog | 7 | ||||
| -rw-r--r-- | widgets/e-table/e-table-sorted-variable.c | 2 | ||||
| -rw-r--r-- | widgets/table/e-table-sorted-variable.c | 2 |
3 files changed, 9 insertions, 2 deletions
diff --git a/widgets/e-table/ChangeLog b/widgets/e-table/ChangeLog index bac9d0b748..d8a8b3b579 100644 --- a/widgets/e-table/ChangeLog +++ b/widgets/e-table/ChangeLog @@ -1,3 +1,10 @@ +2000-05-04 Chris Toshok <toshok@helixcode.com> + + * e-table-sorted-variable.c (etsv_sort): use rows here instead of + E_TABLE_SUBSET(etsv)->n_map, since the table can be populated by + the gtk_main_iteration above. otherwise the vals_closure may not + be fully populated. + 2000-05-04 Christopher James Lahey <clahey@helixcode.com> * e-table-group-container.c, e-table-group-leaf.c, diff --git a/widgets/e-table/e-table-sorted-variable.c b/widgets/e-table/e-table-sorted-variable.c index e3a0fbc8c5..bf571c9f95 100644 --- a/widgets/e-table/e-table-sorted-variable.c +++ b/widgets/e-table/e-table-sorted-variable.c @@ -274,7 +274,7 @@ etsv_sort(ETableSortedVariable *etsv) ascending_closure[j] = column.ascending; } printf("allocated\n"); - qsort(E_TABLE_SUBSET(etsv)->map_table, E_TABLE_SUBSET(etsv)->n_map, sizeof(int), qsort_callback); + qsort(E_TABLE_SUBSET(etsv)->map_table, rows, sizeof(int), qsort_callback); printf ("sorted\n"); g_free(vals_closure); g_free(ascending_closure); diff --git a/widgets/table/e-table-sorted-variable.c b/widgets/table/e-table-sorted-variable.c index e3a0fbc8c5..bf571c9f95 100644 --- a/widgets/table/e-table-sorted-variable.c +++ b/widgets/table/e-table-sorted-variable.c @@ -274,7 +274,7 @@ etsv_sort(ETableSortedVariable *etsv) ascending_closure[j] = column.ascending; } printf("allocated\n"); - qsort(E_TABLE_SUBSET(etsv)->map_table, E_TABLE_SUBSET(etsv)->n_map, sizeof(int), qsort_callback); + qsort(E_TABLE_SUBSET(etsv)->map_table, rows, sizeof(int), qsort_callback); printf ("sorted\n"); g_free(vals_closure); g_free(ascending_closure); |