#include <axis2_array_list.h>
Public Attributes | |
axis2_status_t(* | ensure_capacity )(struct axis2_array_list *array_list, const axis2_env_t *env, int min_capacity) |
int(* | size )(struct axis2_array_list *array_list, const axis2_env_t *env) |
axis2_bool_t(* | is_empty )(struct axis2_array_list *array_list, const axis2_env_t *env) |
axis2_bool_t(* | contains )(struct axis2_array_list *array_list, const axis2_env_t *env, void *e) |
int(* | index_of )(struct axis2_array_list *array_list, const axis2_env_t *env, void *e) |
int(* | last_index_of )(struct axis2_array_list *array_list, const axis2_env_t *env, void *e) |
void **(* | to_array )(struct axis2_array_list *array_list, const axis2_env_t *env) |
void *(* | get )(struct axis2_array_list *array_list, const axis2_env_t *env, int index) |
void *(* | set )(struct axis2_array_list *array_list, const axis2_env_t *env, int index, void *e) |
axis2_status_t(* | add )(struct axis2_array_list *array_list, const axis2_env_t *env, const void *e) |
axis2_status_t(* | add_at )(struct axis2_array_list *array_list, const axis2_env_t *env, const int index, const void *e) |
void *(* | remove )(struct axis2_array_list *array_list, const axis2_env_t *env, int index) |
axis2_bool_t(* | check_bound_inclusive )(struct axis2_array_list *array_list, const axis2_env_t *env, int index) |
axis2_bool_t(* | check_bound_exclusive )(struct axis2_array_list *array_list, const axis2_env_t *env, int index) |
axis2_status_t(* | free )(struct axis2_array_list *array_list, const axis2_env_t *env) |
|
Appends the supplied element to the end of this list. The element, e, can be a pointer of any type or NULL.
|
|
Adds the supplied element at the specified index, shifting all elements currently at that index or higher one to the right. The element, e, can be a pointer of any type or NULL.
|
|
Checks that the index is in the range of existing elements (exclusive).
|
|
Checks that the index is in the range of possible elements (inclusive).
|
|
Returns true iff element is in this array_list.
|
|
Guarantees that this list will have at least enough capacity to hold min_capacity elements. This implementation will grow the list to max(current * 2, min_capacity)
|
|
|
|
Retrieves the element at the user-supplied index.
|
|
Returns the lowest index at which element appears in this List, or -1 if it does not appear. This looks for the pointer value equality only, does not look into pointer content
|
|
Checks if the list is empty.
|
|
Returns the highest index at which element appears in this List, or -1 if it does not appear. This looks for the pointer value equality only, does not look into pointer content
|
|
Removes the element at the user-supplied index.
|
|
Sets the element at the specified index. The new element, e, can be an object of any type or null.
|
|
Returns the number of elements in this list.
|
|
Returns a void* array containing all of the elements in this array_list. The array is not independent of this list.
|