Top | ![]() |
![]() |
![]() |
![]() |
EIntervalTree *
e_intervaltree_new (void
);
Creates a new EIntervalTree.
Since 2.32
gboolean e_intervaltree_insert (EIntervalTree *tree
,time_t start
,time_t end
,ECalComponent *comp
);
Since 2.32
gboolean e_intervaltree_remove (EIntervalTree *tree
,const gchar *uid
,const gchar *rid
);
Since 2.32
GList * e_intervaltree_search (EIntervalTree *tree
,time_t start
,time_t end
);
Returns list of nodes that overlaps given interval or NULL
.
Since 2.32