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

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node is parent/grand parent of other. order should be O(1). tag root as 0 , tag left child as 00 , right child as 01. left child's left child as 000 , left's child's right child as 001 ... and so on. now let input be tags t1 and t2 if( (t1 == (t2>>1)) || (t2==(t1>>1))) return child parent relationship if( (t1 == (t2>>2)) || (t2==(t1>>2))) return child grand-parent relationship ... This solution can take a lot of space as the three grows. We can tag the node by number .. Root -0 1 -2-3-4 SO given two node get their tags.. Get Max of both t1, t2. Go for parent of that node if other node then return or check for parent of parent and check again for other node. With 2^32 value avaialable for indexing ..u wont run out of values.