You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@apr.apache.org by jo...@apache.org on 2004/06/04 15:43:51 UTC
cvs commit: apr/include apr_tables.h
jorton 2004/06/04 06:43:50
Modified: include apr_tables.h
Log:
* include/apr_tables.h: Clarify that array push/pop work as a LIFO
stack.
PR: 29064
Revision Changes Path
1.40 +2 -2 apr/include/apr_tables.h
Index: apr_tables.h
===================================================================
RCS file: /home/cvs/apr/include/apr_tables.h,v
retrieving revision 1.39
retrieving revision 1.40
diff -d -w -u -r1.39 -r1.40
--- apr_tables.h 13 Feb 2004 09:38:28 -0000 1.39
+++ apr_tables.h 4 Jun 2004 13:43:50 -0000 1.40
@@ -111,7 +111,7 @@
int nelts, int elt_size);
/**
- * Add a new element to an array
+ * Add a new element to an array (as a first-in, last-out stack)
* @param arr The array to add an element to.
* @return Location for the new element in the array.
* @remark If there are no free spots in the array, then this function will
@@ -120,7 +120,7 @@
APR_DECLARE(void *) apr_array_push(apr_array_header_t *arr);
/**
- * Remove an element from an array
+ * Remove an element from an array (as a first-in, last-out stack)
* @param arr The array to remove an element from.
* @return Location of the element in the array.
* @remark If there are no elements in the array, NULL is returned.