summaryrefslogtreecommitdiff
path: root/hash.c
diff options
context:
space:
mode:
authorPaul Smith <psmith@gnu.org>2012-03-04 00:24:20 +0000
committerPaul Smith <psmith@gnu.org>2012-03-04 00:24:20 +0000
commit23c2b99e9d23e726ede9442728272616e66d416f (patch)
tree80b69e1fde31e8c4a39ee43b57546a06f77de353 /hash.c
parent405c89ba1e33e013f7e582e28f969fc3f39b9b2c (diff)
downloadgunmake-23c2b99e9d23e726ede9442728272616e66d416f.tar.gz
Convert all "`'" quotes to "''" per new GNU Coding Standard guidelines.
Fixes Savannah bug #34530.
Diffstat (limited to 'hash.c')
-rw-r--r--hash.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/hash.c b/hash.c
index b91447c..e04b1bb 100644
--- a/hash.c
+++ b/hash.c
@@ -26,7 +26,7 @@ static void hash_rehash __P((struct hash_table* ht));
static unsigned long round_up_2 __P((unsigned long rough));
/* Implement double hashing with open addressing. The table size is
- always a power of two. The secondary (`increment') hash function
+ always a power of two. The secondary ('increment') hash function
is forced to return an odd-value, in order to be relatively prime
to the table size. This guarantees that the increment can
potentially hit every slot in the table during collision
@@ -61,7 +61,7 @@ hash_init (struct hash_table *ht, unsigned long size,
ht->ht_compare = hash_cmp;
}
-/* Load an array of items into `ht'. */
+/* Load an array of items into 'ht'. */
void
hash_load (struct hash_table *ht, void *item_table,
@@ -75,9 +75,9 @@ hash_load (struct hash_table *ht, void *item_table,
}
}
-/* Returns the address of the table slot matching `key'. If `key' is
+/* Returns the address of the table slot matching 'key'. If 'key' is
not found, return the address of an empty slot suitable for
- inserting `key'. The caller is responsible for incrementing
+ inserting 'key'. The caller is responsible for incrementing
ht_fill on insertion. */
void **