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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/*-
* Copyright (c) 2006 Verdens Gang AS
* Copyright (c) 2006-2009 Varnish Software AS
* All rights reserved.
*
* Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* Binary Heap API (see: http://en.wikipedia.org/wiki/Binary_heap)
*
* XXX: doesn't scale back the array of pointers when items are deleted.
*/
/* Public Interface --------------------------------------------------*/
struct binheap;
typedef int binheap_cmp_t(void *priv, void *a, void *b);
/*
* Comparison function.
* Should return true if item 'a' should be closer to the root
* than item 'b'
*/
typedef void binheap_update_t(void *priv, void *a, unsigned newidx);
/*
* Update function (optional)
* When items move in the tree, this function gets called to
* notify the item of its new index.
* Only needed if deleting non-root items.
*/
struct binheap *binheap_new(void *priv, binheap_cmp_t, binheap_update_t);
/*
* Create Binary tree
* 'priv' is passed to cmp and update functions.
*/
void binheap_insert(struct binheap *, void *);
/*
* Insert an item
*/
void binheap_reorder(const struct binheap *, unsigned idx);
/*
* Move an order after changing its key value.
*/
void binheap_delete(struct binheap *, unsigned idx);
/*
* Delete an item
* The root item has 'idx' zero
*/
void *binheap_root(const struct binheap *);
/*
* Return the root item
*/
#define BINHEAP_NOIDX 0
|
