Free Pascal (like Delphi) provide some useful functions to watch heap memory state in your application.

function GetHeapStatus: THeapStatus;

In the previous article "Crack C# namespaces in 30 seconds" I demonstrated how to make error having no idea about it. So you will have a lovely time in debugging. But in C# you're condemned to use using directive or your code will be unreadable with all these horrible specifiers

GenieLamp is the software factory and model-driven development framework. I developed it because there is no sense to lead several "agile" coders when several Genies could replace them and do the work.

Quick start on the project's wiki.

I'm looking for contributors, please, contact me at sourceforge.net

Let's perform a simple benchmark testing the random and sequential access to arrays and lists. I would like to compare:

• static array with predefined size (allocated on stack)
• TList container class (allocated on heap)
• dynamic array (allocated on heap)
• generic Delphi TList or Free Pascal TFPGList (allocated on heap)

I use an array/list of 10M elements of integer and varaint data type. You can change the type definition in "type" section if need to test other cases.

The namespaces conception in C# seems to be exhaustive and insufficient at the same time compared with a strong module notation in Oberon-2 and even with a modular programming approaches in Free Pascal/Delphi.

Why insufficient? You cannot declare constants and functions within namespaces but you should add a class with constant field or static method for it.

Why exhaustive? The using directive with such introduced classes is the source of unexpected errors. Here is an example below.