/*
   (c) Copyright 2000-2002  convergence integrated media GmbH.
   (c) Copyright 2002       convergence GmbH.
   
   All rights reserved.

   Written by Denis Oliver Kropp <dok@directfb.org>,
              Andreas Hundt <andi@fischlustig.de> and
              Sven Neumann <sven@convergence.de>.

   Balanced binary tree ported from glib by Sven Neumann
   <sven@convergence.de>.

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2 of the License, or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the
   Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.
*/

#ifndef __TREE_H__
#define __TREE_H__

#include <core/coretypes.h>


typedef struct _Node Node;

struct _Tree
{
     Node  *root;
     void  *fast_keys[96];
};

struct _Node
{
     int    balance;
     Node  *left;
     Node  *right;
     void  *key;
     void  *value;
};


Tree * dfb_tree_new     (void);
void   dfb_tree_destroy (Tree *tree);
void   dfb_tree_insert  (Tree *tree,
                         void *key,
                         void *value);
void * dfb_tree_lookup  (Tree *tree,
                         void *key);

#endif