#define APR_OVERLAP_TABLES_MERGE (1) |
flag for overlap to use apr_table_mergen
#define APR_OVERLAP_TABLES_SET (0) |
flag for overlap to use apr_table_setn
typedef struct apr_array_header_t apr_array_header_t |
typedef int( apr_table_do_callback_fn_t)(void *rec, const char *key, const char *value) |
Declaration prototype for the iterator callback function of apr_table_do() and apr_table_vdo().
rec | The data passed as the first argument to apr_table_[v]do() | |
key | The key from this iteration of the table | |
value | The value from this iteration of the table |
typedef struct apr_table_entry_t apr_table_entry_t |
The (opaque) structure for string-content tables.
typedef struct apr_table_t apr_table_t |
the table abstract data type
apr_array_header_t* apr_array_append | ( | apr_pool_t * | p, | |
const apr_array_header_t * | first, | |||
const apr_array_header_t * | second | |||
) |
Append one array to the end of another, creating a new array in the process.
p | The pool to allocate the new array out of | |
first | The array to put first in the new array. | |
second | The array to put second in the new array. |
void apr_array_cat | ( | apr_array_header_t * | dst, | |
const apr_array_header_t * | src | |||
) |
Concatenate two arrays together
dst | The destination array, and the one to go first in the combined array | |
src | The source array to add to the destination array |
apr_array_header_t* apr_array_copy | ( | apr_pool_t * | p, | |
const apr_array_header_t * | arr | |||
) |
Copy the entire array
p | The pool to allocate the copy of the array out of | |
arr | The array to copy |
apr_array_header_t* apr_array_copy_hdr | ( | apr_pool_t * | p, | |
const apr_array_header_t * | arr | |||
) |
Copy the headers of the array, and arrange for the elements to be copied if and only if the code subsequently does a push or arraycat.
p | The pool to allocate the copy of the array out of | |
arr | The array to copy |
apr_array_header_t* apr_array_make | ( | apr_pool_t * | p, | |
int | nelts, | |||
int | elt_size | |||
) |
Create an array
p | The pool to allocate the memory out of | |
nelts | the number of elements in the initial array | |
elt_size | The size of each element in the array. |
void* apr_array_pop | ( | apr_array_header_t * | arr | ) |
Remove an element from an array
arr | The array to remove an element from. |
char* apr_array_pstrcat | ( | apr_pool_t * | p, | |
const apr_array_header_t * | arr, | |||
const char | sep | |||
) |
Generates a new string from the apr_pool_t containing the concatenated sequence of substrings referenced as elements within the array. The string will be empty if all substrings are empty or null, or if there are no elements in the array. If sep is non-NUL, it will be inserted between elements as a separator.
p | The pool to allocate the string out of | |
arr | The array to generate the string from | |
sep | The separator to use |
void* apr_array_push | ( | apr_array_header_t * | arr | ) |
Add a new element to an array
arr | The array to add an element to. |
int apr_is_empty_array | ( | const apr_array_header_t * | a | ) |
Determine if the array is empty
a | The array to check |
int apr_is_empty_table | ( | const apr_table_t * | t | ) |
Determine if the table is empty
t | The table to check |
void apr_table_add | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add data to a table, regardless of whether there is another element with the same key.
t | The table to add to | |
key | The key to use | |
val | The value to add. |
void apr_table_addn | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add data to a table, regardless of whether there is another element with the same key.
t | The table to add to | |
key | The key to use | |
val | The value to add. |
void apr_table_clear | ( | apr_table_t * | t | ) |
Delete all of the elements from a table
t | The table to clear |
void apr_table_compress | ( | apr_table_t * | t, | |
unsigned | flags | |||
) |
Eliminate redunandant entries in a table by either overwriting or merging duplicates
t | Table. | |
flags | APR_OVERLAP_TABLES_MERGE to merge, or APR_OVERLAP_TABLES_SET to overwrite |
apr_table_t* apr_table_copy | ( | apr_pool_t * | p, | |
const apr_table_t * | t | |||
) |
Create a new table and copy another table into it
p | The pool to allocate the new table out of | |
t | The table to copy |
int apr_table_do | ( | apr_table_do_callback_fn_t * | comp, | |
void * | rec, | |||
const apr_table_t * | t, | |||
... | ||||
) |
Iterate over a table running the provided function once for every element in the table. If there is data passed in as a vararg, then the function is only run on those elements whose key matches something in the vararg. If the vararg is NULL, then every element is run through the function. Iteration continues while the function returns non-zero.
comp | The function to run | |
rec | The data to pass as the first argument to the function | |
t | The table to iterate over | |
... | The vararg. If this is NULL, then all elements in the table are run through the function, otherwise only those whose key matches are run. |
const apr_array_header_t* apr_table_elts | ( | const apr_table_t * | t | ) |
Get the elements from a table
t | The table |
const char* apr_table_get | ( | const apr_table_t * | t, | |
const char * | key | |||
) |
Get the value associated with a given key from the table. After this call, The data is still in the table
t | The table to search for the key | |
key | The key to search for |
apr_table_t* apr_table_make | ( | apr_pool_t * | p, | |
int | nelts | |||
) |
Make a new table
p | The pool to allocate the pool out of | |
nelts | The number of elements in the initial table. |
void apr_table_merge | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add data to a table by merging the value with data that has already been stored
t | The table to search for the data | |
key | The key to merge data for | |
val | The data to add |
void apr_table_mergen | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add data to a table by merging the value with data that has already been stored
t | The table to search for the data | |
key | The key to merge data for | |
val | The data to add |
void apr_table_overlap | ( | apr_table_t * | a, | |
const apr_table_t * | b, | |||
unsigned | flags | |||
) |
Conceptually, apr_table_overlap does this:
apr_array_header_t *barr = apr_table_elts(b); apr_table_entry_t *belt = (apr_table_entry_t *)barr->elts; int i;
for (i = 0; i < barr->nelts; ++i) { if (flags & APR_OVERLAP_TABLES_MERGE) { apr_table_mergen(a, belt[i].key, belt[i].val); } else { apr_table_setn(a, belt[i].key, belt[i].val); } }
Except that it is more efficient (less space and cpu-time) especially when b has many elements.
Notice the assumptions on the keys and values in b -- they must be in an ancestor of a's pool. In practice b and a are usually from the same pool.
apr_table_t* apr_table_overlay | ( | apr_pool_t * | p, | |
const apr_table_t * | overlay, | |||
const apr_table_t * | base | |||
) |
Merge two tables into one new table
p | The pool to use for the new table | |
overlay | The first table to put in the new table | |
base | The table to add at the end of the new table |
void apr_table_set | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add a key/value pair to a table, if another element already exists with the same key, this will over-write the old data.
t | The table to add the data to. | |
key | The key fo use | |
val | The value to add |
void apr_table_setn | ( | apr_table_t * | t, | |
const char * | key, | |||
const char * | val | |||
) |
Add a key/value pair to a table, if another element already exists with the same key, this will over-write the old data.
t | The table to add the data to. | |
key | The key to use | |
val | The value to add |
void apr_table_unset | ( | apr_table_t * | t, | |
const char * | key | |||
) |
Remove data from the table
t | The table to remove data from | |
key | The key of the data being removed |
int apr_table_vdo | ( | apr_table_do_callback_fn_t * | comp, | |
void * | rec, | |||
const apr_table_t * | t, | |||
va_list | vp | |||
) |
Iterate over a table running the provided function once for every element in the table. If there is data passed in as a vararg, then the function is only run on those element's whose key matches something in the vararg. If the vararg is NULL, then every element is run through the function. Iteration continues while the function returns non-zero.
comp | The function to run | |
rec | The data to pass as the first argument to the function | |
t | The table to iterate over | |
vp | The vararg table. If this is NULL, then all elements in the table are run through the function, otherwise only those whose key matches are run. |