Here is the code explaining some methods to pack bit accessing logic in your program.

program project1;

type
  TRec1 = packed record // Doesn't pack at all
    b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16: boolean;
  end;

  TRec2 = bitpacked record // Free Pascal specific …

As DBAs know, Database Tuning Advisor can help you in some cases.

• The analyze of the traces will be efficient in OLTP where the most of queries are repeating and could be generalized
• The analyze of traces will be less efficient in OLAP/reporting where the queries are parameterized by …

In theory, hash map structure should be very fast on retrieving by key operations, close to O(1) like for an array. A sorted map (keys are sorted) should be O(log₂ N) instead. The following test checks the difference.

Common scenario

We will use one tester class per …

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

function GetHeapStatus: THeapStatus;

THeapStatus is documented here

Example of using this function is below

program ProgWatchMem;

uses
  Math, FGL;

type
  TLongIntArr = array of LongInt; // LongInt is a 4-byte signed integer
  PLongIntArr = ^TLongIntArr;
  TMySortedMap = specialize …

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 …

Multiple inheritance of interfaces which are pure abstract classes indeed is not a problem until you need to use the interface implementation in other classes.

Suppose there are two interfaces, the implementation of which will be used in other classes.

class IA
{
public:
    virtual void m1() = 0;
};

class IB : public …

GenieLamp is the software factory and model-driven development framework. You have no more to write a boilerplate!

Quick start on the project's wiki.

I'm looking for contributors, please, contact me at Github

Here is an example how to get N-2 calling procedure information.

Warning: code seeking debugging info is slow so be aware to use it in loops.

Make sure to compile with following options:

• -gl (not requierd but show file and line numbers info)
• -gs (show proc name after address)

var …

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 …

HP LaserJet Pro CP1025 is detected automatically by Ubuntu but it is not sufficient for printing. You should configure HPLIP.

At first time, check that HPLIP installed and its version is 3.11.1 at least

dpkg -l hplip

In Ubuntu 14.04 you should see something like this:

ii …