Skip to main content
An interesting consequence of decay related rules of pointers
and references is that seemingly correct C++ code fails to
compile.

We have a max() template with pretty obvious implementation
for basic types.

template < typename T >
T & max (T &a,T &b);

but,

max("APPLE","PEAR");

Gives an error, because
type of "APPLE" is const char [6]
type of "PEAR" is const char [5]

T can't be "const char [6]" AND "const char [5]"
at the same time!! No array-to-pointer decay occurs here.

Above thing will work for following declaration of max

template < typename T >
T max (T a, T b);

Here T is char *!!

Comments

Hype blog. And I admire your site and plan on
returning to it! When I web surf it always helps me to
find great blogs.
Everyday of the month you need to peep my 1800contacts coupon codes blog.
Incredible blog. I admired your site and I will be
back once again to view it! I use much of my spare
time searching for blogs like yours.
Go and find my 1800contacts coupon blog.
Remarkable blog. I take the neccesary time to find
blogs that are just as good as the ones you do.
Click on my 1800contacts coupon blog before its to late.
outa-time said…
Terrific blog. I search the internet everytime I
get a moment to find blogs. Its better than cold iced
tea and I have to visit it one more time!
Look into my 1800contacts web coupon code blog.
stunned said…
I took pleasure in the site and I will go back!
Surfing online for blogs like this one is worth my
time. Sensational blog.
No matter when you are, just stop by and check for my blog site.
Fascinating blog. I loved the site you did a good
job on it, I will be back! I surf the net for blog
like this one.
Please go over my blog.
Excellent blog. Your site was great and will be
finding it again!  I surf the net for blogs like
yours.
Check out my 1800contacts coupon code blog, you won't be sorry!
condensed said…
Wondrous blog. Your site was very pleasing and I
will go back again! I like surfing the net for blogs
as good as yours.
I hope you had a chance to check out my 1800contacts com coupon blog.
Fascinating blog. I loved the site you did a good
job on it, I will be back! I surf the net for blog
like this one.
Once you sign on, check for my southern california plastic surgery blog.
Unbelievable blog. I can hardly wait to vist this
site again.I'm consistently looking up blogs like
this.
I want you to stop and compare with my plastic surgery mexico blog.
manho valentine said…
If you are interested please contact us with pleasure
Please look at the following website
thanks you!
gclub

Popular posts from this blog

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…

Folding Monadic Functions

In the previous two blog posts (Understanding Fold Expressions and Folding Functions) we looked at the basic usage of C++17 fold expressions and how simple functions can be folded to create a composite one. We’ll continue our stride and see how "embellished" functions may be composed in fold expressions.

First, let me define what I mean by embellished functions. Instead of just returning a simple value, these functions are going to return a generic container of the desired value. The choice of container is very broad but not arbitrary. There are some constraints on the container and once you select a generic container, all functions must return values of the same container. Let's begin with std::vector.
// Hide the allocator template argument of std::vector. // It causes problems and is irrelevant here. template <class T> struct Vector : std::vector<T> {}; struct Continent { }; struct Country { }; struct State { }; struct City { }; auto get_countries…

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…