std

In my C++ application, I have some values that act as codes to represent other values. To translate the codes, I've been debating between using a switch statement or an stl map. The switch would look something like this: int code; int value; switch(code) { case 1: value = 10; break; case 2: value = 15; break; } The map would be an stl::map<int, int> and translation would be a simple lookup with the code used as the key value. Which one is better/more efficient/cleaner/accepted? Why? Personally, I would use the map, as its use implies a data lookup - using a switch usually indicates a

What is the default format, when I'm writting a double to a stringstream ? double v = 3.0; std::stringstream ss; ss << v; Where can I find a list of the default format setup for a stringstream ? Is the default format the same for all derived classes of std::istream (within the stdlib)? The defaults are setup by std::basic_ios::init and are the same for all streams derived from ios_base . The defaults are: rdbuf() sb tie() 0 rdstate() goodbit if sb is not a null pointer, otherwise badbit. exceptions() goodbit flags() skipws | dec width() 0 precision() 6 fill() widen(’ ’) getloc() a copy of the

This question already has answers here : char* vs std::string in c++ [closed] (12 answers) Possible Duplicate: C++ char* vs std::string I'm new to C++ coming from C# but I really do like C++ much better. I have an abstract class that defines two constant strings (not static). And I wondered if a const char* would be a better choice. I'm still getting the hang of the C++ standards, but I just figured that there really isn't any reason why I would need to use std::string in this particular case (no appending or editing the string, just writing to the console via printf ). Should I stick to std:

I need to make use of a queue of doubles because of the good properties it has as an ordered container. I want to pass this queue to a class constructor that accepts vectors. If I do that directly I get the following error: candidate constructor not viable: no known conversion from 'std::queue' to 'std::vector &' for 2nd argument How to cast a queue to a vector? The correct container to model both queue_like behaviour and vector-like behaviour is a std::deque . This has the advantages of: constant-time insertion and deletion at either end of the deque ability to iterate elements without