Skip to main content

Really short STL notes

My STL notes after reading Effective STL by Scott Meyer. For most of the points below, there are subtle important reasons for that. The reasons are not mentioned here as it would be too long. Please read Effective C++ by Scott Meyer.

1. Use member insert function instead of copy algorithm and inserter.

2. Minimize capacity: string (s).swap (s)
Clear and minimize capacity : string ().swap (s)

3. Associative containers use equivalence (strict weak ordering) and not equality.
Equivalence: !(w1 < w2) && !(w2 > w1)
In strict weak ordering, equal values are not equivalent!
Therefore, Comparison function should return false for equal values when equivalence is expected.

4. Use map::operator [] to modify/retrieve existing elements in the map
Use map::insert to add new elements

5. Iterator can be implicitely converted to reverse_iterator.
reverse_iterator to iterator: use member base() function.
const_cast works for conversion from const_iterator to iterator of strings and vector because they are char* and T* pointers. For others to convert from const_iterator to iterator use std::advance (i, distance (i,ci))

6. istream_iterator is used for formatted input. (does not read spaces)
istreambuf_iterator also reads spaces between strings.

7. v.reserve(size) does not invoke constructor (even default). It simply allocates more memory, if any, to hold size objects. Insertion of value at v.end () is wrong in general, use back_inserter (v) instead. Insertion is important and not assignment even after reserve.

8. v.remove () may not erase elements from the container, therefore, v.size() may not change after v.remove.

9. binary_search should receive same comparison function as the sort function did.

10. Custom function objects should be adaptable. To make them adaptable inherit from unary_function or binary_function. Adaptable function objects can be used with not1.
ptr_fun, mem_fun and mem_fun_ref are used to adapt member functions for algorithms like for_each.

Comments

Popular Content

Multi-dimensional arrays in C++11

What new can be said about multi-dimensional arrays in C++? As it turns out, quite a bit! With the advent of C++11, we get new standard library class std::array. We also get new language features, such as template aliases and variadic templates. So I'll talk about interesting ways in which they come together.

It all started with a simple question of how to define a multi-dimensional std::array. It is a great example of deceptively simple things. Are the following the two arrays identical except that one is native and the other one is std::array?

int native[3][4];
std::array<std::array<int, 3>, 4> arr;

No! They are not. In fact, arr is more like an int[4][3]. Note the difference in the array subscripts. The native array is an array of 3 elements where every element is itself an array of 4 integers. 3 rows and 4 columns. If you want a std::array with the same layout, what you really need is:

std::array<std::array<int, 4>, 3> arr;

That's quite annoying for two r…

Inheritance vs std::variant

C++17 added std::variant and std::visit in its repertoire. They are worth a close examination. I've been wondering about whether they are always better than inheritance for modeling sum-types (fancy name for discriminated unions) and if not, under what circumstances they are not. We'll compare the two approaches in this blog post. So here it goes.

Inheritancestd::variantNeed not know all the derived types upfront (open-world assumption)Must know all the cases upfront (closed-world assumption)Dynamic Allocation (usually)No dynamic allocationIntrusive (must inherit from the base class)Non-intrusive (third-party classes can participate)Reference semantics (think how you copy a vector of pointers to base class?)Value semantics (copying is trivial)Algorithm scattered into classesAlgorithm in one placeLanguage supported (Clear errors if pure-virtual is not implemented)Library supported (poor error messages)Creates a first-class abstractionIt’s just a containerKeeps fluent interfaces…

Covariance and Contravariance in C++ Standard Library

Covariance and Contravariance are concepts that come up often as you go deeper into generic programming. While designing a language that supports parametric polymorphism (e.g., templates in C++, generics in Java, C#), the language designer has a choice between Invariance, Covariance, and Contravariance when dealing with generic types. C++'s choice is "invariance". Let's look at an example.
struct Vehicle {}; struct Car : Vehicle {}; std::vector<Vehicle *> vehicles; std::vector<Car *> cars; vehicles = cars; // Does not compile The above program does not compile because C++ templates are invariant. Of course, each time a C++ template is instantiated, the compiler creates a brand new type that uniquely represents that instantiation. Any other type to the same template creates another unique type that has nothing to do with the earlier one. Any two unrelated user-defined types in C++ can't be assigned to each-other by default. You have to provide a c…