Skip to main content

Multiple Template definion with C++

file.h
template

void tfunc( T a)
{
.........
}

file1.cpp
#include"file.h"
void myfunc1()
{
tfunc(123);
}
file2.cpp
#include"file.h"
void myfunc2()
{
tfunc(456);
}

main.cpp
extern void myfunc1();
extern void myfunc2();

int main()
{
myfunc1();
myfunc2();
return 0;
}


Compile with:
g++ -o main.exe file1.cpp file2.cpp main.cpp


Before you compile, just try answering below questions:
1. Will this compile?
If Yes then Why and how?

If no then you are on right track. Same thing happens with normal function definition. But hold on, c++ template handles this multiple definition problem very smoothly. It means above files will compile and execute properly.
Thats special handling with multiple template instantiation done by linker.

Now you know that this answer of above questions is yes, so you may want to know how and why?
Will post in next post. This question was asked to my friend in NetApp.
Labels:

Comments

Post a Comment

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
3 comments
Read more

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)
Post a Comment
Read more

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 { pr...
Post a Comment
Read more