A new drop of Power Collections is now available here. The documentation is available as a .chm in the download, or you can just browse the documentation here.

Here's what is new since the last version:

1. New hash-table based collections Set and Bag. These are similar to OrderedSet and OrderedBag, but use a hash table instead of a binary tree as the underlying storage. They are considerably faster (if you have a good hash code), but do not maintain elements in sorted order.

2. In Algorithms class, added LexicographicalCompare to compare two sequences for their ordering -- very similar to the STL algorithm of the same name. Also fixed the spelling of Concatenate.

3. OrderedBag and OrderedSet have GetFirst(), GetLast(), RemoveFirst(), RemoveLast() methods.

4. Pair and Triple now implement the non-generic IComparable interface as well as the generic version.

5. Various fixes to the documentation.