Skip to main content

One way : Heap or Stack allocation

Took my time to find solution for this and it actually made me realize how much i have to learn.
Now question is how can we enforce the creation of objects whether on heap or stack.

Creating object on Heap only.
Make your destructor private and create a destroy function.
Class A
{
 ~A(){}
public:
 A(){}
void destroy() { delete this; }
}

Now if you can not create your object:

A a; //error: 'A::~A()' is private
A  a = new A();

Great. Now all the objects will be allocated to heap only. Making destructor private a better choice than constructor as we don't know number of constructor so early in programming.

Creating object on stack

While i knew that it has to do something with operator new, but could not figure out how can i create object on stack and return the memory back to class initialization.

Though answer was simple, i had to google for that:

Overload operator new, new[], operator delete and delete[] and make them private ;)

class A
{
private:
void *operator new(size_t size) { }
void * operator new[](size_t size) {}
void operator delete(void *p) {}
void operator delete[](void *p) {}
};

You can create the object like:

A a;//It will work.
A *a = new A();//Error

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server.  To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...