code review 4047047: runtime: automaticaly generated Go declarations for C v...

src/pkg/runtime/hashmap.h

 // Copyright 2009 The Go Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style
 // license that can be found in the LICENSE file.
 
 /* A hash table.
    Example, hashing nul-terminated char*s:
         hash_hash_t str_hash (void *v) {
                 char *s;
                 hash_hash_t hash = 0;
                 for (s = *(char **)v; *s != 0; s++) {
                         hash = (hash ^ *s) * 2654435769U;
                 }
                 return (hash);
         }
         int str_eq (void *a, void *b) {
                 return (strcmp (*(char **)a, *(char **)b) == 0);
         }
         void str_del (void *arg, void *data) {
                 *(char **)arg = *(char **)data;
         }
 
-        struct Hmap *h = hash_new (sizeof (char *), &str_hash, &str_eq, &str_del, 3, 12, 15);
+        struct hash *h = hash_new (sizeof (char *), &str_hash, &str_eq, &str_del, 3, 12, 15);
         ...  3=> 2**3  entries initial size
         ... 12=> 2**12 entries before sprouting sub-tables
         ... 15=> number of adjacent probes to attempt before growing
 
   Example lookup:
         char *key = "foobar";
         char **result_ptr;
         if (hash_lookup (h, &key, (void **) &result_ptr)) {
               printf ("found in table: %s\n", *result_ptr);
         } else {
@@ skipping 117 matching lines @@
 // void hash_iter_init (struct hash *h, struct hash_iter *it);
 
 /* Return the next used entry in the table which which *it was initialized. */
 // void *hash_next (struct hash_iter *it);
 
 /*---- test interface ----*/
 /* Call (*data_visit) (arg, level, data) for every data entry in the table,
    whether used or not.   "level" is the subtable level, 0 means first level. */
 /* TESTING ONLY: DO NOT USE THIS ROUTINE IN NORMAL CODE */
 // void hash_visit (struct hash *h, void (*data_visit) (void *arg, int32 level, void *data), void *arg);