v 0.1.8Added gnu.trove.decorator package, with Decorator classes that wrap trove'sprimitive maps and sets for conformance with the java.util.{Map,Set}APIs.v 0.1.7Added iterators to the primitive maps and sets.  Note that semanticsdiffer from those of java.util.Iterator, so RTFM.Added hashing strategy interfaces to allow users to implement customhashing schemes for optimal distribution for specific data sets.Fixed bug 602376 -- ClassCastException n THashMap.putAllMade all collections implement Cloneable.  primitive collections clone deeply;Object collections produce shallow clones.v 0.1.6Minor bug fix release.Two bugs in TIntArrayList have been fixed.  Thanks to Jessica P.Hekman for reporting them.One of these prevented toNativeArray from working correctly incertain circumstances; the other problem was with the depth ofcloning operations.One enhancement to TintArrayList has been made -- serializedinstances are now compact -- previous versions relied on serializationbehavior of the backing array, which included empty slots and sowasted space.Serialization of sets/maps has been modified as follows: previouslyall of the writeObject methods used a local implementation of theTXXXProcedure for writing out the data in a particular collection.These have been replaced by a single class (SerializationProcedure)which implements all of the appropriate interfaces. This reducesthe number of .class files in the trove jarv 0.1.5added retainEntries methods to all Map classes.  These methods acceptprocedure objects of the appropriate sort and use the return value ofthose procedures to determine whether or not a particular entry in themap should be retained.This is useful for applying a cutoff in a map without copying data:TIntIntHashMap map = new TIntIntHashMap();// load up mapmap.retainEntries(new TIntIntProcedure() {  public boolean execute(int key, int val) {    return val > 3; // retain only those mappings with val > 3  }});It can also be used if you want to reduce one map to the intersectionbetween it and another map:THashMap map1 = new THashMap();THashMap map2 = new THashMap();// load up both mapsmap1.retainEntries(new TObjectObjectProcedure() {  public boolean execute(Object key, Object val) {    return map2.containsKey(key); // retain the intersection with map2  }});	v 0.1.4added increment() and adjustValue() methods to maps with primitive values.These are useful in the all-too-common case where you need a map for thepurposes of counting the number of times a key is seen.  These methodsare handy because you don't have to do a "containsKey" test prior toevery increment() call.  Instead, you can check the return status (trueif an existing mapping was modified) and if it is false, then insert themapping with the initial value:TIntIntHashMap map = TIntIntHashMap();int key, val;key = keyFromSomeWhere();val = valFromSomeWhere();if (! map.increment(key)) map.put(key, 0);increment is implemented in terms of adjustValue, which allows youto specify the amount by which the primitive value associated with aparticular key should be adjusted.Thanks to Jason Baldridge for the idea.v 0.1.3bug fix in TLinkedList ListIterator implementation:  fixed remove()behavior so that it correctly removes the last element returned byeither next() or previous().  Added several tests to suite to verifythat list iterator does what it's supposed to do in accordance with thecollections API docs.v 0.1.2bug fix in primitive hash sets: toArray now produces a correct returnvalue of size set.size().  Previously it generated an ArrayIndexOutOfBoundsException.  Thanks to Tobias Henle for finding this.revised class hierarchy so that all primitive hashing collections arederived from TPrimitiveHash, which extends THash.  Object hashing collectionsare derived from TObjectHash.  As part of this change, the byte[] flagswere pushed down to TPrimitiveHash, and TObjectHash was revised so thatit no longer needs a byte[] array to track the state of the table.  Thishas 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 JDKset; it now takes only 62%.removed slots can now be re-used in all hashing collections.  If thesearch for an insertion index does not find that the key is alreadypresent in the map, insertionIndex implementations will now return theindex of the first REMOVED or FREE slot.  This means that tables whichundergo a pattern of insertions/deletions without radical changes insize will not trigger as many rehashes as before.revised hashing algorithm so that the second hash function is only executedwhen necessary and so that FREE or FULL w/identical content slots can befound with a minimum of effort.v 0.1.1made the initial capacity of lists used for return values in grep/inverseGrepbe the default capacity rather than the size of the list-being-grepped.This saves space when a small list is grepped from a larger list.added reset and resetQuick methods to *ArrayList implementations so thatlists can be cleared while retaining their current capacity.changed *ArrayList toNativeArray() method behavior so that a List of 0 lengthcan return a native array of 0 length (previously this would have thrownan exception)revamped *ArrayList insert/remove implementations so that edits are donein place instead of with a temporary array.minor performance tweak in THashIteratorv 0.1.0Added primitive ArrayList implementations.v 0.0.9Made all collections implement java.io.SerializableMade all collections implement equals() so that they compare their contentsinstead of doing collection object identity.Made TLinkable extend java.io.SerializableChanged secondary hash function to reflect Knuth's observation about thedesirability of using an odd value.Added trimToSize() and ensureCapacity() methods(finally) implemented loadFactor, with default of 0.5, per Knuth.Note that load/capacity/size are handled differently than in the Javasoftimplementations.  Specifically, if you ask for a collection of capacityX, Trove will give you one that can hold X elements without rehashing;Javasoft's implementation does not do this.v 0.0.8Fixes for several user-reported bugs.  Unit tests have been added todemonstrate that each of these is actually fixed.485440 Null in keys() from TObjectDoubleHashMapsize/free were being updated even when a map.put() was really a replaementfor an existing mapping.485829 null values not handled correctly485831 null values cause exceptions485834 null values cause NullPointerExceptionmade Maps that hold Object values behave correctly (no NPE) when doingcomparisons with null objects, since null values are legal.485837 entrySet comparison semantics are wrongmade entrySet check both key and value when doing comparisons.v 0.0.7new package: gnu.trove.benchmarkreplaced gnu.trove.Benchmark with benchmark package.  This now producesformatted reports that include OS/JVM specs.Changed benchmarking approach so that timestamps are only taken at thebeginning/end of the full repetition count for an operation.  This reduces the variability caused by calling System.currentTimeMillis()more than once in the same second.Added memory profiler which produces a report with the memory requirementsfor trove/javasoft collections of the same objects.build.xmlmodified jar task so that the benchmark package is not included in thejar file or the javadoc set.  Only the framework classes get jarred up;developers can run the benchmarks by using the output/classes directoryinstead.TObjectHashBased on profiling results, replaced calls to HashFunctions.hash(obj) withdirect invocation of obj.hashCode() to save a method call.  This isprobably inlined by hotspot compilers, but my profiler doesn't work withthose.TObjectHash.HashIteratorBased on bytecode examination, replaced a putfield/getfield combo with aputfield/dup_x.  This saves three opcodes in a method which gets calleda lot (moveToNextIndex()).PrimeFinder/HashFunctionsfinalized both classes and all methods.