Once again, here are a couple of questions to test your understanding of the material from this chapter:
- 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?
- Is using the QStringList class a good idea? Or should you use QVector<QString> instead?
- Is there any chance that Qt will start using the standard library containers in their APIs?
- What is SSO? What is SVO? Where are they used?
- Consider the following code:
Q_FOREACH(auto const& v, qvector) { ... }
Is it dangerous?
- Do you know now why back in time the COW containers were also known as mad COW containers?
- Who were the Gang of Four? Are they relevant for performance?
- What seems to have the greatest improvement potential when implementing data structures?
- Talking about strings, what can you...
