Top | ![]() |
![]() |
![]() |
![]() |
|
e_table_sorting_utils_affects_sort () |
|
e_table_sorting_utils_sort () |
|
e_table_sorting_utils_insert () |
|
e_table_sorting_utils_check_position () |
|
e_table_sorting_utils_tree_sort () |
|
e_table_sorting_utils_tree_check_position () |
|
e_table_sorting_utils_tree_insert () |
|
e_table_sorting_utils_create_cmp_cache () |
|
e_table_sorting_utils_free_cmp_cache () |
|
e_table_sorting_utils_add_to_cmp_cache () |
const |
e_table_sorting_utils_lookup_cmp_cache () |
gboolean e_table_sorting_utils_affects_sort (,
ETableSortInfo *sort_info,
ETableHeader *full_header);
gint compare_col
void e_table_sorting_utils_sort (,
ETableModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_header,
gint *map_table);
gint rows
gint e_table_sorting_utils_insert (,
ETableModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_header,
gint *map_table,
gint rows);
gint row
gint e_table_sorting_utils_check_position (,
ETableModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_header,
gint *map_table,
gint rows);
gint view_row
void e_table_sorting_utils_tree_sort (,
ETreeModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_headerETreePath *map_table
,);
gint count
gint e_table_sorting_utils_tree_check_position (,
ETreeModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_headerETreePath *map_table
,,
gint count);
gint old_index
gint e_table_sorting_utils_tree_insert (,
ETreeModel *source,
ETableSortInfo *sort_info,
ETableHeader *full_headerETreePath *map_table
,,
gint countETreePath path
);
gpointer e_table_sorting_utils_create_cmp_cache (void
);
Creates a new compare cache, which is storing pairs of string keys and
string values. This can be accessed by
e_table_sorting_utils_lookup_cmp_cache()
and
e_table_sorting_utils_add_to_cmp_cache()
.
Returned pointer should be freed with
e_table_sorting_utils_free_cmp_cache()
.
void e_table_sorting_utils_free_cmp_cache ();
gpointer cmp_cache
Frees a compare cache previously created with
e_table_sorting_utils_create_cmp_cache()
.
void e_table_sorting_utils_add_to_cmp_cache (,
gpointer cmp_cacheconst
,gchar *key);
gchar *value
Adds a new value for a given key to a compare cache. If such key
already exists in a cache then its value will be replaced.
Note: Given value
will be stolen and later freed with g_free.