A hearty welcome to David Schmitt who joined the NGenerics Team. David’s bio : David is a Debian Admin and .Net Developer living and working in Vienna, Austria. He’s partner in a small tech company startup at http://dasz.at/ . His current interests with NGenerics is the implementation of the Immutable namespace. As stated in his bio, …
You can find it on our new project site . This build includes the following (straight from the release notes) :
The home of NGenerics has moved to Google Code from it’s original project site on CodePlex . We’re still in the process of migrating some of the content like the downloads, but we’re mostly up and running. If you have any issues or feature suggestions, please submit them to the Google Code project site .
Content migration for NGenerics went well - but please note the following changes: All downloads for releases moved to the new project site . Due to Google not being willing to add the MS-PL license to Google Code , we’ve had to re-license NGenerics under the LGPL . LGPL is practically the same license but more wordy. A User Voice site is …
Previous instalments General Data Structures HashList ObjectMatrix Trees GeneralTree and the Visitor Pattern Binary Trees and Binary Search Trees The Priority Queue data structure has the same basic behaviour and operations as the classic queue found in .NET . A queue applies a first-in, first-out (FIFO ) approach to a list of objects. This data …
Previous instalments General Data Structures HashList Trees GeneralTree and the Visitor Pattern Binary Trees and Binary Search Trees Looking at tree structures will make your eyes bleed, so we’ll take a break to discuss one of the simpler data structures NGenerics offers - the ObjectMatrix . The ObjectMatrix is a representation of a …
Thanks to a contribution from Andre van der Merwe (blog , twitter ), NGenerics now features Tarjan’s strongly connected components algorithm on it’s Graph implementation. By using Tarjan’s algorithm, we’re able to find the strongly connected components (read : cycles) in a directed graph. You can invoke it via the FindCycles …
Previous instalments General Data Structures HashList Trees GeneralTree and the Visitor Pattern If you haven’t read my previous post on General Trees, it might be a good idea to do so before reading further. A Binary Tree is a refined version of the General Tree that limits the number of children each node can have - two to be exact. Child …
Previous instalments General Data Structures HashList [ Note : This post feels like Computer Science 101 - but I felt it necessary to discuss the basic tree concepts before we move on to some of the more specialized trees like search trees. ] The GeneralTree<T> class in NGenerics provides a way of defining tree structures in a simple, …
The Code Better TeamCity guys were kind enough to install the Silverlight runtime on the build server a while ago, which means that NGenerics now has an automated Silverlight build.