gtkrbtree.h 6.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14
/* gtkrbtree.h
 * Copyright (C) 2000  Red Hat, Inc.,  Jonathan Blandford <jrb@redhat.com>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
Javier Jardón's avatar
Javier Jardón committed
15
 * License along with this library. If not, see <http://www.gnu.org/licenses/>.
16 17
 */

18 19
/* A Red-Black Tree implementation used specifically by GtkTreeView.
 */
20 21 22
#ifndef __GTK_RBTREE_H__
#define __GTK_RBTREE_H__

Matthias Clasen's avatar
Matthias Clasen committed
23 24
#include <glib.h>

25 26 27

G_BEGIN_DECLS

28 29 30 31 32 33 34 35

typedef enum
{
  GTK_RBNODE_BLACK = 1 << 0,
  GTK_RBNODE_RED = 1 << 1,
  GTK_RBNODE_IS_PARENT = 1 << 2,
  GTK_RBNODE_IS_SELECTED = 1 << 3,
  GTK_RBNODE_IS_PRELIT = 1 << 4,
36
  GTK_RBNODE_INVALID = 1 << 7,
Jonathan Blandford's avatar
Jonathan Blandford committed
37 38 39 40 41 42 43 44
  GTK_RBNODE_COLUMN_INVALID = 1 << 8,
  GTK_RBNODE_DESCENDANTS_INVALID = 1 << 9,
  GTK_RBNODE_NON_COLORS = GTK_RBNODE_IS_PARENT |
  			  GTK_RBNODE_IS_SELECTED |
  			  GTK_RBNODE_IS_PRELIT |
                          GTK_RBNODE_INVALID |
                          GTK_RBNODE_COLUMN_INVALID |
                          GTK_RBNODE_DESCENDANTS_INVALID
45 46 47 48 49 50 51
} GtkRBNodeColor;

typedef struct _GtkRBTree GtkRBTree;
typedef struct _GtkRBNode GtkRBNode;
typedef struct _GtkRBTreeView GtkRBTreeView;

typedef void (*GtkRBTreeTraverseFunc) (GtkRBTree  *tree,
52 53
                                       GtkRBNode  *node,
                                       gpointer  data);
54 55 56 57 58 59 60 61 62 63

struct _GtkRBTree
{
  GtkRBNode *root;
  GtkRBTree *parent_tree;
  GtkRBNode *parent_node;
};

struct _GtkRBNode
{
64 65
  guint flags : 14;

Havoc Pennington's avatar
Havoc Pennington committed
66 67 68 69
  /* count is the number of nodes beneath us, plus 1 for ourselves.
   * i.e. node->left->count + node->right->count + 1
   */
  gint count;
70 71 72 73 74

  GtkRBNode *left;
  GtkRBNode *right;
  GtkRBNode *parent;

75 76 77 78 79
  /* count the number of total nodes beneath us, including nodes
   * of children trees.
   * i.e. node->left->count + node->right->count + node->children->root->count + 1
   */
  guint total_count;
80
  
Havoc Pennington's avatar
Havoc Pennington committed
81 82 83 84 85
  /* this is the total of sizes of
   * node->left, node->right, our own height, and the height
   * of all trees in ->children, iff children exists because
   * the thing is expanded.
   */
86
  gint offset;
87 88

  /* Child trees */
89 90 91
  GtkRBTree *children;
};

Jonathan Blandford's avatar
Jonathan Blandford committed
92

93 94 95 96 97 98 99 100 101 102 103 104 105 106
#define GTK_RBNODE_GET_COLOR(node)		(node?(((node->flags&GTK_RBNODE_RED)==GTK_RBNODE_RED)?GTK_RBNODE_RED:GTK_RBNODE_BLACK):GTK_RBNODE_BLACK)
#define GTK_RBNODE_SET_COLOR(node,color) 	if((node->flags&color)!=color)node->flags=node->flags^(GTK_RBNODE_RED|GTK_RBNODE_BLACK)
#define GTK_RBNODE_GET_HEIGHT(node) 		(node->offset-(node->left->offset+node->right->offset+(node->children?node->children->root->offset:0)))
#define GTK_RBNODE_SET_FLAG(node, flag)   	G_STMT_START{ (node->flags|=flag); }G_STMT_END
#define GTK_RBNODE_UNSET_FLAG(node, flag) 	G_STMT_START{ (node->flags&=~(flag)); }G_STMT_END
#define GTK_RBNODE_FLAG_SET(node, flag) 	(node?(((node->flags&flag)==flag)?TRUE:FALSE):FALSE)


GtkRBTree *_gtk_rbtree_new              (void);
void       _gtk_rbtree_free             (GtkRBTree              *tree);
void       _gtk_rbtree_remove           (GtkRBTree              *tree);
void       _gtk_rbtree_destroy          (GtkRBTree              *tree);
GtkRBNode *_gtk_rbtree_insert_before    (GtkRBTree              *tree,
					 GtkRBNode              *node,
Jonathan Blandford's avatar
Jonathan Blandford committed
107 108
					 gint                    height,
					 gboolean                valid);
109 110
GtkRBNode *_gtk_rbtree_insert_after     (GtkRBTree              *tree,
					 GtkRBNode              *node,
Jonathan Blandford's avatar
Jonathan Blandford committed
111 112
					 gint                    height,
					 gboolean                valid);
113 114
void       _gtk_rbtree_remove_node      (GtkRBTree              *tree,
					 GtkRBNode              *node);
115
gboolean   _gtk_rbtree_is_nil           (GtkRBNode              *node);
116 117 118
void       _gtk_rbtree_reorder          (GtkRBTree              *tree,
					 gint                   *new_order,
					 gint                    length);
119 120
gboolean   _gtk_rbtree_contains         (GtkRBTree              *tree,
                                         GtkRBTree              *potential_child);
121 122 123 124 125
GtkRBNode *_gtk_rbtree_find_count       (GtkRBTree              *tree,
					 gint                    count);
void       _gtk_rbtree_node_set_height  (GtkRBTree              *tree,
					 GtkRBNode              *node,
					 gint                    height);
126 127 128 129
void       _gtk_rbtree_node_mark_invalid(GtkRBTree              *tree,
					 GtkRBNode              *node);
void       _gtk_rbtree_node_mark_valid  (GtkRBTree              *tree,
					 GtkRBNode              *node);
Jonathan Blandford's avatar
Jonathan Blandford committed
130
void       _gtk_rbtree_column_invalid   (GtkRBTree              *tree);
131
void       _gtk_rbtree_mark_invalid     (GtkRBTree              *tree);
132
void       _gtk_rbtree_set_fixed_height (GtkRBTree              *tree,
133 134
					 gint                    height,
					 gboolean                mark_valid);
135 136
gint       _gtk_rbtree_node_find_offset (GtkRBTree              *tree,
					 GtkRBNode              *node);
137
guint      _gtk_rbtree_node_get_index   (GtkRBTree              *tree,
138
					 GtkRBNode              *node);
139 140 141 142
gboolean   _gtk_rbtree_find_index       (GtkRBTree              *tree,
					 guint                   index,
					 GtkRBTree             **new_tree,
					 GtkRBNode             **new_node);
143 144 145 146 147 148 149 150 151
gint       _gtk_rbtree_find_offset      (GtkRBTree              *tree,
					 gint                    offset,
					 GtkRBTree             **new_tree,
					 GtkRBNode             **new_node);
void       _gtk_rbtree_traverse         (GtkRBTree              *tree,
					 GtkRBNode              *node,
					 GTraverseType           order,
					 GtkRBTreeTraverseFunc   func,
					 gpointer                data);
152
GtkRBNode *_gtk_rbtree_first            (GtkRBTree              *tree);
153 154 155 156 157 158 159 160 161 162 163 164 165
GtkRBNode *_gtk_rbtree_next             (GtkRBTree              *tree,
					 GtkRBNode              *node);
GtkRBNode *_gtk_rbtree_prev             (GtkRBTree              *tree,
					 GtkRBNode              *node);
void       _gtk_rbtree_next_full        (GtkRBTree              *tree,
					 GtkRBNode              *node,
					 GtkRBTree             **new_tree,
					 GtkRBNode             **new_node);
void       _gtk_rbtree_prev_full        (GtkRBTree              *tree,
					 GtkRBNode              *node,
					 GtkRBTree             **new_tree,
					 GtkRBNode             **new_node);

166
gint       _gtk_rbtree_get_depth        (GtkRBTree              *tree);
167

168 169 170

G_END_DECLS

171 172

#endif /* __GTK_RBTREE_H__ */