#include <axis2_linked_list.h>
Public Attributes | |
axis2_status_t(* | free )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
entry_t *(* | get_entry )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int n) |
axis2_status_t(* | remove_entry )(axis2_linked_list_t *linked_list, const axis2_env_t *env, entry_t *e) |
axis2_bool_t(* | check_bounds_inclusive )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index) |
axis2_bool_t(* | check_bounds_exclusive )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index) |
void *(* | get_first )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
void *(* | get_last )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
void *(* | remove_first )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
void *(* | remove_last )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
axis2_status_t(* | add_first )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
axis2_status_t(* | add_last )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
axis2_bool_t(* | contains )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
int(* | size )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
axis2_bool_t(* | add )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
axis2_bool_t(* | remove )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
axis2_status_t(* | clear )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
void *(* | get )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index) |
void *(* | set )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index, void *o) |
axis2_status_t(* | add_at_index )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index, void *o) |
void *(* | remove_at_index )(axis2_linked_list_t *linked_list, const axis2_env_t *env, int index) |
int(* | index_of )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
int(* | last_index_of )(axis2_linked_list_t *linked_list, const axis2_env_t *env, void *o) |
void **(* | to_array )(axis2_linked_list_t *linked_list, const axis2_env_t *env) |
|
Adds an element to the end of the list.
|
|
Inserts an element in the given position in the list.
|
|
Insert an element at the first of the list.
|
|
Insert an element at the last of the list.
|
|
Checks that the index is in the range of existing elements (exclusive).
|
|
Checks that the index is in the range of possible elements (inclusive).
|
|
Remove all elements from this list. |
|
Returns true if the list contains the given object. Comparison is done by
|
|
Return the element at index.
|
|
Obtain the Entry at a given position in a list. This method of course takes linear time, but it is intelligent enough to take the shorter of the paths to get to the Entry required. This implies that the first or last entry in the list is obtained in constant time, which is a very desirable property. For speed and flexibility, range checking is not done in this method: Incorrect values will be returned if (n < 0) or (n >= size).
|
|
Returns the first element in the list.
|
|
Returns the last element in the list.
|
|
Returns the first index where the element is located in the list, or -1.
|
|
Returns the last index where the element is located in the list, or -1.
|
|
Removes the entry at the lowest index in the list that matches the given object, comparing by
|
|
Removes the element at the given position from the list.
|
|
Remove an entry from the list. This will adjust size and deal with `first' and `last' appropriatly.
|
|
Remove and return the first element in the list.
|
|
Remove and return the last element in the list.
|
|
Replace the element at the given location in the list.
|
|
Returns the size of the list.
|
|
Returns an array which contains the elements of the list in order.
|