trove4j-commit — commit logs for trove CVS projects

[Eric F. <er...@us...>]

Update of /cvsroot/trove4j/trove
In directory usw-pr-cvs1:/tmp/cvs-serv3043

Modified Files:
	ChangeLog 
Log Message:
revised class hierarchy so that all primitive hashing collections are
derived from TPrimitiveHash, which extends THash.  Object hashing collections
are derived from TObjectHash.  As part of this change, the byte[] flags
were pushed down to TPrimitiveHash, and TObjectHash was revised so that
it no longer needs a byte[] array to track the state of the table.  This
has an appreciable impact on the total size of Object hashing collections:
a set of 1,000 Integers used to take 69% of the memory needed for a JDK
set; it now takes only 62%.

removed slots can now be re-used in all hashing collections.  If the
search for an insertion index does not find that the key is already
present in the map, insertionIndex implementations will now return the
index of the first REMOVED or FREE slot.  This means that tables which
undergo a pattern of insertions/deletions without radical changes in
size will not trigger as many rehashes as before.

revised hashing algorithm so that the second hash function is only executed
when necessary and so that FREE or FULL w/identical content slots can be
found with a minimum of effort.


Index: ChangeLog
===================================================================
RCS file: /cvsroot/trove4j/trove/ChangeLog,v
retrieving revision 1.10
retrieving revision 1.11
diff -C2 -d -r1.10 -r1.11
*** ChangeLog	2002/01/06 08:24:33	1.10
--- ChangeLog	2002/01/14 05:59:42	1.11
***************
*** 1,4 ****
--- 1,20 ----
  v 0.1.2
  
+ revised class hierarchy so that all primitive hashing collections are
+ derived from TPrimitiveHash, which extends THash.  Object hashing collections
+ are derived from TObjectHash.  As part of this change, the byte[] flags
+ were pushed down to TPrimitiveHash, and TObjectHash was revised so that
+ it no longer needs a byte[] array to track the state of the table.  This
+ has an appreciable impact on the total size of Object hashing collections:
+ a set of 1,000 Integers used to take 69% of the memory needed for a JDK
+ set; it now takes only 62%.
+ 
+ removed slots can now be re-used in all hashing collections.  If the
+ search for an insertion index does not find that the key is already
+ present in the map, insertionIndex implementations will now return the
+ index of the first REMOVED or FREE slot.  This means that tables which
+ undergo a pattern of insertions/deletions without radical changes in
+ size will not trigger as many rehashes as before.
+ 
  revised hashing algorithm so that the second hash function is only executed
  when necessary and so that FREE or FULL w/identical content slots can be