I
itt ium
Group,
This might be a very obvious question but a simple google search did
not reveal much. I am designing a software where different functions
make local copies of vectors, map and hash map containing big size
structures. I was concerned about following
if the vector is of big size, making a local variable will occupy lot
of stack space and may result in stack overflow.
With map, it seems problem may not be likely since map is a binary
search tree so only head pointer will be pushed to the stack.
I am not able to visualize the local hash map variable with respect to
stack frame.
Please let me know your thoughts on it.
thanks
ittium
This might be a very obvious question but a simple google search did
not reveal much. I am designing a software where different functions
make local copies of vectors, map and hash map containing big size
structures. I was concerned about following
if the vector is of big size, making a local variable will occupy lot
of stack space and may result in stack overflow.
With map, it seems problem may not be likely since map is a binary
search tree so only head pointer will be pushed to the stack.
I am not able to visualize the local hash map variable with respect to
stack frame.
Please let me know your thoughts on it.
thanks
ittium