diff -ur qhacc-3.2/ChangeLog qhacc-3.2.1pre/ChangeLog
--- qhacc-3.2/ChangeLog	2004-07-31 18:22:29.000000000 -0400
+++ qhacc-3.2.1pre/ChangeLog	2004-08-07 11:15:56.000000000 -0400
@@ -1,3 +1,7 @@
+VERSION 3.2.1
+2004-08-XX
+	* fixed indexing segfault that affected upgrades, resizing
+	
 VERSION 3.2
 2004-08-01
 	* improved auto-completion performance in Transaction Editor
Only in qhacc-3.2.1pre: autom4te.cache
diff -ur qhacc-3.2/lib/qhacctable.cpp qhacc-3.2.1pre/lib/qhacctable.cpp
--- qhacc-3.2/lib/qhacctable.cpp	2004-07-17 14:39:00.000000000 -0400
+++ qhacc-3.2.1pre/lib/qhacctable.cpp	2004-08-07 11:16:01.000000000 -0400
@@ -181,7 +181,6 @@
 }
 
 void QHaccTable::istopLoad(){
-	//if( capacity-size>maxFree ) resizeTo( size+maxFree/2 );
 	loading=false;
 	std::ostream * str;
 	remake();
@@ -714,9 +713,9 @@
 uint QHaccTableIndex::operator[]( uint i ) const { return lookup[i]; }
 
 void QHaccTableIndex::remake(){
-	uint sizer=data->trows(); // this is total capacity, so we have some empties
+	lkpsz=data->trows(); // this is total capacity, so we have some empties
 	delete [] lookup;
-	lookup=new uint[sizer];
+	lookup=new uint[lkpsz];
 	reindex();
 }
 
@@ -765,6 +764,11 @@
 
 void QHaccTableIndex::newvalat( uint datapos ){
 	//cout<<"newvalat "<<datapos<<":"<<data->at( datapos ).toString()<<endl;
+	if( datapos>lkpsz ){
+		lkpsz=data->trows(); // this is total capacity, so we have some empties
+		delete [] lookup;
+		lookup=new uint[lkpsz];
+	}
 
 	fcomp=ftype;
 	ffield=field;
@@ -782,77 +786,6 @@
 	}
 }
 
-/*
-void QHaccTableIndex::qisort( uint lo, uint hi ){
-	if( lo>=hi ) return;
-	uint q=findQ( lo, hi );
-	qisort( lo, q );
-	qisort( q+1, hi );
-}
-
-uint QHaccTableIndex::findQ( uint p, uint r ) {
-  uint pivoti=( p+r )/2;
-  uint i=p-1;
-  uint j=r+1;
-
-  if( subfield==-1 ){
-		const TableCol& pivot=dat( pivoti ).get( field );
-
-    while( true ) {
-			int rslt=0;
-      do {
-        j--;
-				rslt=dat( j )[field].compareTo( pivot, ftype );
-				compara++;
-      } while( rslt>0 );
-
-      do {
-        i++;
-				rslt=dat( i )[field].compareTo( pivot, ftype );
-				compara++;
-      } while( rslt<0 );
-
-      if( i<j ) swap( i, j );
-      else return j;
-    }
-  }
-  else{
-		const TableRow& pivot=dat( pivoti );
-    while( true ) {
-			int rslt=0;
-      do {
-        j--;
-				rslt=dat( j )[field].compareTo( pivot[field], ftype );
-				compara++;
-
-				if( rslt==0 ){
-					rslt=dat( j )[subfield].compareTo( pivot[subfield], subtype );
-					scompara++;
-				}
-      } while( rslt>0 );
-
-      do {
-        i++;
-				rslt=dat( i )[field].compareTo( pivot[field], ftype );
-				if( rslt==0 ) {
-					rslt=dat( i )[subfield].compareTo( pivot[subfield], subtype );
-					scompara++;
-				}
-      } while( rslt<0 );
-
-      if( i<j ) swap( i, j );
-      else return j;
-    }
-  }
-}
-
-void QHaccTableIndex::swap( uint i, uint j ){
-	uint temp=lookup[i];
-	lookup[i]=lookup[j];
-	lookup[j]=temp;
-}
-*/
-
 uint QHaccTableIndex::starts( const TableCol& col ) const {
 	// return the position where the given TableCol
 	// starts. if a perfect match can't be found, 
diff -ur qhacc-3.2/lib/qhacctable.h qhacc-3.2.1pre/lib/qhacctable.h
--- qhacc-3.2/lib/qhacctable.h	2004-07-14 16:18:06.000000000 -0400
+++ qhacc-3.2.1pre/lib/qhacctable.h	2004-08-07 11:02:02.000000000 -0400
@@ -216,7 +216,7 @@
  private:
 	uint * lookup;
 	QHaccResultSet * data;
-	int field, subfield;
+	int field, subfield, lkpsz;
 	ColType ftype, subtype;
 
 	// we'll use a multimap to do the sorting for us
diff -ur qhacc-3.2/lib/resultset.cpp qhacc-3.2.1pre/lib/resultset.cpp
--- qhacc-3.2/lib/resultset.cpp	2004-07-14 16:18:44.000000000 -0400
+++ qhacc-3.2.1pre/lib/resultset.cpp	2004-08-07 11:09:34.000000000 -0400
@@ -121,10 +121,7 @@
 }
 
 void QHaccResultSet::stopLoad(){ istopLoad(); }
-void QHaccResultSet::startLoad( uint adds ){
-	istartLoad( adds );
-	//if( adds+size>capacity ) resizeTo( adds+size );
-}
+void QHaccResultSet::startLoad( uint adds ){ istartLoad( adds ); }
 void QHaccResultSet::istopLoad(){}
 void QHaccResultSet::istartLoad( uint ){}
 
@@ -172,19 +169,8 @@
 	return VALID;
 }
 
-void QHaccResultSet::resizeTo( uint ){
-	/*
-	if( newsize<size ) return;
-	TableRow ** ndata=new TableRow * [newsize];
-	capacity=newsize;
-	for( uint i=0; i<size; i++ ) ndata[i]=data[i];
-	for( uint i=size; i<capacity; i++ ) ndata[i]=0;
-	delete [] data;
-	data=ndata;
-	iresize();
-	*/
-	iresize();
-}
-
+// FIXME: future releases should remove these two functions
+void QHaccResultSet::resizeTo( uint ){ iresize(); }
 void QHaccResultSet::iresize(){}
+
 void QHaccResultSet::iadd( uint ){}
Only in qhacc-3.2.1pre/src/pixmaps: file.xpm
Only in qhacc-3.2.1pre: stamp-h
Only in qhacc-3.2.1pre: stamp-h.in