<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en" xmlns="http://www.w3.org/2005/Atom"><title>Recent posts to news</title><link href="https://sourceforge.net/p/cstl/news/" rel="alternate"/><link href="https://sourceforge.net/p/cstl/news/feed.atom" rel="self"/><id>https://sourceforge.net/p/cstl/news/</id><updated>2006-11-13T18:27:53Z</updated><subtitle>Recent posts to news</subtitle><entry><title>0.2.5</title><link href="https://sourceforge.net/p/cstl/news/2006/11/025/" rel="alternate"/><published>2006-11-13T18:27:53Z</published><updated>2006-11-13T18:27:53Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.netd38d4ba4324e38b98639e15683740aa049a76348</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Added Sort, QuickSort, Partition, NthElement, and RandomShuffle.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>0.2.4</title><link href="https://sourceforge.net/p/cstl/news/2006/10/024/" rel="alternate"/><published>2006-10-02T18:14:15Z</published><updated>2006-10-02T18:14:15Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.nete65e507d63365ff3ac64c2c446ec9c24c8d0d7b9</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Added NextPermutation, PrevPermuation, and LexCompare. &lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>0.2.3</title><link href="https://sourceforge.net/p/cstl/news/2006/09/023/" rel="alternate"/><published>2006-09-30T02:37:53Z</published><updated>2006-09-30T02:37:53Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.net74904f3a50a5d37774401fc8fe4861fb23c54433</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Added new algorithms: Search, SearchN, FindEnd, FindFirstOf, Rotate, and RotateCopy. Switched algorithms that compare for equality from IComparer&amp;lt;T&amp;gt; to IEqualityComparer&amp;lt;T&amp;gt;.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>0.2.2</title><link href="https://sourceforge.net/p/cstl/news/2006/09/022/" rel="alternate"/><published>2006-09-27T22:55:26Z</published><updated>2006-09-27T22:55:26Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.nete6642680f84e2712649a8e34f2b047ad8e4639c6</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Added binders and stock predicates. Started working on Sort and StableSort.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>0.2.1 Release</title><link href="https://sourceforge.net/p/cstl/news/2006/09/021-release/" rel="alternate"/><published>2006-09-26T20:05:45Z</published><updated>2006-09-26T20:05:45Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.net51bf1c16f6d41076d6928a45f60d244cf0c28ab5</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;I have added more unit tests for the existing algorithms. Most of the algorithms now have a unit test. I also fixed bugs in the algorithms that were found during testing.&lt;/p&gt;
&lt;p&gt;See the readme.txt file for a description of the library.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>Initial pre-alpha release (0.2.0)</title><link href="https://sourceforge.net/p/cstl/news/2006/05/initial-pre-alpha-release-020/" rel="alternate"/><published>2006-05-23T23:03:04Z</published><updated>2006-05-23T23:03:04Z</updated><author><name>Harold Howe</name><uri>https://sourceforge.net/u/userid-1494218/</uri></author><id>https://sourceforge.net066447d56e1e958b779b62633cd50b2a15fed9e5</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;I just finished uploading the initial release of CSTL. See the readme.txt file for a description of the library.&lt;/p&gt;&lt;/div&gt;</summary></entry></feed>