NSTL - The Power of the STL for .NET

Implement HashMultiSet container

Build Collection Interface overloads in 2.x branch to simplify the usage of the NSTL

Provide overloads of algorithms that take one of the collection interfaces instead of iterators

Update Documentation to new 3.0 LINQ extension features

-insert statement in existing documentation, what is obsolete or better now i Version 3.x -Provide examples by ->Container extensions for Begin/End etc. ->overloads for Algorithms for collectio...

Diff implementation of most RandomAccessIterators return absolute values

-Vector.Iterator -IListIterator extend Diff UnitTest to check negative values!

Provide TopologicalSort Algorithm

The algorithm should work similar to unix's tsort. It shall have a generic approch where a functor is used to model the graphs edges

Fix FxCop warnings

With Vs2008 new and stricter FxCop warnings appeared which need to be fixed before release

Provide Distance() extension methods for iterators and deprecate NStlUtil.Distance

Different overloads for IInputIterator<T> & IRandomAccessIterator<T> are needed.

Provide FrontInserter() extension method for all appropriate containers

IFrontInsertable<T>, will serve for DList and Deque as well LinkedList<T>

Provide BackInserter() extension method for all appropriate containers

Allthough the AddInserter() extension of ICollection<T> provides the same functionality in most cases, an explicit BackInserter method will prove readability. COntainers are: IBackInsertable<T> Li...

Deprecate NStlUtil.Inserter helper methods in favour of extension methodsd for IInsertable<T>

Extension: methods are needed for: -IInsertable<T> -LinkedList<T> -SortedList<T> -Deque<T>