Functions |
UNIV_INTERN ib_vector_t * | ib_vector_create (ib_alloc_t *alloc, ulint sizeof_value, ulint size) |
UNIV_INLINE void | ib_vector_free (ib_vector_t *vec) |
UNIV_INLINE void * | ib_vector_push (ib_vector_t *vec, const void *elem) |
UNIV_INLINE void * | ib_vector_pop (ib_vector_t *vec) |
UNIV_INLINE void * | ib_vector_remove (ib_vector_t *vec, const void *elem) |
UNIV_INLINE ulint | ib_vector_size (const ib_vector_t *vec) |
UNIV_INTERN void | ib_vector_resize (ib_vector_t *vec) |
UNIV_INLINE ibool | ib_vector_is_empty (const ib_vector_t *vec) |
UNIV_INLINE void * | ib_vector_get (ib_vector_t *vec, ulint n) |
UNIV_INLINE const void * | ib_vector_get_const (const ib_vector_t *vec, ulint n) |
UNIV_INLINE void * | ib_vector_get_last (ib_vector_t *vec) |
UNIV_INLINE void | ib_vector_set (ib_vector_t *vec, ulint n, void *elem) |
UNIV_INLINE void | ib_vector_reset (ib_vector_t *vec) |
UNIV_INLINE void * | ib_vector_last (ib_vector_t *vec) |
UNIV_INLINE const void * | ib_vector_last_const (const ib_vector_t *vec) |
UNIV_INLINE void | ib_vector_sort (ib_vector_t *vec, ib_compare_t compare) |
UNIV_INLINE void | ib_heap_free (ib_alloc_t *allocator, void *ptr) |
UNIV_INLINE void * | ib_heap_malloc (ib_alloc_t *allocator, ulint size) |
UNIV_INLINE void * | ib_heap_resize (ib_alloc_t *allocator, void *old_ptr, ulint old_size, ulint new_size) |
UNIV_INLINE ib_alloc_t * | ib_heap_allocator_create (mem_heap_t *heap) |
UNIV_INLINE void | ib_heap_allocator_free (ib_alloc_t *ib_ut_alloc) |
UNIV_INLINE void | ib_ut_free (ib_alloc_t *allocator, void *ptr) |
UNIV_INLINE void * | ib_ut_malloc (ib_alloc_t *allocator, ulint size) |
UNIV_INLINE void * | ib_ut_resize (ib_alloc_t *allocator, void *old_ptr, ulint old_size, ulint new_size) |
UNIV_INLINE ib_alloc_t * | ib_ut_allocator_create (void) |
UNIV_INLINE void | ib_ut_allocator_free (ib_alloc_t *ib_ut_alloc) |
A vector of pointers to data items
Created 4/6/2006 Osku Salerma