[prev in list] [next in list] [prev in thread] [next in thread] 

List:       apr-cvs
Subject:    svn commit: r395443 - in /apr/apr/trunk/include: apr.h.in apr_tables.h
From:       ianh () apache ! org
Date:       2006-04-19 23:51:20
Message-ID: 20060419235120.96038.qmail () minotaur ! apache ! org
[Download RAW message or body]

Author: ianh
Date: Wed Apr 19 16:51:17 2006
New Revision: 395443

URL: http://svn.apache.org/viewcvs?rev=395443&view=rev
Log:
doxygen fixes

Modified:
    apr/apr/trunk/include/apr.h.in
    apr/apr/trunk/include/apr_tables.h

Modified: apr/apr/trunk/include/apr.h.in
URL: http://svn.apache.org/viewcvs/apr/apr/trunk/include/apr.h.in?rev=395443&r1=395442&r2=395443&view=diff
 ==============================================================================
--- apr/apr/trunk/include/apr.h.in (original)
+++ apr/apr/trunk/include/apr.h.in Wed Apr 19 16:51:17 2006
@@ -390,6 +390,7 @@
 #endif
 
 /** @} */
+/** @} */
 
 #ifdef __cplusplus
 }

Modified: apr/apr/trunk/include/apr_tables.h
URL: http://svn.apache.org/viewcvs/apr/apr/trunk/include/apr_tables.h?rev=395443&r1=395442&r2=395443&view=diff
 ==============================================================================
--- apr/apr/trunk/include/apr_tables.h (original)
+++ apr/apr/trunk/include/apr_tables.h Wed Apr 19 16:51:17 2006
@@ -394,9 +394,9 @@
  *          than a function that just loops through table b calling other functions.
  */
 /**
- *<PRE>
  * Conceptually, apr_table_overlap does this:
  *
+ * <pre>
  *  apr_array_header_t *barr = apr_table_elts(b);
  *  apr_table_entry_t *belt = (apr_table_entry_t *)barr->elts;
  *  int i;
@@ -409,6 +409,7 @@
  *          apr_table_setn(a, belt[i].key, belt[i].val);
  *      }
  *  }
+ * </pre>
  *
  *  Except that it is more efficient (less space and cpu-time) especially
  *  when b has many elements.
@@ -416,7 +417,6 @@
  *  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.
- * </PRE>
  */
 
 APR_DECLARE(void) apr_table_overlap(apr_table_t *a, const apr_table_t *b,


[prev in list] [next in list] [prev in thread] [next in thread]