Skip to main content

Simple Template Currying

Currying is the technique of transforming a function that takes multiple arguments in such a way that it can be called as a chain of functions, each with a single argument. I've discussed Currying on this blog previously in Fun With Lambdas C++14 Style and Dependently-Typed Curried printf. Both blogposts discuss currying of functions proper. I.e., they discuss how C++ can treat functions as values at runtime.

However, currying is not limited to just functions. Types can also be curried---if they take type arguments. In C++, we call them templates. Templates are "functions" at type level. For example, passing two type arguments std::string and int to std::map gives std::map<std::string, int>. So std::map is a type-level function that takes two (type) arguments and gives another type as a result. They are also known as type constructors.

So, the question today is: Can C++ templates be curried? As it turns out, they can be. Rather easily. So, here we go...
#include <type_traits>
#include <functional>
#include <map>
#include <iostream>

template <template <class...> class C, class... T, class D = C<T...>>
constexpr std::true_type valid(std::nullptr_t);

template <template <class...> class C, class... T>
constexpr std::false_type valid(...);

template <class TrueFalse, template <class...> class C, class... ArgsSoFar>
struct curry_impl;

template <template <class...> class C, class... ArgsSoFar>
struct curry_impl<std::true_type, C, ArgsSoFar...> {
  using type = C<ArgsSoFar...>;
};

template <template <class...> class C, class... ArgsSoFar>
struct curry_impl<std::false_type, C, ArgsSoFar...> {
  template <class... MoreArgs>
  using apply = curry_impl<decltype(valid<C, ArgsSoFar..., MoreArgs...>(nullptr)), C, ArgsSoFar..., MoreArgs...>;
};

template <template <class...> class C>
struct curry {
  template <class... U>
  using apply = curry_impl<decltype(valid<C, U...>(nullptr)), C, U...>;
};

int main(void) {
  using CurriedIsSame = curry<std::is_same>;
  static_assert(curry<std::is_same>::apply<int>::apply<int>::type::value);

  curry<std::less>::apply<int>::type less;
  std::cout << std::boolalpha << less(5, 4); // prints false

  using CurriedMap = curry<std::map>;
  using MapType = CurriedMap::apply<int>::apply<long, std::less<int>, std::allocator<std::pair<const int, long>>>::type;
  static_assert(std::is_same<MapType, std::map<int, long>>::value);
}
Wandbox

The technique is very simple. There's a function called valid that has two overloads. The first one returns std::true_type only if C<T..> is a valid instantiation of template C with argument list T.... Otherwise, it returns std::false_type. C is type constructor that we would like to curry. This function uses the SFINAE idiom.

curry_impl is the core implementation of template currying. It has two specializations. The std::true_type specialization is selected when valid returns std::true_type. I.e., curried version of the type constructor has received the minimum number of type arguments to form a complete type. In other words, ArgsSoFar are enough. curry_impl<C, ArgsSoFar...>::type is same as instantiation of the type constructor with the valid type arguments (C<ArgsSoFar...>).

Note that C++ allows templates to have default type arguments. Therefore, a template could be instantiated by providing "minimum" number of arguments. For example, std::map could be instantiated in three ways giving the same type:
  • std::map<int, long>
  • std::map<int, long, std::less<int>>
  • std::map<int, long, std::less<int>, std::pair<const int, long>>

When ArgsSoFar are not enough, curry_impl<std::false_type> carries the partial list of type arguments (ArgsSoFar) at class template level. It allows passing one or more type arguments (MoreArgs) to the type constructor through the apply typedef. When ArgsSoFar and MoreArgs are enough to form a valid instantiation, curry_impl<std::true_type> is chosen which yields the fully instantiated type.

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...

Review of Manning's Functional Programming in C++

Last year I reviewed the pre-print manuscript of Manning's Functional Programming in C++ written by Ivan Čukić. I really enjoyed reading the book. I enthusiastically support that the book Offers precise, easy-to-understand, and engaging explanations of functional concepts. Who is this book for This book expects a reasonable working knowledge of C++, its modern syntax, and semantics from the readers. Therefore, reading this book might require a companion book for C++ beginners. I think that’s fair because FP is an advanced topic. C++ is getting more and more powerful day by day. While there are many FP topics that could be discussed in such a book, I like the practicality of the topics selected in this book. Here's the table of contents at a glance. This is a solid coverage of functional programming concepts to get a determined programmer going from zero-to-sixty in a matter of weeks. Others have shared their thoughts on this book as well. See Rangarajan Krishnamo...

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...