Object.st
changeset 370 20f04d9b371b
parent 369 730e0f5d2404
child 375 e5019c22f40e
--- a/Object.st	Fri Jul 28 04:38:43 1995 +0200
+++ b/Object.st	Thu Aug 03 03:17:14 1995 +0200
@@ -30,7 +30,7 @@
 COPYRIGHT (c) 1988 by Claus Gittinger
 	      All Rights Reserved
 
-$Header: /cvs/stx/stx/libbasic/Object.st,v 1.54 1995-07-28 02:37:20 claus Exp $
+$Header: /cvs/stx/stx/libbasic/Object.st,v 1.55 1995-08-03 01:16:04 claus Exp $
 '!
 
 !Object class methodsFor:'documentation'!
@@ -51,7 +51,7 @@
 
 version
 "
-$Header: /cvs/stx/stx/libbasic/Object.st,v 1.54 1995-07-28 02:37:20 claus Exp $
+$Header: /cvs/stx/stx/libbasic/Object.st,v 1.55 1995-08-03 01:16:04 claus Exp $
 "
 !
 
@@ -639,6 +639,13 @@
     ^ false
 !
 
+isArray
+    "return true, if the receiver is some kind of array (or weakArray etc);
+     false is returned here - the method is only redefined in Array."
+
+    ^ false
+!
+
 isString
     "return true, if the receiver is some kind of string;
      false is returned here - the method is only redefined in String."
@@ -1324,8 +1331,8 @@
      no object-table exists and the hashval must not change when objects
      are moved by the collector. Therefore we assign each object a unique
      Id in the object header itself as its hashed upon.
-     (luckily we have 12 bits spare to do this - unluckily its only 12 bits).
-     Time will show, if 12 bits are enough; if not, another entry in the
+     (luckily we have 11 bits spare to do this - unluckily its only 11 bits).
+     Time will show, if 11 bits are enough; if not, another entry in the
      object header will be needed, adding 4 bytes to every object. Alternatively,
      hashed-upon objects could add an instvar containing the hash value."
 
@@ -1349,13 +1356,13 @@
 	}
 
 	/*
-	 * now, we got 12 bits for hashing;
+	 * now, we got 11 bits for hashing;
 	 * make it as large as possible; since most hashers use the returned
 	 * key and take it modulu some prime number, this will allow for
 	 * better distribution (i.e. bigger empty spaces) in hashed collection.
 	 * we could shift it up to the 30 bit limit - not making it negative.
 	 */
-	RETURN ( _MKSMALLINT(hash << 12) );
+	RETURN ( _MKSMALLINT(hash << __HASH_SHIFT__) );
     }
 %}.
     ^ 0 "never reached, since redefined in UndefinedObject and SmallInteger"