February 11, 2021.

# C++: The Worst of Both Worlds

C++ is certainly one of the most complex programming languages around. A particularly gnarly aspect of C++ are the templates: as a late addition to the language, they had to fit within the existing syntax. On top of that, using the STL approach, the C++ language designers discovered that templates were far more powerful than initially thought. In other words, they accidentally created a very pure functional language. Unfortunately, this accident of birth also means that its functional syntax is barely usable. Even so, given its power and the need for advanced C++ techniques, the templating part of C++ keeps amassing ever more features and even more power.

In contrast, Python is often described as one of the easiest programming languages to learn and read. It is also very dynamic, allowing any data to pass around to any function very easily. Better yet, functions can be defined and re-defined at run-time. When you call a function, you are never sure what code will really be executed.

So, why not combine the two? Combine the complexity and obscure syntax of C++ templates with Python dynamic typing and dynamic extensibility? If this kind of revolting brew interests you, then I’ve got something for you!

## Now, Seriously…

The real story is that I wanted to have overloaded function resolution at run-time instead of compile-time.

I wanted to create a dynamic function-dispatch system that could call a function with any data. I wanted this system to be dynamically extensible to allow new overloads of the function for new data types at any time. I also wanted to be able to call the functions with either concrete data or a bunch of std::any. I also wanted all this to be reasonably efficient.

To achieve all these goals, I turned to templates. Not just simple ones though, but rather the more complex variadic templates.

What’s a variadic template? Normal templates require a fixed number of types as argument. That’s fine if you know in advance how many types you’ll need. Variadic templates, on the other hand, accept a variable number of types as argument. It can be zero, one, two, or any number of types.

Besides receiving these types, templates must also be able to use them. As you may already know, templates are compile-time beasts. They need to work without modifying any data. Therefore, to manipulate a variable number of types, C++ needed a new syntax. The new syntax for both receiving the types and using them was created around the ellipsis: ....

The basic idea is that whenever the ellipsis is used, the C++ compiler knows it has to repeat the surrounding piece of code as many times as needed for each type. For example, the types of the variadic template are received with the ellipsis. In the following example, the VARIA template argument represents any number of types.

template <class... VARIA>
struct example
{
// template implementation.
};

Later on, in the template implementation, the variadic type arguments can be used in the code with the ellipsis. For example, the variadic template above could have a function that receives arguments of the corresponding types and passes these values into a call to another function, like this:

// Receive a variable number of arguments…
void foo(VARIA... function_arguments)
{
// … and pass them on to another function.
other_bar_function(function_arguments...);
}

These examples only scratch the surface of what is possible with variadic templates, but they are sufficient for the purposes of this article.

## Dynamic Dispatch Design

Before delving into the design of our dynamic dispatch, we need to outline our requirements more precisely. I said the dynamic dispatch should mimic the compile-time function overload of C++. What does that mean exactly? Well, here are the features of an ideal design:

• The function itself is declared at compile-time and is referred to by its name, like a normal function.
• The number of arguments of a given function can vary.
• Each overload of a function can return different types of values.
• Each such function can be overloaded for any type.
• New function overload can be added dynamically, at run-time, for any type.

While these requirements would be sufficient for our purposes, there were a few additional use cases I wanted to cover. The first was to support function arguments that always have the same type. For example, a text-streaming function would always receive a std::ostream argument. The second was to be able to select a function implementation without having to pass a value to the function. This would allow specifying the return type of the function or implementing functions that take no argument at all. I’ll be showing you an example of each of these cases later on.

To support these use cases, we added two features to the list:

• Not all arguments have to play a part in the type-based selection of the function.
• Some additional types can play a part in the typed-based selection of the function without being an argument.

The result should look like a compile-time function overload. For example, here is how a call to the dynamic-dispatch to_text function looks like:

std::wstring resultat = to_text(7);
// result == "7"
std::any seven(7);
std::wstring resultat = to_text(seven);
// result ==  "7"

This apparent simplicity is supported by a lot of complex code behind the scenes.

## Smooth Operator

Before demonstrating the implementation of the dynamic dispatch, we’ll show what it looks like from the viewpoint of the programmer creating a new operation. How do we create a new function?

To create a new operation called foo, declare a class to represent it. For the purposes of our example, we named it foo_op_t, derived from op_t. The foo_op_t class identifies the operation. It can be entirely empty. Afterward, we can write the foo function, the real entry-point for the operation. That is the function that the user of the foo operation will call. This function only needs to call call<>::op() (for concrete values) or call_any<>::op() (for std::any values), both of which are found in foo_op_t, which takes care of the dynamic dispatch:

struct foo_op_t : op_t<foo_op_t> { /* empty! */ };

inline std::any foo(const std::any& arg_a, const std::any& arg_b)
{
return foo_op_t::call_any<>::op(arg_a, arg_b);
}

template<class A, class B, class RET>
inline RET foo(const A& arg_a, const A& arg_b)
{
std::any result = foo_op_t::call<>::op(arg_a, arg_b);
// Note: we could test if the std::any really contains
//       a RET, instead of blindly trusting it.
return any_cast<RET>(result);
}

Note that the base class of the new operation takes the operation itself as a template parameter. This is a well-known trick in template programming. In fact, it is so well-known that it even has a name: the curiously recursive template pattern. In our case, this trick is used so that the op_t can refer to the specific operation being used.

Now, we can create overloads of the foo operation. This is done by calling make<>::op with a function that implements the overload. To create an overload that takes types A and B and returns the type RET, we call make<>::op<RET, A, B>. This registers the overload in the foo_op_t class. As an example, let’s implement our foo operation for the type int and double and make it return a float:

// Some code in your program that implements the operation.
float foo_for_int_and_double(int i, double d)
{
return float(i + d);
}

// Registration!
foo_op_t::make<>::op<float, int, double>(foo_for_int_and_double);

Of course, we could make the code shorter by writing the implementation right there in the call to make<>::op, with a lambda:

foo_op_t::make<>::op<float, int, double>(
[](int i, double d) -> float
{
return float(i + d);
}
);

In case you were wondering why the call<> and make<> take the template sigils, it’s because they are themselves variadic templates. The optional template arguments are the extra selection types used to choose a more specific overload based on types that are not passed as an argument to the foo operation. We will explain this in greater detail later.

Now, we are finally ready to get into the meat of the subject: implementing the dynamic function dispatch.

## Enter Selector

The first problem to tackle is how each overload is identified within a function family. The obvious solution is to identify it by the types, or by its argument and extra selection types. C++ provides the std::type_info and std::type_index to identify a type. What we need is a tuple of these type_index. We achieve that with a pair of templates: the type converter and the selector.

The type converter maps any type to std::type_index. It is a very idiomatic trick in template programming, where each step in an algorithm is implemented in a type so that it can be executed at compile-time. Below is the converter, converting any type A into a type_index or std::any:

template <class A>
struct type_converter_t
{
using type_index = std::type_index;
using any = std::any;
};

The full type selector can then be written as a variadic template by applying the converter to all types given as argument and declaring a tuple type named selector_t with the result. It uses both the functions argument type, N_ARY, and the extra selection types, EXTRA_SELECTORS, to create the full selector.

template <class... EXTRA_SELECTORS>
struct op_selector_t
{
template <class... N_ARY>
struct n_ary_t
{
// The selector_t type is a tuple of type_index.
using selector_t = std::tuple<
typename type_converter_t<EXTRA_SELECTORS>::type_index...,
typename type_converter_t<N_ARY>::type_index...>;
};
};

Note how the ellipsis is applied to the line:

typename type_converter_t<EXTRA_SELECTORS>::type_index...

How the C++ language applies the ellipsis is part of the black magic of variadic templates. Sometimes, you will have to go by trial and error to see what works and what doesn’t.

Now we have a selector type, but how do we use it? To do this, we provide a few functions. The goal is to have a function that creates a selector pre-filled with concrete types. Naturally, we call our function make:

template <class... EXTRA_SELECTORS>
struct op_selector_t
{
template <class... N_ARY>
struct n_ary_t
{
template <class A, class B>
static selector_t make()
{
return selector_t(
std::type_index(typeid(EXTRA_SELECTORS))...,
std::type_index(typeid(N_ARY))...);
}
};
};

Since we want to support calls with std::any, we need to provide a make_any function with std::any as input. (For optimization purposes, a version with the extra selector already converted to type_index is provided and named make_extra_any, but it is not shown here.)

static selector_t make_any(const typename type_converter_t<N_ARY>::any&... args)
{
return selector_t(
std::type_index(typeid(EXTRA_SELECTORS))...,
std::type_index(args.type())...);
}

## Diving into Delivery

We can finally dive into the mechanical details of the registration and calling of the operations. The operation base class is declared as a template taking the operation itself and a list of optional unchanging extra arguments, EXTRA_ARGS, which have fixed types. (Remember our earlier streaming operation example, which always received a std::ostream.)

template <class OP, class... EXTRA_ARGS>
struct op_t
{
// Internal details will come next...
};

Let’s first show a few types that are used repeatedly: the selector class, op_sel_t, the selector tuple, selector_t and the internal function signature of the operation, op_func_t.

using op_sel_t = typename op_selector_t<EXTRA_SELECTORS...>::template n_ary_t<N_ARY...>;
using selector_t = typename op_sel_t::selector_t;
using op_func_t = std::function<std::any(EXTRA_ARGS ..., typename type_converter_t<N_ARY>::any...)>;

This illustrates some of the inherent complexity of template programming. Many of its parts would normally be totally unnecessary, but are nevertheless required due to the internal workings of templates. For example, typename is necessary to tell the compiler that what follows really is a type. This happens when a template refers to elements of another template. The C++ syntax is too ambiguous to let the compiler infer that we are using a type. Another very peculiar aspect is the extra template keyword right before accessing n_ary_t: it is needed to let the compiler know that it really is a template.

We’re now ready to explain the whole system, which is put together with just a few functions:

• A public way to call the operation: call<>::op
• A public way to make a new overload: make<>::op
• A private way to lookup the correct overload: get_ops

We will tackle each in reverse order, from the lowest implementation details up to the final operation: calling an overload.

## Keeper of Wonders

The lowest implementation detail is the function that holds the available, pre-registered overloads. There is a very important reason why get_ops needs to exist: the problem is that the overloads need to be kept in a container, while the operation base class is a template. We cannot keep all overloads for all operations together. Fortunately, the C++ language specifies that a static variable contained in a function in a template is specific to each instantiation of the template. This lets us hide the registration location within. The get_ops safely holds our list of overloads:

template <class SELECTOR, class OP_FUNC>
static std::map<SELECTOR, OP_FUNC>& get_ops()
{
static std::map<SELECTOR, OP_FUNC> ops;
return ops;
}

The fact that it is templated over SELECTOR and OP_FUNC allows the operation to be overloaded for any number of arguments.

The make<>::op function is a template that takes a concrete overload for concrete types, wraps it into the internal function signature and registers it. The wrapping takes care of converting the std::any arguments into concrete types. This is safe, since the concrete overload for these concrete types is only ever called when the types match. This is where the optional extra selection types may be given as the EXTRA_SELECTORS template arguments.

template <class... EXTRA_SELECTORS>
struct make
{
template <class RET, class... N_ARY>
static void op(
std::function<RET(EXTRA_ARGS... extra_args, N_ARY... args)> a_func)
{
// Wrapper kept as a lambda mapping the internal
// function signature to the concrete function signature.
op_func_t op(
[a_func](
EXTRA_ARGS... extra_args,
const typename type_converter_t<N_ARY>::any&... args) -> std::any
{
// Conversion to concrete argument types.
return std::any(a_func(extra_args..., *std::any_cast<N_ARY>(&args)...));
}
);

// Registration.
auto& ops = get_ops<selector_t, op_func_t>();
ops[op_sel_t::make()] = op;
}
};

## Call Me Up, Call My Op

We finally reach the function used to dispatch a call. There are three versions of the function. The thing that differentiates them is whether the arguments have already been converted to std::any or std::type_index. The call<>::op function needs to do a few things:

• Create a selector from the types of its arguments, plus the optional extra selectors.
• Retrieve the list of available overloads.
• Lookup the function overload using the selector.
• Return an empty value if no overload matches the arguments.
• Call the function if an overload matches the arguments.
template <class... EXTRA_SELECTORS>
struct call
{
template <class... N_ARY>
static std::any op(EXTRA_ARGS... extra_args, N_ARY... args)
{
const auto& ops = get_ops<selector_t, op_func_t>();
// Try to find a matching overload.
const auto pos = ops.find(op_sel_t::make());
// Return an empty result if no overload matches.
if (pos == ops.end())
return std::any();
return pos->second(extra_args..., args...);
}
};

## Wrapping Up

This completes the description of the dynamic dispatch design and its implementation. The source code repo contains multiple examples of operations with a complete suite of tests.

The examples of operations are:

• compare, a binary operation to compare two values.
• convert, a unary operation to convert a value to another type. This is an example of an operation with an extra selector argument, the final type of the conversion.
• is_compatible, a nullary operation that takes two extra selection types to verify if one can be converted to the other.
• size, a unary operation that returns the number of elements in a container, or zero if no overload was found.
• stream, a unary operation to write a value to a text stream. This is an example of an operation with an extra unchanging argument, the destination std::ostream.
• to_text, a unary operation that converts a value to text.

The whole code base is found in the any_op library that is part of my dak_utility repo.