 |
 |
 |
Evolution-Data-Server Manual: Calendar Backend (libedata-cal) |  |
|---|---|---|---|---|
| Top | Description | ||||
Synopsis
struct EIntervalTree; EIntervalTree * e_intervaltree_new (void); gboolean e_intervaltree_insert (EIntervalTree *tree,time_t start,time_t end,ECalComponent *comp); gboolean e_intervaltree_remove (EIntervalTree *tree,const gchar *uid,const gchar *rid); void e_intervaltree_destroy (EIntervalTree *tree); GList * e_intervaltree_search (EIntervalTree *tree,time_t start,time_t end);
Details
struct EIntervalTree
struct EIntervalTree {
GObject parent;
EIntervalTreePrivate *priv;
};
Since 2.32
e_intervaltree_new ()
EIntervalTree * e_intervaltree_new (void);
Creates a new EIntervalTree.
Returns : |
The newly-created EIntervalTree. |
Since 2.32
e_intervaltree_insert ()
gboolean e_intervaltree_insert (EIntervalTree *tree,time_t start,time_t end,ECalComponent *comp);
|
interval tree |
|
start of the interval |
|
end of the interval |
|
Component |
Since 2.32
e_intervaltree_remove ()
gboolean e_intervaltree_remove (EIntervalTree *tree,const gchar *uid,const gchar *rid);
|
an EIntervalTree |
Since 2.32
e_intervaltree_destroy ()
void e_intervaltree_destroy (EIntervalTree *tree);
|
an EIntervalTree |
Since 2.32
e_intervaltree_search ()
GList * e_intervaltree_search (EIntervalTree *tree,time_t start,time_t end);
|
interval tree |
|
start of the interval |
|
end of the interval |
Returns : |
list of nodes that overlaps given interval or NULL. |
Since 2.32