mirror of
https://github.com/BlackMATov/kari.hpp.git
synced 2025-12-14 21:21:29 +07:00
separate core and ext functional
This commit is contained in:
BlackMATov
@@ -252,221 +252,5 @@ namespace kari
|
||||
curryN<N + Args>(std::forward<F>(f))(std::forward<A>(a), std::forward<As>(as)...))
|
||||
}
|
||||
|
||||
namespace kari
|
||||
{
|
||||
//
|
||||
// fid
|
||||
//
|
||||
|
||||
struct fid_t {
|
||||
template < typename A >
|
||||
constexpr auto operator()(A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<A>(a))
|
||||
};
|
||||
inline constexpr auto fid = curry(fid_t{});
|
||||
|
||||
//
|
||||
// fconst
|
||||
//
|
||||
|
||||
struct fconst_t {
|
||||
template < typename A, typename B >
|
||||
constexpr auto operator()(A&& a, B&&) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<A>(a))
|
||||
};
|
||||
inline constexpr auto fconst = curry(fconst_t{});
|
||||
|
||||
//
|
||||
// fflip
|
||||
//
|
||||
|
||||
struct fflip_t {
|
||||
template < typename F, typename A, typename B >
|
||||
constexpr auto operator()(F&& f, A&& a, B&& b) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
std::forward<B>(b),
|
||||
std::forward<A>(a)))
|
||||
};
|
||||
inline constexpr auto fflip = curry(fflip_t{});
|
||||
|
||||
//
|
||||
// fpipe
|
||||
//
|
||||
|
||||
struct fpipe_t {
|
||||
template < typename G, typename F, typename A >
|
||||
constexpr auto operator()(G&& g, F&& f, A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
curry(
|
||||
std::forward<G>(g),
|
||||
std::forward<A>(a))))
|
||||
};
|
||||
inline constexpr auto fpipe = curry(fpipe_t{});
|
||||
|
||||
//
|
||||
// fcompose
|
||||
//
|
||||
|
||||
struct fcompose_t {
|
||||
template < typename G, typename F, typename A >
|
||||
constexpr auto operator()(G&& g, F&& f, A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<G>(g),
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
std::forward<A>(a))))
|
||||
};
|
||||
inline constexpr auto fcompose = curry(fcompose_t{});
|
||||
|
||||
//
|
||||
// fpipe operators
|
||||
//
|
||||
|
||||
template
|
||||
<
|
||||
typename G, typename F,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<G>>, int> = 0,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(G&& g, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
fpipe(
|
||||
std::forward<G>(g),
|
||||
std::forward<F>(f)))
|
||||
|
||||
template
|
||||
<
|
||||
typename F, typename A,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(F&& f, A&& a)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
template
|
||||
<
|
||||
typename A, typename F,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(A&& a, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
//
|
||||
// fcompose operators
|
||||
//
|
||||
|
||||
template
|
||||
<
|
||||
typename G, typename F,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<G>>, int> = 0,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(G&& g, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
fcompose(
|
||||
std::forward<G>(g),
|
||||
std::forward<F>(f)))
|
||||
|
||||
template
|
||||
<
|
||||
typename F, typename A,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(F&& f, A&& a)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
template
|
||||
<
|
||||
typename A, typename F,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(A&& a, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
}
|
||||
|
||||
namespace kari
|
||||
{
|
||||
namespace underscore
|
||||
{
|
||||
struct us_t {};
|
||||
inline constexpr us_t _{};
|
||||
|
||||
//
|
||||
// is_underscore, is_underscore_v
|
||||
//
|
||||
|
||||
template < typename T >
|
||||
struct is_underscore
|
||||
: std::bool_constant<std::is_same_v<us_t, std::remove_cv_t<T>>> {};
|
||||
|
||||
template < typename T >
|
||||
inline constexpr bool is_underscore_v = is_underscore<T>::value;
|
||||
|
||||
//
|
||||
// unary operators
|
||||
//
|
||||
|
||||
#define KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(op, func) \
|
||||
constexpr auto operator op (us_t) KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func))
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(-, std::negate<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(~, std::bit_not<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(!, std::logical_not<>())
|
||||
#undef KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP
|
||||
|
||||
//
|
||||
// binary operators
|
||||
//
|
||||
|
||||
#define KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(op, func) \
|
||||
constexpr auto operator op (us_t, us_t) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func)) \
|
||||
\
|
||||
template < typename A, typename std::enable_if_t<!is_underscore_v<std::decay_t<A>>, int> = 0 > \
|
||||
constexpr auto operator op (A&& a, us_t) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func, std::forward<A>(a))) \
|
||||
\
|
||||
template < typename B, typename std::enable_if_t<!is_underscore_v<std::decay_t<B>>, int> = 0 > \
|
||||
constexpr auto operator op (us_t, B&& b) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(fflip(func, std::forward<B>(b)))
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(+ , std::plus<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(- , std::minus<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(* , std::multiplies<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(/ , std::divides<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(% , std::modulus<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(< , std::less<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(> , std::greater<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(<=, std::less_equal<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(>=, std::greater_equal<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(==, std::equal_to<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(!=, std::not_equal_to<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(| , std::bit_or<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(& , std::bit_and<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(^ , std::bit_xor<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(||, std::logical_or<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(&&, std::logical_and<>())
|
||||
#undef KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP
|
||||
}
|
||||
}
|
||||
|
||||
#undef KARI_HPP_NOEXCEPT_RETURN
|
||||
#undef KARI_HPP_NOEXCEPT_DECLTYPE_RETURN
|
||||
|
||||
234
headers/kari.hpp/kari_ext.hpp
Normal file
234
headers/kari.hpp/kari_ext.hpp
Normal file
@@ -0,0 +1,234 @@
|
||||
/*******************************************************************************
|
||||
* This file is part of the "https://github.com/BlackMATov/kari.hpp"
|
||||
* For conditions of distribution and use, see copyright notice in LICENSE.md
|
||||
* Copyright (C) 2017-2020, by Matvey Cherevko (blackmatov@gmail.com)
|
||||
******************************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include "kari.hpp"
|
||||
|
||||
#define KARI_HPP_NOEXCEPT_RETURN(...) \
|
||||
noexcept(noexcept(__VA_ARGS__)) { return __VA_ARGS__; }
|
||||
|
||||
#define KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(...) \
|
||||
noexcept(noexcept(__VA_ARGS__)) -> decltype (__VA_ARGS__) { return __VA_ARGS__; }
|
||||
|
||||
namespace kari
|
||||
{
|
||||
//
|
||||
// fid
|
||||
//
|
||||
|
||||
struct fid_t {
|
||||
template < typename A >
|
||||
constexpr auto operator()(A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<A>(a))
|
||||
};
|
||||
inline constexpr auto fid = curry(fid_t{});
|
||||
|
||||
//
|
||||
// fconst
|
||||
//
|
||||
|
||||
struct fconst_t {
|
||||
template < typename A, typename B >
|
||||
constexpr auto operator()(A&& a, B&&) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<A>(a))
|
||||
};
|
||||
inline constexpr auto fconst = curry(fconst_t{});
|
||||
|
||||
//
|
||||
// fflip
|
||||
//
|
||||
|
||||
struct fflip_t {
|
||||
template < typename F, typename A, typename B >
|
||||
constexpr auto operator()(F&& f, A&& a, B&& b) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
std::forward<B>(b),
|
||||
std::forward<A>(a)))
|
||||
};
|
||||
inline constexpr auto fflip = curry(fflip_t{});
|
||||
|
||||
//
|
||||
// fpipe
|
||||
//
|
||||
|
||||
struct fpipe_t {
|
||||
template < typename G, typename F, typename A >
|
||||
constexpr auto operator()(G&& g, F&& f, A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
curry(
|
||||
std::forward<G>(g),
|
||||
std::forward<A>(a))))
|
||||
};
|
||||
inline constexpr auto fpipe = curry(fpipe_t{});
|
||||
|
||||
//
|
||||
// fcompose
|
||||
//
|
||||
|
||||
struct fcompose_t {
|
||||
template < typename G, typename F, typename A >
|
||||
constexpr auto operator()(G&& g, F&& f, A&& a) const
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
curry(
|
||||
std::forward<G>(g),
|
||||
curry(
|
||||
std::forward<F>(f),
|
||||
std::forward<A>(a))))
|
||||
};
|
||||
inline constexpr auto fcompose = curry(fcompose_t{});
|
||||
|
||||
//
|
||||
// fpipe operators
|
||||
//
|
||||
|
||||
template
|
||||
<
|
||||
typename G, typename F,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<G>>, int> = 0,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(G&& g, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
fpipe(
|
||||
std::forward<G>(g),
|
||||
std::forward<F>(f)))
|
||||
|
||||
template
|
||||
<
|
||||
typename F, typename A,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(F&& f, A&& a)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
template
|
||||
<
|
||||
typename A, typename F,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator|(A&& a, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
//
|
||||
// fcompose operators
|
||||
//
|
||||
|
||||
template
|
||||
<
|
||||
typename G, typename F,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<G>>, int> = 0,
|
||||
typename std::enable_if_t<is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(G&& g, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
fcompose(
|
||||
std::forward<G>(g),
|
||||
std::forward<F>(f)))
|
||||
|
||||
template
|
||||
<
|
||||
typename F, typename A,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(F&& f, A&& a)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
|
||||
template
|
||||
<
|
||||
typename A, typename F,
|
||||
typename std::enable_if_t<!is_curried_v<std::decay_t<A>>, int> = 0,
|
||||
typename std::enable_if_t< is_curried_v<std::decay_t<F>>, int> = 0
|
||||
>
|
||||
constexpr auto operator*(A&& a, F&& f)
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(
|
||||
std::forward<F>(f)(std::forward<A>(a)))
|
||||
}
|
||||
|
||||
namespace kari
|
||||
{
|
||||
namespace underscore
|
||||
{
|
||||
struct us_t {};
|
||||
inline constexpr us_t _{};
|
||||
|
||||
//
|
||||
// is_underscore, is_underscore_v
|
||||
//
|
||||
|
||||
template < typename T >
|
||||
struct is_underscore
|
||||
: std::bool_constant<std::is_same_v<us_t, std::remove_cv_t<T>>> {};
|
||||
|
||||
template < typename T >
|
||||
inline constexpr bool is_underscore_v = is_underscore<T>::value;
|
||||
|
||||
//
|
||||
// unary operators
|
||||
//
|
||||
|
||||
#define KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(op, func) \
|
||||
constexpr auto operator op (us_t) KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func))
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(-, std::negate<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(~, std::bit_not<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP(!, std::logical_not<>())
|
||||
#undef KARI_HPP_DEFINE_UNDERSCORE_UNARY_OP
|
||||
|
||||
//
|
||||
// binary operators
|
||||
//
|
||||
|
||||
#define KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(op, func) \
|
||||
constexpr auto operator op (us_t, us_t) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func)) \
|
||||
\
|
||||
template < typename A, typename std::enable_if_t<!is_underscore_v<std::decay_t<A>>, int> = 0 > \
|
||||
constexpr auto operator op (A&& a, us_t) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(curry(func, std::forward<A>(a))) \
|
||||
\
|
||||
template < typename B, typename std::enable_if_t<!is_underscore_v<std::decay_t<B>>, int> = 0 > \
|
||||
constexpr auto operator op (us_t, B&& b) \
|
||||
KARI_HPP_NOEXCEPT_DECLTYPE_RETURN(fflip(func, std::forward<B>(b)))
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(+ , std::plus<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(- , std::minus<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(* , std::multiplies<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(/ , std::divides<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(% , std::modulus<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(< , std::less<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(> , std::greater<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(<=, std::less_equal<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(>=, std::greater_equal<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(==, std::equal_to<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(!=, std::not_equal_to<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(| , std::bit_or<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(& , std::bit_and<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(^ , std::bit_xor<>())
|
||||
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(||, std::logical_or<>())
|
||||
KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP(&&, std::logical_and<>())
|
||||
#undef KARI_HPP_DEFINE_UNDERSCORE_BINARY_OP
|
||||
}
|
||||
}
|
||||
|
||||
#undef KARI_HPP_NOEXCEPT_RETURN
|
||||
#undef KARI_HPP_NOEXCEPT_DECLTYPE_RETURN
|
||||
50
untests/kari_ext_tests.cpp
Normal file
50
untests/kari_ext_tests.cpp
Normal file
@@ -0,0 +1,50 @@
|
||||
/*******************************************************************************
|
||||
* This file is part of the "https://github.com/BlackMATov/kari.hpp"
|
||||
* For conditions of distribution and use, see copyright notice in LICENSE.md
|
||||
* Copyright (C) 2017-2020, by Matvey Cherevko (blackmatov@gmail.com)
|
||||
******************************************************************************/
|
||||
|
||||
#include <kari.hpp/kari_ext.hpp>
|
||||
#include "doctest/doctest.hpp"
|
||||
|
||||
using namespace kari;
|
||||
|
||||
TEST_CASE("kari_feature") {
|
||||
SUBCASE("underscore") {
|
||||
using namespace kari::underscore;
|
||||
REQUIRE((-_)(40) == -40);
|
||||
|
||||
REQUIRE((_ + 40)(2) == 42);
|
||||
REQUIRE((_ - 2)(44) == 42);
|
||||
REQUIRE((_ * 21)(2) == 42);
|
||||
REQUIRE((_ / 2)(84) == 42);
|
||||
REQUIRE((_ % 100)(142) == 42);
|
||||
|
||||
REQUIRE((_ == 42)(42));
|
||||
REQUIRE((_ != 42)(40));
|
||||
REQUIRE_FALSE((_ == 42)(40));
|
||||
REQUIRE_FALSE((_ != 42)(42));
|
||||
|
||||
REQUIRE((40 + _)(2) == 42);
|
||||
REQUIRE((44 - _)(2) == 42);
|
||||
REQUIRE((21 * _)(2) == 42);
|
||||
REQUIRE((84 / _)(2) == 42);
|
||||
REQUIRE((142 % _)(100) == 42);
|
||||
|
||||
REQUIRE((42 == _)(42));
|
||||
REQUIRE((42 != _)(40));
|
||||
REQUIRE_FALSE((42 == _)(40));
|
||||
REQUIRE_FALSE((42 != _)(42));
|
||||
|
||||
REQUIRE((_ + _)(40,2) == 42);
|
||||
REQUIRE((_ - _)(44,2) == 42);
|
||||
REQUIRE((_ * _)(21,2) == 42);
|
||||
REQUIRE((_ / _)(84,2) == 42);
|
||||
REQUIRE((_ % _)(142,100) == 42);
|
||||
|
||||
REQUIRE((_ == _)(42,42));
|
||||
REQUIRE((_ != _)(42,40));
|
||||
REQUIRE_FALSE((_ == _)(42,40));
|
||||
REQUIRE_FALSE((_ != _)(42,42));
|
||||
}
|
||||
}
|
||||
@@ -195,43 +195,6 @@ namespace
|
||||
using namespace kari;
|
||||
|
||||
TEST_CASE("kari_feature") {
|
||||
SUBCASE("underscore") {
|
||||
using namespace kari::underscore;
|
||||
REQUIRE((-_)(40) == -40);
|
||||
|
||||
REQUIRE((_ + 40)(2) == 42);
|
||||
REQUIRE((_ - 2)(44) == 42);
|
||||
REQUIRE((_ * 21)(2) == 42);
|
||||
REQUIRE((_ / 2)(84) == 42);
|
||||
REQUIRE((_ % 100)(142) == 42);
|
||||
|
||||
REQUIRE((_ == 42)(42));
|
||||
REQUIRE((_ != 42)(40));
|
||||
REQUIRE_FALSE((_ == 42)(40));
|
||||
REQUIRE_FALSE((_ != 42)(42));
|
||||
|
||||
REQUIRE((40 + _)(2) == 42);
|
||||
REQUIRE((44 - _)(2) == 42);
|
||||
REQUIRE((21 * _)(2) == 42);
|
||||
REQUIRE((84 / _)(2) == 42);
|
||||
REQUIRE((142 % _)(100) == 42);
|
||||
|
||||
REQUIRE((42 == _)(42));
|
||||
REQUIRE((42 != _)(40));
|
||||
REQUIRE_FALSE((42 == _)(40));
|
||||
REQUIRE_FALSE((42 != _)(42));
|
||||
|
||||
REQUIRE((_ + _)(40,2) == 42);
|
||||
REQUIRE((_ - _)(44,2) == 42);
|
||||
REQUIRE((_ * _)(21,2) == 42);
|
||||
REQUIRE((_ / _)(84,2) == 42);
|
||||
REQUIRE((_ % _)(142,100) == 42);
|
||||
|
||||
REQUIRE((_ == _)(42,42));
|
||||
REQUIRE((_ != _)(42,40));
|
||||
REQUIRE_FALSE((_ == _)(42,40));
|
||||
REQUIRE_FALSE((_ != _)(42,42));
|
||||
}
|
||||
SUBCASE("ref_functor") {
|
||||
REQUIRE(curry(minus3_gf())(1,2,3) == -4);
|
||||
{
|
||||
@@ -624,58 +587,6 @@ TEST_CASE("kari") {
|
||||
}
|
||||
}
|
||||
|
||||
TEST_CASE("kari_helpers") {
|
||||
SUBCASE("fid") {
|
||||
REQUIRE(fid(box(10)).v() == 10);
|
||||
}
|
||||
SUBCASE("fconst") {
|
||||
REQUIRE(fconst(box(10), 20).v() == 10);
|
||||
{
|
||||
auto b10 = fconst(box(10));
|
||||
REQUIRE(b10(20).v() == 10);
|
||||
REQUIRE(std::move(b10)(30).v() == 10);
|
||||
REQUIRE(b10(20).v() == 100500);
|
||||
}
|
||||
}
|
||||
SUBCASE("fflip") {
|
||||
REQUIRE(fflip(curry(std::minus<>()))(10, 20) == 10);
|
||||
REQUIRE(fflip(minus3_gl)(10,20,50) == -40);
|
||||
}
|
||||
SUBCASE("fpipe") {
|
||||
using namespace kari::underscore;
|
||||
REQUIRE(fpipe(_+2, _*2, 4) == 12);
|
||||
REQUIRE(((_+2) | (_*2) | 4) == 12);
|
||||
REQUIRE((4 | (_+2) | (_*2)) == 12);
|
||||
}
|
||||
SUBCASE("fcompose") {
|
||||
using namespace kari::underscore;
|
||||
REQUIRE(fcompose(_+2, _*2, 4) == 10);
|
||||
REQUIRE((_+2) * (_*2) * 4 == 10);
|
||||
REQUIRE(4 * (_+2) * (_*2) == 12);
|
||||
{
|
||||
const auto s3 = [](int v1, int v2, int v3){
|
||||
return v1 + v2 + v3;
|
||||
};
|
||||
const auto c = curry(s3) * (_*2) * 10 * 20 * 30;
|
||||
REQUIRE(c == 70);
|
||||
}
|
||||
{
|
||||
// (. (+2)) (*2) $ 10 == 24
|
||||
int i = fflip(fcompose)(_+2, _*2, 10);
|
||||
int j = (_*(_+2))(_*2)(10);
|
||||
REQUIRE(i == 24);
|
||||
REQUIRE(j == 24);
|
||||
}
|
||||
{
|
||||
// ((+2) .) (*2) $ 10 == 24
|
||||
int i = fcompose(_+2)(_*2, 10);
|
||||
int j = ((_+2) * _)(_*2)(10);
|
||||
REQUIRE(i == 22);
|
||||
REQUIRE(j == 22);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
namespace kari_regression {
|
||||
namespace change_type_after_applying {
|
||||
template < typename C >
|
||||
|
||||
Reference in New Issue
Block a user