thesis version
This commit is contained in:
commit
08d655ad70
1
.gitignore
vendored
Normal file
1
.gitignore
vendored
Normal file
@ -0,0 +1 @@
|
|||||||
|
build/
|
||||||
187
CMakeLists.txt
Normal file
187
CMakeLists.txt
Normal file
@ -0,0 +1,187 @@
|
|||||||
|
cmake_minimum_required(VERSION 3.0)
|
||||||
|
get_filename_component(project_name ${CMAKE_CURRENT_SOURCE_DIR} NAME)
|
||||||
|
project(${project_name})
|
||||||
|
|
||||||
|
set(EXTENSION "cpp")
|
||||||
|
|
||||||
|
set(CMAKE_C_STANDARD 99)
|
||||||
|
set(CMAKE_CXX_STANDARD 14)
|
||||||
|
|
||||||
|
set(GEN_BINARY OFF)
|
||||||
|
set(GEN_LIBRARY OFF)
|
||||||
|
set(LIB_TYPE STATIC) # NONE, STATIC, SHARED, MODULE
|
||||||
|
set(LIBS_TYPE NONE)
|
||||||
|
|
||||||
|
set(FLAGS_ANY "-Wall -Wextra -Winline")
|
||||||
|
set(FLAGS_DEBUG "-DDEBUG -Og -pg")
|
||||||
|
set(FLAGS_RELEASE "-DNDEBUG -O2")
|
||||||
|
|
||||||
|
set(SRCDIRS src)
|
||||||
|
set(LIBSDIRS src)
|
||||||
|
set(TESTSDIRS tests)
|
||||||
|
set(EXAMPLESDIRS )
|
||||||
|
set(MANDIRS )
|
||||||
|
|
||||||
|
set(INCLUDE_DIRS inc)
|
||||||
|
set(LIBRARIES "")
|
||||||
|
|
||||||
|
set(USER_LIBRARIES "")
|
||||||
|
|
||||||
|
set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
|
||||||
|
|
||||||
|
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${FLAGS_ANY}")
|
||||||
|
set(CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS_DEBUG} ${FLAGS_ANY} ${FLAGS_DEBUG}")
|
||||||
|
set(CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS_RELEASE} ${FLAGS_ANY} ${FLAGS_RELEASE}")
|
||||||
|
|
||||||
|
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${FLAGS_ANY}")
|
||||||
|
set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} ${FLAGS_ANY} ${FLAGS_DEBUG}")
|
||||||
|
set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} ${FLAGS_ANY} ${FLAGS_RELEASE}")
|
||||||
|
|
||||||
|
## Libraries
|
||||||
|
if(NOT ${LIB_TYPE} MATCHES "^NONE$")
|
||||||
|
# Project library
|
||||||
|
if(GEN_LIBRARY)
|
||||||
|
set(lib_src "")
|
||||||
|
foreach(srcdir ${SRCDIRS})
|
||||||
|
set(srcpath ${CMAKE_CURRENT_SOURCE_DIR}/${srcdir})
|
||||||
|
file(GLOB_RECURSE tmpsrc ${srcpath}/*.${EXTENSION})
|
||||||
|
list(APPEND lib_src ${tmpsrc})
|
||||||
|
endforeach()
|
||||||
|
|
||||||
|
set(lib ${PROJECT_NAME})
|
||||||
|
if(lib_src)
|
||||||
|
message(STATUS "+ Library: ${lib}")
|
||||||
|
add_library(${lib} ${LIB_TYPE} ${lib_src})
|
||||||
|
target_include_directories(${lib} PUBLIC ${INCLUDE_DIRS})
|
||||||
|
target_link_libraries(${lib} ${LIBRARIES})
|
||||||
|
list(APPEND USER_LIBRARIES ${lib})
|
||||||
|
else()
|
||||||
|
message(WARNING "! Library ${lib}: no sources")
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
## Other libraries
|
||||||
|
if(NOT ${LIBS_TYPE} MATCHES "^NONE$")
|
||||||
|
foreach(libsdir ${LIBSDIRS})
|
||||||
|
set(libspath ${CMAKE_CURRENT_SOURCE_DIR}/${libsdir})
|
||||||
|
file(GLOB libs RELATIVE ${libspath} ${libspath}/*)
|
||||||
|
if(libs)
|
||||||
|
foreach(child ${libs})
|
||||||
|
set(lib "")
|
||||||
|
if(IS_DIRECTORY ${libspath}/${child})
|
||||||
|
set(lib ${child})
|
||||||
|
file(GLOB_RECURSE lib_src ${libspath}/${child}/*.${EXTENSION})
|
||||||
|
else()
|
||||||
|
message(WARNING "! Ignoring file: ${libsdir}/${child}")
|
||||||
|
endif()
|
||||||
|
if(lib)
|
||||||
|
if(lib_src)
|
||||||
|
message(STATUS "+ Library: ${lib}")
|
||||||
|
add_library(${lib} ${LIBS_TYPE} ${lib_src})
|
||||||
|
target_include_directories(${lib} PUBLIC ${INCLUDE_DIRS})
|
||||||
|
target_link_libraries(${lib} ${LIBRARIES})
|
||||||
|
list(APPEND USER_LIBRARIES ${lib})
|
||||||
|
else()
|
||||||
|
message(WARNING "! Library ${lib}: no sources")
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
## Binary
|
||||||
|
if(GEN_BINARY)
|
||||||
|
set(src "")
|
||||||
|
foreach(srcdir ${SRCDIRS})
|
||||||
|
set(srcpath ${CMAKE_CURRENT_SOURCE_DIR}/${srcdir})
|
||||||
|
file(GLOB_RECURSE tmpsrc ${srcpath}/*.${EXTENSION})
|
||||||
|
list(APPEND src ${tmpsrc})
|
||||||
|
endforeach()
|
||||||
|
set(bin ${PROJECT_NAME})
|
||||||
|
if(src)
|
||||||
|
if(GEN_LIBRARY)
|
||||||
|
set(bin ${bin}.bin)
|
||||||
|
endif()
|
||||||
|
message(STATUS "+ Binary: ${bin}")
|
||||||
|
add_executable(${bin} ${src})
|
||||||
|
target_include_directories(${bin} PUBLIC ${LIBSDIRS} ${INCLUDE_DIRS})
|
||||||
|
target_link_libraries(${bin} ${LIBRARIES} ${USER_LIBRARIES})
|
||||||
|
else()
|
||||||
|
message(WARNING "! Binary ${bin}: no sources")
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
## Tests
|
||||||
|
foreach(testsdir ${TESTSDIRS})
|
||||||
|
set(testspath ${CMAKE_CURRENT_SOURCE_DIR}/${testsdir})
|
||||||
|
file(GLOB_RECURSE tests_src ${testspath}/*.${EXTENSION})
|
||||||
|
if(tests_src)
|
||||||
|
set(tests ${testsdir}_${PROJECT_NAME})
|
||||||
|
message(STATUS "+ Tests: ${tests}")
|
||||||
|
add_executable(${tests} ${tests_src})
|
||||||
|
target_compile_options(${tests} PUBLIC ${${testsdir}_FLAGS})
|
||||||
|
target_include_directories(${tests} PUBLIC ${SRCDIRS} ${LIBSDIRS} ${INCLUDE_DIRS} ${${testsdir}_INCLUDE_DIRS})
|
||||||
|
target_link_libraries(${tests} ${LIBRARIES} ${USER_LIBRARIES} ${${testsdir}_LIBRARIES})
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
|
|
||||||
|
## Examples
|
||||||
|
foreach(examplesdir ${EXAMPLESDIRS})
|
||||||
|
set(examplespath ${CMAKE_CURRENT_SOURCE_DIR}/${examplesdir})
|
||||||
|
file(GLOB examples RELATIVE ${examplespath} ${examplespath}/*)
|
||||||
|
if(examples)
|
||||||
|
foreach(child ${examples})
|
||||||
|
set(example_bin_filename "")
|
||||||
|
set(example "")
|
||||||
|
if(IS_DIRECTORY ${examplespath}/${child})
|
||||||
|
set(example_bin_filename ${child})
|
||||||
|
set(example ${examplesdir}_${example_bin_filename})
|
||||||
|
file(GLOB_RECURSE example_src ${examplespath}/${child}/*.${EXTENSION})
|
||||||
|
else()
|
||||||
|
get_filename_component(extension ${child} EXT)
|
||||||
|
if(${extension} MATCHES "^.${EXTENSION}$")
|
||||||
|
get_filename_component(example_name ${child} NAME_WE)
|
||||||
|
set(example_bin_filename ${example_name})
|
||||||
|
set(example ${examplesdir}_${example_bin_filename})
|
||||||
|
set(example_src ${examplespath}/${child})
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
if(example)
|
||||||
|
if(example_src)
|
||||||
|
message(STATUS "+ Example: ${examplesdir}/${example}")
|
||||||
|
add_executable(${example} ${example_src})
|
||||||
|
target_include_directories(${example} PUBLIC ${SRCDIRS} ${LIBSDIRS} ${INCLUDE_DIRS})
|
||||||
|
target_link_libraries(${example} ${LIBRARIES} ${USER_LIBRARIES})
|
||||||
|
set_target_properties(${example} PROPERTIES RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/${examplesdir})
|
||||||
|
set_target_properties(${example} PROPERTIES OUTPUT_NAME ${example_bin_filename})
|
||||||
|
else()
|
||||||
|
message(WARNING "! Example ${example}: no sources")
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
|
|
||||||
|
## Man pages
|
||||||
|
foreach(mandir ${MANDIRS})
|
||||||
|
set(MANPATH ${CMAKE_CURRENT_SOURCE_DIR}/${mandir})
|
||||||
|
set(MAN_OUTPATH ${CMAKE_BINARY_DIR}/deb/usr/share/man)
|
||||||
|
file(GLOB_RECURSE man_src RELATIVE ${MANPATH} ${MANPATH}/*)
|
||||||
|
if(man_src)
|
||||||
|
set(man_outfiles "")
|
||||||
|
foreach(man_file IN LISTS man_src)
|
||||||
|
set(man_outfile ${MAN_OUTPATH}/${man_file}.gz)
|
||||||
|
get_filename_component(man_outdir ${man_outfile} DIRECTORY)
|
||||||
|
list(APPEND man_outfiles ${man_outfile})
|
||||||
|
message(STATUS "+ manpage: ${man_file}")
|
||||||
|
add_custom_command(OUTPUT ${man_outfile}
|
||||||
|
COMMAND ${CMAKE_COMMAND} -E make_directory ${man_outdir}
|
||||||
|
COMMAND ${CMAKE_COMMAND} -E copy ${MANPATH}/${man_file} ${MAN_OUTPATH}/${man_file}
|
||||||
|
COMMAND gzip -f ${MAN_OUTPATH}/${man_file}
|
||||||
|
DEPENDS ${MANPATH}/${man_file})
|
||||||
|
endforeach()
|
||||||
|
add_custom_target(man ALL DEPENDS ${man_outfiles})
|
||||||
|
endif()
|
||||||
|
endforeach()
|
||||||
674
LICENSE
Normal file
674
LICENSE
Normal file
@ -0,0 +1,674 @@
|
|||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 29 June 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
the GNU General Public License is intended to guarantee your freedom to
|
||||||
|
share and change all versions of a program--to make sure it remains free
|
||||||
|
software for all its users. We, the Free Software Foundation, use the
|
||||||
|
GNU General Public License for most of our software; it applies also to
|
||||||
|
any other work released this way by its authors. You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
them if you wish), that you receive source code or can get it if you
|
||||||
|
want it, that you can change the software or use pieces of it in new
|
||||||
|
free programs, and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to prevent others from denying you
|
||||||
|
these rights or asking you to surrender the rights. Therefore, you have
|
||||||
|
certain responsibilities if you distribute copies of the software, or if
|
||||||
|
you modify it: responsibilities to respect the freedom of others.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must pass on to the recipients the same
|
||||||
|
freedoms that you received. You must make sure that they, too, receive
|
||||||
|
or can get the source code. And you must show them these terms so they
|
||||||
|
know their rights.
|
||||||
|
|
||||||
|
Developers that use the GNU GPL protect your rights with two steps:
|
||||||
|
(1) assert copyright on the software, and (2) offer you this License
|
||||||
|
giving you legal permission to copy, distribute and/or modify it.
|
||||||
|
|
||||||
|
For the developers' and authors' protection, the GPL clearly explains
|
||||||
|
that there is no warranty for this free software. For both users' and
|
||||||
|
authors' sake, the GPL requires that modified versions be marked as
|
||||||
|
changed, so that their problems will not be attributed erroneously to
|
||||||
|
authors of previous versions.
|
||||||
|
|
||||||
|
Some devices are designed to deny users access to install or run
|
||||||
|
modified versions of the software inside them, although the manufacturer
|
||||||
|
can do so. This is fundamentally incompatible with the aim of
|
||||||
|
protecting users' freedom to change the software. The systematic
|
||||||
|
pattern of such abuse occurs in the area of products for individuals to
|
||||||
|
use, which is precisely where it is most unacceptable. Therefore, we
|
||||||
|
have designed this version of the GPL to prohibit the practice for those
|
||||||
|
products. If such problems arise substantially in other domains, we
|
||||||
|
stand ready to extend this provision to those domains in future versions
|
||||||
|
of the GPL, as needed to protect the freedom of users.
|
||||||
|
|
||||||
|
Finally, every program is threatened constantly by software patents.
|
||||||
|
States should not allow patents to restrict development and use of
|
||||||
|
software on general-purpose computers, but in those that do, we wish to
|
||||||
|
avoid the special danger that patents applied to a free program could
|
||||||
|
make it effectively proprietary. To prevent this, the GPL assures that
|
||||||
|
patents cannot be used to render the program non-free.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
0. Definitions.
|
||||||
|
|
||||||
|
"This License" refers to version 3 of the GNU General Public License.
|
||||||
|
|
||||||
|
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||||
|
works, such as semiconductor masks.
|
||||||
|
|
||||||
|
"The Program" refers to any copyrightable work licensed under this
|
||||||
|
License. Each licensee is addressed as "you". "Licensees" and
|
||||||
|
"recipients" may be individuals or organizations.
|
||||||
|
|
||||||
|
To "modify" a work means to copy from or adapt all or part of the work
|
||||||
|
in a fashion requiring copyright permission, other than the making of an
|
||||||
|
exact copy. The resulting work is called a "modified version" of the
|
||||||
|
earlier work or a work "based on" the earlier work.
|
||||||
|
|
||||||
|
A "covered work" means either the unmodified Program or a work based
|
||||||
|
on the Program.
|
||||||
|
|
||||||
|
To "propagate" a work means to do anything with it that, without
|
||||||
|
permission, would make you directly or secondarily liable for
|
||||||
|
infringement under applicable copyright law, except executing it on a
|
||||||
|
computer or modifying a private copy. Propagation includes copying,
|
||||||
|
distribution (with or without modification), making available to the
|
||||||
|
public, and in some countries other activities as well.
|
||||||
|
|
||||||
|
To "convey" a work means any kind of propagation that enables other
|
||||||
|
parties to make or receive copies. Mere interaction with a user through
|
||||||
|
a computer network, with no transfer of a copy, is not conveying.
|
||||||
|
|
||||||
|
An interactive user interface displays "Appropriate Legal Notices"
|
||||||
|
to the extent that it includes a convenient and prominently visible
|
||||||
|
feature that (1) displays an appropriate copyright notice, and (2)
|
||||||
|
tells the user that there is no warranty for the work (except to the
|
||||||
|
extent that warranties are provided), that licensees may convey the
|
||||||
|
work under this License, and how to view a copy of this License. If
|
||||||
|
the interface presents a list of user commands or options, such as a
|
||||||
|
menu, a prominent item in the list meets this criterion.
|
||||||
|
|
||||||
|
1. Source Code.
|
||||||
|
|
||||||
|
The "source code" for a work means the preferred form of the work
|
||||||
|
for making modifications to it. "Object code" means any non-source
|
||||||
|
form of a work.
|
||||||
|
|
||||||
|
A "Standard Interface" means an interface that either is an official
|
||||||
|
standard defined by a recognized standards body, or, in the case of
|
||||||
|
interfaces specified for a particular programming language, one that
|
||||||
|
is widely used among developers working in that language.
|
||||||
|
|
||||||
|
The "System Libraries" of an executable work include anything, other
|
||||||
|
than the work as a whole, that (a) is included in the normal form of
|
||||||
|
packaging a Major Component, but which is not part of that Major
|
||||||
|
Component, and (b) serves only to enable use of the work with that
|
||||||
|
Major Component, or to implement a Standard Interface for which an
|
||||||
|
implementation is available to the public in source code form. A
|
||||||
|
"Major Component", in this context, means a major essential component
|
||||||
|
(kernel, window system, and so on) of the specific operating system
|
||||||
|
(if any) on which the executable work runs, or a compiler used to
|
||||||
|
produce the work, or an object code interpreter used to run it.
|
||||||
|
|
||||||
|
The "Corresponding Source" for a work in object code form means all
|
||||||
|
the source code needed to generate, install, and (for an executable
|
||||||
|
work) run the object code and to modify the work, including scripts to
|
||||||
|
control those activities. However, it does not include the work's
|
||||||
|
System Libraries, or general-purpose tools or generally available free
|
||||||
|
programs which are used unmodified in performing those activities but
|
||||||
|
which are not part of the work. For example, Corresponding Source
|
||||||
|
includes interface definition files associated with source files for
|
||||||
|
the work, and the source code for shared libraries and dynamically
|
||||||
|
linked subprograms that the work is specifically designed to require,
|
||||||
|
such as by intimate data communication or control flow between those
|
||||||
|
subprograms and other parts of the work.
|
||||||
|
|
||||||
|
The Corresponding Source need not include anything that users
|
||||||
|
can regenerate automatically from other parts of the Corresponding
|
||||||
|
Source.
|
||||||
|
|
||||||
|
The Corresponding Source for a work in source code form is that
|
||||||
|
same work.
|
||||||
|
|
||||||
|
2. Basic Permissions.
|
||||||
|
|
||||||
|
All rights granted under this License are granted for the term of
|
||||||
|
copyright on the Program, and are irrevocable provided the stated
|
||||||
|
conditions are met. This License explicitly affirms your unlimited
|
||||||
|
permission to run the unmodified Program. The output from running a
|
||||||
|
covered work is covered by this License only if the output, given its
|
||||||
|
content, constitutes a covered work. This License acknowledges your
|
||||||
|
rights of fair use or other equivalent, as provided by copyright law.
|
||||||
|
|
||||||
|
You may make, run and propagate covered works that you do not
|
||||||
|
convey, without conditions so long as your license otherwise remains
|
||||||
|
in force. You may convey covered works to others for the sole purpose
|
||||||
|
of having them make modifications exclusively for you, or provide you
|
||||||
|
with facilities for running those works, provided that you comply with
|
||||||
|
the terms of this License in conveying all material for which you do
|
||||||
|
not control copyright. Those thus making or running the covered works
|
||||||
|
for you must do so exclusively on your behalf, under your direction
|
||||||
|
and control, on terms that prohibit them from making any copies of
|
||||||
|
your copyrighted material outside their relationship with you.
|
||||||
|
|
||||||
|
Conveying under any other circumstances is permitted solely under
|
||||||
|
the conditions stated below. Sublicensing is not allowed; section 10
|
||||||
|
makes it unnecessary.
|
||||||
|
|
||||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||||
|
|
||||||
|
No covered work shall be deemed part of an effective technological
|
||||||
|
measure under any applicable law fulfilling obligations under article
|
||||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||||
|
similar laws prohibiting or restricting circumvention of such
|
||||||
|
measures.
|
||||||
|
|
||||||
|
When you convey a covered work, you waive any legal power to forbid
|
||||||
|
circumvention of technological measures to the extent such circumvention
|
||||||
|
is effected by exercising rights under this License with respect to
|
||||||
|
the covered work, and you disclaim any intention to limit operation or
|
||||||
|
modification of the work as a means of enforcing, against the work's
|
||||||
|
users, your or third parties' legal rights to forbid circumvention of
|
||||||
|
technological measures.
|
||||||
|
|
||||||
|
4. Conveying Verbatim Copies.
|
||||||
|
|
||||||
|
You may convey verbatim copies of the Program's source code as you
|
||||||
|
receive it, in any medium, provided that you conspicuously and
|
||||||
|
appropriately publish on each copy an appropriate copyright notice;
|
||||||
|
keep intact all notices stating that this License and any
|
||||||
|
non-permissive terms added in accord with section 7 apply to the code;
|
||||||
|
keep intact all notices of the absence of any warranty; and give all
|
||||||
|
recipients a copy of this License along with the Program.
|
||||||
|
|
||||||
|
You may charge any price or no price for each copy that you convey,
|
||||||
|
and you may offer support or warranty protection for a fee.
|
||||||
|
|
||||||
|
5. Conveying Modified Source Versions.
|
||||||
|
|
||||||
|
You may convey a work based on the Program, or the modifications to
|
||||||
|
produce it from the Program, in the form of source code under the
|
||||||
|
terms of section 4, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) The work must carry prominent notices stating that you modified
|
||||||
|
it, and giving a relevant date.
|
||||||
|
|
||||||
|
b) The work must carry prominent notices stating that it is
|
||||||
|
released under this License and any conditions added under section
|
||||||
|
7. This requirement modifies the requirement in section 4 to
|
||||||
|
"keep intact all notices".
|
||||||
|
|
||||||
|
c) You must license the entire work, as a whole, under this
|
||||||
|
License to anyone who comes into possession of a copy. This
|
||||||
|
License will therefore apply, along with any applicable section 7
|
||||||
|
additional terms, to the whole of the work, and all its parts,
|
||||||
|
regardless of how they are packaged. This License gives no
|
||||||
|
permission to license the work in any other way, but it does not
|
||||||
|
invalidate such permission if you have separately received it.
|
||||||
|
|
||||||
|
d) If the work has interactive user interfaces, each must display
|
||||||
|
Appropriate Legal Notices; however, if the Program has interactive
|
||||||
|
interfaces that do not display Appropriate Legal Notices, your
|
||||||
|
work need not make them do so.
|
||||||
|
|
||||||
|
A compilation of a covered work with other separate and independent
|
||||||
|
works, which are not by their nature extensions of the covered work,
|
||||||
|
and which are not combined with it such as to form a larger program,
|
||||||
|
in or on a volume of a storage or distribution medium, is called an
|
||||||
|
"aggregate" if the compilation and its resulting copyright are not
|
||||||
|
used to limit the access or legal rights of the compilation's users
|
||||||
|
beyond what the individual works permit. Inclusion of a covered work
|
||||||
|
in an aggregate does not cause this License to apply to the other
|
||||||
|
parts of the aggregate.
|
||||||
|
|
||||||
|
6. Conveying Non-Source Forms.
|
||||||
|
|
||||||
|
You may convey a covered work in object code form under the terms
|
||||||
|
of sections 4 and 5, provided that you also convey the
|
||||||
|
machine-readable Corresponding Source under the terms of this License,
|
||||||
|
in one of these ways:
|
||||||
|
|
||||||
|
a) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by the
|
||||||
|
Corresponding Source fixed on a durable physical medium
|
||||||
|
customarily used for software interchange.
|
||||||
|
|
||||||
|
b) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by a
|
||||||
|
written offer, valid for at least three years and valid for as
|
||||||
|
long as you offer spare parts or customer support for that product
|
||||||
|
model, to give anyone who possesses the object code either (1) a
|
||||||
|
copy of the Corresponding Source for all the software in the
|
||||||
|
product that is covered by this License, on a durable physical
|
||||||
|
medium customarily used for software interchange, for a price no
|
||||||
|
more than your reasonable cost of physically performing this
|
||||||
|
conveying of source, or (2) access to copy the
|
||||||
|
Corresponding Source from a network server at no charge.
|
||||||
|
|
||||||
|
c) Convey individual copies of the object code with a copy of the
|
||||||
|
written offer to provide the Corresponding Source. This
|
||||||
|
alternative is allowed only occasionally and noncommercially, and
|
||||||
|
only if you received the object code with such an offer, in accord
|
||||||
|
with subsection 6b.
|
||||||
|
|
||||||
|
d) Convey the object code by offering access from a designated
|
||||||
|
place (gratis or for a charge), and offer equivalent access to the
|
||||||
|
Corresponding Source in the same way through the same place at no
|
||||||
|
further charge. You need not require recipients to copy the
|
||||||
|
Corresponding Source along with the object code. If the place to
|
||||||
|
copy the object code is a network server, the Corresponding Source
|
||||||
|
may be on a different server (operated by you or a third party)
|
||||||
|
that supports equivalent copying facilities, provided you maintain
|
||||||
|
clear directions next to the object code saying where to find the
|
||||||
|
Corresponding Source. Regardless of what server hosts the
|
||||||
|
Corresponding Source, you remain obligated to ensure that it is
|
||||||
|
available for as long as needed to satisfy these requirements.
|
||||||
|
|
||||||
|
e) Convey the object code using peer-to-peer transmission, provided
|
||||||
|
you inform other peers where the object code and Corresponding
|
||||||
|
Source of the work are being offered to the general public at no
|
||||||
|
charge under subsection 6d.
|
||||||
|
|
||||||
|
A separable portion of the object code, whose source code is excluded
|
||||||
|
from the Corresponding Source as a System Library, need not be
|
||||||
|
included in conveying the object code work.
|
||||||
|
|
||||||
|
A "User Product" is either (1) a "consumer product", which means any
|
||||||
|
tangible personal property which is normally used for personal, family,
|
||||||
|
or household purposes, or (2) anything designed or sold for incorporation
|
||||||
|
into a dwelling. In determining whether a product is a consumer product,
|
||||||
|
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||||
|
product received by a particular user, "normally used" refers to a
|
||||||
|
typical or common use of that class of product, regardless of the status
|
||||||
|
of the particular user or of the way in which the particular user
|
||||||
|
actually uses, or expects or is expected to use, the product. A product
|
||||||
|
is a consumer product regardless of whether the product has substantial
|
||||||
|
commercial, industrial or non-consumer uses, unless such uses represent
|
||||||
|
the only significant mode of use of the product.
|
||||||
|
|
||||||
|
"Installation Information" for a User Product means any methods,
|
||||||
|
procedures, authorization keys, or other information required to install
|
||||||
|
and execute modified versions of a covered work in that User Product from
|
||||||
|
a modified version of its Corresponding Source. The information must
|
||||||
|
suffice to ensure that the continued functioning of the modified object
|
||||||
|
code is in no case prevented or interfered with solely because
|
||||||
|
modification has been made.
|
||||||
|
|
||||||
|
If you convey an object code work under this section in, or with, or
|
||||||
|
specifically for use in, a User Product, and the conveying occurs as
|
||||||
|
part of a transaction in which the right of possession and use of the
|
||||||
|
User Product is transferred to the recipient in perpetuity or for a
|
||||||
|
fixed term (regardless of how the transaction is characterized), the
|
||||||
|
Corresponding Source conveyed under this section must be accompanied
|
||||||
|
by the Installation Information. But this requirement does not apply
|
||||||
|
if neither you nor any third party retains the ability to install
|
||||||
|
modified object code on the User Product (for example, the work has
|
||||||
|
been installed in ROM).
|
||||||
|
|
||||||
|
The requirement to provide Installation Information does not include a
|
||||||
|
requirement to continue to provide support service, warranty, or updates
|
||||||
|
for a work that has been modified or installed by the recipient, or for
|
||||||
|
the User Product in which it has been modified or installed. Access to a
|
||||||
|
network may be denied when the modification itself materially and
|
||||||
|
adversely affects the operation of the network or violates the rules and
|
||||||
|
protocols for communication across the network.
|
||||||
|
|
||||||
|
Corresponding Source conveyed, and Installation Information provided,
|
||||||
|
in accord with this section must be in a format that is publicly
|
||||||
|
documented (and with an implementation available to the public in
|
||||||
|
source code form), and must require no special password or key for
|
||||||
|
unpacking, reading or copying.
|
||||||
|
|
||||||
|
7. Additional Terms.
|
||||||
|
|
||||||
|
"Additional permissions" are terms that supplement the terms of this
|
||||||
|
License by making exceptions from one or more of its conditions.
|
||||||
|
Additional permissions that are applicable to the entire Program shall
|
||||||
|
be treated as though they were included in this License, to the extent
|
||||||
|
that they are valid under applicable law. If additional permissions
|
||||||
|
apply only to part of the Program, that part may be used separately
|
||||||
|
under those permissions, but the entire Program remains governed by
|
||||||
|
this License without regard to the additional permissions.
|
||||||
|
|
||||||
|
When you convey a copy of a covered work, you may at your option
|
||||||
|
remove any additional permissions from that copy, or from any part of
|
||||||
|
it. (Additional permissions may be written to require their own
|
||||||
|
removal in certain cases when you modify the work.) You may place
|
||||||
|
additional permissions on material, added by you to a covered work,
|
||||||
|
for which you have or can give appropriate copyright permission.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, for material you
|
||||||
|
add to a covered work, you may (if authorized by the copyright holders of
|
||||||
|
that material) supplement the terms of this License with terms:
|
||||||
|
|
||||||
|
a) Disclaiming warranty or limiting liability differently from the
|
||||||
|
terms of sections 15 and 16 of this License; or
|
||||||
|
|
||||||
|
b) Requiring preservation of specified reasonable legal notices or
|
||||||
|
author attributions in that material or in the Appropriate Legal
|
||||||
|
Notices displayed by works containing it; or
|
||||||
|
|
||||||
|
c) Prohibiting misrepresentation of the origin of that material, or
|
||||||
|
requiring that modified versions of such material be marked in
|
||||||
|
reasonable ways as different from the original version; or
|
||||||
|
|
||||||
|
d) Limiting the use for publicity purposes of names of licensors or
|
||||||
|
authors of the material; or
|
||||||
|
|
||||||
|
e) Declining to grant rights under trademark law for use of some
|
||||||
|
trade names, trademarks, or service marks; or
|
||||||
|
|
||||||
|
f) Requiring indemnification of licensors and authors of that
|
||||||
|
material by anyone who conveys the material (or modified versions of
|
||||||
|
it) with contractual assumptions of liability to the recipient, for
|
||||||
|
any liability that these contractual assumptions directly impose on
|
||||||
|
those licensors and authors.
|
||||||
|
|
||||||
|
All other non-permissive additional terms are considered "further
|
||||||
|
restrictions" within the meaning of section 10. If the Program as you
|
||||||
|
received it, or any part of it, contains a notice stating that it is
|
||||||
|
governed by this License along with a term that is a further
|
||||||
|
restriction, you may remove that term. If a license document contains
|
||||||
|
a further restriction but permits relicensing or conveying under this
|
||||||
|
License, you may add to a covered work material governed by the terms
|
||||||
|
of that license document, provided that the further restriction does
|
||||||
|
not survive such relicensing or conveying.
|
||||||
|
|
||||||
|
If you add terms to a covered work in accord with this section, you
|
||||||
|
must place, in the relevant source files, a statement of the
|
||||||
|
additional terms that apply to those files, or a notice indicating
|
||||||
|
where to find the applicable terms.
|
||||||
|
|
||||||
|
Additional terms, permissive or non-permissive, may be stated in the
|
||||||
|
form of a separately written license, or stated as exceptions;
|
||||||
|
the above requirements apply either way.
|
||||||
|
|
||||||
|
8. Termination.
|
||||||
|
|
||||||
|
You may not propagate or modify a covered work except as expressly
|
||||||
|
provided under this License. Any attempt otherwise to propagate or
|
||||||
|
modify it is void, and will automatically terminate your rights under
|
||||||
|
this License (including any patent licenses granted under the third
|
||||||
|
paragraph of section 11).
|
||||||
|
|
||||||
|
However, if you cease all violation of this License, then your
|
||||||
|
license from a particular copyright holder is reinstated (a)
|
||||||
|
provisionally, unless and until the copyright holder explicitly and
|
||||||
|
finally terminates your license, and (b) permanently, if the copyright
|
||||||
|
holder fails to notify you of the violation by some reasonable means
|
||||||
|
prior to 60 days after the cessation.
|
||||||
|
|
||||||
|
Moreover, your license from a particular copyright holder is
|
||||||
|
reinstated permanently if the copyright holder notifies you of the
|
||||||
|
violation by some reasonable means, this is the first time you have
|
||||||
|
received notice of violation of this License (for any work) from that
|
||||||
|
copyright holder, and you cure the violation prior to 30 days after
|
||||||
|
your receipt of the notice.
|
||||||
|
|
||||||
|
Termination of your rights under this section does not terminate the
|
||||||
|
licenses of parties who have received copies or rights from you under
|
||||||
|
this License. If your rights have been terminated and not permanently
|
||||||
|
reinstated, you do not qualify to receive new licenses for the same
|
||||||
|
material under section 10.
|
||||||
|
|
||||||
|
9. Acceptance Not Required for Having Copies.
|
||||||
|
|
||||||
|
You are not required to accept this License in order to receive or
|
||||||
|
run a copy of the Program. Ancillary propagation of a covered work
|
||||||
|
occurring solely as a consequence of using peer-to-peer transmission
|
||||||
|
to receive a copy likewise does not require acceptance. However,
|
||||||
|
nothing other than this License grants you permission to propagate or
|
||||||
|
modify any covered work. These actions infringe copyright if you do
|
||||||
|
not accept this License. Therefore, by modifying or propagating a
|
||||||
|
covered work, you indicate your acceptance of this License to do so.
|
||||||
|
|
||||||
|
10. Automatic Licensing of Downstream Recipients.
|
||||||
|
|
||||||
|
Each time you convey a covered work, the recipient automatically
|
||||||
|
receives a license from the original licensors, to run, modify and
|
||||||
|
propagate that work, subject to this License. You are not responsible
|
||||||
|
for enforcing compliance by third parties with this License.
|
||||||
|
|
||||||
|
An "entity transaction" is a transaction transferring control of an
|
||||||
|
organization, or substantially all assets of one, or subdividing an
|
||||||
|
organization, or merging organizations. If propagation of a covered
|
||||||
|
work results from an entity transaction, each party to that
|
||||||
|
transaction who receives a copy of the work also receives whatever
|
||||||
|
licenses to the work the party's predecessor in interest had or could
|
||||||
|
give under the previous paragraph, plus a right to possession of the
|
||||||
|
Corresponding Source of the work from the predecessor in interest, if
|
||||||
|
the predecessor has it or can get it with reasonable efforts.
|
||||||
|
|
||||||
|
You may not impose any further restrictions on the exercise of the
|
||||||
|
rights granted or affirmed under this License. For example, you may
|
||||||
|
not impose a license fee, royalty, or other charge for exercise of
|
||||||
|
rights granted under this License, and you may not initiate litigation
|
||||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||||
|
any patent claim is infringed by making, using, selling, offering for
|
||||||
|
sale, or importing the Program or any portion of it.
|
||||||
|
|
||||||
|
11. Patents.
|
||||||
|
|
||||||
|
A "contributor" is a copyright holder who authorizes use under this
|
||||||
|
License of the Program or a work on which the Program is based. The
|
||||||
|
work thus licensed is called the contributor's "contributor version".
|
||||||
|
|
||||||
|
A contributor's "essential patent claims" are all patent claims
|
||||||
|
owned or controlled by the contributor, whether already acquired or
|
||||||
|
hereafter acquired, that would be infringed by some manner, permitted
|
||||||
|
by this License, of making, using, or selling its contributor version,
|
||||||
|
but do not include claims that would be infringed only as a
|
||||||
|
consequence of further modification of the contributor version. For
|
||||||
|
purposes of this definition, "control" includes the right to grant
|
||||||
|
patent sublicenses in a manner consistent with the requirements of
|
||||||
|
this License.
|
||||||
|
|
||||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||||
|
patent license under the contributor's essential patent claims, to
|
||||||
|
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||||
|
propagate the contents of its contributor version.
|
||||||
|
|
||||||
|
In the following three paragraphs, a "patent license" is any express
|
||||||
|
agreement or commitment, however denominated, not to enforce a patent
|
||||||
|
(such as an express permission to practice a patent or covenant not to
|
||||||
|
sue for patent infringement). To "grant" such a patent license to a
|
||||||
|
party means to make such an agreement or commitment not to enforce a
|
||||||
|
patent against the party.
|
||||||
|
|
||||||
|
If you convey a covered work, knowingly relying on a patent license,
|
||||||
|
and the Corresponding Source of the work is not available for anyone
|
||||||
|
to copy, free of charge and under the terms of this License, through a
|
||||||
|
publicly available network server or other readily accessible means,
|
||||||
|
then you must either (1) cause the Corresponding Source to be so
|
||||||
|
available, or (2) arrange to deprive yourself of the benefit of the
|
||||||
|
patent license for this particular work, or (3) arrange, in a manner
|
||||||
|
consistent with the requirements of this License, to extend the patent
|
||||||
|
license to downstream recipients. "Knowingly relying" means you have
|
||||||
|
actual knowledge that, but for the patent license, your conveying the
|
||||||
|
covered work in a country, or your recipient's use of the covered work
|
||||||
|
in a country, would infringe one or more identifiable patents in that
|
||||||
|
country that you have reason to believe are valid.
|
||||||
|
|
||||||
|
If, pursuant to or in connection with a single transaction or
|
||||||
|
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||||
|
covered work, and grant a patent license to some of the parties
|
||||||
|
receiving the covered work authorizing them to use, propagate, modify
|
||||||
|
or convey a specific copy of the covered work, then the patent license
|
||||||
|
you grant is automatically extended to all recipients of the covered
|
||||||
|
work and works based on it.
|
||||||
|
|
||||||
|
A patent license is "discriminatory" if it does not include within
|
||||||
|
the scope of its coverage, prohibits the exercise of, or is
|
||||||
|
conditioned on the non-exercise of one or more of the rights that are
|
||||||
|
specifically granted under this License. You may not convey a covered
|
||||||
|
work if you are a party to an arrangement with a third party that is
|
||||||
|
in the business of distributing software, under which you make payment
|
||||||
|
to the third party based on the extent of your activity of conveying
|
||||||
|
the work, and under which the third party grants, to any of the
|
||||||
|
parties who would receive the covered work from you, a discriminatory
|
||||||
|
patent license (a) in connection with copies of the covered work
|
||||||
|
conveyed by you (or copies made from those copies), or (b) primarily
|
||||||
|
for and in connection with specific products or compilations that
|
||||||
|
contain the covered work, unless you entered into that arrangement,
|
||||||
|
or that patent license was granted, prior to 28 March 2007.
|
||||||
|
|
||||||
|
Nothing in this License shall be construed as excluding or limiting
|
||||||
|
any implied license or other defenses to infringement that may
|
||||||
|
otherwise be available to you under applicable patent law.
|
||||||
|
|
||||||
|
12. No Surrender of Others' Freedom.
|
||||||
|
|
||||||
|
If conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot convey a
|
||||||
|
covered work so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you may
|
||||||
|
not convey it at all. For example, if you agree to terms that obligate you
|
||||||
|
to collect a royalty for further conveying from those to whom you convey
|
||||||
|
the Program, the only way you could satisfy both those terms and this
|
||||||
|
License would be to refrain entirely from conveying the Program.
|
||||||
|
|
||||||
|
13. Use with the GNU Affero General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, you have
|
||||||
|
permission to link or combine any covered work with a work licensed
|
||||||
|
under version 3 of the GNU Affero General Public License into a single
|
||||||
|
combined work, and to convey the resulting work. The terms of this
|
||||||
|
License will continue to apply to the part which is the covered work,
|
||||||
|
but the special requirements of the GNU Affero General Public License,
|
||||||
|
section 13, concerning interaction through a network will apply to the
|
||||||
|
combination as such.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the
|
||||||
|
Program specifies that a certain numbered version of the GNU General
|
||||||
|
Public License "or any later version" applies to it, you have the
|
||||||
|
option of following the terms and conditions either of that numbered
|
||||||
|
version or of any later version published by the Free Software
|
||||||
|
Foundation. If the Program does not specify a version number of the
|
||||||
|
GNU General Public License, you may choose any version ever published
|
||||||
|
by the Free Software Foundation.
|
||||||
|
|
||||||
|
If the Program specifies that a proxy can decide which future
|
||||||
|
versions of the GNU General Public License can be used, that proxy's
|
||||||
|
public statement of acceptance of a version permanently authorizes you
|
||||||
|
to choose that version for the Program.
|
||||||
|
|
||||||
|
Later license versions may give you additional or different
|
||||||
|
permissions. However, no additional obligations are imposed on any
|
||||||
|
author or copyright holder as a result of your choosing to follow a
|
||||||
|
later version.
|
||||||
|
|
||||||
|
15. Disclaimer of Warranty.
|
||||||
|
|
||||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
16. Limitation of Liability.
|
||||||
|
|
||||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||||
|
SUCH DAMAGES.
|
||||||
|
|
||||||
|
17. Interpretation of Sections 15 and 16.
|
||||||
|
|
||||||
|
If the disclaimer of warranty and limitation of liability provided
|
||||||
|
above cannot be given local legal effect according to their terms,
|
||||||
|
reviewing courts shall apply local law that most closely approximates
|
||||||
|
an absolute waiver of all civil liability in connection with the
|
||||||
|
Program, unless a warranty or assumption of liability accompanies a
|
||||||
|
copy of the Program in return for a fee.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
state the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
pfor
|
||||||
|
Copyright (C) 2021 phd / dev
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program does terminal interaction, make it output a short
|
||||||
|
notice like this when it starts in an interactive mode:
|
||||||
|
|
||||||
|
<program> Copyright (C) 2021 phd / dev
|
||||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, your program's commands
|
||||||
|
might be different; for a GUI interface, you would use an "about box".
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or school,
|
||||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||||
|
For more information on this, and how to apply and follow the GNU GPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
The GNU General Public License does not permit incorporating your program
|
||||||
|
into proprietary programs. If your program is a subroutine library, you
|
||||||
|
may consider it more useful to permit linking proprietary applications with
|
||||||
|
the library. If this is what you want to do, use the GNU Lesser General
|
||||||
|
Public License instead of this License. But first, please read
|
||||||
|
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||||
24
README.md
Normal file
24
README.md
Normal file
@ -0,0 +1,24 @@
|
|||||||
|
# About
|
||||||
|
|
||||||
|
This template metaprogramming library is part of my Ph.D. thesis work and is used in main
|
||||||
|
projects.
|
||||||
|
|
||||||
|
## Organisation
|
||||||
|
|
||||||
|
Main directories:
|
||||||
|
- `src`: the library sources.
|
||||||
|
|
||||||
|
## Usage
|
||||||
|
|
||||||
|
To produce the `Makefile` and build the project:
|
||||||
|
```bash
|
||||||
|
mkdir build
|
||||||
|
cd build
|
||||||
|
cmake -DCMAKE_BUILD_TYPE=Release ..
|
||||||
|
make
|
||||||
|
```
|
||||||
|
|
||||||
|
To run unit testing:
|
||||||
|
```bash
|
||||||
|
./build/tests_pfor
|
||||||
|
```
|
||||||
17471
inc/catch.hpp
Normal file
17471
inc/catch.hpp
Normal file
File diff suppressed because it is too large
Load Diff
7
src/algorithm.h
Normal file
7
src/algorithm.h
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
#ifndef TMP_ALGORITHM_H
|
||||||
|
#define TMP_ALGORITHM_H
|
||||||
|
|
||||||
|
#include "packalgo.h"
|
||||||
|
#include "treealgo.h"
|
||||||
|
|
||||||
|
#endif
|
||||||
22
src/bind.h
Normal file
22
src/bind.h
Normal file
@ -0,0 +1,22 @@
|
|||||||
|
#ifndef TMP_BIND_H
|
||||||
|
#define TMP_BIND_H
|
||||||
|
|
||||||
|
#include "packalgo.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
template<template<typename...> class TT, typename C>
|
||||||
|
struct Bind2nd {
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
using F = TT<T, C>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename ValueType, template<typename, ValueType, typename...> class TT, ValueType V>
|
||||||
|
struct Bind2ndV {
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
using F = TT<T, V>;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
78
src/debug.h
Normal file
78
src/debug.h
Normal file
@ -0,0 +1,78 @@
|
|||||||
|
#ifndef TMP_DEBUG_H
|
||||||
|
#define TMP_DEBUG_H
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @file tmp/debug.h
|
||||||
|
* @brief compile-time typename to string resolution
|
||||||
|
*
|
||||||
|
* see: https://stackoverflow.com/questions/81870/is-it-possible-to-print-a-variables-type-in-standard-c
|
||||||
|
* see: https://stackoverflow.com/a/20170989
|
||||||
|
*
|
||||||
|
* Adapted, minimal C++ version supported is C++14
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <cstdio>
|
||||||
|
#include "stringview.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
namespace detail {
|
||||||
|
|
||||||
|
constexpr unsigned strlen(char const*str) {
|
||||||
|
unsigned l = 0;
|
||||||
|
while(*str++) ++l;
|
||||||
|
return l;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief compile-time typename to string resolution
|
||||||
|
*
|
||||||
|
* @param[in] T type to resolve
|
||||||
|
*
|
||||||
|
* @return constexpr string_view containing the typename
|
||||||
|
*
|
||||||
|
* TODO this function has not been tested for Windows
|
||||||
|
*/
|
||||||
|
template<typename T>
|
||||||
|
constexpr string_view typeName() {
|
||||||
|
#if defined(__clang__)
|
||||||
|
string_view p = __PRETTY_FUNCTION__;
|
||||||
|
constexpr auto leftDummy = detail::strlen("tmp::string_view tmp::typeName() [T = ");
|
||||||
|
constexpr auto rightDummy = detail::strlen("]");
|
||||||
|
#elif defined(__GNUC__)
|
||||||
|
string_view p = __PRETTY_FUNCTION__;
|
||||||
|
constexpr auto leftDummy = detail::strlen("constexpr tmp::string_view tmp::typeName() [with T = ");
|
||||||
|
constexpr auto rightDummy = detail::strlen("]");
|
||||||
|
#elif defined(_MSC_VER)
|
||||||
|
string_view p = __FUNCSIG__;
|
||||||
|
constexpr auto leftDummy = detail::strlen("");
|
||||||
|
constexpr auto rightDummy = detail::strlen("");
|
||||||
|
#else
|
||||||
|
return {"[err: tmp::typeNameF is not implemented for your compiler]"};
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if defined(__clang__) || defined(__GNUC__) || defined(__MSC_VER)
|
||||||
|
return string_view(p.data() + leftDummy, p.size() - leftDummy - rightDummy);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename... As, typename... Ts>
|
||||||
|
std::string strTypes(Ts...) {
|
||||||
|
using Fold = int[];
|
||||||
|
std::string result;
|
||||||
|
static_cast<void>(Fold{(result += std::string{typeName<As>()} + ", ", 0)...});
|
||||||
|
static_cast<void>(Fold{(result += std::string{typeName<Ts>()} + ", ", 0)...});
|
||||||
|
if(result.empty()) return "";
|
||||||
|
else return result.substr(0, result.size()-2);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename... As, typename... Ts>
|
||||||
|
void printTypes(Ts...) {
|
||||||
|
std::puts(strTypes<As..., Ts...>().c_str());
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
167
src/pack.h
Normal file
167
src/pack.h
Normal file
@ -0,0 +1,167 @@
|
|||||||
|
#ifndef TMP_PACK_H
|
||||||
|
#define TMP_PACK_H
|
||||||
|
|
||||||
|
#include "utility.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Pack
|
||||||
|
*/
|
||||||
|
template<typename... Ts> struct Pack {
|
||||||
|
static constexpr Size size = sizeof...(Ts);
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackHead
|
||||||
|
*/
|
||||||
|
template<typename> struct PackHeadImpl;
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
struct PackHeadImpl<Pack<T, Ts...>> {
|
||||||
|
using type = T;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using PackHead = typename PackHeadImpl<T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackTrail
|
||||||
|
*/
|
||||||
|
template<typename> struct PackTrailImpl;
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
struct PackTrailImpl<Pack<T, Ts...>> {
|
||||||
|
using type = Pack<Ts...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using PackTrail = typename PackTrailImpl<T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackGet
|
||||||
|
*/
|
||||||
|
template<typename, Size> struct PackGetImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, Size I>
|
||||||
|
struct PackGetImpl<Pack<T, Ts...>, I> {
|
||||||
|
using type = typename PackGetImpl<Pack<Ts...>, I-1>::type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
struct PackGetImpl<Pack<T, Ts...>, 0> {
|
||||||
|
using type = T;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, Size I>
|
||||||
|
using PackGet = typename PackGetImpl<T, I>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackPushFront
|
||||||
|
*/
|
||||||
|
template<typename, typename> struct PackPushFrontImpl;
|
||||||
|
|
||||||
|
template<typename... Ts, typename T>
|
||||||
|
struct PackPushFrontImpl<Pack<Ts...>, T> {
|
||||||
|
using type = Pack<T, Ts...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, typename T>
|
||||||
|
using PackPushFront = typename PackPushFrontImpl<P, T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackPushBack
|
||||||
|
*/
|
||||||
|
template<typename, typename> struct PackPushBackImpl;
|
||||||
|
|
||||||
|
template<typename... Ts, typename T>
|
||||||
|
struct PackPushBackImpl<Pack<Ts...>, T> {
|
||||||
|
using type = Pack<Ts..., T>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, typename T>
|
||||||
|
using PackPushBack = typename PackPushBackImpl<P, T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackCat
|
||||||
|
*/
|
||||||
|
template<typename...> struct PackCatImpl;
|
||||||
|
|
||||||
|
template<typename... Ts, typename... Us, typename... Packs>
|
||||||
|
struct PackCatImpl<Pack<Ts...>, Pack<Us...>, Packs...> {
|
||||||
|
using type = typename PackCatImpl<Pack<Ts..., Us...>, Packs...>::type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename... Ts>
|
||||||
|
struct PackCatImpl<Pack<Ts...>> {
|
||||||
|
using type = Pack<Ts...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct PackCatImpl<> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename... Packs>
|
||||||
|
using PackCat = typename PackCatImpl<Packs...>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackReverse
|
||||||
|
*/
|
||||||
|
template<typename> struct PackReverseImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
struct PackReverseImpl<Pack<T, Ts...>> {
|
||||||
|
using type = PackPushBack<typename PackReverseImpl<Pack<Ts...>>::type, T>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct PackReverseImpl<Pack<>> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P>
|
||||||
|
using PackReverse = typename PackReverseImpl<P>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackReplace
|
||||||
|
*/
|
||||||
|
template<typename, typename, typename> struct PackReplaceImpl;
|
||||||
|
|
||||||
|
template<typename Before, typename After, typename Current, typename... Ts>
|
||||||
|
struct PackReplaceImpl<Pack<Current, Ts...>, Before, After> {
|
||||||
|
using type = PackCat<Pack<Current>, typename PackReplaceImpl<Pack<Ts...>, Before, After>::type>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename Before, typename After, typename... Ts>
|
||||||
|
struct PackReplaceImpl<Pack<Before, Ts...>, Before, After> {
|
||||||
|
using type = PackCat<Pack<After>, typename PackReplaceImpl<Pack<Ts...>, Before, After>::type>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename Before, typename After>
|
||||||
|
struct PackReplaceImpl<Pack<>, Before, After> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, typename Before, typename After>
|
||||||
|
using PackReplace = typename PackReplaceImpl<P, Before, After>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Repack
|
||||||
|
*/
|
||||||
|
template<template<typename...> class, typename> struct RepackImpl;
|
||||||
|
template<template<typename...> class Out, template<typename...> class In, typename... Ts>
|
||||||
|
struct RepackImpl<Out, In<Ts...>> {
|
||||||
|
using type = Out<Ts...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class Out, typename In>
|
||||||
|
using Repack = typename RepackImpl<Out, In>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* AsPack
|
||||||
|
*/
|
||||||
|
template<typename T>
|
||||||
|
using AsPack = Repack<Pack, T>;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
108
src/packalgo.h
Normal file
108
src/packalgo.h
Normal file
@ -0,0 +1,108 @@
|
|||||||
|
#ifndef TMP_PACKALGO_H
|
||||||
|
#define TMP_PACKALGO_H
|
||||||
|
|
||||||
|
#include "pack.h"
|
||||||
|
#include "traits.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Transform
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename...> class> struct TransformImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, template<typename...> class F>
|
||||||
|
struct TransformImpl<Pack<T, Ts...>, F> {
|
||||||
|
using type = PackPushFront<typename TransformImpl<Pack<Ts...>, F>::type, F<T>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F>
|
||||||
|
struct TransformImpl<Pack<>, F> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, template<typename...> class F>
|
||||||
|
using Transform = typename TransformImpl<P, F>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Accumulate
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename...> class, typename> struct AccumulateImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, template<typename...> class F, typename A>
|
||||||
|
struct AccumulateImpl<Pack<T, Ts...>, F, A> {
|
||||||
|
using type = typename AccumulateImpl<Pack<Ts...>, F, F<A, T>>::type;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F, typename A>
|
||||||
|
struct AccumulateImpl<Pack<>, F, A> {
|
||||||
|
using type = A;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, template<typename...> class F, typename A>
|
||||||
|
using Accumulate = typename AccumulateImpl<P, F, A>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Filter
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename...> class> struct FilterImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, template<typename...> class F>
|
||||||
|
struct FilterImpl<Pack<T, Ts...>, F> {
|
||||||
|
using next = typename FilterImpl<Pack<Ts...>, F>::type;
|
||||||
|
using type = std::conditional_t<F<T>::value, PackPushFront<next, T>, next>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F>
|
||||||
|
struct FilterImpl<Pack<>, F> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, template<typename...> class F>
|
||||||
|
using Filter = typename FilterImpl<P, F>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Cut
|
||||||
|
*/
|
||||||
|
template<typename T, typename, template<typename...> class> struct CutImpl;
|
||||||
|
|
||||||
|
template<typename R, typename... Rs, typename... Ls, template<typename...> class F>
|
||||||
|
struct CutImpl<Pack<Ls...>, Pack<R, Rs...>, F> {
|
||||||
|
using next = typename CutImpl<Pack<Ls..., R>, Pack<Rs...>, F>::type;
|
||||||
|
using type = std::conditional_t<F<R>::value, next, Pack<Pack<Ls...>, Pack<R, Rs...>>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename... Ls, template<typename...> class F>
|
||||||
|
struct CutImpl<Pack<Ls...>, Pack<>, F> {
|
||||||
|
using type = Pack<Pack<Ls...>, Pack<>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F>
|
||||||
|
struct CutImpl<Pack<>, Pack<>, F> {
|
||||||
|
using type = Pack<Pack<>, Pack<>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P, template<typename...> class F>
|
||||||
|
using Cut = typename CutImpl<Pack<>, P, F>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Reverse
|
||||||
|
*/
|
||||||
|
template<typename> struct ReverseImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts>
|
||||||
|
struct ReverseImpl<Pack<T, Ts...>> {
|
||||||
|
using type = PackPushBack<typename ReverseImpl<Pack<Ts...>>::type, T>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct ReverseImpl<Pack<>> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using Reverse = typename ReverseImpl<T>::type;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
52
src/stringview.h
Normal file
52
src/stringview.h
Normal file
@ -0,0 +1,52 @@
|
|||||||
|
#ifndef TMP_STRINGVIEW_H
|
||||||
|
#define TMP_STRINGVIEW_H
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @file tmp/stringview.h"
|
||||||
|
* @brief partial implementation of C++17 std::string_view
|
||||||
|
*
|
||||||
|
* see: https://stackoverflow.com/questions/81870/is-it-possible-to-print-a-variables-type-in-standard-c
|
||||||
|
* see: https://stackoverflow.com/a/20170989
|
||||||
|
* string_view is from "static_string" class
|
||||||
|
* to be replaced by std::string_view as soon as possible
|
||||||
|
*
|
||||||
|
* Adapted, minimal C++ version supported now C++11
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdexcept>
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
class string_view {
|
||||||
|
char const* const _p;
|
||||||
|
std::size_t const _sz;
|
||||||
|
|
||||||
|
public:
|
||||||
|
using const_iterator = char const*;
|
||||||
|
|
||||||
|
template<std::size_t N>
|
||||||
|
constexpr string_view(char const(&a)[N]) noexcept: _p(a), _sz(N-1) {}
|
||||||
|
constexpr string_view(char const*p, std::size_t N) noexcept: _p(p), _sz(N) {}
|
||||||
|
|
||||||
|
constexpr char const*data() const noexcept {return _p;}
|
||||||
|
constexpr std::size_t size() const noexcept {return _sz;}
|
||||||
|
|
||||||
|
constexpr const_iterator begin() const noexcept {return _p;}
|
||||||
|
constexpr const_iterator end() const noexcept {return _p + _sz;}
|
||||||
|
|
||||||
|
constexpr char operator[](std::size_t n) const {
|
||||||
|
return n < _sz? _p[n] : throw std::out_of_range("string_view");
|
||||||
|
}
|
||||||
|
|
||||||
|
explicit operator std::string() const { return {_p, _sz}; }
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename Ostream>
|
||||||
|
inline Ostream&operator<<(Ostream &os, string_view const&s) {
|
||||||
|
os.write(s.data(), s.size());
|
||||||
|
return os;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
84
src/traits.h
Normal file
84
src/traits.h
Normal file
@ -0,0 +1,84 @@
|
|||||||
|
#ifndef TMP_TRAITS_H
|
||||||
|
#define TMP_TRAITS_H
|
||||||
|
|
||||||
|
#include <type_traits>
|
||||||
|
#include "pack.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* void_t
|
||||||
|
*
|
||||||
|
* as of C++17, use std::void_t instead
|
||||||
|
*/
|
||||||
|
template<typename...> using void_t = void;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Void
|
||||||
|
*
|
||||||
|
* use to replace `void` when an instance is required
|
||||||
|
*/
|
||||||
|
struct Void {};
|
||||||
|
|
||||||
|
// TODO: remove it?
|
||||||
|
template<typename Ostream>
|
||||||
|
Ostream &operator<<(Ostream &os, Void const&) {
|
||||||
|
return os << "Void{}";
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* dependentFalse
|
||||||
|
*/
|
||||||
|
template<typename...>
|
||||||
|
constexpr bool dependentFalse = false;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ReturnType
|
||||||
|
*/
|
||||||
|
template<typename> struct ReturnTypeImpl;
|
||||||
|
template<typename R, typename... Ts>
|
||||||
|
struct ReturnTypeImpl<R(Ts...)> {
|
||||||
|
using type = R;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using ReturnType = typename ReturnTypeImpl<T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Parameters
|
||||||
|
*/
|
||||||
|
template<typename> struct ParametersImpl;
|
||||||
|
template<typename R, typename... Ps>
|
||||||
|
struct ParametersImpl<R(Ps...)> {
|
||||||
|
using type = Pack<Ps...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using Parameters = typename ParametersImpl<T>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* invoke_result
|
||||||
|
* as of C++17, use std::invoke_result instead
|
||||||
|
*/
|
||||||
|
template<typename F, typename... Args>
|
||||||
|
using invoke_result = std::result_of<F(Args...)>;
|
||||||
|
|
||||||
|
template<typename F, typename... Args>
|
||||||
|
using invoke_result_t = typename invoke_result<F, Args...>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* FunctionCat
|
||||||
|
*/
|
||||||
|
template<typename, typename> struct FunctionCatImpl;
|
||||||
|
|
||||||
|
template<typename Ret, typename... Ts, typename... Us>
|
||||||
|
struct FunctionCatImpl<Ret(Ts...), Ret(Us...)> {
|
||||||
|
using type = Ret(Ts..., Us...);
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename F1, typename F2>
|
||||||
|
using FunctionCat = typename FunctionCatImpl<F1, F2>::type;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
159
src/tree.h
Normal file
159
src/tree.h
Normal file
@ -0,0 +1,159 @@
|
|||||||
|
#ifndef TMP_TREE_H
|
||||||
|
#define TMP_TREE_H
|
||||||
|
|
||||||
|
#include "bind.h"
|
||||||
|
#include "pack.h"
|
||||||
|
#include "packalgo.h"
|
||||||
|
#include "utility.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Tree
|
||||||
|
*/
|
||||||
|
template<typename...> struct Tree;
|
||||||
|
|
||||||
|
template<typename N, typename... Cs>
|
||||||
|
struct Tree<N, Cs...> {
|
||||||
|
using node = N;
|
||||||
|
using children = Pack<Cs...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct Tree<> {};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeNode
|
||||||
|
*
|
||||||
|
* for use in flat tree representations
|
||||||
|
*/
|
||||||
|
enum class TreeNodeType { Branch, Leaf };
|
||||||
|
template<Depth D, typename T, TreeNodeType N>
|
||||||
|
struct TreeNode {
|
||||||
|
static constexpr Depth depth = D;
|
||||||
|
using type = T;
|
||||||
|
static constexpr TreeNodeType nodeType = N;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, TreeNodeType NT = TreeNodeType::Branch>
|
||||||
|
using TreeRoot = TreeNode<0, T, NT>;
|
||||||
|
|
||||||
|
template<Depth D, typename T>
|
||||||
|
using TreeBranch = TreeNode<D, T, TreeNodeType::Branch>;
|
||||||
|
|
||||||
|
template<Depth D, typename T>
|
||||||
|
using TreeLeaf = TreeNode<D, T, TreeNodeType::Leaf>;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeIsLeaf
|
||||||
|
*/
|
||||||
|
template<typename> struct TreeIsLeafImpl: std::true_type {};
|
||||||
|
template<typename... Ts>
|
||||||
|
struct TreeIsLeafImpl<Tree<Ts...>>: std::false_type {};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
constexpr bool TreeIsLeaf = TreeIsLeafImpl<T>::value;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* PackFromTreeNLR
|
||||||
|
*
|
||||||
|
* creates a pack from a tree using NLR
|
||||||
|
* tree traversal algorithm
|
||||||
|
*/
|
||||||
|
template<typename, Depth=0> struct PackFromTreeNLRImpl;
|
||||||
|
|
||||||
|
template<typename N, typename... LRs, Depth D>
|
||||||
|
struct PackFromTreeNLRImpl<Tree<N, LRs...>, D> {
|
||||||
|
using type = PackPushFront<
|
||||||
|
PackCat<typename PackFromTreeNLRImpl<LRs, D+1>::type...>,
|
||||||
|
TreeBranch<D, N>
|
||||||
|
>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename N, Depth D>
|
||||||
|
struct PackFromTreeNLRImpl<Tree<N>, D> {
|
||||||
|
using type = Pack<TreeLeaf<D, N>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<Depth D>
|
||||||
|
struct PackFromTreeNLRImpl<Tree<>, D> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, Depth D = 0>
|
||||||
|
using PackFromTreeNLR = typename PackFromTreeNLRImpl<T, D>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeFromPackNLR
|
||||||
|
*
|
||||||
|
* creates a tree from a pack
|
||||||
|
* reverses PackFromTreeNLR
|
||||||
|
*/
|
||||||
|
namespace detail {
|
||||||
|
|
||||||
|
template<Depth D, typename T>
|
||||||
|
using PartialTree = Pack<std::integral_constant<decltype(D), D>, T>;
|
||||||
|
|
||||||
|
template<Depth LIM>
|
||||||
|
struct GreaterThan {
|
||||||
|
template<typename T, typename=void> struct CmpImpl;
|
||||||
|
template<Depth D, typename T>
|
||||||
|
struct CmpImpl<PartialTree<D, T>>: std::integral_constant<bool, (D > LIM)> {};
|
||||||
|
template<typename T>
|
||||||
|
struct CmpImpl<T>: std::true_type {};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using Cmp = CmpImpl<T>;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/* property:
|
||||||
|
* one block either groups future blocks or
|
||||||
|
* has a bigger or equal depth than following
|
||||||
|
*
|
||||||
|
* property:
|
||||||
|
* the list of depths when building is always
|
||||||
|
* decreasing (quite easy to demonstrate)
|
||||||
|
*/
|
||||||
|
template<typename, typename=void> struct TreeFromPackNLRImpl;
|
||||||
|
|
||||||
|
template<Depth D, typename T, typename... Ns>
|
||||||
|
struct TreeFromPackNLRImpl<Pack<TreeBranch<D, T>, Ns...>, std::enable_if_t<D != 0>> {
|
||||||
|
using next = typename TreeFromPackNLRImpl<Pack<Ns...>>::subtree;
|
||||||
|
using cutd = Cut<next, detail::GreaterThan<D>::template Cmp>;
|
||||||
|
using children = Transform<PackGet<cutd, 0>, Bind2ndV<Size, PackGet, 1>::template F>;
|
||||||
|
using siblings = PackGet<cutd, 1>;
|
||||||
|
using part = detail::PartialTree<D, Repack<Tree, PackPushFront<children, T>>>;
|
||||||
|
using subtree = PackPushFront<siblings, part>;
|
||||||
|
|
||||||
|
using type = Repack<Tree, subtree>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, TreeNodeType NT, typename... Ns>
|
||||||
|
struct TreeFromPackNLRImpl<Pack<TreeRoot<T, NT>, Ns...>> {
|
||||||
|
using next = typename TreeFromPackNLRImpl<Pack<Ns...>>::subtree;
|
||||||
|
using children = Transform<next, Bind2ndV<Size, PackGet, 1>::template F>;
|
||||||
|
using subtree = PackPushFront<children, T>;
|
||||||
|
using type = Repack<Tree, subtree>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<Depth D, typename T, typename... Ns>
|
||||||
|
struct TreeFromPackNLRImpl<Pack<TreeLeaf<D, T>, Ns...>, std::enable_if_t<D != 0>> {
|
||||||
|
using part = detail::PartialTree<D, Tree<T>>;
|
||||||
|
using subtree = PackPushFront<typename TreeFromPackNLRImpl<Pack<Ns...>>::subtree, part>;
|
||||||
|
using type = Repack<Tree, subtree>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct TreeFromPackNLRImpl<Pack<>> {
|
||||||
|
using subtree = Pack<>;
|
||||||
|
using type = Repack<Tree, subtree>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename P>
|
||||||
|
using TreeFromPackNLR = typename TreeFromPackNLRImpl<P>::type;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
107
src/treealgo.h
Normal file
107
src/treealgo.h
Normal file
@ -0,0 +1,107 @@
|
|||||||
|
#ifndef TMP_TREEALGO_H
|
||||||
|
#define TMP_TREEALGO_H
|
||||||
|
|
||||||
|
#include "packalgo.h"
|
||||||
|
#include "tree.h"
|
||||||
|
#include "utility.h"
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeTransform
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename...> class> struct TreeTransformImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, template<typename...> class F>
|
||||||
|
struct TreeTransformImpl<Tree<T, Ts...>, F> {
|
||||||
|
using type = Tree<F<T>, typename TreeTransformImpl<Ts, F>::type...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F>
|
||||||
|
struct TreeTransformImpl<Tree<>, F> {
|
||||||
|
using type = Tree<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, template<typename...> class F>
|
||||||
|
using TreeTransform = typename TreeTransformImpl<T, F>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeAccumulate
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename...> class, typename> struct TreeAccumulateImpl;
|
||||||
|
|
||||||
|
template<typename T, typename... Ts, template<typename...> class F, typename A>
|
||||||
|
struct TreeAccumulateImpl<Tree<T, Ts...>, F, A> {
|
||||||
|
using type = F<T, typename TreeAccumulateImpl<Ts, F, A>::type...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, template<typename...> class F, typename A>
|
||||||
|
struct TreeAccumulateImpl<Tree<T>, F, A> {
|
||||||
|
using type = F<T, A>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<template<typename...> class F, typename A>
|
||||||
|
struct TreeAccumulateImpl<Tree<>, F, A> {
|
||||||
|
using type = A;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T, template<typename...> class F, typename A>
|
||||||
|
using TreeAccumulate = typename TreeAccumulateImpl<T, F, A>::type;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeNLRAccumulate
|
||||||
|
*/
|
||||||
|
template<typename T, template<typename, typename> class F, typename A>
|
||||||
|
using TreeNLRAccumulate = Accumulate<Transform<PackFromTreeNLR<T>, GetType>, F, A>;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeHeight
|
||||||
|
*/
|
||||||
|
template<typename T>
|
||||||
|
struct TreeHeightImpl {
|
||||||
|
template<typename, typename... Ts>
|
||||||
|
using CalcHeight = std::integral_constant<Depth, 1 + detail::Max<Ts::type::value...>>;
|
||||||
|
using CalcHeightDefault = std::integral_constant<Depth, -1>;
|
||||||
|
|
||||||
|
static constexpr Depth value = TreeAccumulate<T, CalcHeight, CalcHeightDefault>::value;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
constexpr Depth TreeHeight = TreeHeightImpl<T>::value;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* TreeAllRTLPaths
|
||||||
|
*/
|
||||||
|
namespace detail {
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
struct PackPushFronter {
|
||||||
|
template<typename P>
|
||||||
|
using Do = PackPushFront<P, T>;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename> struct TreeAllRTLPathsImpl;
|
||||||
|
|
||||||
|
template<typename N, typename... Cs>
|
||||||
|
struct TreeAllRTLPathsImpl<Tree<N, Cs...>> {
|
||||||
|
using type = PackCat<Transform<typename TreeAllRTLPathsImpl<Cs>::type, Bind2nd<PackPushFront, N>::template F>...>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename N>
|
||||||
|
struct TreeAllRTLPathsImpl<Tree<N>> {
|
||||||
|
using type = Pack<Pack<N>>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<>
|
||||||
|
struct TreeAllRTLPathsImpl<Tree<>> {
|
||||||
|
using type = Pack<>;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using TreeAllRTLPaths = typename TreeAllRTLPathsImpl<T>::type;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
30
src/utility.h
Normal file
30
src/utility.h
Normal file
@ -0,0 +1,30 @@
|
|||||||
|
#ifndef TMP_UTILITY_H
|
||||||
|
#define TMP_UTILITY_H
|
||||||
|
|
||||||
|
#include <type_traits>
|
||||||
|
|
||||||
|
namespace tmp {
|
||||||
|
|
||||||
|
using Size = decltype(sizeof 0);
|
||||||
|
|
||||||
|
using Depth = signed long long int;
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
using GetType = typename T::type;
|
||||||
|
|
||||||
|
namespace detail {
|
||||||
|
|
||||||
|
template<Depth V, Depth... Vs>
|
||||||
|
struct MaxImpl: std::integral_constant<Depth, (V>MaxImpl<Vs...>::value? V:MaxImpl<Vs...>::value)> {};
|
||||||
|
|
||||||
|
template<Depth V>
|
||||||
|
struct MaxImpl<V>: std::integral_constant<decltype(V), V> {};
|
||||||
|
|
||||||
|
template<Depth... Vs>
|
||||||
|
constexpr Depth Max = MaxImpl<Vs...>::value;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
3
tests/catch_tmp.h
Normal file
3
tests/catch_tmp.h
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
#include <catch.hpp>
|
||||||
|
|
||||||
|
#define REQUIRE_SAME(T0, T1) REQUIRE(std::is_same<T0, T1>{})
|
||||||
39
tests/debug.cpp
Normal file
39
tests/debug.cpp
Normal file
@ -0,0 +1,39 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <debug.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
#if defined(__clang__)
|
||||||
|
TEST_CASE("typeName") {
|
||||||
|
REQUIRE("void" == std::string{typeName<void>()});
|
||||||
|
REQUIRE("int &" == std::string{typeName<int&>()});
|
||||||
|
REQUIRE("int *" == std::string{typeName<int*>()});
|
||||||
|
REQUIRE("const int" == std::string{typeName<int const>()});
|
||||||
|
REQUIRE("int *const &" == std::string{typeName<int* const&>()});
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("strTypes") {
|
||||||
|
REQUIRE("" == strTypes());
|
||||||
|
REQUIRE("int" == strTypes<int>());
|
||||||
|
REQUIRE("int" == strTypes<>(0));
|
||||||
|
REQUIRE("char, int" == strTypes<char>(0));
|
||||||
|
}
|
||||||
|
#elif defined(__GNUC__)
|
||||||
|
TEST_CASE("typeName") {
|
||||||
|
REQUIRE("void" == std::string{typeName<void>()});
|
||||||
|
REQUIRE("int&" == std::string{typeName<int&>()});
|
||||||
|
REQUIRE("int*" == std::string{typeName<int*>()});
|
||||||
|
REQUIRE("const int" == std::string{typeName<int const>()});
|
||||||
|
REQUIRE("int* const&" == std::string{typeName<int* const&>()});
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("strTypes") {
|
||||||
|
REQUIRE("" == strTypes());
|
||||||
|
REQUIRE("int" == strTypes<int>());
|
||||||
|
REQUIRE("int" == strTypes<>(0));
|
||||||
|
REQUIRE("char, int" == strTypes<char>(0));
|
||||||
|
}
|
||||||
|
#elif defined(__MSC_VER)
|
||||||
|
TEST_CASE("typeName") {}
|
||||||
|
TEST_CASE("strTypes") {}
|
||||||
|
#endif
|
||||||
2
tests/main.cpp
Normal file
2
tests/main.cpp
Normal file
@ -0,0 +1,2 @@
|
|||||||
|
#define CATCH_CONFIG_MAIN
|
||||||
|
#include <catch.hpp>
|
||||||
154
tests/pack.cpp
Normal file
154
tests/pack.cpp
Normal file
@ -0,0 +1,154 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <pack.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
template<typename...> struct MyPack {};
|
||||||
|
|
||||||
|
TEST_CASE("PackHead") {
|
||||||
|
using P = Pack<void>;
|
||||||
|
REQUIRE_SAME(void, PackHead<P>);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackTrail") {
|
||||||
|
SECTION("empty trail") {
|
||||||
|
using P = Pack<void>;
|
||||||
|
REQUIRE_SAME(Pack<>, PackTrail<P>);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using P = Pack<void, bool, char, int>;
|
||||||
|
using Expected = Pack<bool, char, int>;
|
||||||
|
REQUIRE_SAME(Expected, PackTrail<P>);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackGet") {
|
||||||
|
using P = Pack<void, bool, char, int>;
|
||||||
|
|
||||||
|
using P0 = PackGet<P, 0>;
|
||||||
|
using P1 = PackGet<P, 1>;
|
||||||
|
using P2 = PackGet<P, 2>;
|
||||||
|
using P3 = PackGet<P, 3>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(void, P0);
|
||||||
|
REQUIRE_SAME(bool, P1);
|
||||||
|
REQUIRE_SAME(char, P2);
|
||||||
|
REQUIRE_SAME(int, P3);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackPushFront") {
|
||||||
|
SECTION("empty pack") {
|
||||||
|
using Result = PackPushFront<Pack<>, void>;
|
||||||
|
REQUIRE_SAME(Pack<void>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<bool, char>;
|
||||||
|
using Result = PackPushFront<Input, void>;
|
||||||
|
using Expected = Pack<void, bool, char>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackPushBack") {
|
||||||
|
SECTION("empty pack") {
|
||||||
|
using Result = PackPushBack<Pack<>, void>;
|
||||||
|
REQUIRE_SAME(Pack<void>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<bool, char>;
|
||||||
|
using Result = PackPushBack<Input, void>;
|
||||||
|
using Expected = Pack<bool, char, void>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackCat") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = PackCat<Pack<>, Pack<>>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty lhs") {
|
||||||
|
using Result = PackCat<Pack<>, Pack<void>>;
|
||||||
|
REQUIRE_SAME(Pack<void>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty rhs") {
|
||||||
|
using Result = PackCat<Pack<void>, Pack<>>;
|
||||||
|
REQUIRE_SAME(Pack<void>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Result = PackCat<Pack<void, char>, Pack<int, int, int>>;
|
||||||
|
using Expected = Pack<void, char, int, int, int>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackReverse") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = PackReverse<Pack<>>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("one element") {
|
||||||
|
using Result = PackReverse<Pack<void>>;
|
||||||
|
REQUIRE_SAME(Pack<void>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Result = PackReverse<Pack<void, char, int, int, int>>;
|
||||||
|
using Expected = Pack<int, int, int, char, void>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("PackReplace") {
|
||||||
|
SECTION("empty pack") {
|
||||||
|
using Result = PackReplace<Pack<>, void, bool>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<void, bool, char, void, char, void>;
|
||||||
|
using Result = PackReplace<Input, void, bool>;
|
||||||
|
using Expected = Pack<bool, bool, char, bool, char, bool>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Repack") {
|
||||||
|
SECTION("empty pack") {
|
||||||
|
using Result = Repack<MyPack, Pack<>>;
|
||||||
|
REQUIRE_SAME(MyPack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<void, void, void>;
|
||||||
|
using Result = Repack<MyPack, Input>;
|
||||||
|
using Expected = MyPack<void, void, void>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("AsPack") {
|
||||||
|
SECTION("empty pack") {
|
||||||
|
using Result = Repack<Pack, MyPack<>>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = MyPack<void, void, void>;
|
||||||
|
using Result = Repack<Pack, Input>;
|
||||||
|
using Expected = Pack<void, void, void>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
149
tests/packalgo.cpp
Normal file
149
tests/packalgo.cpp
Normal file
@ -0,0 +1,149 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <algorithm.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
template<unsigned N = 0> struct UInt { static constexpr unsigned value = N; };
|
||||||
|
|
||||||
|
template<typename T> struct IdentityImpl { using type = T; };
|
||||||
|
template<typename T> using Identity = typename IdentityImpl<T>::type;
|
||||||
|
|
||||||
|
template<typename> struct UnpackImpl;
|
||||||
|
template<typename T> struct UnpackImpl<Pack<T>> { using type = T; };
|
||||||
|
template<typename T> using Unpack = typename UnpackImpl<T>::type;
|
||||||
|
|
||||||
|
template<typename T> struct SizeofImpl { using type = UInt<sizeof(T)>; };
|
||||||
|
template<typename T> using Sizeof = typename SizeofImpl<T>::type;
|
||||||
|
|
||||||
|
template<typename P0, typename P1> using Merge = PackCat<P0, P1>;
|
||||||
|
|
||||||
|
template<typename U0, typename U1> struct USumImpl { using type = UInt<U0::value+U1::value>; };
|
||||||
|
template<typename U0, typename U1> using USum = typename USumImpl<U0, U1>::type;
|
||||||
|
|
||||||
|
template<typename T> struct IsEven: std::integral_constant<bool, not(T::value & 1)> {};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Transform") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = Transform<Pack<>, Identity>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
using Input0 = Pack<Pack<char>, Pack<float>, Pack<int>>;
|
||||||
|
using Input1 = Pack<bool, char, short, int, long, long long>;
|
||||||
|
|
||||||
|
SECTION("Identity") {
|
||||||
|
REQUIRE(std::is_same<Input0, Transform<Input0, Identity>>{});
|
||||||
|
REQUIRE(std::is_same<Input1, Transform<Input1, Identity>>{});
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("Unpack") {
|
||||||
|
using Expected = Pack<char, float, int>;
|
||||||
|
using Result = Transform<Input0, Unpack>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("Sizeof") {
|
||||||
|
using Expected = Pack<UInt<sizeof(bool)>, UInt<sizeof(char)>, UInt<sizeof(short)>, UInt<sizeof(int)>, UInt<sizeof(long)>, UInt<sizeof(long long)>>;
|
||||||
|
using Result = Transform<Input1, Sizeof>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Accumulate") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = Accumulate<Pack<>, PackCat, void>;
|
||||||
|
REQUIRE_SAME(void, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
using Input0 = Pack<Pack<char>, Pack<float>, Pack<int>>;
|
||||||
|
using Input1 = Pack<bool, char, short, int, long, long long>;
|
||||||
|
|
||||||
|
SECTION("PackCat") {
|
||||||
|
using Expected = Pack<char, float, int>;
|
||||||
|
using Result = Accumulate<Input0, PackCat, Pack<>>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("USum") {
|
||||||
|
using Expected = UInt<sizeof(bool)+sizeof(char)+sizeof(short)+sizeof(int)+sizeof(long)+sizeof(long long)>;
|
||||||
|
using Result = Accumulate<Transform<Input1, Sizeof>, USum, UInt<>>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Filter") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Expected = Pack<>;
|
||||||
|
using Result = Filter<Pack<>, IsEven>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty output") {
|
||||||
|
using Input = Pack<UInt<1>, UInt<3>, UInt<3>, UInt<5>, UInt<5>, UInt<7>>;
|
||||||
|
using Expected = Pack<>;
|
||||||
|
using Result = Filter<Input, IsEven>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<UInt<1>, UInt<2>, UInt<3>, UInt<4>, UInt<5>, UInt<6>>;
|
||||||
|
using Expected = Pack<UInt<2>, UInt<4>, UInt<6>>;
|
||||||
|
using Result = Filter<Input, IsEven>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Cut") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Expected = Pack<Pack<>, Pack<>>;
|
||||||
|
using Result = Cut<Pack<>, IsEven>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty left output") {
|
||||||
|
using Input = Pack<UInt<1>, UInt<3>, UInt<3>, UInt<5>, UInt<5>, UInt<7>>;
|
||||||
|
using Expected = Pack<Pack<>, Input>;
|
||||||
|
using Result = Cut<Input, IsEven>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty right output") {
|
||||||
|
using Input = Pack<UInt<2>, UInt<4>, UInt<4>, UInt<6>, UInt<6>, UInt<8>>;
|
||||||
|
using Expected = Pack<Input, Pack<>>;
|
||||||
|
using Result = Cut<Input, IsEven>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<UInt<2>, UInt<2>, UInt<3>, UInt<3>, UInt<5>, UInt<7>>;
|
||||||
|
using Expected = Pack<Pack<UInt<2>, UInt<2>>, Pack<UInt<3>, UInt<3>, UInt<5>, UInt<7>>>;
|
||||||
|
using Result = Cut<Input, IsEven>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Reverse") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
REQUIRE_SAME(Pack<>, Reverse<Pack<>>);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("one element") {
|
||||||
|
REQUIRE_SAME(Pack<void>, Reverse<Pack<void>>);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Input = Pack<bool, char, short, int, long>;
|
||||||
|
using Expected = Pack<long, int, short, char, bool>;
|
||||||
|
using Result = Reverse<Input>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
74
tests/traits.cpp
Normal file
74
tests/traits.cpp
Normal file
@ -0,0 +1,74 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <traits.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
TEST_CASE("void_t") {}
|
||||||
|
TEST_CASE("Void") {}
|
||||||
|
|
||||||
|
TEST_CASE("ReturnType") {
|
||||||
|
REQUIRE_SAME(void, ReturnType<void()>);
|
||||||
|
REQUIRE_SAME(void, ReturnType<void(int)>);
|
||||||
|
REQUIRE_SAME(bool, ReturnType<bool()>);
|
||||||
|
REQUIRE_SAME(bool&, ReturnType<bool&()>);
|
||||||
|
REQUIRE_SAME(bool const&, ReturnType<bool const&()>);
|
||||||
|
REQUIRE_SAME(void*, ReturnType<void*()>);
|
||||||
|
REQUIRE_SAME(void const*, ReturnType<void const*()>);
|
||||||
|
REQUIRE_SAME(void const*&, ReturnType<void const*&()>);
|
||||||
|
REQUIRE_SAME(void const* const&, ReturnType<void const* const&()>);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("Parameters") {
|
||||||
|
REQUIRE_SAME(Pack<>, Parameters<void()>);
|
||||||
|
|
||||||
|
SECTION("single parameter") {
|
||||||
|
REQUIRE_SAME(Pack<int>, Parameters<void(int)>);
|
||||||
|
|
||||||
|
REQUIRE_SAME(Pack<int>, Parameters<void(int const)>);
|
||||||
|
|
||||||
|
REQUIRE_SAME(Pack<int&>, Parameters<void(int&)>);
|
||||||
|
REQUIRE_SAME(Pack<int const&>, Parameters<void(int const&)>);
|
||||||
|
REQUIRE_SAME(Pack<int*>, Parameters<void(int*)>);
|
||||||
|
REQUIRE_SAME(Pack<int const*>, Parameters<void(int const*)>);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("multiple parameters") {
|
||||||
|
using Input = void(void*, char, bool, int);
|
||||||
|
using Result = Parameters<Input>;
|
||||||
|
using Expected = Pack<void*, char, bool, int>;
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("invoke_result_t") {}
|
||||||
|
|
||||||
|
TEST_CASE("FunctionCat") {
|
||||||
|
SECTION("empty lhs and rhs") {
|
||||||
|
using Result = FunctionCat<void(), void()>;
|
||||||
|
using Expected = void();
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty lhs") {
|
||||||
|
using Result = FunctionCat<void(), void(char)>;
|
||||||
|
using Expected = void(char);
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("empty rhs") {
|
||||||
|
using Result = FunctionCat<void(char), void()>;
|
||||||
|
using Expected = void(char);
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Result = FunctionCat<void(char, int), void(bool, char)>;
|
||||||
|
using Expected = void(char, int, bool, char);
|
||||||
|
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
57
tests/tree.cpp
Normal file
57
tests/tree.cpp
Normal file
@ -0,0 +1,57 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <tree.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
struct A {};
|
||||||
|
struct B {};
|
||||||
|
struct C {};
|
||||||
|
struct D {};
|
||||||
|
struct E {};
|
||||||
|
struct F {};
|
||||||
|
struct G {};
|
||||||
|
struct H {};
|
||||||
|
struct I {};
|
||||||
|
|
||||||
|
using T0 = Tree<>;
|
||||||
|
using T1 = Tree<A>;
|
||||||
|
using T2 = Tree<A, Tree<B>, Tree<C>>;
|
||||||
|
using T3 = Tree<A, Tree<B, Tree<C>, Tree<D>, Tree<E>>, Tree<F, Tree<G>>>;
|
||||||
|
using T4 = Tree<A,
|
||||||
|
Tree<B, Tree<C, Tree<D>, Tree<E>>>,
|
||||||
|
Tree<F, Tree<G, Tree<H>>>,
|
||||||
|
Tree<I>
|
||||||
|
>;
|
||||||
|
|
||||||
|
TEST_CASE("NLR") {
|
||||||
|
using P0 = Pack<>;
|
||||||
|
using P1 = Pack<TreeRoot<A, TreeNodeType::Leaf>>;
|
||||||
|
using P2 = Pack<TreeRoot<A>, TreeLeaf<1, B>, TreeLeaf<1, C>>;
|
||||||
|
using P3 = Pack<
|
||||||
|
TreeRoot<A>,
|
||||||
|
TreeBranch<1, B>, TreeLeaf<2, C>, TreeLeaf<2, D>, TreeLeaf<2, E>,
|
||||||
|
TreeBranch<1, F>, TreeLeaf<2, G>
|
||||||
|
>;
|
||||||
|
using P4 = Pack<
|
||||||
|
TreeRoot<A>,
|
||||||
|
TreeBranch<1, B>, TreeBranch<2, C>, TreeLeaf<3, D>, TreeLeaf<3, E>,
|
||||||
|
TreeBranch<1, F>, TreeBranch<2, G>, TreeLeaf<3, H>,
|
||||||
|
TreeLeaf<1, I>
|
||||||
|
>;
|
||||||
|
|
||||||
|
SECTION("PackFromTree") {
|
||||||
|
REQUIRE_SAME(P0, PackFromTreeNLR<T0>);
|
||||||
|
REQUIRE_SAME(P1, PackFromTreeNLR<T1>);
|
||||||
|
REQUIRE_SAME(P2, PackFromTreeNLR<T2>);
|
||||||
|
REQUIRE_SAME(P3, PackFromTreeNLR<T3>);
|
||||||
|
REQUIRE_SAME(P4, PackFromTreeNLR<T4>);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("TreeFromPack") {
|
||||||
|
REQUIRE_SAME(T0, TreeFromPackNLR<P0>);
|
||||||
|
REQUIRE_SAME(T1, TreeFromPackNLR<P1>);
|
||||||
|
REQUIRE_SAME(T2, TreeFromPackNLR<P2>);
|
||||||
|
REQUIRE_SAME(T3, TreeFromPackNLR<P3>);
|
||||||
|
REQUIRE_SAME(T4, TreeFromPackNLR<P4>);
|
||||||
|
}
|
||||||
|
}
|
||||||
122
tests/treealgo.cpp
Normal file
122
tests/treealgo.cpp
Normal file
@ -0,0 +1,122 @@
|
|||||||
|
#include "catch_tmp.h"
|
||||||
|
#include <treealgo.h>
|
||||||
|
|
||||||
|
using namespace tmp;
|
||||||
|
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
template<typename T> struct IdentityImpl { using type = T; };
|
||||||
|
template<typename T> using Identity = typename IdentityImpl<T>::type;
|
||||||
|
|
||||||
|
template<typename> struct UnpackImpl;
|
||||||
|
template<typename T> struct UnpackImpl<Pack<T>> { using type = T; };
|
||||||
|
template<typename T> using Unpack = typename UnpackImpl<T>::type;
|
||||||
|
|
||||||
|
template<unsigned...> struct Unsigneds;
|
||||||
|
template<typename, typename> struct MakeSizeListImpl;
|
||||||
|
template<unsigned... Us, typename T> struct MakeSizeListImpl<Unsigneds<Us...>, T> { using type = Unsigneds<Us..., sizeof(T)>; };
|
||||||
|
template<typename U, typename T> using MakeSizeList = typename MakeSizeListImpl<U, T>::type;
|
||||||
|
|
||||||
|
|
||||||
|
template<typename, typename... Ts>
|
||||||
|
using CalcHeight = std::integral_constant<Depth, 1 + detail::Max<Ts::type::value...>>;
|
||||||
|
|
||||||
|
struct A {};
|
||||||
|
struct B {};
|
||||||
|
struct C {};
|
||||||
|
struct D {};
|
||||||
|
struct E {};
|
||||||
|
struct F {};
|
||||||
|
struct G {};
|
||||||
|
struct H {};
|
||||||
|
struct I {};
|
||||||
|
|
||||||
|
using T0 = Tree<>;
|
||||||
|
using T1 = Tree<A>;
|
||||||
|
using T2 = Tree<A, Tree<B>, Tree<C>>;
|
||||||
|
using T3 = Tree<A, Tree<B, Tree<C>, Tree<D>, Tree<E>>, Tree<F, Tree<G>>>;
|
||||||
|
using T4 = Tree<A,
|
||||||
|
Tree<B, Tree<C, Tree<D>, Tree<E>>>,
|
||||||
|
Tree<F, Tree<G, Tree<H>>>,
|
||||||
|
Tree<I>
|
||||||
|
>;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("TreeTransform") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = TreeTransform<Tree<>, Identity>;
|
||||||
|
REQUIRE_SAME(Tree<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
using Input1 = Tree<Pack<char>>;
|
||||||
|
using Input2 = Tree<Pack<bool>, Tree<Pack<char>, Tree<Pack<int>>>, Tree<Pack<long>>>;
|
||||||
|
|
||||||
|
SECTION("Identity") {
|
||||||
|
REQUIRE(std::is_same<Input1, TreeTransform<Input1, Identity>>{});
|
||||||
|
REQUIRE(std::is_same<Input2, TreeTransform<Input2, Identity>>{});
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("Unpack") {
|
||||||
|
using Expected = Tree<bool, Tree<char, Tree<int>>, Tree<long>>;
|
||||||
|
using Result = TreeTransform<Input2, Unpack>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("TreeAccumulate") {
|
||||||
|
using Default = std::integral_constant<Depth, -1>;
|
||||||
|
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = TreeAccumulate<Tree<>, CalcHeight, Default>;
|
||||||
|
REQUIRE_SAME(Default, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("Unpack") {
|
||||||
|
REQUIRE(0 == TreeAccumulate<T1, CalcHeight, Default>::value);
|
||||||
|
REQUIRE(1 == TreeAccumulate<T2, CalcHeight, Default>::value);
|
||||||
|
REQUIRE(1 == TreeAccumulate<Tree<Tree<T1>, T1, T1>, CalcHeight, Default>::value);
|
||||||
|
REQUIRE(2 == TreeAccumulate<T3, CalcHeight, Default>::value);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("TreeNLRAccumulate") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = TreeNLRAccumulate<Tree<>, MakeSizeList, void>;
|
||||||
|
REQUIRE_SAME(void, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("MakeSizeList") {
|
||||||
|
using Input = Tree<char, Tree<int, Tree<long long>>, Tree<float>, Tree<double>>;
|
||||||
|
using Expected = Unsigneds<sizeof(char), sizeof(int), sizeof(long long), sizeof(float), sizeof(double)>;
|
||||||
|
using Result = TreeNLRAccumulate<Input, MakeSizeList, Unsigneds<>>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("TreeHeight") {
|
||||||
|
REQUIRE(-1 == TreeHeight<T0>);
|
||||||
|
REQUIRE(0 == TreeHeight<T1>);
|
||||||
|
REQUIRE(1 == TreeHeight<T2>);
|
||||||
|
REQUIRE(1 == TreeHeight<Tree<Tree<T1>, T1, T1>>);
|
||||||
|
REQUIRE(2 == TreeHeight<T3>);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("TreeAllRTLPaths") {
|
||||||
|
SECTION("empty input") {
|
||||||
|
using Result = TreeAllRTLPaths<T0>;
|
||||||
|
REQUIRE_SAME(Pack<>, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("only root") {
|
||||||
|
using Expected = Pack<Pack<A>>;
|
||||||
|
using Result = TreeAllRTLPaths<T1>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("general case") {
|
||||||
|
using Expected = Pack<Pack<A,B,C,D>, Pack<A,B,C,E>, Pack<A,F,G,H>, Pack<A,I>>;
|
||||||
|
using Result = TreeAllRTLPaths<T4>;
|
||||||
|
REQUIRE_SAME(Expected, Result);
|
||||||
|
}
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue
Block a user