91 lines
2.5 KiB
C
91 lines
2.5 KiB
C
/*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 of the License, or (at your option) version 3.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with the program; if not, see <http://www.gnu.org/licenses/>
|
|
*
|
|
*
|
|
* Authors:
|
|
* Chris Lahey <clahey@ximian.com>
|
|
*
|
|
* Copyright (C) 1999-2008 Novell, Inc. (www.novell.com)
|
|
*
|
|
*/
|
|
|
|
#ifndef _E_TABLE_SORTER_H_
|
|
#define _E_TABLE_SORTER_H_
|
|
|
|
#include <e-util/e-sorter.h>
|
|
#include <table/e-table-model.h>
|
|
#include <table/e-table-subset-variable.h>
|
|
#include <table/e-table-sort-info.h>
|
|
#include <table/e-table-header.h>
|
|
|
|
/* Standard GObject macros */
|
|
#define E_TYPE_TABLE_SORTER \
|
|
(e_table_sorter_get_type ())
|
|
#define E_TABLE_SORTER(obj) \
|
|
(G_TYPE_CHECK_INSTANCE_CAST \
|
|
((obj), E_TYPE_TABLE_SORTER, ETableSorter))
|
|
#define E_TABLE_SORTER_CLASS(cls) \
|
|
(G_TYPE_CHECK_CLASS_CAST \
|
|
((cls), E_TYPE_TABLE_SORTER, ETableSorterClass))
|
|
#define E_IS_TABLE_SORTER(obj) \
|
|
(G_TYPE_CHECK_INSTANCE_TYPE \
|
|
((obj), E_TYPE_TABLE_SORTER))
|
|
#define E_IS_TABLE_SORTER_CLASS(cls) \
|
|
(G_TYPE_CHECK_CLASS_TYPE \
|
|
((cls), E_TYPE_TABLE_SORTER))
|
|
#define E_TABLE_SORTER_GET_CLASS(obj) \
|
|
(G_TYPE_INSTANCE_GET_CLASS \
|
|
((obj), E_TYPE_TABLE_SORTER, ETableSorterClass))
|
|
|
|
G_BEGIN_DECLS
|
|
|
|
typedef struct _ETableSorter ETableSorter;
|
|
typedef struct _ETableSorterClass ETableSorterClass;
|
|
|
|
struct _ETableSorter {
|
|
ESorter parent;
|
|
|
|
ETableModel *source;
|
|
ETableHeader *full_header;
|
|
ETableSortInfo *sort_info;
|
|
|
|
/* If needs_sorting is 0, then model_to_sorted
|
|
* and sorted_to_model are no-ops. */
|
|
gint needs_sorting;
|
|
|
|
gint *sorted;
|
|
gint *backsorted;
|
|
|
|
gint table_model_changed_id;
|
|
gint table_model_row_changed_id;
|
|
gint table_model_cell_changed_id;
|
|
gint table_model_rows_inserted_id;
|
|
gint table_model_rows_deleted_id;
|
|
gint sort_info_changed_id;
|
|
gint group_info_changed_id;
|
|
};
|
|
|
|
struct _ETableSorterClass {
|
|
ESorterClass parent_class;
|
|
};
|
|
|
|
GType e_table_sorter_get_type (void) G_GNUC_CONST;
|
|
ETableSorter * e_table_sorter_new (ETableModel *etm,
|
|
ETableHeader *full_header,
|
|
ETableSortInfo *sort_info);
|
|
|
|
G_END_DECLS
|
|
|
|
#endif /* _E_TABLE_SORTER_H_ */
|