JuniorTestVentor

A test project for a Junior C++ Developer at "Ventor" company

The task was:

1. We need to implement Queue class, using given class declaration.
2. When we creating a "Queue" object, the initial size must be specified.
3. Queue "hData" must be allocated as an inline memory block.
4. A "Head" must be an index of the most recent data we have added.
5. A "Tail" must point to the end of data.
6. By calling "Put" function we must move the "Head" and return the size of data transfered.
7. By calling "Clear" function we must move the "Tail" and return the size of data cleared.
8. The Queue must be a "Circular Queue", so there must be overflow contorl system (if the "Head" will meet the "Tail")