64 lines
1.6 KiB
C
64 lines
1.6 KiB
C
#ifndef BH_ALGO_H
|
|
#define BH_ALGO_H
|
|
|
|
#include "bh.h"
|
|
|
|
void bh_swap(void *dest,
|
|
void *src,
|
|
size_t size);
|
|
|
|
void *bh_partition(void *pivot,
|
|
void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_sort(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_sort_insert(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_sort_shell(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_sort_intro(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_sort_heap(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_heap_make(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_heap_remove(void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_heap_insert(void *value,
|
|
void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
void bh_heap_replace(void *value,
|
|
void *array,
|
|
size_t size,
|
|
size_t element,
|
|
bh_equal_cb_t equal);
|
|
|
|
#endif /* BH_ALGO_H */
|