X-Git-Url: https://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=doc%2Fexamples%2Frculfhash%2Fjhash.h;fp=doc%2Fexamples%2Frculfhash%2Fjhash.h;h=f50a0dac64216601a1c75a8bebc5ef411e085b01;hp=fc3928e5d3deae77110bc89479f81fa94345e149;hb=f99c6e92aaa1582e6cd19d93d44d91d968f39aa7;hpb=1e41ec3b07e4f8eb71c3ace758c76a7ad1784c73

diff --git a/doc/examples/rculfhash/jhash.h b/doc/examples/rculfhash/jhash.h
index fc3928e..f50a0da 100644
--- a/doc/examples/rculfhash/jhash.h
+++ b/doc/examples/rculfhash/jhash.h
@@ -116,7 +116,7 @@ uint32_t hashlittle(const void *key, size_t length, uint32_t initval)
 		 * rest of the string.	Every machine with memory protection I've seen
 		 * does it on word boundaries, so is OK with this.	But VALGRIND will
 		 * still catch it and complain.	The masking trick does make the hash
-		 * noticably faster for short strings (like English words).
+		 * noticeably faster for short strings (like English words).
 		 */
 #ifndef VALGRIND