1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/*
* Copyright (C) 2004 Benjamin Otte <otte@gnome.org>
*
* This 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 program 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
* General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/* The interfaces in this file are subject to change at any time. */
#include "vtetree.h"
VteTree *
_vte_tree_new(GCompareFunc key_compare_func)
{
VteTree *tree = g_slice_new0 (VteTree);
tree->tree = g_tree_new (key_compare_func);
return tree;
}
void
_vte_tree_destroy(VteTree *tree)
{
g_tree_destroy (tree->tree);
g_slice_free (VteTree, tree);
}
void
_vte_tree_insert(VteTree *tree, gpointer key, gpointer value)
{
guint index = GPOINTER_TO_UINT (key);
if (index < VTE_TREE_ARRAY_SIZE) {
tree->array[index] = value;
return;
}
g_tree_insert (tree->tree, key, value);
}
gpointer
_vte_tree_lookup(VteTree *tree, gconstpointer key)
{
const guint index = GPOINTER_TO_UINT (key);
if (index < VTE_TREE_ARRAY_SIZE)
return tree->array[index];
return g_tree_lookup (tree->tree, key);
}
|
