Parallel Plane Sweep
0.1
Shared memory multithreaded version of the plane sweep algorithm
|
Go to the source code of this file.
Functions | |
struct avl_table * | avl_create (avl_comparison_func *compare, void *param, struct libavl_allocator *allocator) |
void * | avl_find (const struct avl_table *tree, const void *item) |
void ** | avl_probe (struct avl_table *tree, void *item) |
void * | avl_insert (struct avl_table *table, void *item) |
void * | avl_replace (struct avl_table *table, void *item) |
void * | avl_delete (struct avl_table *tree, const void *item) |
void | avl_t_init (struct avl_traverser *trav, struct avl_table *tree) |
void * | avl_t_first (struct avl_traverser *trav, struct avl_table *tree) |
void * | avl_t_last (struct avl_traverser *trav, struct avl_table *tree) |
void * | avl_t_find (struct avl_traverser *trav, struct avl_table *tree, void *item) |
void * | avl_t_insert (struct avl_traverser *trav, struct avl_table *tree, void *item) |
void * | avl_t_copy (struct avl_traverser *trav, const struct avl_traverser *src) |
void * | avl_t_next (struct avl_traverser *trav) |
void * | avl_t_prev (struct avl_traverser *trav) |
void * | avl_t_cur (struct avl_traverser *trav) |
void * | avl_t_replace (struct avl_traverser *trav, void *new) |
struct avl_table * | avl_copy (const struct avl_table *org, avl_copy_func *copy, avl_item_func *destroy, struct libavl_allocator *allocator) |
void | avl_destroy (struct avl_table *tree, avl_item_func *destroy) |
void * | avl_malloc (struct libavl_allocator *allocator, size_t size) |
void | avl_free (struct libavl_allocator *allocator, void *block) |
void() | avl_assert_insert (struct avl_table *table, void *item) |
void *() | avl_assert_delete (struct avl_table *table, void *item) |
Variables | |
struct libavl_allocator | avl_allocator_default |
This is the gnu avl library source fle.
Definition in file avl.c.
void*() avl_assert_delete | ( | struct avl_table * | table, |
void * | item | ||
) |
void() avl_assert_insert | ( | struct avl_table * | table, |
void * | item | ||
) |
struct avl_table* avl_copy | ( | const struct avl_table * | org, |
avl_copy_func * | copy, | ||
avl_item_func * | destroy, | ||
struct libavl_allocator * | allocator | ||
) |
struct avl_table* avl_create | ( | avl_comparison_func * | compare, |
void * | param, | ||
struct libavl_allocator * | allocator | ||
) |
void* avl_delete | ( | struct avl_table * | tree, |
const void * | item | ||
) |
void avl_destroy | ( | struct avl_table * | tree, |
avl_item_func * | destroy | ||
) |
void* avl_find | ( | const struct avl_table * | tree, |
const void * | item | ||
) |
void avl_free | ( | struct libavl_allocator * | allocator, |
void * | block | ||
) |
void* avl_malloc | ( | struct libavl_allocator * | allocator, |
size_t | size | ||
) |
void* avl_t_copy | ( | struct avl_traverser * | trav, |
const struct avl_traverser * | src | ||
) |
void* avl_t_cur | ( | struct avl_traverser * | trav | ) |
void* avl_t_find | ( | struct avl_traverser * | trav, |
struct avl_table * | tree, | ||
void * | item | ||
) |
void* avl_t_first | ( | struct avl_traverser * | trav, |
struct avl_table * | tree | ||
) |
void avl_t_init | ( | struct avl_traverser * | trav, |
struct avl_table * | tree | ||
) |
void* avl_t_insert | ( | struct avl_traverser * | trav, |
struct avl_table * | tree, | ||
void * | item | ||
) |
void* avl_t_last | ( | struct avl_traverser * | trav, |
struct avl_table * | tree | ||
) |
void* avl_t_next | ( | struct avl_traverser * | trav | ) |
void* avl_t_prev | ( | struct avl_traverser * | trav | ) |
void* avl_t_replace | ( | struct avl_traverser * | trav, |
void * | new | ||
) |
struct libavl_allocator avl_allocator_default |