Adds two more tasks.

data/genericify_cpp.jsonl

@@ -5,4 +5,6 @@
 {"base_canonical_solution": "template <typename T>\nT mean_absolute_deviation(std::vector<T> numbers) {\n  T sum = 0;\n  for (int i = 0; i < numbers.size(); i++) sum += numbers[i];\n  T avg = sum / numbers.size();\n  T msum = 0;\n  for (int i = 0; i < numbers.size(); i++) msum += std::abs(numbers[i] - avg);\n  return msum / numbers.size();\n}", "base_prompt": "Make the following function generic for the value type of the vector parameter `numbers`.", "concepts_canonical_solution": "template <std::floating_point T>\nT mean_absolute_deviation(std::vector<T> numbers) {\n  T sum = 0;\n  for (int i = 0; i < numbers.size(); i++) sum += numbers[i];\n  T avg = sum / numbers.size();\n  T msum = 0;\n  for (int i = 0; i < numbers.size(); i++) msum += std::abs(numbers[i] - avg);\n  return msum / numbers.size();\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that the generic type is only floating point types.", "invalids": "int main() { mean_absolute_deviation(std::vector<int>{0, 1, 2}); }", "sfinae_canonical_solution": "template <typename T, std::enable_if_t<std::is_floating_point_v<T>, int> = 0>\nT mean_absolute_deviation(std::vector<T> numbers) {\n  T sum = 0;\n  for (int i = 0; i < numbers.size(); i++) sum += numbers[i];\n  T avg = sum / numbers.size();\n  T msum = 0;\n  for (int i = 0; i < numbers.size(); i++) msum += std::abs(numbers[i] - avg);\n  return msum / numbers.size();\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that the generic type is only floating point types.", "starter_code": "float mean_absolute_deviation(std::vector<float> numbers) {\n  float sum = 0;\n  for (int i = 0; i < numbers.size(); i++) sum += numbers[i];\n  float avg = sum / numbers.size();\n  float msum = 0;\n  for (int i = 0; i < numbers.size(); i++) msum += std::abs(numbers[i] - avg);\n  return msum / numbers.size();\n}", "task_id": "HEP/4", "tests": "#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                   \\\n  do {                                                                         \\\n    ASSERT(abs(mean_absolute_deviation(std::vector<_type_>{1.0, 2.0, 3.0}) -   \\\n               (_type_)2.0 / (_type_)3.0) < (_type_)1e-4);                     \\\n    ASSERT(                                                                    \\\n        abs(mean_absolute_deviation(std::vector<_type_>{1.0, 2.0, 3.0, 4.0}) - \\\n            (_type_)1.0) < (_type_)1e-4);                                      \\\n    ASSERT(abs(mean_absolute_deviation(                                        \\\n                   std::vector<_type_>{1.0, 2.0, 3.0, 4.0, 5.0}) -             \\\n               (_type_)6.0 / (_type_)5.0) < (_type_)1e-4);                     \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(float);\n  TEST_ON_TYPE(double);\n}"}
 {"base_canonical_solution": "template <typename Container, typename Value>\nContainer intersperse(Container numbers, Value delimeter) {\n  Container out;\n  if (numbers.size() > 0) out.push_back(numbers[0]);\n  for (int i = 1; i < numbers.size(); i++) {\n    out.push_back(delimeter);\n    out.push_back(numbers[i]);\n  }\n  return out;\n}", "base_prompt": "Make the following function generic for both parameters and return type.", "concepts_canonical_solution": "template <typename Container, typename Value>\n  requires requires(Container &c, Value v) {\n    { c.push_back(v) };\n  }\nContainer intersperse(Container numbers, Value delimeter) {\n  Container out;\n  if (numbers.size() > 0) out.push_back(numbers[0]);\n  for (int i = 1; i < numbers.size(); i++) {\n    out.push_back(delimeter);\n    out.push_back(numbers[i]);\n  }\n  return out;\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that the value to intersperse can be pushed back on the container.", "invalids": "int main() {\n  std::vector<int*> v;\n  intersperse(v, int{0});\n}", "sfinae_canonical_solution": "template <typename Container, typename Value,\n          typename = std::void_t<decltype(std::declval<Container &>().push_back(\n              std::declval<Value>()))>>\nContainer intersperse(Container numbers, Value delimeter) {\n  Container out;\n  if (numbers.size() > 0) out.push_back(numbers[0]);\n  for (int i = 1; i < numbers.size(); i++) {\n    out.push_back(delimeter);\n    out.push_back(numbers[i]);\n  }\n  return out;\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that the value to intersperse can be pushed back on the container.", "starter_code": "std::vector<int> intersperse(std::vector<int> numbers, int delimeter) {\n  std::vector<int> out;\n  if (numbers.size() > 0) out.push_back(numbers[0]);\n  for (int i = 1; i < numbers.size(); i++) {\n    out.push_back(delimeter);\n    out.push_back(numbers[i]);\n  }\n  return out;\n}", "task_id": "HEP/5", "tests": "template <typename T>\nbool issame(T a, T b) {\n  if (a.size() != b.size()) return false;\n  for (int i = 0; i < a.size(); i++) {\n    if (a[i] != b[i]) return false;\n  }\n  return true;\n}\n\n#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_, _value_)                            \\\n  do {                                                           \\\n    ASSERT(issame(intersperse(_type_{}, (_value_)7), _type_{})); \\\n    ASSERT(issame(intersperse(_type_{5, 6, 3, 2}, (_value_)8),   \\\n                  _type_{5, 8, 6, 8, 3, 8, 2}));                 \\\n    ASSERT(issame(intersperse(_type_{2, 2, 2}, (_value_)2),      \\\n                  _type_{2, 2, 2, 2, 2}));                       \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(std::vector<int>, int);\n  TEST_ON_TYPE(std::vector<float>, long);\n  TEST_ON_TYPE(std::deque<float>, float);\n}"}
 {"base_canonical_solution": "template <typename T>\nstd::vector<int> parse_nested_parens(T paren_string) {\n  std::vector<int> all_levels;\n  std::string current_paren;\n  int level = 0, max_level = 0;\n  for (int i = 0; i < paren_string.size(); i++) {\n    char chr = paren_string[i];\n    if (chr == '(') {\n      level += 1;\n      if (level > max_level) max_level = level;\n      current_paren += chr;\n    }\n    if (chr == ')') {\n      level -= 1;\n      current_paren += chr;\n      if (level == 0) {\n        all_levels.push_back(max_level);\n        current_paren = \"\";\n        max_level = 0;\n      }\n    }\n  }\n  return all_levels;\n}", "base_prompt": "Make the following function generic for the parameter `paren_string`.", "concepts_canonical_solution": "template <typename T>\n  requires requires(const T& s, std::size_t i) {\n    { s[i] } -> std::convertible_to<char>;\n    { s.size() } -> std::convertible_to<int>;\n    std::same_as<typename T::value_type, char>;\n  }\nstd::vector<int> parse_nested_parens(T paren_string) {\n  std::vector<int> all_levels;\n  std::string current_paren;\n  int level = 0, max_level = 0;\n  for (int i = 0; i < paren_string.size(); i++) {\n    char chr = paren_string[i];\n    if (chr == '(') {\n      level += 1;\n      if (level > max_level) max_level = level;\n      current_paren += chr;\n    }\n    if (chr == ')') {\n      level -= 1;\n      current_paren += chr;\n      if (level == 0) {\n        all_levels.push_back(max_level);\n        current_paren = \"\";\n        max_level = 0;\n      }\n    }\n  }\n  return all_levels;\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that the parameter `paren_string` must be a sequenced container of characters like a string.", "invalids": "int main() { parse_nested_parens(float{3}); }", "sfinae_canonical_solution": "template <\n    typename T,\n    std::enable_if_t<\n        std::conjunction_v<\n            std::is_same<char, typename T::value_type>,\n            std::is_same<char,\n                         std::decay_t<decltype(std::declval<T>()[std::declval<\n                             std::size_t>()])>>>,\n        int> = 0>\nstd::vector<int> parse_nested_parens(T paren_string) {\n  std::vector<int> all_levels;\n  std::string current_paren;\n  int level = 0, max_level = 0;\n  for (int i = 0; i < paren_string.length(); i++) {\n    char chr = paren_string[i];\n    if (chr == '(') {\n      level += 1;\n      if (level > max_level) max_level = level;\n      current_paren += chr;\n    }\n    if (chr == ')') {\n      level -= 1;\n      current_paren += chr;\n      if (level == 0) {\n        all_levels.push_back(max_level);\n        current_paren = \"\";\n        max_level = 0;\n      }\n    }\n  }\n  return all_levels;\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that the parameter `paren_string` must be a sequenced container of characters like a string.", "starter_code": "std::vector<int> parse_nested_parens(std::string paren_string) {\n  std::vector<int> all_levels;\n  std::string current_paren;\n  int level = 0, max_level = 0;\n  for (int i = 0; i < paren_string.size(); i++) {\n    char chr = paren_string[i];\n    if (chr == '(') {\n      level += 1;\n      if (level > max_level) max_level = level;\n      current_paren += chr;\n    }\n    if (chr == ')') {\n      level -= 1;\n      current_paren += chr;\n      if (level == 0) {\n        all_levels.push_back(max_level);\n        current_paren = \"\";\n        max_level = 0;\n      }\n    }\n  }\n  return all_levels;\n}", "task_id": "HEP/6", "tests": "bool issame(std::vector<int> a, std::vector<int> b) {\n  if (a.size() != b.size()) return false;\n  for (int i = 0; i < a.size(); i++) {\n    if (a[i] != b[i]) return false;\n  }\n  return true;\n}\n\n#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                  \\\n  do {                                                                        \\\n    ASSERT(issame(parse_nested_parens(_type_{\"(()()) ((())) () ((())()())\"}), \\\n                  {2, 3, 1, 3}));                                             \\\n    ASSERT(issame(parse_nested_parens(_type_{\"() (()) ((())) (((())))\"}),     \\\n                  {1, 2, 3, 4}));                                             \\\n    ASSERT(issame(parse_nested_parens(_type_{\"(()(())((())))\"}), {4}));       \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(std::string);\n  TEST_ON_TYPE(std::string_view);\n}"}
-{"base_canonical_solution": "template <typename T>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "base_prompt": "Make the following function generic for the parameter `string` and return value.", "concepts_canonical_solution": "template <typename T>\n  requires std::same_as<typename T::value_type, std::string>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that it accepts a sequenced container with value type of string.", "invalids": "int main() { filter_by_substring(std::vector<int>{}, \"hello\"); }", "sfinae_canonical_solution": "template <typename T,\n          std::enable_if_t<std::is_same_v<typename T::value_type, std::string>,\n                           int> = 0>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that it accepts a sequenced container with value type of string.", "starter_code": "std::vector<string> filter_by_substring(std::vector<string> strings,\n                                        std::string substring) {\n  std::vector<string> out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "task_id": "HEP/7", "tests": "template <typename T>\nbool issame(T a, T b) {\n  if (a.size() != b.size()) return false;\n  for (int i = 0; i < a.size(); i++) {\n    if (a[i] != b[i]) return false;\n  }\n  return true;\n}\n\n#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                   \\\n  do {                                                                         \\\n    ASSERT(issame(filter_by_substring(_type_{}, \"john\"), _type_{}));           \\\n    ASSERT(issame(                                                             \\\n        filter_by_substring(                                                   \\\n            _type_{\"xxx\", \"asd\", \"xxy\", \"john doe\", \"xxxAAA\", \"xxx\"}, \"xxx\"),  \\\n        _type_{\"xxx\", \"xxxAAA\", \"xxx\"}));                                      \\\n    ASSERT(issame(filter_by_substring(_type_{\"xxx\", \"asd\", \"aaaxxy\",           \\\n                                             \"john doe\", \"xxxAAA\", \"xxx\"},     \\\n                                      \"xx\"),                                   \\\n                  _type_{\"xxx\", \"aaaxxy\", \"xxxAAA\", \"xxx\"}));                  \\\n    ASSERT(issame(filter_by_substring(                                         \\\n                      _type_{\"grunt\", \"trumpet\", \"prune\", \"gruesome\"}, \"run\"), \\\n                  _type_{\"grunt\", \"prune\"}));                                  \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(std::vector<std::string>);\n  TEST_ON_TYPE(std::deque<std::string>);\n}\n"}
+{"base_canonical_solution": "template <typename T>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "base_prompt": "Make the following function generic for the parameter `string` and return value.", "concepts_canonical_solution": "template <typename T>\n  requires std::same_as<typename T::value_type, std::string>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that it accepts a sequenced container with value type of string.", "invalids": "int main() { filter_by_substring(std::vector<int>{}, \"hello\"); }", "sfinae_canonical_solution": "template <typename T,\n          std::enable_if_t<std::is_same_v<typename T::value_type, std::string>,\n                           int> = 0>\nT filter_by_substring(T strings, std::string substring) {\n  T out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that it accepts a sequenced container with value type of string.", "starter_code": "std::vector<string> filter_by_substring(std::vector<string> strings,\n                                        std::string substring) {\n  std::vector<string> out;\n  for (int i = 0; i < strings.size(); i++) {\n    if (strings[i].find(substring) != strings[i].npos)\n      out.push_back(strings[i]);\n  }\n  return out;\n}", "task_id": "HEP/7", "tests": "template <typename T>\nbool issame(T a, T b) {\n  if (a.size() != b.size()) return false;\n  for (int i = 0; i < a.size(); i++) {\n    if (a[i] != b[i]) return false;\n  }\n  return true;\n}\n\n#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                   \\\n  do {                                                                         \\\n    ASSERT(issame(filter_by_substring(_type_{}, \"john\"), _type_{}));           \\\n    ASSERT(issame(                                                             \\\n        filter_by_substring(                                                   \\\n            _type_{\"xxx\", \"asd\", \"xxy\", \"john doe\", \"xxxAAA\", \"xxx\"}, \"xxx\"),  \\\n        _type_{\"xxx\", \"xxxAAA\", \"xxx\"}));                                      \\\n    ASSERT(issame(filter_by_substring(_type_{\"xxx\", \"asd\", \"aaaxxy\",           \\\n                                             \"john doe\", \"xxxAAA\", \"xxx\"},     \\\n                                      \"xx\"),                                   \\\n                  _type_{\"xxx\", \"aaaxxy\", \"xxxAAA\", \"xxx\"}));                  \\\n    ASSERT(issame(filter_by_substring(                                         \\\n                      _type_{\"grunt\", \"trumpet\", \"prune\", \"gruesome\"}, \"run\"), \\\n                  _type_{\"grunt\", \"prune\"}));                                  \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(std::vector<std::string>);\n  TEST_ON_TYPE(std::deque<std::string>);\n}\n"}
+{"base_canonical_solution": "template <typename T>\nstd::pair<T, T> sum_product(std::vector<T> numbers) {\n  T sum = 0, product = 1;\n  for (int i = 0; i < numbers.size(); i++) {\n    sum += numbers[i];\n    product *= numbers[i];\n  }\n  return {sum, product};\n}", "base_prompt": "Make the following function generic for the value types of the parameter and return pair.", "concepts_canonical_solution": "template <typename T>\n  requires std::integral<T> || std::floating_point<T>\nstd::pair<T, T> sum_product(std::vector<T> numbers) {\n  T sum = 0, product = 1;\n  for (int i = 0; i < numbers.size(); i++) {\n    sum += numbers[i];\n    product *= numbers[i];\n  }\n  return {sum, product};\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that the generic parameter is a number type.", "invalids": "int main() { sum_product(std::vector<int*>{}); }", "sfinae_canonical_solution": "template <typename T,\n          std::enable_if_t<std::disjunction_v<std::is_integral<T>,\n                                              std::is_floating_point<T>>,\n                           int> = 0>\nstd::pair<T, T> sum_product(std::vector<T> numbers) {\n  T sum = 0, product = 1;\n  for (int i = 0; i < numbers.size(); i++) {\n    sum += numbers[i];\n    product *= numbers[i];\n  }\n  return {sum, product};\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that the generic parameter is a number type.", "starter_code": "std::pair<int, int> sum_product(std::vector<int> numbers) {\n  int sum = 0, product = 1;\n  for (int i = 0; i < numbers.size(); i++) {\n    sum += numbers[i];\n    product *= numbers[i];\n  }\n  return {sum, product};\n}", "task_id": "HEP/8", "tests": "#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                   \\\n  do {                                                                         \\\n    ASSERT(sum_product(std::vector<_type_>{}) == std::pair<_type_>{0, 1});     \\\n    ASSERT(sum_product(std::vector<_type_>{1, 1, 1}) ==                        \\\n           std::pair<_type_>{3, 1});                                           \\\n    ASSERT(sum_product(std::vector<_type_>{100, 0}) ==                         \\\n           std::pair<_type_>{100, 0});                                         \\\n    ASSERT(sum_product(std::vector<_type_>{3, 5, 7}) ==                        \\\n           std::pair<_type_>{3 + 5 + 7, 3 * 5 * 7});                           \\\n    ASSERT(sum_product(std::vector<_type_>{10}) == std::pair<_type_>{10, 10}); \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(float);\n  TEST_ON_TYPE(int);\n  TEST_ON_TYPE(long);\n}\n"}
+{"base_canonical_solution": "template <typename T>\nstd::vector<T> rolling_max(std::vector<T> numbers) {\n  std::vector<T> out;\n  T max = 0;\n  for (int i = 0; i < numbers.size(); i++) {\n    if (numbers[i] > max) max = numbers[i];\n    out.push_back(max);\n  }\n  return out;\n}", "base_prompt": "Make the following function generic for value type of the parameter and return type.", "concepts_canonical_solution": "template <typename T>\n  requires requires(const T& lhs, const T& rhs) {\n    { lhs > rhs } -> std::convertible_to<bool>;\n  }\nstd::vector<T> rolling_max(std::vector<T> numbers) {\n  std::vector<T> out;\n  T max = 0;\n  for (int i = 0; i < numbers.size(); i++) {\n    if (numbers[i] > max) max = numbers[i];\n    out.push_back(max);\n  }\n  return out;\n}", "concepts_prompt": "Constrain the generic code using C++20 Concepts so that the generic parameter must be comparable to another of its type with greater than operator.", "invalids": "int main() {\n  struct S {};\n  rolling_max(std::vector<S>{});\n}", "sfinae_canonical_solution": "template <\n    typename T,\n    std::enable_if_t<std::is_convertible_v<decltype(std::declval<const T &>() >\n                                                    std::declval<const T &>()),\n                                           bool>,\n                     int> = 0>\nstd::vector<T> rolling_max(std::vector<T> numbers) {\n  std::vector<T> out;\n  T max = 0;\n  for (int i = 0; i < numbers.size(); i++) {\n    if (numbers[i] > max) max = numbers[i];\n    out.push_back(max);\n  }\n  return out;\n}", "sfinae_prompt": "Constrain the generic code using C++17 SFINAE so that the generic parameter must be comparable to another of its type with greater than operator.", "starter_code": "std::vector<int> rolling_max(std::vector<int> numbers) {\n  std::vector<int> out;\n  int max = 0;\n  for (int i = 0; i < numbers.size(); i++) {\n    if (numbers[i] > max) max = numbers[i];\n    out.push_back(max);\n  }\n  return out;\n}", "task_id": "HEP/9", "tests": "\ntemplate <typename T>\nbool issame(std::vector<T> a, std::vector<T> b) {\n  if (a.size() != b.size()) return false;\n  for (int i = 0; i < a.size(); i++) {\n    if (a[i] != b[i]) return false;\n  }\n  return true;\n}\n\n#define ASSERT(...)       \\\n  do {                    \\\n    if (!(__VA_ARGS__)) { \\\n      std::exit(-1);      \\\n    }                     \\\n  } while (false)\n\n#define TEST_ON_TYPE(_type_)                                                   \\\n  do {                                                                         \\\n    ASSERT(issame(rolling_max(std::vector<_type_>{}), std::vector<_type_>{})); \\\n    ASSERT(issame(rolling_max(std::vector<_type_>{1, 2, 3, 4}),                \\\n                  std::vector<_type_>{1, 2, 3, 4}));                           \\\n    ASSERT(issame(rolling_max(std::vector<_type_>{4, 3, 2, 1}),                \\\n                  std::vector<_type_>{4, 4, 4, 4}));                           \\\n    ASSERT(issame(rolling_max(std::vector<_type_>{3, 2, 3, 100, 3}),           \\\n                  std::vector<_type_>{3, 3, 3, 100, 100}));                    \\\n  } while (false)\n\nint main() {\n  TEST_ON_TYPE(int);\n  TEST_ON_TYPE(float);\n\n  ASSERT(issame(rolling_max(std::vector<std::string>{}),\n                std::vector<std::string>{}));\n  ASSERT(issame(rolling_max(std::vector<std::string>{\"1\", \"2\", \"3\", \"4\"}),\n                std::vector<std::string>{\"1\", \"2\", \"3\", \"4\"}));\n  ASSERT(issame(rolling_max(std::vector<std::string>{\"4\", \"3\", \"2\", \"1\"}),\n                std::vector<std::string>{\"4\", \"4\", \"4\", \"4\"}));\n  ASSERT(issame(rolling_max(std::vector<std::string>{\"3\", \"2\", \"3\", \"5\", \"3\"}),\n                std::vector<std::string>{\"3\", \"3\", \"3\", \"5\", \"5\"}));\n}"}