summaryrefslogtreecommitdiff
path: root/src/utils
diff options
context:
space:
mode:
authorDaniel Silverstone <dsilvers@digital-scurf.org>2012-09-10 19:14:49 +0100
committerDaniel Silverstone <dsilvers@digital-scurf.org>2012-09-10 19:14:49 +0100
commita77488bab4732c30044b04e97d13707e03825bdf (patch)
treec2b056265adfe7acd76596ab5433d2ce7f227cd3 /src/utils
parentc733e0fbd053ffa80b83839c4114a2a28b3ed2ec (diff)
downloadlibdom-a77488bab4732c30044b04e97d13707e03825bdf.tar.gz
libdom-a77488bab4732c30044b04e97d13707e03825bdf.tar.bz2
unsigned long -> uint32_t, signed long and long -> int32_t, plus collateral fixes. Test suite does not pass
Diffstat (limited to 'src/utils')
-rw-r--r--src/utils/character_valid.c4
-rw-r--r--src/utils/hashtable.c4
2 files changed, 4 insertions, 4 deletions
diff --git a/src/utils/character_valid.c b/src/utils/character_valid.c
index e966ec1..81c3558 100644
--- a/src/utils/character_valid.c
+++ b/src/utils/character_valid.c
@@ -161,11 +161,11 @@ bool binary_search(unsigned int ch, int left, int right,
}
/**
- * Test whether certain character belongs to some XML character group
+ * Test whether certain character beint32_ts to some XML character group
*
* \param ch The character being tested
* \param group The character group
- * \return true if the character belongs to the group, false otherwise.
+ * \return true if the character beint32_ts to the group, false otherwise.
*
* Generally, we use an algorithm like binary search to find the desired
* character in the group. The time complexity is about lg(n) and here n is
diff --git a/src/utils/hashtable.c b/src/utils/hashtable.c
index db6ece8..fb7c84a 100644
--- a/src/utils/hashtable.c
+++ b/src/utils/hashtable.c
@@ -114,7 +114,7 @@ dom_hash_table *_dom_hash_clone(dom_hash_table *ht)
* Destroys a hash table, freeing all memory associated with it.
*
* \param ht Hash table to destroy. After the function returns, this
- * will nolonger be valid
+ * will noint32_ter be valid
*/
void _dom_hash_destroy(dom_hash_table *ht)
{
@@ -305,7 +305,7 @@ uint32_t _dom_hash_get_length(struct dom_hash_table *ht)
* If you make changes to this hash table implementation, please rerun this
* test, and if possible, through valgrind to make sure there are no memory
* leaks or invalid memory accesses. If you add new functionality, please
- * include a test for it that has good coverage along side the other tests.
+ * include a test for it that has good coverage aint32_t side the other tests.
*/
#ifdef TEST_RIG