2019-01-30 15:17:56 +08:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2012 William Swanson
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person
|
|
|
|
* obtaining a copy of this software and associated documentation
|
|
|
|
* files (the "Software"), to deal in the Software without
|
|
|
|
* restriction, including without limitation the rights to use, copy,
|
|
|
|
* modify, merge, publish, distribute, sublicense, and/or sell copies
|
|
|
|
* of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be
|
|
|
|
* included in all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
|
|
|
|
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
|
|
|
|
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*
|
|
|
|
* Except as contained in this notice, the names of the authors or
|
|
|
|
* their institutions shall not be used in advertising or otherwise to
|
|
|
|
* promote the sale, use or other dealings in this Software without
|
|
|
|
* prior written authorization from the authors.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Implements the higher-order Map function in the C Pre-Processor.
|
|
|
|
*
|
|
|
|
* Explanations available in [1,2,3].
|
|
|
|
* Original source from [1].
|
|
|
|
*
|
|
|
|
* [1] https://github.com/swansontec/map-macro SHA:383c38e9
|
|
|
|
* [2] http://jhnet.co.uk/articles/cpp_magic#turning-recursion-into-an-iterator
|
|
|
|
* [3] https://en.wikipedia.org/wiki/Map_(higher-order_function)
|
|
|
|
*/
|
|
|
|
|
2019-01-30 15:19:24 +08:00
|
|
|
#ifndef EXT_DEBUG_CTF_CTF_MAP_H
|
|
|
|
#define EXT_DEBUG_CTF_CTF_MAP_H
|
2019-01-30 15:17:56 +08:00
|
|
|
|
|
|
|
#define EVAL0(...) __VA_ARGS__
|
|
|
|
#define EVAL1(...) EVAL0(EVAL0(EVAL0(__VA_ARGS__)))
|
|
|
|
#define EVAL2(...) EVAL1(EVAL1(EVAL1(__VA_ARGS__)))
|
|
|
|
#define EVAL3(...) EVAL2(EVAL2(EVAL2(__VA_ARGS__)))
|
|
|
|
#define EVAL4(...) EVAL3(EVAL3(EVAL3(__VA_ARGS__)))
|
|
|
|
#define EVAL(...) EVAL4(EVAL4(EVAL4(__VA_ARGS__)))
|
|
|
|
|
|
|
|
#define MAP_END(...)
|
|
|
|
#define MAP_OUT
|
|
|
|
#define MAP_COMMA ,
|
|
|
|
|
|
|
|
#define MAP_GET_END2() 0, MAP_END
|
|
|
|
#define MAP_GET_END1(...) MAP_GET_END2
|
|
|
|
#define MAP_GET_END(...) MAP_GET_END1
|
|
|
|
#define MAP_NEXT0(test, next, ...) next MAP_OUT
|
|
|
|
#define MAP_NEXT1(test, next) MAP_NEXT0(test, next, 0)
|
|
|
|
#define MAP_NEXT(test, next) MAP_NEXT1(MAP_GET_END test, next)
|
|
|
|
|
|
|
|
#define MAP0(f, x, peek, ...) f(x) MAP_NEXT(peek, MAP1)(f, peek, __VA_ARGS__)
|
|
|
|
#define MAP1(f, x, peek, ...) f(x) MAP_NEXT(peek, MAP0)(f, peek, __VA_ARGS__)
|
|
|
|
|
|
|
|
#define MAP_LIST_NEXT1(test, next) MAP_NEXT0(test, MAP_COMMA next, 0)
|
|
|
|
#define MAP_LIST_NEXT(test, next) MAP_LIST_NEXT1(MAP_GET_END test, next)
|
|
|
|
|
|
|
|
#define MAP_LIST0(f, x, peek, ...) f(x) MAP_LIST_NEXT(peek, MAP_LIST1)(f, peek, __VA_ARGS__)
|
|
|
|
#define MAP_LIST1(f, x, peek, ...) f(x) MAP_LIST_NEXT(peek, MAP_LIST0)(f, peek, __VA_ARGS__)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Applies the function macro `f` to each of the remaining parameters.
|
|
|
|
*/
|
|
|
|
#define MAP(f, ...) EVAL(MAP1(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0))
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Applies the function macro `f` to each of the remaining parameters and
|
|
|
|
* inserts commas between the results.
|
|
|
|
*/
|
|
|
|
#define MAP_LIST(f, ...) EVAL(MAP_LIST1(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0))
|
|
|
|
|
2019-01-30 15:19:24 +08:00
|
|
|
#endif /* EXT_DEBUG_CTF_CTF_MAP_H */
|