[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
FYI: 18-gary-hash-resize-removal.patch
From: |
Gary V. Vaughan |
Subject: |
FYI: 18-gary-hash-resize-removal.patch |
Date: |
Thu, 26 Jun 2003 16:00:51 +0100 |
User-agent: |
Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4) Gecko/20030617 |
Applied to HEAD.
--
())_. Gary V. Vaughan gary@(oranda.demon.co.uk|gnu.org)
( '/ Research Scientist http://www.oranda.demon.co.uk ,_())____
/ )= GNU Hacker http://www.gnu.org/software/libtool \' `&
`(_~)_ Tech' Author http://sources.redhat.com/autobook =`---d__/
Index: ChangeLog
from Gary V. Vaughan <address@hidden>
* m4/hash.c (m4_hash_resize): ifdefed out. This function is
neither used nor particularly appropriate since it exposes the
internal workings of the hash module. I haven't yet decided
whether to remove it entirely.
Index: m4/hash.c
===================================================================
RCS file: /cvsroot/m4/m4/m4/hash.c,v
retrieving revision 1.10
diff -u -p -u -r1.10 hash.c
--- m4/hash.c 18 Jun 2003 15:28:41 -0000 1.10
+++ m4/hash.c 26 Jun 2003 14:18:57 -0000
@@ -324,6 +324,7 @@ m4_get_hash_length (m4_hash *hash)
return HASH_LENGTH (hash);
}
+#if 0
/* Force the number of buckets to be the given value. You probably ought
not to be using this function once the table has been in use, since
the maximum density algorithm will grow the number of buckets back to
@@ -355,6 +356,7 @@ m4_hash_resize (m4_hash *hash, size_t si
XFREE (original_buckets);
}
+#endif
/* If the node density breaks the threshold, increase the size of
HASH and repopulate with the original nodes. */
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- FYI: 18-gary-hash-resize-removal.patch,
Gary V. Vaughan <=