Re:Template Metaprogramming with Modern C++: templates in depth
by corysama on Monday September 29, 2014 @01:59PM
(#8384125)
So then, is the proposed alternative a library of containers and algorithms that are genericized via void pointers, memcpy sizes and function pointer predicates?
[ Parent
| on HN ]
Re:Template Metaprogramming with Modern C++: templates in depth
by dllthomas on Monday September 29, 2014 @02:04PM
(#8384162)
I'd assume so. In principle you can get there without sacrificing type safety (http://en.wikipedia.org/wiki/Type_erasure). In practice, I don't know whether or not you can write type safe C++ that compiles that way.
Re:Template Metaprogramming with Modern C++: templates in depth
by cbsmith on Monday September 29, 2014 @04:34PM
(#8385126)
In truth, if you really care about it, you can take a policy based design approach to this and have explicit rules for when you may or may not do type erasure. It's definitely a bit of work, but you can actually get full compile_time type safety and yet avoid having duplicative code with various tricks like (this skips over a lot of the pain and isn't really how you'd do it... just illustrative):
template <std::size_t N>
struct raw {
template <typename U>
constexpr raw(U x, std::enable_if<.....>);
template <typename U>
constexpr operator U();
};
template <template ContainerType, typename T, std::enable_if<std::is_trivially_convertible<T, ....> > >
struct somewhat_erased_container : private ContainerType<raw<sizeof(T)>> {
};
It's particularly easy to do with containers of pointers (of course).
Re:Template Metaprogramming with Modern C++: templates in depth
by dllthomas on Monday September 29, 2014 @04:39PM
(#8385159)
Very nice.
Re:Template Metaprogramming with Modern C++: templates in depth
by cbsmith on Monday September 29, 2014 @05:45PM
(#8385499)
Herb Sutter has prompted a variant of the Pimpl idiom that kind of goes this way, as have others. Linus was proudly showing how C was better than C++ by virtue of being able to do something much like this, but of course you can accomplish this in C++, of course there are some down sides that accompany it. Most importantly with C++ you can much more easily provide more robust compile time type safety with little or no runtime overhead.
Re:Template Metaprogramming with Modern C++: templates in depth
by corysama on Monday September 29, 2014 @03:44PM
(#8384818)
This seems like a nice article series on the subject http://akrzemi1.wordpress.com/2013/11/18/type-erasure-part-i...
Just getting started on it, it seems that the theme is that you can't have the same binary code work on different types without having a run-time indirection in there somewhere. But, you can use templates to keep that indirection convenient and type safe. And, you can structure your templates to only specialize a minimal amount of code necessary to interface your type into a non-specialized algorithm.
Re:Template Metaprogramming with Modern C++: templates in depth
by dllthomas on Monday September 29, 2014 @04:24PM
(#8385053)
Right, that looks like an exploration of what I was talking about (and at a skim, looks solid).
"you can't have the same binary code work on different types without having a run-time indirection in there somewhere"
That's certainly the case, but if you're passing by reference you already have an indirection, so that may or may not mean additional run-time overhead.