Questions

Once again, here are a couple of questions to test your understanding of the material from this chapter:

1. If a better algorithm uses knowledge about the structure of the data, how does that apply to sorting? Is the data to be sorted, by definition, devoid of any structure?

2. Is using the QStringList class a good idea? Or should you use QVector<QString> instead?
3. Is there any chance that Qt will start using the standard library containers in their APIs?
4. What is SSO? What is SVO? Where are they used?
5. Consider the following code:

 Q_FOREACH(auto const& v, qvector) { ... }

Is it dangerous?

6. Do you know now why back in time the COW containers were also known as mad COW containers?
7. Who were the Gang of Four? Are they relevant for performance?
8. What seems to have the greatest improvement potential when implementing data structures?
9. Talking about strings, what can you say about the performance of the following code:

bool hasTwoDigits(const QString& numberStrg)
{
  QRegExp rx("^\\d\\d?$");
  return rx.indexIn(numberStrg) != -1;
}