#define E_TREE_MODEL_TYPEgint (*ETreePathCompareFunc) (ETreeModel *model,ETreePath *path1,ETreePath *path2);gboolean (*ETreePathFunc) (ETreeModel *model,ETreePath *path,gpointer data);void e_tree_model_construct (ETreeModel *etree);ETreeModel * e_tree_model_new (void);ETreePath * e_tree_model_get_root (ETreeModel *etree);ETreePath * e_tree_model_node_get_parent (ETreeModel *etree,ETreePath *path);ETreePath * e_tree_model_node_get_first_child (ETreeModel *etree,ETreePath *path);ETreePath * e_tree_model_node_get_last_child (ETreeModel *etree,ETreePath *path);ETreePath * e_tree_model_node_get_next (ETreeModel *etree,ETreePath *path);ETreePath * e_tree_model_node_get_prev (ETreeModel *etree,ETreePath *path);ETreePath * e_tree_model_node_insert (ETreeModel *etree,ETreePath *parent,int position,gpointer node_data);ETreePath * e_tree_model_node_insert_before (ETreeModel *etree,ETreePath *parent,ETreePath *sibling,gpointer node_data);gpointer e_tree_model_node_remove (ETreeModel *etree,ETreePath *path);void e_tree_model_freeze (ETreeModel *etree);void e_tree_model_thaw (ETreeModel *etree);gboolean e_tree_model_node_is_root (ETreeModel *etree,ETreePath *path);gboolean e_tree_model_node_is_expandable (ETreeModel *etree,ETreePath *path);gboolean e_tree_model_node_is_expanded (ETreeModel *etree,ETreePath *path);gboolean e_tree_model_node_is_visible (ETreeModel *etree,ETreePath *path);void e_tree_model_set_expanded_default (ETreeModel *etree,gboolean expanded);void e_tree_model_node_set_expanded (ETreeModel *etree,ETreePath *path,gboolean expanded);void e_tree_model_node_set_expanded_recurse (ETreeModel *etree,ETreePath *path,gboolean expanded);guint e_tree_model_node_get_children (ETreeModel *etree,ETreePath *path,ETreePath ***paths);guint e_tree_model_node_depth (ETreeModel *etree,ETreePath *path);guint e_tree_model_node_num_visible_descendents (ETreeModel *etm,ETreePath *node);gpointer e_tree_model_node_get_data (ETreeModel *etm,ETreePath *node);void e_tree_model_node_set_data (ETreeModel *etm,ETreePath *node,gpointer node_data);ETreePath * e_tree_model_node_at_row (ETreeModel *etree,int row);GdkPixbuf * e_tree_model_icon_of_node (ETreeModel *etree,ETreePath *path);int e_tree_model_row_of_node (ETreeModel *etree,ETreePath *path);void e_tree_model_root_node_set_visible (ETreeModel *etree,gboolean visible);gboolean e_tree_model_root_node_is_visible (ETreeModel *etree);void e_tree_model_node_set_compare_function (ETreeModel *tree_model,ETreePath *node, ETreePathCompareFunc compare);void e_tree_model_node_sort (ETreeModel *tree_model,ETreePath *node);void e_tree_model_node_changed (ETreeModel *tree_model,ETreePath *node);void e_tree_model_node_inserted (ETreeModel *tree_model,ETreePath *parent_node,ETreePath *inserted_node);void e_tree_model_node_removed (ETreeModel *tree_model,ETreePath *parent_node,ETreePath *removed_node);void e_tree_model_node_collapsed (ETreeModel *tree_model,ETreePath *node);void e_tree_model_node_expanded (ETreeModel *tree_model,ETreePath *node,gboolean *allow_expand);gboolean e_tree_model_save_expanded_state (ETreeModel *etm, constchar *filename);gboolean e_tree_model_load_expanded_state (ETreeModel *etm, constchar *filename);void e_tree_model_node_set_save_id (ETreeModel *etm,ETreePath *node, constchar *id);ETreePath * e_tree_model_node_insert_id (ETreeModel *tree_model,ETreePath *parent_path,int position,gpointer node_data, constchar *save_id);void e_tree_model_node_traverse (ETreeModel *model,ETreePath *path, ETreePathFunc func,gpointer data);
gint (*ETreePathCompareFunc) (ETreeModel *model,ETreePath *path1,ETreePath *path2);
| model : | |
| path1 : | |
| path2 : | |
| Returns : |
|
gboolean (*ETreePathFunc) (ETreeModel *model,ETreePath *path,gpointer data);
| model : | |
| path : | |
| data : | |
| Returns : |
|
ETreeModel * e_tree_model_new (void);
XXX docs here.
return values: a newly constructed ETreeModel.
| Returns : |
|
ETreePath * e_tree_model_get_root (ETreeModel *etree);
Accessor for the root node of etree.
return values: the ETreePath corresponding to the root node.
| etree : | the ETreeModel of which we want the root node. |
| Returns : |
|
ETreePath * e_tree_model_node_get_parent (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : |
|
| Returns : |
|
ETreePath * e_tree_model_node_get_first_child (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : | |
| Returns : |
|
ETreePath * e_tree_model_node_get_last_child (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : | |
| Returns : |
|
ETreePath * e_tree_model_node_get_next (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : | |
| Returns : |
|
ETreePath * e_tree_model_node_get_prev (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : | |
| Returns : |
|
ETreePath * e_tree_model_node_insert (ETreeModel *etree,ETreePath *parent,int position,gpointer node_data);
| etree : | |
| parent : | |
| position : | |
| node_data : | |
| Returns : |
|
ETreePath * e_tree_model_node_insert_before (ETreeModel *etree,ETreePath *parent,ETreePath *sibling,gpointer node_data);
| etree : | |
| parent : | |
| sibling : | |
| node_data : | |
| Returns : |
|
gpointer e_tree_model_node_remove (ETreeModel *etree,ETreePath *path);
| etree : | |
| path : | |
| Returns : |
|
gboolean e_tree_model_node_is_root (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : |
|
| Returns : |
|
gboolean e_tree_model_node_is_expandable (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : |
|
| Returns : |
|
gboolean e_tree_model_node_is_expanded (ETreeModel *etree,ETreePath *path);
| etree : | |
| path : | |
| Returns : |
|
gboolean e_tree_model_node_is_visible (ETreeModel *etree,ETreePath *path);
| etree : | |
| path : | |
| Returns : |
|
void e_tree_model_set_expanded_default (ETreeModel *etree,gboolean expanded);
| etree : | |
| expanded : |
|
void e_tree_model_node_set_expanded (ETreeModel *etree,ETreePath *path,gboolean expanded);
| etree : | |
| path : | |
| expanded : |
|
void e_tree_model_node_set_expanded_recurse (ETreeModel *etree,ETreePath *path,gboolean expanded);
| etree : | |
| path : | |
| expanded : |
|
guint e_tree_model_node_get_children (ETreeModel *etree,ETreePath *path,ETreePath ***paths);
| etree : | |
| path : | |
| paths : | |
| Returns : |
|
guint e_tree_model_node_depth (ETreeModel *etree,ETreePath *path);
| etree : |
|
| path : |
|
| Returns : |
|
guint e_tree_model_node_num_visible_descendents (ETreeModel *etm,ETreePath *node);
| etm : | |
| node : | |
| Returns : |
|
gpointer e_tree_model_node_get_data (ETreeModel *etm,ETreePath *node);
| etm : | |
| node : | |
| Returns : |
|
void e_tree_model_node_set_data (ETreeModel *etm,ETreePath *node,gpointer node_data);
| etm : | |
| node : | |
| node_data : |
|
ETreePath * e_tree_model_node_at_row (ETreeModel *etree,int row);
| etree : | |
| row : | |
| Returns : |
|
GdkPixbuf * e_tree_model_icon_of_node (ETreeModel *etree,ETreePath *path);
XXX docs here.
return values: the GdkPixbuf associated with this node.
| etree : | The ETreeModel. |
| path : | The ETreePath to the node we're getting the icon of. |
| Returns : |
|
int e_tree_model_row_of_node (ETreeModel *etree,ETreePath *path);
| etree : | |
| path : | |
| Returns : |
|
void e_tree_model_root_node_set_visible (ETreeModel *etree,gboolean visible);
| etree : | |
| visible : |
|
gboolean e_tree_model_root_node_is_visible (ETreeModel *etree);
| etree : | |
| Returns : |
|
void e_tree_model_node_set_compare_function (ETreeModel *tree_model,ETreePath *node, ETreePathCompareFunc compare);
| tree_model : | |
| node : | |
| compare : |
|
void e_tree_model_node_sort (ETreeModel *tree_model,ETreePath *node);
| tree_model : | |
| node : |
|
void e_tree_model_node_changed (ETreeModel *tree_model,ETreePath *node);
| tree_model : |
|
| node : |
|
void e_tree_model_node_inserted (ETreeModel *tree_model,ETreePath *parent_node,ETreePath *inserted_node);
| tree_model : |
|
| parent_node : |
|
| inserted_node : |
|
void e_tree_model_node_removed (ETreeModel *tree_model,ETreePath *parent_node,ETreePath *removed_node);
| tree_model : |
|
| parent_node : |
|
| removed_node : |
|
void e_tree_model_node_collapsed (ETreeModel *tree_model,ETreePath *node);
| tree_model : | |
| node : |
|
void e_tree_model_node_expanded (ETreeModel *tree_model,ETreePath *node,gboolean *allow_expand);
| tree_model : | |
| node : | |
| allow_expand : |
|
gboolean e_tree_model_save_expanded_state (ETreeModel *etm, constchar *filename);
| etm : | |
| filename : | |
| Returns : |
|
gboolean e_tree_model_load_expanded_state (ETreeModel *etm, constchar *filename);
| etm : | |
| filename : | |
| Returns : |
|
void e_tree_model_node_set_save_id (ETreeModel *etm,ETreePath *node, constchar *id);
| etm : | |
| node : | |
| id : |
|
ETreePath * e_tree_model_node_insert_id (ETreeModel *tree_model,ETreePath *parent_path,int position,gpointer node_data, constchar *save_id);
| tree_model : | |
| parent_path : | |
| position : | |
| node_data : | |
| save_id : | |
| Returns : |
|
void e_tree_model_node_traverse (ETreeModel *model,ETreePath *path, ETreePathFunc func,gpointer data);
| model : |
|
| path : |
|
| func : |
|
| data : |
|
| <<< ECellTree | ETableGroup >>> |