58 lines
2.2 KiB
C
58 lines
2.2 KiB
C
/*
|
|
* Elastic Binary Trees - exported functions for String data nodes.
|
|
* Version 5.1
|
|
* (C) 2002-2009 - Willy Tarreau <w@1wt.eu>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU 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 General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
/* Consult ebsttree.h for more details about those functions */
|
|
|
|
#include "ebsttree.h"
|
|
|
|
/* Find the first occurence of a zero-terminated string <x> in the tree <root>.
|
|
* It's the caller's reponsibility to use this function only on trees which
|
|
* only contain zero-terminated strings. If none can be found, return NULL.
|
|
*/
|
|
REGPRM2 struct ebmb_node *ebst_lookup(struct eb_root *root, const char *x)
|
|
{
|
|
return __ebst_lookup(root, x);
|
|
}
|
|
|
|
/* Find the first occurence of a length <len> string <x> in the tree <root>.
|
|
* It's the caller's reponsibility to use this function only on trees which
|
|
* only contain zero-terminated strings, and that no null character is present
|
|
* in string <x> in the first <len> chars. If none can be found, return NULL.
|
|
*/
|
|
REGPRM3 struct ebmb_node *ebst_lookup_len(struct eb_root *root, const char *x, unsigned int len)
|
|
{
|
|
struct ebmb_node *node;
|
|
|
|
node = ebmb_lookup(root, x, len);
|
|
if (!node || node->key[len] != 0)
|
|
return NULL;
|
|
return node;
|
|
}
|
|
|
|
/* Insert ebmb_node <new> into subtree starting at node root <root>. Only
|
|
* new->key needs be set with the zero-terminated string key. The ebmb_node is
|
|
* returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
|
|
* caller is responsible for properly terminating the key with a zero.
|
|
*/
|
|
REGPRM2 struct ebmb_node *ebst_insert(struct eb_root *root, struct ebmb_node *new)
|
|
{
|
|
return __ebst_insert(root, new);
|
|
}
|