| Top |  |  |  |  | 
| EIntervalTree * | e_intervaltree_new () | 
| gboolean | e_intervaltree_insert () | 
| gboolean | e_intervaltree_remove () | 
| GList * | e_intervaltree_search () | 
| void | e_intervaltree_destroy () | 
| void | e_intervaltree_dump () | 
Implementation of the interval node as described in Introduction to Algorithms book by Cormen et al, chapter 14.3.
Basically, the interval tree is the red-black tree, the node key is the start of the interval.
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);
| tree | ||
| uid | the uid of the component to remove | |
| rid | the recurrance id of the component to remove | 
Since: 2.32
GList * e_intervaltree_search (EIntervalTree *tree,time_t start,time_t end);
Since: 2.32
struct EIntervalTree;
Contains only private data that should be read and manipulated using the functions below.
Since: 2.32
struct EIntervalTreeClass {
};
Class structure for the EIntervalTree class.
Since: 2.32