nstl Release Rss Feed

Updated Release: 3.1 Production

AndyM — Fri, 02 Oct 2009 19:15:07 GMT

Next release in the 3.x branch

Updated Release: 3.0.30.0 Production (Oct 02, 2009)

AndyM — Fri, 02 Oct 2009 17:23:08 GMT

This is the first official release of the 3.x branch. It builds on .NET 3.5 features like extension methods and aims to integrate the NSTL into .NET. Therefore you need the 3.5 version of the framework or higher to use the library.

It features:

Deprecation of NSTL collections that are superfluous today. Extension methods were provided to pimp up the .NET container with the lost functionality
Cast<T>() extensions for IList and IDictionary to cast to their generic counterparts
Weak() extension methods to adapt a generic collection in their non generic counterpart
Extension methods for the .NET Collections that were missing, e.g. IList<T>.resize(..)
Extension methods for the NSTL iterators to convert them into convenient ranges and .NET collections.
Extension methods for the .NET collections to provide and consume iterators

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Released: 3.0.30.0 Production (Oct 02, 2009)

Fri, 02 Oct 2009 17:23:08 GMT

Deprecation of NSTL collections that are superfluous today. Extension methods were provided to pimp up the .NET container with the lost functionality
Cast<T>() extensions for IList and IDictionary to cast to their generic counterparts
Weak() extension methods to adapt a generic collection in their non generic counterpart
Extension methods for the .NET Collections that were missing, e.g. IList<T>.resize(..)
Extension methods for the NSTL iterators to convert them into convenient ranges and .NET collections.
Extension methods for the .NET collections to provide and consume iterators

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: 2.7.132.0 Production (Sep 21, 2008)

AndyM — Fri, 02 Oct 2009 17:22:52 GMT

This is a simple re release under the Eclipse Public License (EPL). The license was changed, because it is not possible anymore to maintain the custom licenses in codeplex myself. The EPL offers the same freedom to the user as the former license. All releases prior to this one are not affected!

Released: 2.7.132.0 Production (Sep 21, 2008)

Fri, 02 Oct 2009 17:22:52 GMT

Updated Release: 3.0.30.0 Production (Oct 02, 2009)

AndyM — Fri, 02 Oct 2009 17:20:40 GMT

Deprecation of NSTL collections that are superfluous today. Extension methods were provided to pimp up the .NET container with the lost functionality
Cast<T>() extensions for IList and IDictionary to cast to their generic counterparts
Weak() extension methods to adapt a generic collection in their non generic counterpart
Extension methods for the .NET Collections that were missing, e.g. IList<T>.resize(..)
Extension methods for the NSTL iterators to convert them into convenient ranges and .NET collections.
Extension methods for the .NET collections to provide and consume iterators

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: 3.0.30.0 Production (Oct 02, 2009)

AndyM — Fri, 02 Oct 2009 17:19:51 GMT

Deprecation of NSTL collections that are superfluous today. Extension methods were provided to pimp up the .NET container with the lost functionality
Cast<T>() extensions for IList and IDictionary to cast to their generic counterparts
Weak() extension methods to adapt a generic collection in their non generic counterpart
Extension methods for the .NET Collections that were missing, e.g. IList<T>.resize(..)
Extension methods for the NSTL iterators to convert them into convenient ranges and .NET collections.
Extension methods for the .NET collections to provide and consume iterators

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: 2.7.132.0 Production (Sep 21, 2008)

AndyM — Tue, 08 Sep 2009 16:34:30 GMT

Released: 2.7.132.0 Production (Sep 21, 2008)

Tue, 08 Sep 2009 16:34:30 GMT

Updated Release: Latest Builds (Dec 16, 2008)

AndyM — Mon, 01 Jun 2009 11:28:12 GMT

Here you can download the latest fully tested builds. As they have undergone all automated tests by a full release build process, they can be considered as stable as a regular release.

2.x Release Branch

The 2.x branch contains the current release. It is in maintenance mode and you will find bug fixes and minor extensions, e.g, new container types or improved documentation and tests.

Corrected typos in documentation
New HashMultiSet<T> container
Convenience overloads of several algorithms

3.x Release Branch

This branch is the main branch of development and not released yet. It aims to integrate the NSTL tightly with LINQ and vice versa. The current status is stable and just about to be released.

Algorithms as LINQ operators (ongoing)
Several extension methods for collections to integrate tightly with the NSTL's algorithms.

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Released: Latest Builds (Dec 16, 2008)

Mon, 01 Jun 2009 11:28:12 GMT

Here you can download the latest fully tested builds. As they have undergone all automated tests by a full release build process, they can be considered as stable as a regular release.

2.x Release Branch

The 2.x branch contains the current release. It is in maintenance mode and you will find bug fixes and minor extensions, e.g, new container types or improved documentation and tests.

Corrected typos in documentation
New HashMultiSet<T> container
Convenience overloads of several algorithms

3.x Release Branch

This branch is the main branch of development and not released yet. It aims to integrate the NSTL tightly with LINQ and vice versa. The current status is stable and just about to be released.

Algorithms as LINQ operators (ongoing)
Several extension methods for collections to integrate tightly with the NSTL's algorithms.

using.NUnit.Framework;
using NStl.Linq;//Import the extensions

List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: Latest Builds (Dec 16, 2008)

AndyM — Tue, 16 Dec 2008 13:07:28 GMT

Here you can download the latest fully tested builds. As they have undergone all automated tests by a full release build process, they can be considered as stable as a regular release.

2.x Release Branch

The 2.x branch contains the current release. It is in maintenance mode and you will find bug fixes and minor extensions, e.g, new container types or improved documentation and tests.

Corrected typos in documentation
New HashMultiSet<T> container
Convenience overloads of several algorithms

3.x Release Branch

This branch is the main branch of development and not released yet. It aims to integrate the NSTL tightly with LINQ and vice versa.

Algorithms as LINQ operators (ongoing)
Several extension methods for collections to integrate tightly with the NSTL's algorithms.

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Released: Latest Builds (Dec 16, 2008)

Tue, 16 Dec 2008 13:07:26 GMT

Here you can download the latest fully tested builds. As they have undergone all automated tests by a full release build process, they can be considered as stable as a regular release.

2.x Release Branch

The 2.x branch contains the current release. It is in maintenance mode and you will find bug fixes and minor extensions, e.g, new container types or improved documentation and tests.

Corrected typos in documentation
New HashMultiSet<T> container
Convenience overloads of several algorithms

3.x Release Branch

This branch is the main branch of development and not released yet. It aims to integrate the NSTL tightly with LINQ and vice versa.

Algorithms as LINQ operators (ongoing)
Several extension methods for collections to integrate tightly with the NSTL's algorithms.

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: 2.7.132.0 Production (Sep 21, 2008)

AndyM — Sat, 08 Nov 2008 17:51:48 GMT

Released: 2.7.132.0 Production (Sep 21, 2008)

Sat, 08 Nov 2008 17:51:45 GMT

Updated Release: Latest Builds (Nov 08, 2008)

AndyM — Sat, 08 Nov 2008 17:44:26 GMT

Here you can download the latest fully tested builds. As they have undergone all automated tests by a full release build process, they can be considered as stable as a regular release.

The current latest build is for the new 3.0 release. Although everything is tested, please consider it alpha level. This means that interfaces, names and features are still subject to change!

It features several extension methods for collections to integrate tightly with the NSTL's algorithms.

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Released: Latest Builds (Nov 08, 2008)

Sat, 08 Nov 2008 17:44:26 GMT

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: Latest Builds (Oct 01, 2008)

AndyM — Wed, 01 Oct 2008 21:03:49 GMT

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Released: Latest Builds (Oct 01, 2008)

Wed, 01 Oct 2008 21:03:45 GMT

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());

Updated Release: Latest Builds (Mar 13, 2008)

AndyM — Wed, 24 Sep 2008 19:03:46 GMT

using.NUnit.Framework;
using NStl.Linq;//Import the extensions
 
List<int> list = new List<int>(){0,1,2,3};
ListTIterator<int> it = Algorithm.Find(list.Begin(), list.End(), 2);
Assert.That(it, Is.Not.EqualTo(list.End());