diff options
author | Not Zed <NotZed@HelixCode.com> | 2000-10-04 23:51:35 +0800 |
---|---|---|
committer | Michael Zucci <zucchi@src.gnome.org> | 2000-10-04 23:51:35 +0800 |
commit | 58eba683f83f3b6e2ca023c34e6eae647d929409 (patch) | |
tree | b3f8feb446ef991df4a39fda25959d6b1b256294 /widgets/table/e-table-model.h | |
parent | dcb9840881ea727701ccc12b5c96545825881064 (diff) | |
download | gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar.gz gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar.bz2 gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar.lz gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar.xz gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.tar.zst gsoc2013-evolution-58eba683f83f3b6e2ca023c34e6eae647d929409.zip |
Changed to take into account the sort group, if the table has one.x
2000-10-04 Not Zed <NotZed@HelixCode.com>
* e-table-sorted-variable.c (etsv_add): Changed to take into
account the sort group, if the table has one.x
(etsv_insert_idle): Clear the insert count if we hit an idle loop.
(etsv_sort_idle): Reset the insert count if we perform a sort.
(etsv_add): If we are adding a lot (>ETSV_INSERT_MAX) items,
without hitting an idle loop, assume we're better off performing a
sort instead. Use another idle handler to reset the count.
2000-10-03 Not Zed <NotZed@HelixCode.com>
* e-table-sorted-variable.c (etsv_sort_by_group): Sort based on
the sort_group stuff.
* e-tree-model.c (e_tree_init): Setup the group sort info string.
(etree_destroy): And free it.
(build_sort_group): Build a string for this node.
2000-09-29 Not Zed <NotZed@HelixCode.com>
* e-cell-tree.c (e_cell_tree_get_node): Changed to take the source
model, not the tree model. The source model may be a subset, and
it needs to remap the rows for us.
(ect_draw):
(ect_event):
(ect_max_width):
(ect_print): Changed callers.
* e-table-sorted-variable.c (etsv_sort_subset):
(etsv_sort_build_subset):
(etsv_sort_free_subset): Functions to perfom grouping of sorts for
sorts that have row_sort_group returning useful info.
(etsv_sort): Use the complex sort routines if we need to.
* e-table-model.c (e_table_model_row_sort_group): Return a sort-id
for a given row.
(e_table_model_has_sort_group): Return if the sort-id provides any
useful information.
svn path=/trunk/; revision=5705
Diffstat (limited to 'widgets/table/e-table-model.h')
-rw-r--r-- | widgets/table/e-table-model.h | 7 |
1 files changed, 7 insertions, 0 deletions
diff --git a/widgets/table/e-table-model.h b/widgets/table/e-table-model.h index d4fae1659e..b58614d150 100644 --- a/widgets/table/e-table-model.h +++ b/widgets/table/e-table-model.h @@ -27,6 +27,10 @@ typedef struct { gboolean (*is_cell_editable) (ETableModel *etm, int col, int row); void (*append_row) (ETableModel *etm, ETableModel *source, int row); + /* the sort group id for this row */ + const char *(*row_sort_group) (ETableModel *etm, int row); + gboolean (*has_sort_group) (ETableModel *etm); + /* Allocate a copy of the given value. */ void *(*duplicate_value) (ETableModel *etm, int col, const void *value); /* Free an allocated value. */ @@ -69,6 +73,9 @@ void e_table_model_set_value_at (ETableModel *e_table_model, int col, gboolean e_table_model_is_cell_editable (ETableModel *e_table_model, int col, int row); void e_table_model_append_row (ETableModel *e_table_model, ETableModel *source, int row); +const char *e_table_model_row_sort_group (ETableModel *e_table_model, int row); +gboolean e_table_model_has_sort_group (ETableModel *e_table_model); + void *e_table_model_duplicate_value (ETableModel *e_table_model, int col, const void *value); void e_table_model_free_value (ETableModel *e_table_model, int col, void *value); void *e_table_model_initialize_value (ETableModel *e_table_model, int col); |