/*
 * SPDX-FileCopyrightText: (C) 2008
 * SPDX-License-Identifier: LGPL-2.0-or-later
 * SPDX-FileContributor: Stanislav Slusny <slusnys@gmail.com>
 */

#if !defined (__LIBEDATA_CAL_H_INSIDE__) && !defined (LIBEDATA_CAL_COMPILATION)
#error "Only <libedata-cal/libedata-cal.h> should be included directly."
#endif

#ifndef E_INTERVALTREE_H
#define E_INTERVALTREE_H

#include <libecal/libecal.h>

#define E_INTERVALTREE_DEBUG 1

/* Standard GObject macros */
#define E_TYPE_INTERVALTREE \
	(e_intervaltree_get_type ())
#define E_INTERVALTREE(obj) \
	(G_TYPE_CHECK_INSTANCE_CAST \
	((obj), E_TYPE_INTERVALTREE, EIntervalTree))
#define E_INTERVALTREE_CLASS(cls) \
	(G_TYPE_CHECK_CLASS_CAST \
	((cls), E_TYPE_INTERVALTREE, EIntervalTreeClass))
#define E_IS_INTERVALTREE(obj) \
	(G_TYPE_CHECK_INSTANCE_TYPE \
	((obj), E_TYPE_INTERVALTREE))
#define E_IS_INTERVALTREE_CLASS(cls) \
	(G_TYPE_CHECK_CLASS_TYPE \
	((cls), E_TYPE_INTERVALTREE))
#define E_INTERVALTREE_GET_CLASS(obj) \
	(G_TYPE_INSTANCE_GET_CLASS \
	((obj), E_TYPE_INTERVALTREE, EIntervalTreeClass))

G_BEGIN_DECLS

/* #undef E_INTERVALTREE_DEBUG */
/*
 * 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.
 */

typedef struct _EIntervalTree EIntervalTree;
typedef struct _EIntervalTreeClass EIntervalTreeClass;
typedef struct _EIntervalTreePrivate EIntervalTreePrivate;

/**
 * EIntervalTree:
 * Since: 2.32
 **/
struct _EIntervalTree {
	/*< private >*/
	GObject parent;
	EIntervalTreePrivate *priv;
};

/**
 * EIntervalTreeClass:
 *
 * Class structure for the #EIntervalTree class.
 *
 * Since: 2.32
 */
struct _EIntervalTreeClass {
	/*< private >*/
	GObjectClass parent_class;
};

GType		e_intervaltree_get_type		(void) G_GNUC_CONST;
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);
GList *		e_intervaltree_search		(EIntervalTree *tree,
						 time_t start,
						 time_t end);
void		e_intervaltree_destroy		(EIntervalTree *tree);

#ifdef E_INTERVALTREE_DEBUG
void		e_intervaltree_dump		(EIntervalTree *tree);
#endif

G_END_DECLS

#endif /* E_INTERVALTREE_H */
