amino  1.0-beta2
Lightweight Robot Utility Library
heap.h
Go to the documentation of this file.
1 /* -*- mode: C; c-basic-offset: 4 -*- */
2 /* ex: set shiftwidth=4 tabstop=4 expandtab: */
3 /*
4  * Copyright (c) 2013, Georgia Tech Research Corporation
5  * All rights reserved.
6  *
7  * Author(s): Neil T. Dantam <ntd@gatech.edu>
8  * Georgia Tech Humanoid Robotics Lab
9  * Under Direction of Prof. Mike Stilman <mstilman@cc.gatech.edu>
10  *
11  *
12  * This file is provided under the following "BSD-style" License:
13  *
14  *
15  * Redistribution and use in source and binary forms, with or
16  * without modification, are permitted provided that the following
17  * conditions are met:
18  *
19  * * Redistributions of source code must retain the above copyright
20  * notice, this list of conditions and the following disclaimer.
21  *
22  * * Redistributions in binary form must reproduce the above
23  * copyright notice, this list of conditions and the following
24  * disclaimer in the documentation and/or other materials provided
25  * with the distribution.
26  *
27  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
28  * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
29  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
30  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
31  * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
32  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
35  * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
36  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
38  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
39  * POSSIBILITY OF SUCH DAMAGE.
40  *
41  */
42 
43 
56 typedef int (*aa_compar_fun)(const void *a, const void *b);
57 
63 void aa_aheap_heapify(uint8_t *base, size_t nmemb, size_t size, size_t i, aa_compar_fun compar );
64 
68 void aa_aheap_sort(void *base, size_t nmemb, size_t size, aa_compar_fun compar );
69 
73 void aa_aheap_build(uint8_t *base, size_t nmemb, size_t size, aa_compar_fun compar );
aa_aheap_build
void aa_aheap_build(uint8_t *base, size_t nmemb, size_t size, aa_compar_fun compar)
Build a heap from an array.
aa_aheap_sort
void aa_aheap_sort(void *base, size_t nmemb, size_t size, aa_compar_fun compar)
Perform heapsort.
aa_aheap_heapify
void aa_aheap_heapify(uint8_t *base, size_t nmemb, size_t size, size_t i, aa_compar_fun compar)
The "heapify" operation.
aa_compar_fun
int(* aa_compar_fun)(const void *a, const void *b)
A comparison function.
Definition: heap.h:56