S
Sarath
Dear All,
I've a class which has lot of Get/Set functions. Since most of the
data members are of same type (e.g float), I'd like to implement it
with the help of lookup table ( probably will be using stl maps). The
code size will be considerably reduced if I use this method(by
avoiding set/get functions for each members). but I doubt on the
performance of stl map look up functionality. My program is doing some
intensive computations. Will this implementation creates any high
performance hit? I'm not really worried about the insertion(creation
of new keys) but looking to optimize the set/get of existing keys in
the map. Please provide your valuable suggestions.
-Sarat
I've a class which has lot of Get/Set functions. Since most of the
data members are of same type (e.g float), I'd like to implement it
with the help of lookup table ( probably will be using stl maps). The
code size will be considerably reduced if I use this method(by
avoiding set/get functions for each members). but I doubt on the
performance of stl map look up functionality. My program is doing some
intensive computations. Will this implementation creates any high
performance hit? I'm not really worried about the insertion(creation
of new keys) but looking to optimize the set/get of existing keys in
the map. Please provide your valuable suggestions.
-Sarat