4141static Error ERROR_duplicate_decl ;
4242static Error ERROR_duplicate_decl_diff_file ;
4343
44- void
45- DICTprint ( Dictionary dict ) {
44+ void DICTprint ( Dictionary dict ) {
4645 Element e ;
4746 DictionaryEntry de ;
4847
@@ -63,19 +62,15 @@ void DICTinitialize( void ) {
6362 "Redeclaration of %s. Previous declaration was on line %d in file %s." , SEVERITY_ERROR );
6463}
6564
66- /*
67- ** Procedure: DICTcreate
68- ** Parameters: int size - estimated (initial) max # of entries
69- ** Returns: Dictionary - a new dictionary of the specified size
65+ /** \def DICTcreate
66+ ** \param size - estimated (initial) max # of entries
67+ ** \return a new dictionary of the specified size
68+ ** \note now a macro
7069*/
71- /* now a macro */
7270
7371/**
7472 * Define anything in a dictionary. Generates an
7573 * error directly if there is a duplicate value.
76- * \param dictionary dictionary to modify
77- * \param entry entry to be added
78- * \param experrc buffer for error code
7974 * \return 0 on success, 1 on failure
8075 */
8176int DICTdefine ( Dictionary dict , char * name , Generic obj , Symbol * sym , char type ) {
@@ -124,6 +119,7 @@ int DICTdefine( Dictionary dict, char * name, Generic obj, Symbol * sym, char ty
124119 * ENUMERATION OF ( A, A ) which has happened!
125120 * This is the way DICTdefine used to look before enumerations gained
126121 * their unusual behavior with respect to scoping and visibility rules
122+ * \sa DICTdefine
127123 */
128124int DICT_define ( Dictionary dict , char * name , Generic obj , Symbol * sym , char type ) {
129125 struct Element_ e , * e2 ;
@@ -146,32 +142,26 @@ int DICT_define( Dictionary dict, char * name, Generic obj, Symbol * sym, char t
146142 return ( 1 );
147143}
148144
149- /*
150- ** Procedure: DICTundefine
151- ** Parameters: Dictionary dictionary - dictionary to modify
152- ** char * name - name to remove
153- ** Returns: Generic - the entry removed, NULL if not found
145+ /**
146+ ** \param dict dictionary to modify
147+ ** \param name name to remove
148+ ** \return the entry removed, NULL if not found
154149 Changed to return void, since the hash code frees the element, there
155150 is no way to return (without godawful casting) the generic itself.
156151*/
157-
158- void
159- DICTundefine ( Dictionary dict , char * name ) {
152+ void DICTundefine ( Dictionary dict , char * name ) {
160153 struct Element_ e ;
161154
162155 e .key = name ;
163156 HASHsearch ( dict , & e , HASH_DELETE );
164157}
165158
166- /*
167- ** Procedure: DICTlookup
168- ** Parameters: Dictionary dictionary - dictionary to look in
169- ** char * name - name to look up
170- ** Returns: Generic - the value found, NULL if not found
159+ /**
160+ ** \param dictionary dictionary to look in
161+ ** \param name name to look up
162+ ** \return the value found, NULL if not found
171163*/
172-
173- Generic
174- DICTlookup ( Dictionary dictionary , char * name ) {
164+ Generic DICTlookup ( Dictionary dictionary , char * name ) {
175165 struct Element_ e , * ep ;
176166
177167 if ( !dictionary ) {
@@ -187,9 +177,10 @@ DICTlookup( Dictionary dictionary, char * name ) {
187177 return ( NULL );
188178}
189179
190- /* like DICTlookup but returns symbol, too */
191- Generic
192- DICTlookup_symbol ( Dictionary dictionary , char * name , Symbol * * sym ) {
180+ /** like DICTlookup but returns symbol, too
181+ * \sa DICTlookup
182+ */
183+ Generic DICTlookup_symbol ( Dictionary dictionary , char * name , Symbol * * sym ) {
193184 struct Element_ e , * ep ;
194185
195186 if ( !dictionary ) {
@@ -206,8 +197,7 @@ DICTlookup_symbol( Dictionary dictionary, char * name, Symbol ** sym ) {
206197 return ( NULL );
207198}
208199
209- Generic
210- DICTdo ( DictionaryEntry * dict_entry ) {
200+ Generic DICTdo ( DictionaryEntry * dict_entry ) {
211201 if ( 0 == HASHlist ( dict_entry ) ) {
212202 return 0 ;
213203 }
0 commit comments