objc4-222.tar.gz

[apple/objc4.git] / runtime / hashtable2.h

diff --git a/runtime/hashtable2.h b/runtime/hashtable2.h
index ecb94be58556a320bf4214087f9cb4b81abb81ec..0f13973d12765fcb8e951c11501eb6ca7e28b6ec 100644 (file)
--- a/runtime/hashtable2.h
+++ b/runtime/hashtable2.h
@@ -27,7 +27,7 @@
     Copyright 1989-1996 NeXT Software, Inc.
 */
 
-#warning the API in this header is obsolete
+#warning The API in this header is obsoleted by NSHashtable.h
 
 #ifndef _OBJC_LITTLE_HASHTABLE_H_
 #define _OBJC_LITTLE_HASHTABLE_H_
@@ -39,7 +39,7 @@
  *************************************************************************/
 
 /* This module allows hashing of arbitrary data.  Such data must be pointers or integers, and client is responsible for allocating/deallocating this data.  A deallocation call-back is provided.
-The objective C class HashTable is prefered when dealing with (key, values) associations because it is easier to use in that situation.
+The objective C class HashTable is preferred when dealing with (key, values) associations because it is easier to use in that situation.
 As well-behaved scalable data structures, hash tables double in size when they start becoming full, thus guaranteeing both average constant time access and linear size. */
 
 typedef struct {