Skip to main content

const overloaded arrow operator

I think it is a good idea to have const-overloaded arrow operator in counted pointer idiom though the Coplien's book does not say about it. This is required to "carry forward" the const-ness from the handle object to the body pointer held inside the handle. Counted body idiom is useful when you do not want to add corresponding (mirror) functions in handle class when you add functions in the body class. Handle class can actually be template. (CORBA _var classes?) The arrow operator takes care of "automatic" forwarding.

class String // this is handle
Stringrep *operator -> () const { return b_; }
Stringrep *b_;

class Stringrep // this is body
void func (); // a non-const function.

main() {
const String s (new Stringrep);
s->func (); // invokes a non-const function of stringrep (body) when handle object is const.

In order to prevent this undetected mishap declare vonst-overloaded arrow operators.

class String
const Stringrep *operator -> () const { return b_; }
Stringrep *operator -> () { return b_; }
Stringrep *b_;

Depending upon the const-ness of the handle object, it will invoke the right const-overloaded arrow operator and therefore, const-ness of body pointer comes along with it and therefore, compiler will prevent invocation of non-const member method of the body class using a const handle object. This is important because handle-body are logically the same entity for the client of the abstraction.


dat-girl said…
I peep the web for blogs just like this one.
Airtight blog. Your site was off the chain and I will
I will give you access to jump to my 1800contacts web coupon code blog.
stunned said…
Prodigious blog. Loved it so much I went to it
again! Just go online and search for blogs that are
worth the value as yours.
Where you been? You have got to look at my 1800contacts com coupon blog!
lightly-blended said…
Fruitful blog. I favor your site and I shall
return to it! I go to sites like this when I get the
chance, and find blog just like this.
Please examine my 1800contacts com coupon blog as soon as you can.
Nice blog. I seen the site and I adored the work,
that I want to visit it more each day! I like
searching for blogs that have the same content like
this one!
Please proceed to my 1800contacts coupon code blog when you find the time.
Super blog. I enjoyed the site and when I have the
time, shall visit the site again. Finding blogs this
good on the internet.
Please consider looking at my blog.
Asset Search said…
Suitable blog, its very good. I liked the site its
from so much I have to visit it again! I surf the web
for blogs like yours in my spare time.
Look who checking out my 1800contacts com coupon blog?
Super blog. I web surf when I have the time for
blogs like this one.Your site was nice and will be
visited again!
Please consider looking at my plastic surgery specialist blog.
Energizing blog. It blew me away and I loved your
site. when I have the time to surf the net, i try
finding blogs as good as your site.
I want you to look for my plastic surgery center blog.

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

Unit Testing C++ Templates and Mock Injection Using Traits

Unit testing your template code comes up from time to time. (You test your templates, right?) Some templates are easy to test. No others. Sometimes it's not clear how to about injecting mock code into the template code that's under test. I've seen several reasons why code injection becomes challenging. Here I've outlined some examples below with roughly increasing code injection difficulty. Template accepts a type argument and an object of the same type by reference in constructor Template accepts a type argument. Makes a copy of the constructor argument or simply does not take one Template accepts a type argument and instantiates multiple interrelated templates without virtual functions Lets start with the easy ones. Template accepts a type argument and an object of the same type by reference in constructor This one appears straight-forward because the unit test simply instantiates the template under test with a mock type. Some assertion might be tested in

Want speed? Use constexpr meta-programming!

It's official: C++11 has two meta-programming languages embedded in it! One is based on templates and other one using constexpr . Templates have been extensively used for meta-programming in C++03. C++11 now gives you one more option of writing compile-time meta-programs using constexpr . The capabilities differ, however. The meta-programming language that uses templates was discovered accidently and since then countless techniques have been developed. It is a pure functional language which allows you to manipulate compile-time integral literals and types but not floating point literals. Most people find the syntax of template meta-programming quite abominable because meta-functions must be implemented as structures and nested typedefs. Compile-time performance is also a pain point for this language feature. The generalized constant expressions (constexpr for short) feature allows C++11 compiler to peek into the implementation of a function (even classes) and perform optimization