yogesh wrote:
> Hi,
>
> I need to know how to solve this problem of the code ,
>
> kindly help me if any one know this
> given 2 cl***** A and B defined as follows
> struct A { int a; }
> struct B { int b; char c; }
> the requirement is to efficiently write 2 map cl*****
> 1. class AMap
> It should have member functions similar to below
> add (const std::string name, A*)
> A* get (const std::string name)
> remove(const std::string name)
> 2. class BMap
> It should have member functions similar to below
> add (const std::string name, B*)
> B* get (const std::string name)
> remove(const std::string name)
> Note that in the above add/get/remove functions, I have
> deliberately not provided the correct signatures as that is what you
> need to create.
> Add a main routine that exercises all the above functions
> no extra libs like glib should be used; STL may be used
>
>
> can any one guess what this
Yes, he wants you to write two cl***** which map strings to A* and B*
respectively. I don't think the way he's specified it is especially
precise, and I'm not sure A* and B* are especially good choices for a
value type (who owns the memory pointed to? who should ultimately
delete/free it?), but those are things you can point out in your answer.
It's also worth asking what he means by "efficiently write". Should the
writing be efficient, or the code? There's not always a trade-off
involved, but there can be.
Regards,
Stu
--
[ See http://www.gotw.ca/resources/clcm.htm
for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]
|
