1 /* Produced by texiweb from libavl.w. */
3 /* libavl - library for manipulation of binary trees.
4 Copyright (C) 1998-2002, 2004 Free Software Foundation, Inc.
6 This program is free software; you can redistribute it and/or
7 modify it under the terms of the GNU General Public License as
8 published by the Free Software Foundation; either version 2 of the
9 License, or (at your option) any later version.
11 This program is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
14 See the GNU General Public License for more details.
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., 59 Temple Place - Suite 330, Boston, MA
21 The author may be contacted at <blp@gnu.org> on the Internet, or
22 write to Ben Pfaff, Stanford University, Computer Science Dept., 353
23 Serra Mall, Stanford CA 94305, USA.
29 #ifndef LIBAVL_ALLOCATOR
30 #define LIBAVL_ALLOCATOR
31 /* Memory allocator. */
32 struct libavl_allocator
34 void *(*libavl_malloc
) (struct libavl_allocator
*, size_t libavl_size
);
35 void (*libavl_free
) (struct libavl_allocator
*, void *libavl_block
);
39 int test_correctness (struct libavl_allocator
*allocator
,
40 int insert
[], int delete[], int n
, int verbosity
);
41 int test_overflow (struct libavl_allocator
*, int order
[], int n
,
43 int compare_ints (const void *pa
, const void *pb
, void *param
);