blob: 08e9ceb1b6758cbe649161a67494d0ca42e47b05 [file] [log] [blame]
Willy Tarreauc2186022009-10-26 19:48:54 +01001/*
2 * Elastic Binary Trees - exported functions for String data nodes.
Willy Tarreaue1ee9562011-01-04 14:33:13 +01003 * Version 6.0.5
4 * (C) 2002-2011 - Willy Tarreau <w@1wt.eu>
Willy Tarreauc2186022009-10-26 19:48:54 +01005 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21/* Consult ebsttree.h for more details about those functions */
22
23#include "ebsttree.h"
24
25/* Find the first occurence of a zero-terminated string <x> in the tree <root>.
26 * It's the caller's reponsibility to use this function only on trees which
27 * only contain zero-terminated strings. If none can be found, return NULL.
28 */
29REGPRM2 struct ebmb_node *ebst_lookup(struct eb_root *root, const char *x)
30{
31 return __ebst_lookup(root, x);
32}
33
Willy Tarreauc2186022009-10-26 19:48:54 +010034/* Insert ebmb_node <new> into subtree starting at node root <root>. Only
35 * new->key needs be set with the zero-terminated string key. The ebmb_node is
36 * returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
37 * caller is responsible for properly terminating the key with a zero.
38 */
39REGPRM2 struct ebmb_node *ebst_insert(struct eb_root *root, struct ebmb_node *new)
40{
41 return __ebst_insert(root, new);
42}