bug fix
authorClaus Gittinger <cg@exept.de>
Thu, 24 Jun 1999 09:38:14 +0200
changeset 4309 7d8976a3abe3
parent 4308 20585b7ae5e1
child 4310 7282fde15db3
bug fix
Array.st
--- a/Array.st	Thu Jun 24 09:36:27 1999 +0200
+++ b/Array.st	Thu Jun 24 09:38:14 1999 +0200
@@ -2265,6 +2265,8 @@
     nIndex = __BYTES2OBJS__(__qSize(self) - OHDR_SIZE);
     index = __intVal(__ClassInstPtr(__qClass(self))->c_ninstvars);
 
+    o = anObject;
+
     /*
      * however, the search is limited to the first 500
      * elements, since otherwise, we may spend too much time
@@ -2276,8 +2278,6 @@
 	    nIndex = 500;
     }
 
-    o = anObject;
-
 # ifdef memsrch4
     if (index < nIndex) {
 	OBJ *p;
@@ -2370,5 +2370,5 @@
 !Array class methodsFor:'documentation'!
 
 version
-    ^ '$Header: /cvs/stx/stx/libbasic/Array.st,v 1.115 1999-06-23 12:41:21 cg Exp $'
+    ^ '$Header: /cvs/stx/stx/libbasic/Array.st,v 1.116 1999-06-24 07:38:14 cg Exp $'
 ! !