Brand new idea

First we allocate entire part of memory. We devide it into number of chanks of
fixed size. According to this information we create a table wich represent
avalible chanks of data from our allocation (like hard drive table =D). Data
will be placed into this chanks. It will use or entire chank of several of them.

Table has next structure:

	long tableSize - the size of table
	int chankSize - the size of chank
	int tableArray - the table. It is the sequence of two int walues:
		the first value - is the chank free (0 - free, 1 - not free)
		the second value - the begining adress (data long is more
			than entire chank long)

New functions:

	initialize - gets memory size and creates a table
	uninitialize - delete allocation for data and table
	check Size - check the result of malloc & calloc
	showTable - show exist data allocation table