Browse Source

Merge branch 'master' into dft_to_gspn

tempestpy_adaptions
Matthias Volk 8 years ago
parent
commit
c1acf22f5f
  1. 46
      CMakeLists.txt
  2. 44
      Jenkinsfile
  3. 910
      LICENSE
  4. 24
      README
  5. 3
      README.md
  6. 6
      StormCPackConfig.cmake
  7. 6
      doc/build.md
  8. 76
      resources/3rdparty/CMakeLists.txt
  9. 4
      resources/3rdparty/cpptemplate/cpptempl.h
  10. 99
      resources/3rdparty/cudd-3.0.0/cplusplus/cuddObj.cc
  11. 10
      resources/3rdparty/cudd-3.0.0/cplusplus/cuddObj.hh
  12. 13
      resources/3rdparty/cudd-3.0.0/cudd/cudd.h
  13. 15
      resources/3rdparty/cudd-3.0.0/cudd/cuddAPI.c
  14. 581
      resources/3rdparty/cudd-3.0.0/cudd/cuddAddAbs.c
  15. 364
      resources/3rdparty/cudd-3.0.0/cudd/cuddAddApply.c
  16. 239
      resources/3rdparty/cudd-3.0.0/cudd/cuddBddAbs.c
  17. 5
      resources/3rdparty/cudd-3.0.0/cudd/cuddInt.h
  18. 5
      resources/3rdparty/cudd-3.0.0/cudd/cuddSat.c
  19. 2
      resources/3rdparty/eigen-3.3-beta1/COPYING.BSD
  20. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/Core
  21. 8
      resources/3rdparty/eigen-3.3-beta1/Eigen/QtAlignedMalloc
  22. 2
      resources/3rdparty/eigen-3.3-beta1/Eigen/SuperLUSupport
  23. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LDLT.h
  24. 8
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LLT.h
  25. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LLT_MKL.h
  26. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/CholmodSupport/CholmodSupport.h
  27. 10
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Array.h
  28. 8
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ArrayBase.h
  29. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ArrayWrapper.h
  30. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Assign.h
  31. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/AssignEvaluator.h
  32. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Assign_MKL.h
  33. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/BandMatrix.h
  34. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Block.h
  35. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/BooleanRedux.h
  36. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CommaInitializer.h
  37. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CoreEvaluators.h
  38. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CoreIterators.h
  39. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseBinaryOp.h
  40. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseNullaryOp.h
  41. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseUnaryOp.h
  42. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseUnaryView.h
  43. 12
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseBase.h
  44. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseCoeffsBase.h
  45. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseStorage.h
  46. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Diagonal.h
  47. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DiagonalMatrix.h
  48. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DiagonalProduct.h
  49. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Dot.h
  50. 8
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/EigenBase.h
  51. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ForceAlignedAccess.h
  52. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Fuzzy.h
  53. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GeneralProduct.h
  54. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GenericPacketMath.h
  55. 36
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GlobalFunctions.h
  56. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/IO.h
  57. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Inverse.h
  58. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Map.h
  59. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MapBase.h
  60. 8
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MathFunctions.h
  61. 16
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Matrix.h
  62. 14
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MatrixBase.h
  63. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NestByValue.h
  64. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NoAlias.h
  65. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NumTraits.h
  66. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/PermutationMatrix.h
  67. 30
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/PlainObjectBase.h
  68. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Product.h
  69. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ProductEvaluators.h
  70. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Random.h
  71. 14
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Redux.h
  72. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Ref.h
  73. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Replicate.h
  74. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ReturnByValue.h
  75. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Reverse.h
  76. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Select.h
  77. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SelfAdjointView.h
  78. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SelfCwiseBinaryOp.h
  79. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Solve.h
  80. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SolveTriangular.h
  81. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SolverBase.h
  82. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SpecialFunctions.h
  83. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/StableNorm.h
  84. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Stride.h
  85. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Swap.h
  86. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Transpose.h
  87. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Transpositions.h
  88. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/TriangularMatrix.h
  89. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/VectorBlock.h
  90. 6
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/VectorwiseOp.h
  91. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Visitor.h
  92. 12
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/Complex.h
  93. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/MathFunctions.h
  94. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/PacketMath.h
  95. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/TypeCasting.h
  96. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/Complex.h
  97. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/MathFunctions.h
  98. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/PacketMath.h
  99. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/CUDA/MathFunctions.h
  100. 4
      resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/CUDA/PacketMath.h

46
CMakeLists.txt

@ -23,7 +23,9 @@ include(imported)
#############################################################
option(STORM_DEVELOPER "Sets whether the development mode is used." OFF)
option(STORM_ALLWARNINGS "Compile with even more warnings" OFF)
option(STORM_PORTABLE_RELEASE "Sets whether a release build needs to be portable to another machine. This is only effective for release builds in non-development mode." OFF)
option(STORM_USE_LTO "Sets whether link-time optimizations are enabled." ON)
MARK_AS_ADVANCED(STORM_USE_LTO)
option(STORM_PORTABLE_RELEASE "Sets whether a release build needs to be portable to another machine." OFF)
MARK_AS_ADVANCED(STORM_PORTABLE_RELEASE)
option(STORM_USE_POPCNT "Sets whether the popcnt instruction is going to be used." ON)
MARK_AS_ADVANCED(STORM_USE_POPCNT)
@ -31,12 +33,13 @@ option(USE_BOOST_STATIC_LIBRARIES "Sets whether the Boost libraries should be li
option(STORM_USE_INTELTBB "Sets whether the Intel TBB libraries should be used." OFF)
option(STORM_USE_GUROBI "Sets whether Gurobi should be used." OFF)
option(USE_CARL "Sets whether carl should be included." ON)
option(STORM_FORCE_SHIPPED_CARL "Sets whether the shipped version of carl is to be used no matter whether carl is found or not." OFF)
MARK_AS_ADVANCED(STORM_FORCE_SHIPPED_CARL)
option(USE_SMTRAT "Sets whether SMT-RAT should be included." OFF)
option(USE_HYPRO "Sets whether HyPro should be included." OFF)
option(XML_SUPPORT "Sets whether xml based format parsing should be included." ON)
option(FORCE_COLOR "Force color output" OFF)
mark_as_advanced(FORCE_COLOR)
option(STORM_PYTHON "Build the API for Python" OFF)
option(STORM_COMPILE_WITH_CCACHE "Compile using CCache [if found]" ON)
mark_as_advanced(STORM_COMPILE_WITH_CCACHE)
option(STORM_LOG_DISABLE_DEBUG "Disable log and trace message support" OFF)
@ -78,6 +81,8 @@ message("CMAKE_INSTALL_DIR: ${CMAKE_INSTALL_DIR}")
if (STORM_DEVELOPER)
set(CMAKE_BUILD_TYPE "DEBUG")
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -DSTORM_DEV")
else()
set(STORM_LOG_DISABLE_DEBUG ON)
endif()
message(STATUS "Storm - Building ${CMAKE_BUILD_TYPE} version.")
@ -132,11 +137,6 @@ endif()
message(STATUS "Assuming extension for shared libraries: ${DYNAMIC_EXT}")
message(STATUS "Assuming extension for static libraries: ${STATIC_EXT}")
# Python bindings need shared library
if(STORM_PYTHON)
set(BUILD_SHARED_LIBS ON CACHE BOOL "Build the Storm library dynamically" FORCE)
endif()
if(BUILD_SHARED_LIBS)
set(LIB_EXT ${DYNAMIC_EXT})
message(STATUS "Build dynamic libraries.")
@ -219,7 +219,7 @@ if (STORM_COMPILER_CLANG OR STORM_COMPILER_APPLECLANG)
endif()
set (CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++14 -stdlib=${CLANG_STDLIB} -ftemplate-depth=1024")
set (CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -flto -ffast-math -fno-finite-math-only")
set (CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -ffast-math -fno-finite-math-only")
set (CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} -Wl,-export_dynamic")
set (CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,-export_dynamic")
elseif (STORM_COMPILER_GCC)
@ -229,6 +229,10 @@ elseif (STORM_COMPILER_GCC)
set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -rdynamic")
endif ()
if (STORM_USE_LTO)
set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -flto")
endif()
# In release mode, we turn on even more optimizations if we do not have to provide a portable binary.
if (NOT STORM_PORTABLE_RELEASE)
set (CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -march=native")
@ -264,6 +268,25 @@ else()
set (CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -fomit-frame-pointer")
endif()
#############################################################
##
## RPATH settings
##
#############################################################
# don't skip the full RPATH for the build tree
SET(CMAKE_SKIP_BUILD_RPATH FALSE)
# when building, don't use the install RPATH already (but only when installing)
SET(CMAKE_BUILD_WITH_INSTALL_RPATH FALSE)
# the RPATH to be used when installing
SET(CMAKE_INSTALL_RPATH "${CMAKE_INSTALL_PREFIX}/lib")
# don't add the automatically determined parts of the RPATH
# which point to directories outside the build tree to the install RPATH
SET(CMAKE_INSTALL_RPATH_USE_LINK_PATH TRUE)
#############################################################
##
## Generator specific settings
@ -360,12 +383,15 @@ set(STORM_GENERATED_SOURCES "${PROJECT_BINARY_DIR}/src/storm/utility/storm-versi
include_directories("${PROJECT_BINARY_DIR}/include")
include(CTest)
# Compiles all tests
add_custom_target(tests)
# Compiles and runs all tests
add_custom_target(check COMMAND ${CMAKE_CTEST_COMMAND})
set(CMAKE_CTEST_COMMAND_VERBOSE ${CMAKE_CTEST_COMMAND} -V)
add_custom_target(check-verbose COMMAND ${CMAKE_CTEST_COMMAND_VERBOSE})
add_dependencies(check tests)
add_dependencies(check-verbose tests)
# Python bindings for storm
set(STORM_TARGETS "")
add_subdirectory(src)

44
Jenkinsfile

@ -0,0 +1,44 @@
node {
def cmakeTool
stage('Preparation') {
// Get some code from a GitHub repository
checkout scm
cmakeTool = tool name: 'InSearchPath', type: 'hudson.plugins.cmake.CmakeTool'
sh "rm -rf build"
sh "mkdir -p build"
}
stage('Configure') {
dir("build") {
sh "${cmakeTool} .."
}
}
stage('Build') {
dir("build") {
sh "make storm"
}
}
stage('Build Tests') {
dir("build") {
sh "make -j 4 tests"
}
}
stage('Test') {
dir("build") {
sh "make check-verbose"
}
}
stage('Archive') {
archiveArtifacts artifacts: 'build/bin/*', onlyIfSuccessful: true
archiveArtifacts artifacts: 'build/lib/*', onlyIfSuccessful: true
archiveArtifacts artifacts: 'build/include/*', onlyIfSuccessful: true
}
}

910
LICENSE

@ -1,285 +1,626 @@
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
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
this service 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.
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 make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
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 give the recipients all the rights that
you have. 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.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
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.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
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.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
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
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
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 a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE 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.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
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
@ -287,15 +628,15 @@ 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
convey the exclusion of warranty; and each file should have at least
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.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; you can redistribute it and/or modify
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 2 of the License, or
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,
@ -304,37 +645,30 @@ the "copyright" line and a pointer to where the full notice is found.
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, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
<program> Copyright (C) <year> <name of author>
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, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This 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 Library General
Public License instead of this License.
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
<http://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
<http://www.gnu.org/philosophy/why-not-lgpl.html>.

24
README

@ -1,24 +0,0 @@
# Create build directory for storm
mkdir build
# Go to build directory
cd build
# Configure the project
cmake ..
# If you want an interactive configuration, try "ccmake ..". Then you can press "c" to initially configure the project, change your values and then press "g" to generate the Makefile
# After generating the Makefile you can build the resources we need for the project
make resources
# Now we build the main project for DFTs
make storm-dft-main
# Last you can run an example
./src/storm-dft -dft ../examples/dft/and.dft -mttf
# To get a list of all available arguments run
./src/storm-dft --help
# Example for DFT to Petri net translation
./src/storm-dft -dft ../examples/dft/and.dft --gspn

3
README.md

@ -1,7 +1,7 @@
Storm
==============================
For more instructions, check out the documentation found in [Getting Started](doc/getting-started.md)
For more instructions, check out the documentation found in [Getting Started](https://moves-rwth.github.io/storm/getting-started.html)
Benchmarks
@ -48,5 +48,6 @@ Storm has been developed at RWTH Aachen University.
* Thomas Henn
* Tom Janson
* Gereon Kremer
* Sascha Vincent Kurowski
* Manuel Sascha Weiand
* Lukas Westhofen

6
StormCPackConfig.cmake

@ -4,9 +4,9 @@ include(InstallRequiredSystemLibraries)
# http://www.cmake.org/Wiki/CMake:CPackConfiguration
### general settings
set(CPACK_PACKAGE_NAME "StoRM")
set(CPACK_PACKAGE_VENDOR "i2 RWTH Aachen University")
set(CPACK_PACKAGE_DESCRIPTION_SUMMARY "Stochastic Reward Model Checker - An extensible model checker written in C++.")
set(CPACK_PACKAGE_NAME "Storm")
set(CPACK_PACKAGE_VENDOR "RWTH Aachen University")
set(CPACK_PACKAGE_DESCRIPTION_SUMMARY "Storm - A probabilistic model checker written in C++.")
set(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_SOURCE_DIR}/LICENSE")

6
doc/build.md

@ -23,9 +23,11 @@ Prerequisites:
## Instructions
### General
> mkdir build
```bash
mkdir build
cd build
```
It is recommended to make an out-of-source build, meaning that the folder in which CMake generates its Cache, Makefiles and output files should not be the Project Root nor its Source Directory.
A typical build layout is to create a folder "build" in the project root alongside the CMakeLists.txt file, change into this folder and execute "cmake .." as this will leave all source files untouched

76
resources/3rdparty/CMakeLists.txt

@ -69,10 +69,13 @@ endif ()
if ((NOT Boost_LIBRARY_DIRS) OR ("${Boost_LIBRARY_DIRS}" STREQUAL ""))
set(Boost_LIBRARY_DIRS "${Boost_INCLUDE_DIRS}/stage/lib")
endif ()
link_directories(${Boost_LIBRARY_DIRS})
include_directories(${Boost_INCLUDE_DIRS})
list(APPEND STORM_LINK_LIBRARIES ${Boost_LIBRARIES})
set(CNTVAR 1)
foreach(BOOSTLIB ${Boost_LIBRARIES})
add_imported_library(target-boost-${CNTVAR} SHARED ${BOOSTLIB} ${Boost_INCLUDE_DIRS})
list(APPEND STORM_DEP_TARGETS target-boost-${CNTVAR}_SHARED)
MATH(EXPR CNTVAR "${CNTVAR}+1")
endforeach()
message(STATUS "Storm - Using boost ${Boost_VERSION} (library version ${Boost_LIB_VERSION}).")
# set the information for the config header
set(STORM_BOOST_INCLUDE_DIR "${Boost_INCLUDE_DIRS}")
@ -131,8 +134,8 @@ set(STORM_HAVE_Z3 ${Z3_FOUND})
if(Z3_FOUND)
message (STATUS "Storm - Linking with Z3.")
include_directories(${Z3_INCLUDE_DIRS})
list(APPEND STORM_LINK_LIBRARIES ${Z3_LIBRARIES})
add_imported_library(z3 SHARED ${Z3_LIBRARIES} ${Z3_INCLUDE_DIRS})
list(APPEND STORM_DEP_TARGETS z3_SHARED)
endif(Z3_FOUND)
#############################################################
@ -175,8 +178,6 @@ include(${STORM_3RDPARTY_SOURCE_DIR}/include_cudd.cmake)
#############################################################
include(${STORM_3RDPARTY_SOURCE_DIR}/include_cpptemplate.cmake)
#############################################################
##
## carl
@ -185,23 +186,25 @@ include(${STORM_3RDPARTY_SOURCE_DIR}/include_cpptemplate.cmake)
set(STORM_HAVE_CARL OFF)
if(USE_CARL)
find_package(carl QUIET)
if(carl_FOUND)
if (NOT STORM_FORCE_SHIPPED_CARL)
find_package(carl QUIET)
endif()
if(carl_FOUND AND NOT STORM_FORCE_SHIPPED_CARL)
set(STORM_SHIPPED_CARL OFF)
set(STORM_HAVE_CARL ON)
message(STATUS "Storm - Use system version of carl.")
message(STATUS "Storm - Linking with carl ${carl_VERSION} (CARL_USE_CLN_NUMBERS: ${CARL_USE_CLN_NUMBERS}).")
set(STORM_HAVE_CLN ${CARL_USE_CLN_NUMBERS})
else()
set(STORM_SHIPPED_CARL ON)
# The first external project will be built at *configure stage*
message("START CARL CONFIG PROCESS")
file(MAKE_DIRECTORY ${STORM_3RDPARTY_BINARY_DIR}/carl_download)
execute_process(
COMMAND ${CMAKE_COMMAND} ${STORM_3RDPARTY_SOURCE_DIR}/carl "-DSTORM_3RDPARTY_BINARY_DIR=${STORM_3RDPARTY_BINARY_DIR}"
WORKING_DIRECTORY ${STORM_3RDPARTY_BINARY_DIR}/carl_download
OUTPUT_VARIABLE carlconfig_out
RESULT_VARIABLE carlconfig_result
)
execute_process(
COMMAND ${CMAKE_COMMAND} ${STORM_3RDPARTY_SOURCE_DIR}/carl "-DSTORM_3RDPARTY_BINARY_DIR=${STORM_3RDPARTY_BINARY_DIR}"
WORKING_DIRECTORY ${STORM_3RDPARTY_BINARY_DIR}/carl_download
OUTPUT_VARIABLE carlconfig_out
RESULT_VARIABLE carlconfig_result)
if(NOT carlconfig_result)
message("${carlconfig_out}")
@ -218,30 +221,34 @@ if(USE_CARL)
message("END CARL CONFIG PROCESS")
message(STATUS "Storm - Using shipped version of carl.")
set(CARL_BUILD_COMMAND make lib_carl)
ExternalProject_Add(
carl
SOURCE_DIR ${STORM_3RDPARTY_BINARY_DIR}/carl
CONFIGURE_COMMAND ""
BUILD_IN_SOURCE 1
BUILD_COMMAND make lib_carl
INSTALL_COMMAND ""
INSTALL_COMMAND make install
LOG_BUILD ON
LOG_INSTALL ON
BUILD_BYPRODUCTS ${STORM_3RDPARTY_BINARY_DIR}/carl/lib/libcarl${DYNAMIC_EXT}
)
include(${STORM_3RDPARTY_BINARY_DIR}/carl/carlConfig.cmake)
message("CARL_USE_CLN_NUMBERS: ${CARL_USE_CLN_NUMBERS}")
set(STORM_HAVE_CLN ${CARL_USE_CLN_NUMBERS})
add_dependencies(resources carl)
set(carl_INCLUDE_DIR "${STORM_3RDPARTY_BINARY_DIR}/carl/build/include")
set(carl_INCLUDE_DIR "${STORM_3RDPARTY_BINARY_DIR}/carl/include/")
set(carl_LIBRARIES ${STORM_3RDPARTY_BINARY_DIR}/carl/lib/libcarl${DYNAMIC_EXT})
set(STORM_HAVE_CARL ON)
# install the carl dynamic library if we build it
get_filename_component(STORM_CARL_DYLIB_FULL_PATH ${STORM_3RDPARTY_BINARY_DIR}/carl/lib/libcarl${DYNAMIC_EXT} REALPATH)
install(FILES ${STORM_CARL_DYLIB_FULL_PATH} DESTINATION lib)
endif()
if(STORM_USE_CLN_NUMBERS AND NOT STORM_HAVE_CLN)
message(FATAL_ERROR "Cannot use CLN numbers if carl is build without")
endif()
list(APPEND STORM_DEP_IMP_TARGETS lib_carl)
endif()
@ -276,9 +283,8 @@ if(USE_HYPRO)
find_package(hypro QUIET REQUIRED)
if(hypro_FOUND)
set(STORM_HAVE_HYPRO ON)
message(STATUS "Storm - Linking with hypro ${hypro_VERSION_STRING}.")
message(STATUS "Storm - Linking with hypro.")
include_directories("${hypro_INCLUDE_DIR}")
link_directories( /Users/tim/hypro/build )
list(APPEND STORM_LINK_LIBRARIES ${hypro_LIBRARIES})
else()
message(FATAL_ERROR "StoRM - HyPro was requested but not found")
@ -317,10 +323,11 @@ if (ENABLE_MSAT)
list(APPEND STORM_LINK_LIBRARIES "mathsat")
if(GMP_FOUND)
include_directories("${GMP_INCLUDE_DIR}")
list(APPEND STORM_LINK_LIBRARIES "gmp")
list(APPEND STORM_LINK_LIBRARIES ${GMP_LIBRARY})
elseif(MPIR_FOUND)
include_directories("${GMP_INCLUDE_DIR}")
list(APPEND STORM_LINK_LIBRARIES "mpir" "mpirxx")
list(APPEND STORM_LINK_LIBRARIES ${GMP_MPIR_LIBRARY})
list(APPEND STORM_LINK_LIBRARIES ${GMP_MPIRXX_LIBRARY})
else(GMP_FOUND)
message(FATAL_ERROR "GMP is required for MathSAT, but was not found!")
endif(GMP_FOUND)
@ -345,7 +352,7 @@ ExternalProject_Add(
DOWNLOAD_COMMAND ""
PREFIX "sylvan"
SOURCE_DIR ${STORM_3RDPARTY_SOURCE_DIR}/sylvan
CMAKE_ARGS -DCMAKE_C_COMPILER=${CMAKE_C_COMPILER} -DSYLVAN_BUILD_TEST=Off -DSYLVAN_BUILD_EXAMPLES=Off -DCMAKE_BUILD_TYPE=Release -DCMAKE_POSITION_INDEPENDENT_CODE=ON
CMAKE_ARGS -DCMAKE_C_COMPILER=${CMAKE_C_COMPILER} -DSYLVAN_BUILD_TEST=Off -DSYLVAN_BUILD_EXAMPLES=Off -DCMAKE_BUILD_TYPE=Release -DCMAKE_POSITION_INDEPENDENT_CODE=ON -DUSE_CARL=ON -Dcarl_INCLUDE_DIR=${carl_INCLUDE_DIR} -DSYLVAN_PORTABLE=${STORM_PORTABLE_RELEASE} -Dcarl_LIBRARIES=${carl_LIBRARIES}
BINARY_DIR ${STORM_3RDPARTY_BINARY_DIR}/sylvan
BUILD_IN_SOURCE 0
INSTALL_COMMAND ""
@ -362,16 +369,19 @@ message(STATUS "Storm - Using shipped version of sylvan.")
message(STATUS "Storm - Linking with sylvan.")
add_imported_library(sylvan STATIC ${Sylvan_LIBRARY} ${Sylvan_INCLUDE_DIR})
add_dependencies(sylvan_STATIC sylvan)
if(STORM_SHIPPED_CARL)
add_dependencies(sylvan carl)
endif()
list(APPEND STORM_DEP_TARGETS sylvan_STATIC)
if(${OPERATING_SYSTEM} MATCHES "Linux")
find_package(Hwloc QUIET REQUIRED)
if(HWLOC_FOUND)
message(STATUS "Storm - Linking with hwloc ${HWLOC_VERSION}.")
add_imported_library(hwloc STATIC ${HWLOC_LIBRARIES} "")
list(APPEND STORM_DEP_TARGETS hwloc_STATIC)
else()
message(FATAL_ERROR "HWLOC is required but was not found.")
find_package(Hwloc QUIET REQUIRED)
if(HWLOC_FOUND)
message(STATUS "Storm - Linking with hwloc ${HWLOC_VERSION}.")
add_imported_library(hwloc STATIC ${HWLOC_LIBRARIES} "")
list(APPEND STORM_DEP_TARGETS hwloc_STATIC)
else()
if(${OPERATING_SYSTEM} MATCHES "Linux")
message(FATAL_ERROR "HWLOC is required on Linux but was not found.")
endif()
endif()

4
resources/3rdparty/cpptemplate/cpptempl.h

@ -114,8 +114,8 @@ namespace cpptempl
{
public:
TemplateException(std::string reason) : m_reason(reason){}
~TemplateException() throw() {}
const char* what() throw() {
~TemplateException() {}
const char* what() const noexcept {
return m_reason.c_str();
}
private:

99
resources/3rdparty/cudd-3.0.0/cplusplus/cuddObj.cc

@ -566,7 +566,7 @@ BDD::operator+(
const BDD& other) const
{
DdManager *mgr = checkSameManager(other);
DdNode *result = Cudd_bddOr(mgr,node,other.node);
DdNode *result = (mgr,node,other.node);
checkReturnValue(result);
return BDD(p, result);
@ -2648,7 +2648,16 @@ ADD::MinAbstract(const ADD& cube) const
checkReturnValue(result);
return ADD(p, result);
} // ADD::MinAbstract
ADD
ADD::MinAbstractExcept0(const ADD& cube) const
{
DdManager *mgr = checkSameManager(cube);
DdNode *result = Cudd_addMinExcept0Abstract(mgr, node, cube.node);
checkReturnValue(result);
return ADD(p, result);
} // ADD::MinAbstractExcept0
ADD
ADD::MaxAbstract(const ADD& cube) const
{
@ -2658,6 +2667,24 @@ ADD::MaxAbstract(const ADD& cube) const
return ADD(p, result);
} // ADD::MaxAbstract
BDD
ADD::MinAbstractRepresentative(const ADD& cube) const
{
DdManager *mgr = checkSameManager(cube);
DdNode *result = Cudd_addMinAbstractRepresentative(mgr, node, cube.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::MinRepresentative
BDD
ADD::MaxAbstractRepresentative(const ADD& cube) const
{
DdManager *mgr = checkSameManager(cube);
DdNode *result = Cudd_addMaxAbstractRepresentative(mgr, node, cube.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::MaxRepresentative
ADD
ADD::Plus(
const ADD& g) const
@ -3136,6 +3163,66 @@ ADD::GreaterThanOrEqual(const ADD& g) const
} // ADD::GreaterThanOrEqual
BDD
ADD::EqualsBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddEquals, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::EqualsBdd
BDD
ADD::NotEqualsBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddNotEquals, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::NotEqualsBdd
BDD
ADD::LessThanBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddLessThan, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::LessThanBdd
BDD
ADD::LessThanOrEqualBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddLessThanEquals, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::LessThanOrEqualBdd
BDD
ADD::GreaterThanBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddGreaterThan, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::GreaterThanBdd
BDD
ADD::GreaterThanOrEqualBdd(const ADD& g) const
{
DdManager *mgr = checkSameManager(g);
DdNode *result = Cudd_addToBddApply(mgr, Cudd_addToBddGreaterThanEquals, node, g.node);
checkReturnValue(result);
return BDD(p, result);
} // ADD::GreaterThanOrEqualBdd
BDD
BDD::AndAbstract(
const BDD& g,
@ -3485,6 +3572,14 @@ BDD::ExistAbstract(
} // BDD::ExistAbstract
BDD
BDD::ExistAbstractRepresentative(const BDD& cube) const {
DdManager *mgr = checkSameManager(cube);
DdNode *result;
result = Cudd_bddExistAbstractRepresentative(mgr, node, cube.node);
checkReturnValue(result);
return BDD(p, result);
} // BDD::ExistAbstractRepresentative
BDD
BDD::XorExistAbstract(

10
resources/3rdparty/cudd-3.0.0/cplusplus/cuddObj.hh

@ -213,6 +213,7 @@ public:
BDD BiasedOverApprox(const BDD& bias, int numVars, int threshold = 0,
double quality1 = 1.0, double quality0 = 1.0) const;
BDD ExistAbstract(const BDD& cube, unsigned int limit = 0) const;
BDD ExistAbstractRepresentative(const BDD& cube) const;
BDD XorExistAbstract(const BDD& g, const BDD& cube) const;
BDD UnivAbstract(const BDD& cube) const;
BDD BooleanDiff(int x) const;
@ -333,7 +334,10 @@ public:
ADD UnivAbstract(const ADD& cube) const;
ADD OrAbstract(const ADD& cube) const;
ADD MinAbstract(const ADD& cube) const;
ADD MinAbstractExcept0(const ADD& cube) const;
ADD MaxAbstract(const ADD& cube) const;
BDD MinAbstractRepresentative(const ADD& cube) const;
BDD MaxAbstractRepresentative(const ADD& cube) const;
ADD Plus(const ADD& g) const;
ADD Times(const ADD& g) const;
ADD Threshold(const ADD& g) const;
@ -373,6 +377,12 @@ public:
ADD LessThanOrEqual(const ADD& g) const;
ADD GreaterThan(const ADD& g) const;
ADD GreaterThanOrEqual(const ADD& g) const;
BDD EqualsBdd(const ADD& g) const;
BDD NotEqualsBdd(const ADD& g) const;
BDD LessThanBdd(const ADD& g) const;
BDD LessThanOrEqualBdd(const ADD& g) const;
BDD GreaterThanBdd(const ADD& g) const;
BDD GreaterThanOrEqualBdd(const ADD& g) const;
BDD BddThreshold(CUDD_VALUE_TYPE value) const;
BDD BddStrictThreshold(CUDD_VALUE_TYPE value) const;
BDD BddInterval(CUDD_VALUE_TYPE lower, CUDD_VALUE_TYPE upper) const;

13
resources/3rdparty/cudd-3.0.0/cudd/cudd.h

@ -515,6 +515,7 @@ extern int Cudd_zddVarsFromBddVars(DdManager *dd, int multiplicity);
extern unsigned int Cudd_ReadMaxIndex(void);
extern DdNode * Cudd_addConst(DdManager *dd, CUDD_VALUE_TYPE c);
extern int Cudd_IsConstant(DdNode *node);
extern int Cudd_IsConstant_const(DdNode const *node);
extern int Cudd_IsNonConstant(DdNode *f);
extern DdNode * Cudd_T(DdNode *node);
extern DdNode * Cudd_E(DdNode *node);
@ -666,8 +667,12 @@ extern DdNode * Cudd_addExistAbstract(DdManager *manager, DdNode *f, DdNode *cub
extern DdNode * Cudd_addUnivAbstract(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * Cudd_addOrAbstract(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * Cudd_addMinAbstract(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * Cudd_addMinExcept0Abstract(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * Cudd_addMaxAbstract(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * Cudd_addMinAbstractRepresentative(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * Cudd_addMaxAbstractRepresentative(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * Cudd_addApply(DdManager *dd, DD_AOP op, DdNode *f, DdNode *g);
extern DdNode * Cudd_addToBddApply(DdManager *dd, DD_AOP op, DdNode *f, DdNode *g);
extern DdNode * Cudd_addPlus(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addTimes(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addThreshold(DdManager *dd, DdNode **f, DdNode **g);
@ -675,6 +680,7 @@ extern DdNode * Cudd_addSetNZ(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addDivide(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addMinus(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addMinimum(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addMinimumExcept0(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addMaximum(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addOneZeroMaximum(DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addDiff(DdManager *dd, DdNode **f, DdNode **g);
@ -690,6 +696,12 @@ extern DdNode * Cudd_addGreaterThan (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addGreaterThanEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addLessThan (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addLessThanEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddNotEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddGreaterThan (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddGreaterThanEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddLessThan (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addToBddLessThanEquals (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addPow (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addMod (DdManager *dd, DdNode **f, DdNode **g);
extern DdNode * Cudd_addLogXY (DdManager *dd, DdNode **f, DdNode **g);
@ -740,6 +752,7 @@ extern DdNode * Cudd_RemapOverApprox(DdManager *dd, DdNode *f, int numVars, int
extern DdNode * Cudd_BiasedUnderApprox(DdManager *dd, DdNode *f, DdNode *b, int numVars, int threshold, double quality1, double quality0);
extern DdNode * Cudd_BiasedOverApprox(DdManager *dd, DdNode *f, DdNode *b, int numVars, int threshold, double quality1, double quality0);
extern DdNode * Cudd_bddExistAbstract(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * Cudd_bddExistAbstractRepresentative(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * Cudd_bddExistAbstractLimit(DdManager * manager, DdNode * f, DdNode * cube, unsigned int limit);
extern DdNode * Cudd_bddXorExistAbstract(DdManager *manager, DdNode *f, DdNode *g, DdNode *cube);
extern DdNode * Cudd_bddUnivAbstract(DdManager *manager, DdNode *f, DdNode *cube);

15
resources/3rdparty/cudd-3.0.0/cudd/cuddAPI.c

@ -553,6 +553,20 @@ int Cudd_IsConstant(DdNode *node)
} /* end of Cudd_IsConstant */
/**
@brief Returns 1 if the node is a constant node.
@details A constant node is not an internal node. The pointer
passed to Cudd_IsConstant may be either regular or complemented.
@sideeffect none
*/
int Cudd_IsConstant_const(DdNode const*node)
{
return Cudd_Regular(node)->index == CUDD_CONST_INDEX;
} /* end of Cudd_IsConstant_const */
/**
@brief Returns 1 if a %DD node is not constant.
@ -576,7 +590,6 @@ Cudd_IsNonConstant(
} /* end of Cudd_IsNonConstant */
/**
@brief Returns the then child of an internal node.

581
resources/3rdparty/cudd-3.0.0/cudd/cuddAddAbs.c

@ -243,6 +243,44 @@ Cudd_addMinAbstract(
} /* end of Cudd_addMinAbstract */
/**Function********************************************************************
Synopsis [Abstracts all the variables in cube from the
ADD f by taking the minimum.]
Description [Abstracts all the variables in cube from the ADD f
by taking the minimum over all possible values taken by the
variables. Returns the abstracted ADD if successful; NULL
otherwise.]
SideEffects [None]
SeeAlso [Cudd_addUnivAbstract Cudd_addExistAbstract]
Note: Added by Christian Dehnert 24/08/2016
******************************************************************************/
DdNode *
Cudd_addMinExcept0Abstract(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *res;
if (addCheckPositiveCube(manager, cube) == 0) {
(void) fprintf(manager->err,"Error: Can only abstract cubes");
return(NULL);
}
do {
manager->reordered = 0;
res = cuddAddMinExcept0AbstractRecur(manager, f, cube);
} while (manager->reordered == 1);
return(res);
} /* end of Cudd_addMinExcept0Abstract */
/**Function********************************************************************
Synopsis [Abstracts all the variables in cube from the
@ -281,6 +319,78 @@ Cudd_addMaxAbstract(
} /* end of Cudd_addMaxAbstract */
/**Function********************************************************************
Synopsis [Just like Cudd_addMinAbstract, but instead of abstracting the
variables in the given cube, picks a unique representative that realizes th
minimal function value.]
Description [Returns the resulting ADD if successful; NULL otherwise.]
SideEffects [None]
SeeAlso [Cudd_addMaxAbstractRepresentative]
Note: Added by Christian Dehnert 8/5/14
******************************************************************************/
DdNode *
Cudd_addMinAbstractRepresentative(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *res;
if (addCheckPositiveCube(manager, cube) == 0) {
(void) fprintf(manager->err,"Error: Can only abstract cubes");
return(NULL);
}
do {
manager->reordered = 0;
res = cuddAddMinAbstractRepresentativeRecur(manager, f, cube);
} while (manager->reordered == 1);
return(res);
} /* end of Cudd_addMinRepresentative */
/**Function********************************************************************
Synopsis [Just like Cudd_addMaxAbstract, but instead of abstracting the
variables in the given cube, picks a unique representative that realizes th
maximal function value.]
Description [Returns the resulting ADD if successful; NULL otherwise.]
SideEffects [None]
SeeAlso [Cudd_addMinAbstractRepresentative]
Note: Added by Christian Dehnert 8/5/14
******************************************************************************/
DdNode *
Cudd_addMaxAbstractRepresentative(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *res;
if (addCheckPositiveCube(manager, cube) == 0) {
(void) fprintf(manager->err,"Error: Can only abstract cubes");
return(NULL);
}
do {
manager->reordered = 0;
res = cuddAddMaxAbstractRepresentativeRecur(manager, f, cube);
} while (manager->reordered == 1);
return(res);
} /* end of Cudd_addMaxRepresentative */
/*---------------------------------------------------------------------------*/
/* Definition of internal functions */
/*---------------------------------------------------------------------------*/
@ -678,6 +788,98 @@ cuddAddMinAbstractRecur(
} /* end of cuddAddMinAbstractRecur */
/**Function********************************************************************
Synopsis [Performs the recursive step of Cudd_addMinAbstract.]
Description [Performs the recursive step of Cudd_addMinAbstract.
Returns the ADD obtained by abstracting the variables of cube from f,
if successful; NULL otherwise.]
SideEffects [None]
SeeAlso []
added 24/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
cuddAddMinExcept0AbstractRecur(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *T, *E, *res, *res1, *res2, *zero;
zero = DD_ZERO(manager);
/* Cube is guaranteed to be a cube at this point. */
if (f == zero || cuddIsConstant(cube)) {
return(f);
}
/* Abstract a variable that does not appear in f. */
if (cuddI(manager,f->index) > cuddI(manager,cube->index)) {
res = cuddAddMinAbstractRecur(manager, f, cuddT(cube));
return(res);
}
if ((res = cuddCacheLookup2(manager, Cudd_addMinAbstract, f, cube)) != NULL) {
return(res);
}
T = cuddT(f);
E = cuddE(f);
/* If the two indices are the same, so are their levels. */
if (f->index == cube->index) {
res1 = cuddAddMinAbstractRecur(manager, T, cuddT(cube));
if (res1 == NULL) return(NULL);
cuddRef(res1);
res2 = cuddAddMinAbstractRecur(manager, E, cuddT(cube));
if (res2 == NULL) {
Cudd_RecursiveDeref(manager,res1);
return(NULL);
}
cuddRef(res2);
res = cuddAddApplyRecur(manager, Cudd_addMinimumExcept0, res1, res2);
if (res == NULL) {
Cudd_RecursiveDeref(manager,res1);
Cudd_RecursiveDeref(manager,res2);
return(NULL);
}
cuddRef(res);
Cudd_RecursiveDeref(manager,res1);
Cudd_RecursiveDeref(manager,res2);
cuddCacheInsert2(manager, Cudd_addMinAbstract, f, cube, res);
cuddDeref(res);
return(res);
}
else { /* if (cuddI(manager,f->index) < cuddI(manager,cube->index)) */
res1 = cuddAddMinAbstractRecur(manager, T, cube);
if (res1 == NULL) return(NULL);
cuddRef(res1);
res2 = cuddAddMinAbstractRecur(manager, E, cube);
if (res2 == NULL) {
Cudd_RecursiveDeref(manager,res1);
return(NULL);
}
cuddRef(res2);
res = (res1 == res2) ? res1 :
cuddUniqueInter(manager, (int) f->index, res1, res2);
if (res == NULL) {
Cudd_RecursiveDeref(manager,res1);
Cudd_RecursiveDeref(manager,res2);
return(NULL);
}
cuddDeref(res1);
cuddDeref(res2);
cuddCacheInsert2(manager, Cudd_addMinAbstract, f, cube, res);
return(res);
}
} /* end of cuddAddMinAbstractRecur */
/**Function********************************************************************
@ -774,6 +976,385 @@ cuddAddMaxAbstractRecur(
/* Definition of static functions */
/*---------------------------------------------------------------------------*/
/**Function********************************************************************
Synopsis [Performs the recursive step of Cudd_addMinAbstractRepresentative.]
Description [Performs the recursive step of Cudd_addMinAbstractRepresentative.
Returns the ADD obtained by picking a representative over the variables in
the given cube for all other valuations. Returns the resulting ADD if successful;
NULL otherwise.]
SideEffects [None]
SeeAlso []
******************************************************************************/
DdNode *
cuddAddMinAbstractRepresentativeRecur(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *T, *E, *res, *res1, *res2, *zero, *one, *logicalZero, *res1Inf, *res2Inf, *left, *right, *tmp, *tmp2;
zero = DD_ZERO(manager);
one = DD_ONE(manager);
logicalZero = Cudd_Not(one);
/* Cube is guaranteed to be a cube at this point. */
if (cuddIsConstant(cube)) {
return one;
}
if (cuddIsConstant(f)) {
res = cuddAddMinAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
cuddRef(res);
// We build in the negation ourselves.
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager,res);
return(NULL);
}
res1 = Cudd_Not(res1);
cuddDeref(res);
return(res1);
}
/* Abstract a variable that does not appear in f. */
if (cuddI(manager,f->index) > cuddI(manager,cube->index)) {
res = cuddAddMinAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
// Fill in the missing variables to make representative unique.
cuddRef(res);
// We build in the negation ourselves.
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager,res);
return(NULL);
}
res1 = Cudd_Not(res1);
cuddDeref(res);
return(res1);
}
if ((res = cuddCacheLookup2(manager, Cudd_addMinAbstractRepresentative, f, cube)) != NULL) {
return(res);
}
E = cuddE(f);
T = cuddT(f);
/* If the two indices are the same, so are their levels. */
if (f->index == cube->index) {
res1 = cuddAddMinAbstractRepresentativeRecur(manager, E, cuddT(cube));
if (res1 == NULL) {
return(NULL);
}
cuddRef(res1);
res2 = cuddAddMinAbstractRepresentativeRecur(manager, T, cuddT(cube));
if (res2 == NULL) {
Cudd_IterDerefBdd(manager, res1);
return(NULL);
}
cuddRef(res2);
left = cuddAddMinAbstractRecur(manager, E, cuddT(cube));
if (left == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
return(NULL);
}
cuddRef(left);
right = cuddAddMinAbstractRecur(manager, T, cuddT(cube));
if (right == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
Cudd_RecursiveDeref(manager, left);
return(NULL);
}
cuddRef(right);
tmp = cuddAddToBddApplyRecur(manager, Cudd_addToBddLessThanEquals, left, right);
if (tmp == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_RecursiveDeref(manager,left);
Cudd_RecursiveDeref(manager,right);
return(NULL);
}
cuddRef(tmp);
Cudd_RecursiveDeref(manager, left);
Cudd_RecursiveDeref(manager, right);
res1Inf = cuddBddIteRecur(manager, tmp, res1, logicalZero);
if (res1Inf == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,tmp);
return(NULL);
}
cuddRef(res1Inf);
Cudd_IterDerefBdd(manager,res1);
res2Inf = cuddBddIteRecur(manager, tmp, logicalZero, res2);
Cudd_IterDerefBdd(manager,tmp);
if (res2Inf == NULL) {
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,res1Inf);
return(NULL);
}
cuddRef(res2Inf);
Cudd_IterDerefBdd(manager,res2);
int compl = (res1Inf == res2Inf) ? 1 : Cudd_IsComplement(res2Inf);
res = (res1Inf == res2Inf) ? cuddUniqueInter(manager, (int) f->index, one, Cudd_Not(res1Inf)) : cuddUniqueInter(manager, (int) f->index, Cudd_Regular(res2Inf), compl ? Cudd_Not(res1Inf) : res1Inf);
if (res == NULL) {
Cudd_IterDerefBdd(manager,res1Inf);
Cudd_IterDerefBdd(manager,res2Inf);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddRef(res);
cuddDeref(res1Inf);
cuddDeref(res2Inf);
cuddCacheInsert2(manager, Cudd_addMinAbstractRepresentative, f, cube, res);
cuddDeref(res);
return(res);
}
else { /* if (cuddI(manager,f->index) < cuddI(manager,cube->index)) */
res1 = cuddAddMinAbstractRepresentativeRecur(manager, E, cube);
if (res1 == NULL) return(NULL);
cuddRef(res1);
res2 = cuddAddMinAbstractRepresentativeRecur(manager, T, cube);
if (res2 == NULL) {
Cudd_IterDerefBdd(manager,res1);
return(NULL);
}
cuddRef(res2);
int compl = (res1 == res2) ? 0 : Cudd_IsComplement(res2);
res = (res1 == res2) ? res1 : cuddUniqueInter(manager, (int) f->index, Cudd_Regular(res2), compl ? Cudd_Not(res1) : res1);
if (res == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddDeref(res1);
cuddDeref(res2);
cuddCacheInsert2(manager, Cudd_addMinAbstractRepresentative, f, cube, res);
return(res);
}
} /* end of cuddAddMinAbstractRepresentativeRecur */
/**Function********************************************************************
Synopsis [Performs the recursive step of Cudd_addMaxAbstractRepresentative.]
Description [Performs the recursive step of Cudd_addMaxAbstractRepresentative.
Returns the ADD obtained by picking a representative over the variables in
the given cube for all other valuations. Returns the resulting ADD if successful;
NULL otherwise.]
SideEffects [None]
SeeAlso []
******************************************************************************/
DdNode *
cuddAddMaxAbstractRepresentativeRecur(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *T, *E, *res, *res1, *res2, *zero, *one, *logicalZero, *res1Inf, *res2Inf, *left, *right, *tmp, *tmp2;
zero = DD_ZERO(manager);
one = DD_ONE(manager);
logicalZero = Cudd_Not(one);
/* Cube is guaranteed to be a cube at this point. */
if (cuddIsConstant(cube)) {
return one;
}
if (cuddIsConstant(f)) {
res = cuddAddMaxAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
cuddRef(res);
// We build in the negation ourselves.
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager,res);
return(NULL);
}
res1 = Cudd_Not(res1);
cuddDeref(res);
return(res1);
}
/* Abstract a variable that does not appear in f. */
if (cuddI(manager,f->index) > cuddI(manager,cube->index)) {
res = cuddAddMaxAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
// Fill in the missing variables to make representative unique.
cuddRef(res);
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager, res);
return(NULL);
}
res1 = Cudd_Not(res1);
Cudd_IterDerefBdd(manager,res);
return(res1);
}
if ((res = cuddCacheLookup2(manager, Cudd_addMaxAbstractRepresentative, f, cube)) != NULL) {
return(res);
}
E = cuddE(f);
T = cuddT(f);
/* If the two indices are the same, so are their levels. */
if (f->index == cube->index) {
res1 = cuddAddMaxAbstractRepresentativeRecur(manager, E, cuddT(cube));
if (res1 == NULL) {
return(NULL);
}
cuddRef(res1);
res2 = cuddAddMaxAbstractRepresentativeRecur(manager, T, cuddT(cube));
if (res2 == NULL) {
Cudd_IterDerefBdd(manager, res1);
return(NULL);
}
cuddRef(res2);
left = cuddAddMaxAbstractRecur(manager, E, cuddT(cube));
if (left == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
return(NULL);
}
cuddRef(left);
right = cuddAddMaxAbstractRecur(manager, T, cuddT(cube));
if (right == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
Cudd_RecursiveDeref(manager, left);
return(NULL);
}
cuddRef(right);
tmp = cuddAddToBddApplyRecur(manager, Cudd_addToBddGreaterThanEquals, left, right);
if (tmp == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_RecursiveDeref(manager,left);
Cudd_RecursiveDeref(manager,right);
return(NULL);
}
cuddRef(tmp);
Cudd_RecursiveDeref(manager, left);
Cudd_RecursiveDeref(manager, right);
cuddRef(zero);
res1Inf = cuddBddIteRecur(manager, tmp, res1, logicalZero);
if (res1Inf == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,tmp);
cuddDeref(zero);
return(NULL);
}
cuddRef(res1Inf);
Cudd_IterDerefBdd(manager,res1);
cuddRef(zero);
res2Inf = cuddBddIteRecur(manager, tmp, logicalZero, res2);
if (res2Inf == NULL) {
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,res1Inf);
Cudd_IterDerefBdd(manager,tmp);
return(NULL);
}
cuddRef(res2Inf);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,tmp);
int compl = (res1Inf == res2Inf) ? 1 : Cudd_IsComplement(res2Inf);
res = (res1Inf == res2Inf) ? cuddUniqueInter(manager, (int) f->index, one, Cudd_Not(res1Inf)) : cuddUniqueInter(manager, (int) f->index, Cudd_Regular(res2Inf), compl ? Cudd_Not(res1Inf) : res1Inf);
if (res == NULL) {
Cudd_IterDerefBdd(manager,res1Inf);
Cudd_IterDerefBdd(manager,res2Inf);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddRef(res);
Cudd_IterDerefBdd(manager,res1Inf);
Cudd_IterDerefBdd(manager,res2Inf);
cuddCacheInsert2(manager, Cudd_addMaxAbstractRepresentative, f, cube, res);
cuddDeref(res);
return(res);
}
else { /* if (cuddI(manager,f->index) < cuddI(manager,cube->index)) */
res1 = cuddAddMaxAbstractRepresentativeRecur(manager, E, cube);
if (res1 == NULL) return(NULL);
cuddRef(res1);
res2 = cuddAddMaxAbstractRepresentativeRecur(manager, T, cube);
if (res2 == NULL) {
Cudd_IterDerefBdd(manager,res1);
return(NULL);
}
cuddRef(res2);
int compl = (res1 == res2) ? 0 : Cudd_IsComplement(res2);
res = (res1 == res2) ? res1 : cuddUniqueInter(manager, (int) f->index, Cudd_Regular(res2), compl ? Cudd_Not(res1) : res1);
if (res == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddDeref(res1);
cuddDeref(res2);
cuddCacheInsert2(manager, Cudd_addMaxAbstractRepresentative, f, cube, res);
return(res);
}
} /* end of cuddAddMaxAbstractRepresentativeRecur */
/*---------------------------------------------------------------------------*/
/* Definition of static functions */
/*---------------------------------------------------------------------------*/
/**
@brief Checks whether cube is an %ADD representing the product

364
resources/3rdparty/cudd-3.0.0/cudd/cuddAddApply.c

@ -117,6 +117,41 @@ Cudd_addApply(
} /* end of Cudd_addApply */
/**
@brief Applies op to the corresponding discriminants of f and g and produces a BDD as a result.
@return a pointer to the result if succssful; NULL otherwise.
@sideeffect None
@see Cudd_addMonadicApply Cudd_addPlus Cudd_addTimes
Cudd_addThreshold Cudd_addSetNZ Cudd_addDivide Cudd_addMinus Cudd_addMinimum
Cudd_addMaximum Cudd_addOneZeroMaximum Cudd_addDiff Cudd_addAgreement
Cudd_addOr Cudd_addNand Cudd_addNor Cudd_addXor Cudd_addXnor
added 23/08/2016 by Christian Dehnert
*/
DdNode *
Cudd_addToBddApply(
DdManager * dd /**< manager */,
DD_AOP op /**< operator */,
DdNode * f /**< first operand */,
DdNode * g /**< second operand */)
{
DdNode *res;
do {
dd->reordered = 0;
res = cuddAddToBddApplyRecur(dd,op,f,g);
} while (dd->reordered == 1);
if (dd->errorCode == CUDD_TIMEOUT_EXPIRED && dd->timeoutHandler) {
dd->timeoutHandler(dd, dd->tohArg);
}
return(res);
} /* end of Cudd_addToBddApply */
/**
@brief Integer and floating point addition.
@ -371,6 +406,53 @@ Cudd_addMinimum(
} /* end of Cudd_addMinimum */
/**
@brief Integer and floating point min.
@details Integer and floating point min for Cudd_addApply.
@return NULL if not a terminal case; min(f,g) otherwise.
@sideeffect None
@see Cudd_addApply
added 24/08/2016
*/
DdNode *
Cudd_addMinimumExcept0(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == DD_ZERO(dd)) return(G);
if (G == DD_ZERO(dd)) return(F);
if (F == DD_PLUS_INFINITY(dd)) return(G);
if (G == DD_PLUS_INFINITY(dd)) return(F);
if (F == G) return(F);
#if 0
/* These special cases probably do not pay off. */
if (F == DD_MINUS_INFINITY(dd)) return(F);
if (G == DD_MINUS_INFINITY(dd)) return(G);
#endif
if (cuddIsConstant(F) && cuddIsConstant(G)) {
if (cuddV(F) <= cuddV(G)) {
return(F);
} else {
return(G);
}
}
if (F > G) { /* swap f and g */
*f = G;
*g = F;
}
return(NULL);
} /* end of Cudd_addMinimumExcept0 */
/**
@brief Integer and floating point max.
@ -817,6 +899,38 @@ Cudd_addEquals(
} /* end of Cudd_addEquals */
/**Function********************************************************************
Synopsis [1 if f==g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f==g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddEquals(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(DD_ONE(dd));
if (cuddIsConstant(F) && cuddIsConstant(G)) return(Cudd_Not(DD_ONE(dd)));
if (F > G) { /* swap f and g */
*f = G;
*g = F;
}
return(NULL);
} /* end of Cudd_addToBddEquals */
/**Function********************************************************************
@ -849,6 +963,39 @@ Cudd_addNotEquals(
} /* end of Cudd_addNotEquals */
/**Function********************************************************************
Synopsis [1 if f!=g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f!=g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddNotEquals(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(Cudd_Not(DD_ONE(dd)));
if (cuddIsConstant(F) && cuddIsConstant(G)) return(DD_ONE(dd));
if (F > G) { /* swap f and g */
*f = G;
*g = F;
}
return(NULL);
} /* end of Cudd_addToBddNotEquals */
/**Function********************************************************************
Synopsis [1 if f>g; 0 otherwise.]
@ -878,6 +1025,37 @@ Cudd_addGreaterThan(
} /* end of Cudd_addGreaterThan */
/**Function********************************************************************
Synopsis [1 if f>g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f>g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddGreaterThan(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(Cudd_Not(DD_ONE(dd)));
if (cuddIsConstant(F) && cuddIsConstant(G)) {
if (cuddV(F)>cuddV(G)) return (DD_ONE(dd)); else return (Cudd_Not(DD_ONE(dd)));
}
return(NULL);
} /* end of Cudd_addToBddGreaterThan */
/**Function********************************************************************
@ -908,6 +1086,36 @@ Cudd_addGreaterThanEquals(
} /* end of Cudd_addGreaterThanEquals */
/**Function********************************************************************
Synopsis [1 if f>=g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f>=g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddGreaterThanEquals(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(DD_ONE(dd));
if (cuddIsConstant(F) && cuddIsConstant(G)) {
if (cuddV(F)>=cuddV(G)) return (DD_ONE(dd)); else return (Cudd_Not(DD_ONE(dd)));
}
return(NULL);
} /* end of Cudd_addToBddGreaterThanEquals */
/**Function********************************************************************
@ -938,6 +1146,36 @@ Cudd_addLessThan(
} /* end of Cudd_addLessThan */
/**Function********************************************************************
Synopsis [1 if f<g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f<g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddLessThan(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(Cudd_Not(DD_ONE(dd)));
if (cuddIsConstant(F) && cuddIsConstant(G)) {
if (cuddV(F)<cuddV(G)) return (DD_ONE(dd)); else return (Cudd_Not(DD_ONE(dd)));
}
return(NULL);
} /* end of Cudd_addToBddLessThan */
/**Function********************************************************************
@ -968,6 +1206,37 @@ Cudd_addLessThanEquals(
} /* end of Cudd_addLessThanEquals */
/**Function********************************************************************
Synopsis [1 if f<=g; 0 otherwise.]
Description [Returns NULL if not a terminal case; f op g otherwise,
where f op g is 1 if f<=g; 0 otherwise.]
SideEffects [None]
SeeAlso [Cudd_addApply]
Added 23/08/2016 by Christian Dehnert
******************************************************************************/
DdNode *
Cudd_addToBddLessThanEquals(
DdManager * dd,
DdNode ** f,
DdNode ** g)
{
DdNode *F, *G;
F = *f; G = *g;
if (F == G) return(DD_ONE(dd));
if (cuddIsConstant(F) && cuddIsConstant(G)) {
if (cuddV(F)<=cuddV(G)) return (DD_ONE(dd)); else return (Cudd_Not(DD_ONE(dd)));
}
return(NULL);
} /* end of Cudd_addToBddLessThanEquals */
/**Function********************************************************************
Synopsis [f to the power of g.]
@ -1174,6 +1443,101 @@ cuddAddApplyRecur(
} /* end of cuddAddApplyRecur */
/**
@brief Performs the recursive step of Cudd_addToBddApply.
@return a pointer to the result if successful; NULL otherwise.
@sideeffect None
@see cuddAddMonadicApplyRecur
added 23/08/2016 by Christian Dehnert
*/
DdNode *
cuddAddToBddApplyRecur(
DdManager * dd,
DD_AOP op,
DdNode * f,
DdNode * g)
{
DdNode *res,
*fv, *fvn, *gv, *gvn,
*T, *E;
int ford, gord;
unsigned int index;
DD_CTFP cacheOp;
/* Check terminal cases. Op may swap f and g to increase the
* cache hit rate.
*/
statLine(dd);
res = (*op)(dd,&f,&g);
if (res != NULL) return(res);
/* Check cache. */
cacheOp = (DD_CTFP) op;
res = cuddCacheLookup2(dd,cacheOp,f,g);
if (res != NULL) return(res);
checkWhetherToGiveUp(dd);
/* Recursive step. */
ford = cuddI(dd,f->index);
gord = cuddI(dd,g->index);
if (ford <= gord) {
index = f->index;
fv = cuddT(f);
fvn = cuddE(f);
} else {
index = g->index;
fv = fvn = f;
}
if (gord <= ford) {
gv = cuddT(g);
gvn = cuddE(g);
} else {
gv = gvn = g;
}
T = cuddAddToBddApplyRecur(dd,op,fv,gv);
if (T == NULL) return(NULL);
cuddRef(T);
E = cuddAddToBddApplyRecur(dd,op,fvn,gvn);
if (E == NULL) {
Cudd_IterDerefBdd(dd,T);
return(NULL);
}
cuddRef(E);
int complT = Cudd_IsComplement(T);
if (T == E) {
res = T;
} else {
res = cuddUniqueInter(dd,(int)index,Cudd_Regular(T),complT ? Cudd_Not(E) : E);
if (complT) {
res = Cudd_Not(res);
}
}
if (res == NULL) {
Cudd_IterDerefBdd(dd, T);
Cudd_IterDerefBdd(dd, E);
return(NULL);
}
cuddRef(res);
cuddDeref(T);
cuddDeref(E);
/* Store result. */
cuddCacheInsert2(dd,cacheOp,f,g,res);
cuddDeref(res);
return(res);
} /* end of cuddAddToBddApplyRecur */
/**
@brief Performs the recursive step of Cudd_addMonadicApply.

239
resources/3rdparty/cudd-3.0.0/cudd/cuddBddAbs.c

@ -124,6 +124,42 @@ Cudd_bddExistAbstract(
} /* end of Cudd_bddExistAbstract */
/**Function********************************************************************
Synopsis [Just like Cudd_bddExistAbstract, but instead of abstracting the
variables in the given cube, picks a unique representative that realizes the
existential truth value.]
Description [Returns the resulting BDD if successful; NULL otherwise.]
SideEffects [None]
SeeAlso []
Note: Added by Christian Dehnert 9/21/15
******************************************************************************/
DdNode *
Cudd_bddExistAbstractRepresentative(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *res;
if (bddCheckPositiveCube(manager, cube) == 0) {
(void) fprintf(manager->err,"Error: Can only abstract positive cubes\n");
manager->errorCode = CUDD_INVALID_ARG;
return(NULL);
}
do {
manager->reordered = 0;
res = cuddBddExistAbstractRepresentativeRecur(manager, f, cube);
} while (manager->reordered == 1);
return(res);
} /* end of Cudd_bddExistAbstractRepresentative */
/**
@brief Existentially abstracts all the variables in cube from f.
@ -465,6 +501,209 @@ cuddBddExistAbstractRecur(
} /* end of cuddBddExistAbstractRecur */
/**Function********************************************************************
Synopsis [Performs the recursive steps of Cudd_bddExistAbstractRepresentative.]
Description [Performs the recursive steps of Cudd_bddExistAbstractRepresentative.
Returns the BDD obtained by picking a representative over the variables in
the given cube for all other valuations. Returns the resulting BDD if successful;
NULL otherwise.]
SideEffects [None]
SeeAlso []
******************************************************************************/
DdNode *
cuddBddExistAbstractRepresentativeRecur(
DdManager * manager,
DdNode * f,
DdNode * cube)
{
DdNode *F, *T, *E, *res, *res1, *res2, *one, *zero, *left, *right, *tmp, *res1Inf, *res2Inf;
statLine(manager);
one = DD_ONE(manager);
zero = Cudd_Not(one);
F = Cudd_Regular(f);
// Store whether f is negated.
int fIsNegated = f != F;
/* Cube is guaranteed to be a cube at this point. */
if (F == one) {
if (fIsNegated) {
return f;
}
if (cube == one) {
return one;
} else {
res = cuddBddExistAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
cuddRef(res);
// res1 = cuddUniqueInter(manager, (int) cube->index, zero, res);
// We now build in the necessary negation ourselves.
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager,res);
return(NULL);
}
res1 = Cudd_Not(res1);
cuddDeref(res);
return(res1);
}
} else if (cube == one) {
return f;
}
/* From now on, cube and f are non-constant. */
/* Abstract a variable that does not appear in f. */
if (manager->perm[F->index] > manager->perm[cube->index]) {
res = cuddBddExistAbstractRepresentativeRecur(manager, f, cuddT(cube));
if (res == NULL) {
return(NULL);
}
cuddRef(res);
// res1 = cuddUniqueInter(manager, (int) cube->index, zero, res);
// We now build in the necessary negation ourselves.
res1 = cuddUniqueInter(manager, (int) cube->index, one, Cudd_Not(res));
if (res1 == NULL) {
Cudd_IterDerefBdd(manager,res);
return(NULL);
}
res1 = Cudd_Not(res1);
cuddDeref(res);
return(res1);
}
/* Check the cache. */
if (F->ref != 1 && (res = cuddCacheLookup2(manager, Cudd_bddExistAbstractRepresentative, f, cube)) != NULL) {
return(res);
}
/* Compute the cofactors of f. */
T = cuddT(F); E = cuddE(F);
if (f != F) {
T = Cudd_Not(T); E = Cudd_Not(E);
}
/* If the two indices are the same, so are their levels. */
if (F->index == cube->index) {
res1 = cuddBddExistAbstractRepresentativeRecur(manager, E, cuddT(cube));
if (res1 == NULL) {
return(NULL);
}
if (res1 == one) {
if (F->ref != 1) {
cuddCacheInsert2(manager, Cudd_bddExistAbstractRepresentative, f, cube, Cudd_Not(cube));
}
return(Cudd_Not(cube));
}
cuddRef(res1);
res2 = cuddBddExistAbstractRepresentativeRecur(manager, T, cuddT(cube));
if (res2 == NULL) {
Cudd_IterDerefBdd(manager,res1);
return(NULL);
}
cuddRef(res2);
left = cuddBddExistAbstractRecur(manager, E, cuddT(cube));
if (left == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
return(NULL);
}
cuddRef(left);
res1Inf = cuddBddIteRecur(manager, left, res1, zero);
if (res1Inf == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,left);
return(NULL);
}
cuddRef(res1Inf);
Cudd_IterDerefBdd(manager,res1);
res2Inf = cuddBddIteRecur(manager, left, zero, res2);
if (res2Inf == NULL) {
Cudd_IterDerefBdd(manager,res1);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,left);
Cudd_IterDerefBdd(manager,res1Inf);
return(NULL);
}
cuddRef(res2Inf);
Cudd_IterDerefBdd(manager,res2);
Cudd_IterDerefBdd(manager,left);
assert(res1Inf != res2Inf);
int compl = Cudd_IsComplement(res2Inf);
res = cuddUniqueInter(manager, (int) F->index, Cudd_Regular(res2Inf), compl ? Cudd_Not(res1Inf) : res1Inf);
if (res == NULL) {
Cudd_IterDerefBdd(manager,res1Inf);
Cudd_IterDerefBdd(manager,res2Inf);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddRef(res);
cuddDeref(res1Inf);
cuddDeref(res2Inf);
cuddCacheInsert2(manager, Cudd_bddExistAbstractRepresentative, f, cube, res);
cuddDeref(res);
return(res);
} else { /* if (cuddI(manager,F->index) < cuddI(manager,cube->index)) */
res1 = cuddBddExistAbstractRepresentativeRecur(manager, E, cube);
if (res1 == NULL){
return(NULL);
}
cuddRef(res1);
res2 = cuddBddExistAbstractRepresentativeRecur(manager, T, cube);
if (res2 == NULL) {
Cudd_IterDerefBdd(manager, res1);
return(NULL);
}
cuddRef(res2);
/* ITE takes care of possible complementation of res1 and of the
** case in which res1 == res2. */
int compl = Cudd_IsComplement(res2);
res = cuddUniqueInter(manager, (int)F->index, Cudd_Regular(res2), compl ? Cudd_Not(res1) : res1);
if (res == NULL) {
Cudd_IterDerefBdd(manager, res1);
Cudd_IterDerefBdd(manager, res2);
return(NULL);
}
if (compl) {
res = Cudd_Not(res);
}
cuddDeref(res1);
cuddDeref(res2);
if (F->ref != 1) {
cuddCacheInsert2(manager, Cudd_bddExistAbstractRepresentative, f, cube, res);
}
return(res);
}
} /* end of cuddBddExistAbstractRepresentativeRecur */
/**
@brief Takes the exclusive OR of two BDDs and simultaneously abstracts the

5
resources/3rdparty/cudd-3.0.0/cudd/cuddInt.h

@ -1062,8 +1062,12 @@ extern DdNode * cuddAddExistAbstractRecur(DdManager *manager, DdNode *f, DdNode
extern DdNode * cuddAddUnivAbstractRecur(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddAddOrAbstractRecur(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddAddMinAbstractRecur (DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddAddMinExcept0AbstractRecur (DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddAddMaxAbstractRecur (DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddAddMinAbstractRepresentativeRecur(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * cuddAddMaxAbstractRepresentativeRecur(DdManager * manager, DdNode * f, DdNode * cube);
extern DdNode * cuddAddApplyRecur(DdManager *dd, DdNode * (*)(DdManager *, DdNode **, DdNode **), DdNode *f, DdNode *g);
extern DdNode * cuddAddToBddApplyRecur(DdManager *dd, DdNode * (*)(DdManager *, DdNode **, DdNode **), DdNode *f, DdNode *g);
extern DdNode * cuddAddMonadicApplyRecur(DdManager * dd, DdNode * (*op)(DdManager *, DdNode *), DdNode * f);
extern DdNode * cuddAddScalarInverseRecur(DdManager *dd, DdNode *f, DdNode *epsilon);
extern DdNode * cuddAddIteRecur(DdManager *dd, DdNode *f, DdNode *g, DdNode *h);
@ -1076,6 +1080,7 @@ extern DdNode * cuddBiasedUnderApprox(DdManager *dd, DdNode *f, DdNode *b, int n
extern DdNode * cuddBddAndAbstractRecur(DdManager *manager, DdNode *f, DdNode *g, DdNode *cube);
extern int cuddAnnealing(DdManager *table, int lower, int upper);
extern DdNode * cuddBddExistAbstractRecur(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddBddExistAbstractRepresentativeRecur(DdManager *manager, DdNode *f, DdNode *cube);
extern DdNode * cuddBddXorExistAbstractRecur(DdManager *manager, DdNode *f, DdNode *g, DdNode *cube);
extern DdNode * cuddBddBooleanDiffRecur(DdManager *manager, DdNode *f, DdNode *var);
extern DdNode * cuddBddIteRecur(DdManager *dd, DdNode *f, DdNode *g, DdNode *h);

5
resources/3rdparty/cudd-3.0.0/cudd/cuddSat.c

@ -843,11 +843,12 @@ Cudd_EqualSupNormRel(
/* Check terminal cases. */
if (f == g) return(1);
if (Cudd_IsConstant(f) && Cudd_IsConstant(g)) {
if (ddAbs((cuddV(f) - cuddV(g))/cuddV(f)) < tolerance) {
CUDD_VALUE_TYPE absDiff = ddAbs((cuddV(f) - cuddV(g)));
if (absDiff/cuddV(f) < tolerance || absDiff < Cudd_ReadEpsilon(dd)) {
return(1);
} else {
if (pr>0) {
(void) fprintf(dd->out,"Offending nodes:\n");
(void) fprintf(dd->out,"Offending nodes (wrt. precision %0.30f) with diff %0.30f:\n", Cudd_ReadEpsilon(dd), absDiff);
(void) fprintf(dd->out,
"f: address = %p\t value = %40.30f\n",
(void *) f, cuddV(f));

2
resources/3rdparty/eigen-3.3-beta1/COPYING.BSD

@ -23,4 +23,4 @@
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
*/

4
resources/3rdparty/eigen-3.3-beta1/Eigen/Core

@ -242,7 +242,7 @@
#endif
/** \brief Namespace containing all symbols from the %Eigen library. */
namespace Eigen {
namespace StormEigen {
inline static const char *SimdInstructionSetsInUse(void) {
#if defined(EIGEN_VECTORIZE_AVX)
@ -268,7 +268,7 @@ inline static const char *SimdInstructionSetsInUse(void) {
#endif
}
} // end namespace Eigen
} // end namespace StormEigen
#if defined EIGEN2_SUPPORT_STAGE40_FULL_EIGEN3_STRICTNESS || defined EIGEN2_SUPPORT_STAGE30_FULL_EIGEN3_API || defined EIGEN2_SUPPORT_STAGE20_RESOLVE_API_CONFLICTS || defined EIGEN2_SUPPORT_STAGE10_FULL_EIGEN2_API || defined EIGEN2_SUPPORT
// This will generate an error message:

8
resources/3rdparty/eigen-3.3-beta1/Eigen/QtAlignedMalloc

@ -16,19 +16,19 @@
void *qMalloc(size_t size)
{
return Eigen::internal::aligned_malloc(size);
return StormEigen::internal::aligned_malloc(size);
}
void qFree(void *ptr)
{
Eigen::internal::aligned_free(ptr);
StormEigen::internal::aligned_free(ptr);
}
void *qRealloc(void *ptr, size_t size)
{
void* newPtr = Eigen::internal::aligned_malloc(size);
void* newPtr = StormEigen::internal::aligned_malloc(size);
memcpy(newPtr, ptr, size);
Eigen::internal::aligned_free(ptr);
StormEigen::internal::aligned_free(ptr);
return newPtr;
}

2
resources/3rdparty/eigen-3.3-beta1/Eigen/SuperLUSupport

@ -33,7 +33,7 @@ typedef int int_t;
#define SUPERLU_EMPTY (-1)
namespace Eigen { struct SluMatrix; }
namespace StormEigen { struct SluMatrix; }
/** \ingroup Support_modules
* \defgroup SuperLUSupport_Module SuperLUSupport module

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LDLT.h

@ -13,7 +13,7 @@
#ifndef EIGEN_LDLT_H
#define EIGEN_LDLT_H
namespace Eigen {
namespace StormEigen {
namespace internal {
template<typename MatrixType, int UpLo> struct LDLT_Traits;
@ -59,7 +59,7 @@ template<typename _MatrixType, int _UpLo> class LDLT
};
typedef typename MatrixType::Scalar Scalar;
typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
typedef StormEigen::Index Index; ///< \deprecated since Eigen 3.3
typedef typename MatrixType::StorageIndex StorageIndex;
typedef Matrix<Scalar, RowsAtCompileTime, 1, Options, MaxRowsAtCompileTime, 1> TmpMatrixType;
@ -596,6 +596,6 @@ MatrixBase<Derived>::ldlt() const
}
#endif // __CUDACC__
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_LDLT_H

8
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LLT.h

@ -10,7 +10,7 @@
#ifndef EIGEN_LLT_H
#define EIGEN_LLT_H
namespace Eigen {
namespace StormEigen {
namespace internal{
template<typename MatrixType, int UpLo> struct LLT_Traits;
@ -59,7 +59,7 @@ template<typename _MatrixType, int _UpLo> class LLT
};
typedef typename MatrixType::Scalar Scalar;
typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
typedef StormEigen::Index Index; ///< \deprecated since Eigen 3.3
typedef typename MatrixType::StorageIndex StorageIndex;
enum {
@ -325,7 +325,7 @@ template<typename Scalar> struct llt_inplace<Scalar, Lower>
template<typename MatrixType, typename VectorType>
static Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma)
{
return Eigen::internal::llt_rank_update_lower(mat, vec, sigma);
return StormEigen::internal::llt_rank_update_lower(mat, vec, sigma);
}
};
@ -487,6 +487,6 @@ SelfAdjointView<MatrixType, UpLo>::llt() const
}
#endif // __CUDACC__
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_LLT_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Cholesky/LLT_MKL.h

@ -36,7 +36,7 @@
#include "Eigen/src/Core/util/MKL_support.h"
#include <iostream>
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -73,7 +73,7 @@ template<> struct llt_inplace<EIGTYPE, Lower> \
} \
template<typename MatrixType, typename VectorType> \
static Index rankUpdate(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) \
{ return Eigen::internal::llt_rank_update_lower(mat, vec, sigma); } \
{ return StormEigen::internal::llt_rank_update_lower(mat, vec, sigma); } \
}; \
template<> struct llt_inplace<EIGTYPE, Upper> \
{ \
@ -97,6 +97,6 @@ EIGEN_MKL_LLT(scomplex, MKL_Complex8, c)
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_LLT_MKL_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/CholmodSupport/CholmodSupport.h

@ -10,7 +10,7 @@
#ifndef EIGEN_CHOLMODSUPPORT_H
#define EIGEN_CHOLMODSUPPORT_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -558,6 +558,6 @@ class CholmodDecomposition : public CholmodBase<_MatrixType, _UpLo, CholmodDecom
}
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_CHOLMODSUPPORT_H

10
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Array.h

@ -10,7 +10,7 @@
#ifndef EIGEN_ARRAY_H
#define EIGEN_ARRAY_H
namespace Eigen {
namespace StormEigen {
/** \class Array
* \ingroup Core_Module
@ -303,9 +303,9 @@ EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(std::complex<double>, cd)
#undef EIGEN_MAKE_ARRAY_TYPEDEFS_LARGE
#define EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, SizeSuffix) \
using Eigen::Matrix##SizeSuffix##TypeSuffix; \
using Eigen::Vector##SizeSuffix##TypeSuffix; \
using Eigen::RowVector##SizeSuffix##TypeSuffix;
using StormEigen::Matrix##SizeSuffix##TypeSuffix; \
using StormEigen::Vector##SizeSuffix##TypeSuffix; \
using StormEigen::RowVector##SizeSuffix##TypeSuffix;
#define EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(TypeSuffix) \
EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, 2) \
@ -320,6 +320,6 @@ EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(d) \
EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(cf) \
EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(cd)
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ARRAY_H

8
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ArrayBase.h

@ -10,7 +10,7 @@
#ifndef EIGEN_ARRAYBASE_H
#define EIGEN_ARRAYBASE_H
namespace Eigen {
namespace StormEigen {
template<typename ExpressionType> class MatrixWrapper;
@ -88,7 +88,7 @@ template<typename Derived> class ArrayBase
typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,PlainObject> ConstantReturnType;
#endif // not EIGEN_PARSED_BY_DOXYGEN
#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::ArrayBase
#define EIGEN_CURRENT_STORAGE_BASE_CLASS StormEigen::ArrayBase
# include "../plugins/CommonCwiseUnaryOps.h"
# include "../plugins/MatrixCwiseUnaryOps.h"
# include "../plugins/ArrayCwiseUnaryOps.h"
@ -142,7 +142,7 @@ template<typename Derived> class ArrayBase
EIGEN_DEVICE_FUNC
const ArrayBase<Derived>& array() const { return *this; }
/** \returns an \link Eigen::MatrixBase Matrix \endlink expression of this array
/** \returns an \link StormEigen::MatrixBase Matrix \endlink expression of this array
* \sa MatrixBase::array() */
EIGEN_DEVICE_FUNC
MatrixWrapper<Derived> matrix() { return MatrixWrapper<Derived>(derived()); }
@ -221,6 +221,6 @@ ArrayBase<Derived>::operator/=(const ArrayBase<OtherDerived>& other)
return derived();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ARRAYBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ArrayWrapper.h

@ -10,7 +10,7 @@
#ifndef EIGEN_ARRAYWRAPPER_H
#define EIGEN_ARRAYWRAPPER_H
namespace Eigen {
namespace StormEigen {
/** \class ArrayWrapper
* \ingroup Core_Module
@ -294,6 +294,6 @@ class MatrixWrapper : public MatrixBase<MatrixWrapper<ExpressionType> >
NestedExpressionType m_expression;
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ARRAYWRAPPER_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Assign.h

@ -12,7 +12,7 @@
#ifndef EIGEN_ASSIGN_H
#define EIGEN_ASSIGN_H
namespace Eigen {
namespace StormEigen {
template<typename Derived>
template<typename OtherDerived>
@ -85,6 +85,6 @@ EIGEN_STRONG_INLINE Derived& MatrixBase<Derived>::operator=(const ReturnByValue<
return derived();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ASSIGN_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/AssignEvaluator.h

@ -12,7 +12,7 @@
#ifndef EIGEN_ASSIGN_EVALUATOR_H
#define EIGEN_ASSIGN_EVALUATOR_H
namespace Eigen {
namespace StormEigen {
// This implementation is based on Assign.h
@ -805,6 +805,6 @@ struct Assignment<DstXprType, SrcXprType, Functor, EigenBase2EigenBase, Scalar>
} // namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ASSIGN_EVALUATOR_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Assign_MKL.h

@ -34,7 +34,7 @@
#ifndef EIGEN_ASSIGN_VML_H
#define EIGEN_ASSIGN_VML_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -169,6 +169,6 @@ EIGEN_MKL_VML_DECLARE_POW_CALL(pow, vmzPowx, dcomplex, MKL_Complex16, LA)
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ASSIGN_VML_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/BandMatrix.h

@ -10,7 +10,7 @@
#ifndef EIGEN_BANDMATRIX_H
#define EIGEN_BANDMATRIX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -179,7 +179,7 @@ struct traits<BandMatrix<_Scalar,_Rows,_Cols,_Supers,_Subs,_Options> >
{
typedef _Scalar Scalar;
typedef Dense StorageKind;
typedef Eigen::Index StorageIndex;
typedef StormEigen::Index StorageIndex;
enum {
CoeffReadCost = NumTraits<Scalar>::ReadCost,
RowsAtCompileTime = _Rows,
@ -348,6 +348,6 @@ template<> struct AssignmentKind<DenseShape,BandShape> { typedef EigenBase2Eigen
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_BANDMATRIX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Block.h

@ -11,7 +11,7 @@
#ifndef EIGEN_BLOCK_H
#define EIGEN_BLOCK_H
namespace Eigen {
namespace StormEigen {
/** \class Block
* \ingroup Core_Module
@ -431,6 +431,6 @@ class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_BLOCK_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/BooleanRedux.h

@ -10,7 +10,7 @@
#ifndef EIGEN_ALLANDANY_H
#define EIGEN_ALLANDANY_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -126,7 +126,7 @@ inline bool DenseBase<Derived>::any() const
* \sa all(), any()
*/
template<typename Derived>
inline Eigen::Index DenseBase<Derived>::count() const
inline StormEigen::Index DenseBase<Derived>::count() const
{
return derived().template cast<bool>().template cast<Index>().sum();
}
@ -159,6 +159,6 @@ inline bool DenseBase<Derived>::allFinite() const
#endif
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_ALLANDANY_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CommaInitializer.h

@ -11,7 +11,7 @@
#ifndef EIGEN_COMMAINITIALIZER_H
#define EIGEN_COMMAINITIALIZER_H
namespace Eigen {
namespace StormEigen {
/** \class CommaInitializer
* \ingroup Core_Module
@ -106,7 +106,7 @@ struct CommaInitializer
EIGEN_DEVICE_FUNC
inline ~CommaInitializer()
#if defined VERIFY_RAISES_ASSERT && (!defined EIGEN_NO_ASSERTION_CHECKING) && defined EIGEN_EXCEPTIONS
EIGEN_EXCEPTION_SPEC(Eigen::eigen_assert_exception)
EIGEN_EXCEPTION_SPEC(StormEigen::eigen_assert_exception)
#endif
{
eigen_assert((m_row+m_currentBlockRows) == m_xpr.rows()
@ -158,6 +158,6 @@ DenseBase<Derived>::operator<<(const DenseBase<OtherDerived>& other)
return CommaInitializer<Derived>(*static_cast<Derived *>(this), other);
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_COMMAINITIALIZER_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CoreEvaluators.h

@ -13,7 +13,7 @@
#ifndef EIGEN_COREEVALUATORS_H
#define EIGEN_COREEVALUATORS_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -1371,6 +1371,6 @@ protected:
} // namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_COREEVALUATORS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CoreIterators.h

@ -10,7 +10,7 @@
#ifndef EIGEN_COREITERATORS_H
#define EIGEN_COREITERATORS_H
namespace Eigen {
namespace StormEigen {
/* This file contains the respective InnerIterator definition of the expressions defined in Eigen/Core
*/
@ -122,6 +122,6 @@ public:
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_COREITERATORS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseBinaryOp.h

@ -11,7 +11,7 @@
#ifndef EIGEN_CWISE_BINARY_OP_H
#define EIGEN_CWISE_BINARY_OP_H
namespace Eigen {
namespace StormEigen {
/** \class CwiseBinaryOp
* \ingroup Core_Module
@ -178,7 +178,7 @@ MatrixBase<Derived>::operator+=(const MatrixBase<OtherDerived>& other)
return derived();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_CWISE_BINARY_OP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseNullaryOp.h

@ -10,7 +10,7 @@
#ifndef EIGEN_CWISE_NULLARY_OP_H
#define EIGEN_CWISE_NULLARY_OP_H
namespace Eigen {
namespace StormEigen {
/** \class CwiseNullaryOp
* \ingroup Core_Module
@ -866,6 +866,6 @@ template<typename Derived>
EIGEN_STRONG_INLINE const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::UnitW()
{ return Derived::Unit(3); }
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_CWISE_NULLARY_OP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseUnaryOp.h

@ -11,7 +11,7 @@
#ifndef EIGEN_CWISE_UNARY_OP_H
#define EIGEN_CWISE_UNARY_OP_H
namespace Eigen {
namespace StormEigen {
/** \class CwiseUnaryOp
* \ingroup Core_Module
@ -98,6 +98,6 @@ public:
typedef typename internal::generic_xpr_base<CwiseUnaryOp<UnaryOp, XprType> >::type Base;
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_CWISE_UNARY_OP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/CwiseUnaryView.h

@ -10,7 +10,7 @@
#ifndef EIGEN_CWISE_UNARY_VIEW_H
#define EIGEN_CWISE_UNARY_VIEW_H
namespace Eigen {
namespace StormEigen {
/** \class CwiseUnaryView
* \ingroup Core_Module
@ -123,6 +123,6 @@ class CwiseUnaryViewImpl<ViewOp,MatrixType,Dense>
}
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_CWISE_UNARY_VIEW_H

12
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseBase.h

@ -11,7 +11,7 @@
#ifndef EIGEN_DENSEBASE_H
#define EIGEN_DENSEBASE_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -52,15 +52,15 @@ template<typename Derived> class DenseBase
/** Inner iterator type to iterate over the coefficients of a row or column.
* \sa class InnerIterator
*/
typedef Eigen::InnerIterator<Derived> InnerIterator;
typedef StormEigen::InnerIterator<Derived> InnerIterator;
typedef typename internal::traits<Derived>::StorageKind StorageKind;
/**
* \brief The type used to store indices
* \details This typedef is relevant for types that store multiple indices such as
* PermutationMatrix or Transpositions, otherwise it defaults to Eigen::Index
* \sa \ref TopicPreprocessorDirectives, Eigen::Index, SparseMatrixBase.
* PermutationMatrix or Transpositions, otherwise it defaults to StormEigen::Index
* \sa \ref TopicPreprocessorDirectives, StormEigen::Index, SparseMatrixBase.
*/
typedef typename internal::traits<Derived>::StorageIndex StorageIndex;
@ -560,7 +560,7 @@ template<typename Derived> class DenseBase
}
EIGEN_DEVICE_FUNC void reverseInPlace();
#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::DenseBase
#define EIGEN_CURRENT_STORAGE_BASE_CLASS StormEigen::DenseBase
# include "../plugins/BlockMethods.h"
# ifdef EIGEN_DENSEBASE_PLUGIN
# include EIGEN_DENSEBASE_PLUGIN
@ -596,6 +596,6 @@ template<typename Derived> class DenseBase
template<typename OtherDerived> EIGEN_DEVICE_FUNC explicit DenseBase(const DenseBase<OtherDerived>&);
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DENSEBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseCoeffsBase.h

@ -10,7 +10,7 @@
#ifndef EIGEN_DENSECOEFFSBASE_H
#define EIGEN_DENSECOEFFSBASE_H
namespace Eigen {
namespace StormEigen {
namespace internal {
template<typename T> struct add_const_on_value_type_if_arithmetic
@ -652,6 +652,6 @@ struct outer_stride_at_compile_time<Derived, false>
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DENSECOEFFSBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DenseStorage.h

@ -18,7 +18,7 @@
#define EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN
#endif
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -558,6 +558,6 @@ template<typename T, int _Cols, int _Options> class DenseStorage<T, Dynamic, Dyn
EIGEN_DEVICE_FUNC T *data() { return m_data; }
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATRIX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Diagonal.h

@ -11,7 +11,7 @@
#ifndef EIGEN_DIAGONAL_H
#define EIGEN_DIAGONAL_H
namespace Eigen {
namespace StormEigen {
/** \class Diagonal
* \ingroup Core_Module
@ -252,6 +252,6 @@ MatrixBase<Derived>::diagonal() const
return typename ConstDiagonalIndexReturnType<Index_>::Type(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DIAGONAL_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DiagonalMatrix.h

@ -11,7 +11,7 @@
#ifndef EIGEN_DIAGONALMATRIX_H
#define EIGEN_DIAGONALMATRIX_H
namespace Eigen {
namespace StormEigen {
#ifndef EIGEN_PARSED_BY_DOXYGEN
template<typename Derived>
@ -335,6 +335,6 @@ struct Assignment<DstXprType, SrcXprType, Functor, Diagonal2Dense, Scalar>
} // namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DIAGONALMATRIX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/DiagonalProduct.h

@ -11,7 +11,7 @@
#ifndef EIGEN_DIAGONALPRODUCT_H
#define EIGEN_DIAGONALPRODUCT_H
namespace Eigen {
namespace StormEigen {
/** \returns the diagonal matrix product of \c *this by the diagonal matrix \a diagonal.
*/
@ -23,6 +23,6 @@ MatrixBase<Derived>::operator*(const DiagonalBase<DiagonalDerived> &a_diagonal)
return Product<Derived, DiagonalDerived, LazyProduct>(derived(),a_diagonal.derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DIAGONALPRODUCT_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Dot.h

@ -10,7 +10,7 @@
#ifndef EIGEN_DOT_H
#define EIGEN_DOT_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -179,7 +179,7 @@ struct lpNorm_selector<Derived, Infinity>
} // end namespace internal
/** \returns the \b coefficient-wise \f$ \ell^p \f$ norm of \c *this, that is, returns the p-th root of the sum of the p-th powers of the absolute values
* of the coefficients of \c *this. If \a p is the special value \a Eigen::Infinity, this function returns the \f$ \ell^\infty \f$
* of the coefficients of \c *this. If \a p is the special value \a StormEigen::Infinity, this function returns the \f$ \ell^\infty \f$
* norm, that is the maximum of the absolute values of the coefficients of \c *this.
*
* \note For matrices, this function does not compute the <a href="https://en.wikipedia.org/wiki/Operator_norm">operator-norm</a>. That is, if \c *this is a matrix, then its coefficients are interpreted as a 1D vector. Nonetheless, you can easily compute the 1-norm and \f$\infty\f$-norm matrix operator norms using \link TutorialReductionsVisitorsBroadcastingReductionsNorm partial reductions \endlink.
@ -238,6 +238,6 @@ bool MatrixBase<Derived>::isUnitary(const RealScalar& prec) const
return true;
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DOT_H

8
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/EigenBase.h

@ -11,7 +11,7 @@
#ifndef EIGEN_EIGENBASE_H
#define EIGEN_EIGENBASE_H
namespace Eigen {
namespace StormEigen {
/** \class EigenBase
*
@ -31,10 +31,10 @@ template<typename Derived> struct EigenBase
/** \brief The interface type of indices
* \details To change this, \c \#define the preprocessor symbol \c EIGEN_DEFAULT_DENSE_INDEX_TYPE.
* \deprecated Since Eigen 3.3, its usage is deprecated. Use Eigen::Index instead.
* \deprecated Since Eigen 3.3, its usage is deprecated. Use StormEigen::Index instead.
* \sa StorageIndex, \ref TopicPreprocessorDirectives.
*/
typedef Eigen::Index Index;
typedef StormEigen::Index Index;
// FIXME is it needed?
typedef typename internal::traits<Derived>::StorageKind StorageKind;
@ -150,6 +150,6 @@ Derived& DenseBase<Derived>::operator-=(const EigenBase<OtherDerived> &other)
return derived();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_EIGENBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ForceAlignedAccess.h

@ -10,7 +10,7 @@
#ifndef EIGEN_FORCEALIGNEDACCESS_H
#define EIGEN_FORCEALIGNEDACCESS_H
namespace Eigen {
namespace StormEigen {
/** \class ForceAlignedAccess
* \ingroup Core_Module
@ -141,6 +141,6 @@ MatrixBase<Derived>::forceAlignedAccessIf()
return derived(); // FIXME This should not work but apparently is never used
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_FORCEALIGNEDACCESS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Fuzzy.h

@ -11,7 +11,7 @@
#ifndef EIGEN_FUZZY_H
#define EIGEN_FUZZY_H
namespace Eigen {
namespace StormEigen {
namespace internal
{
@ -150,6 +150,6 @@ bool DenseBase<Derived>::isMuchSmallerThan(
return internal::isMuchSmallerThan_object_selector<Derived, OtherDerived>::run(derived(), other.derived(), prec);
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_FUZZY_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GeneralProduct.h

@ -11,7 +11,7 @@
#ifndef EIGEN_GENERAL_PRODUCT_H
#define EIGEN_GENERAL_PRODUCT_H
namespace Eigen {
namespace StormEigen {
enum {
Large = 2,
@ -452,6 +452,6 @@ MatrixBase<Derived>::lazyProduct(const MatrixBase<OtherDerived> &other) const
return Product<Derived,OtherDerived,LazyProduct>(derived(), other.derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PRODUCT_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GenericPacketMath.h

@ -11,7 +11,7 @@
#ifndef EIGEN_GENERIC_PACKET_MATH_H
#define EIGEN_GENERIC_PACKET_MATH_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -572,6 +572,6 @@ pblend(const Selector<unpacket_traits<Packet>::size>& ifPacket, const Packet& th
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_GENERIC_PACKET_MATH_H

36
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/GlobalFunctions.h

@ -13,9 +13,9 @@
#define EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(NAME,FUNCTOR) \
template<typename Derived> \
inline const Eigen::CwiseUnaryOp<Eigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived> \
(NAME)(const Eigen::ArrayBase<Derived>& x) { \
return Eigen::CwiseUnaryOp<Eigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived>(x.derived()); \
inline const StormEigen::CwiseUnaryOp<StormEigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived> \
(NAME)(const StormEigen::ArrayBase<Derived>& x) { \
return StormEigen::CwiseUnaryOp<StormEigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived>(x.derived()); \
}
#define EIGEN_ARRAY_DECLARE_GLOBAL_EIGEN_UNARY(NAME,FUNCTOR) \
@ -23,18 +23,18 @@
template<typename Derived> \
struct NAME##_retval<ArrayBase<Derived> > \
{ \
typedef const Eigen::CwiseUnaryOp<Eigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived> type; \
typedef const StormEigen::CwiseUnaryOp<StormEigen::internal::FUNCTOR<typename Derived::Scalar>, const Derived> type; \
}; \
template<typename Derived> \
struct NAME##_impl<ArrayBase<Derived> > \
{ \
static inline typename NAME##_retval<ArrayBase<Derived> >::type run(const Eigen::ArrayBase<Derived>& x) \
static inline typename NAME##_retval<ArrayBase<Derived> >::type run(const StormEigen::ArrayBase<Derived>& x) \
{ \
return typename NAME##_retval<ArrayBase<Derived> >::type(x.derived()); \
} \
};
namespace Eigen
namespace StormEigen
{
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(real,scalar_real_op)
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(imag,scalar_imag_op)
@ -70,8 +70,8 @@ namespace Eigen
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sign,scalar_sign_op)
template<typename Derived>
inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar>, const Derived>
pow(const Eigen::ArrayBase<Derived>& x, const typename Derived::Scalar& exponent) {
inline const StormEigen::CwiseUnaryOp<StormEigen::internal::scalar_pow_op<typename Derived::Scalar>, const Derived>
pow(const StormEigen::ArrayBase<Derived>& x, const typename Derived::Scalar& exponent) {
return x.derived().pow(exponent);
}
@ -85,10 +85,10 @@ namespace Eigen
* \sa ArrayBase::pow()
*/
template<typename Derived,typename ExponentDerived>
inline const Eigen::CwiseBinaryOp<Eigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>
pow(const Eigen::ArrayBase<Derived>& x, const Eigen::ArrayBase<ExponentDerived>& exponents)
inline const StormEigen::CwiseBinaryOp<StormEigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>
pow(const StormEigen::ArrayBase<Derived>& x, const StormEigen::ArrayBase<ExponentDerived>& exponents)
{
return Eigen::CwiseBinaryOp<Eigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>(
return StormEigen::CwiseBinaryOp<StormEigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>(
x.derived(),
exponents.derived()
);
@ -105,11 +105,11 @@ namespace Eigen
* \sa ArrayBase::pow()
*/
template<typename Derived>
inline const Eigen::CwiseBinaryOp<Eigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename Derived::Scalar>, const typename Derived::ConstantReturnType, const Derived>
pow(const typename Derived::Scalar& x, const Eigen::ArrayBase<Derived>& exponents)
inline const StormEigen::CwiseBinaryOp<StormEigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename Derived::Scalar>, const typename Derived::ConstantReturnType, const Derived>
pow(const typename Derived::Scalar& x, const StormEigen::ArrayBase<Derived>& exponents)
{
typename Derived::ConstantReturnType constant_x(exponents.rows(), exponents.cols(), x);
return Eigen::CwiseBinaryOp<Eigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename Derived::Scalar>, const typename Derived::ConstantReturnType, const Derived>(
return StormEigen::CwiseBinaryOp<StormEigen::internal::scalar_binary_pow_op<typename Derived::Scalar, typename Derived::Scalar>, const typename Derived::ConstantReturnType, const Derived>(
constant_x,
exponents.derived()
);
@ -119,12 +119,12 @@ namespace Eigen
* \brief Component-wise division of a scalar by array elements.
**/
template <typename Derived>
inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>, const Derived>
operator/(const typename Derived::Scalar& s, const Eigen::ArrayBase<Derived>& a)
inline const StormEigen::CwiseUnaryOp<StormEigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>, const Derived>
operator/(const typename Derived::Scalar& s, const StormEigen::ArrayBase<Derived>& a)
{
return Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>, const Derived>(
return StormEigen::CwiseUnaryOp<StormEigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>, const Derived>(
a.derived(),
Eigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>(s)
StormEigen::internal::scalar_inverse_mult_op<typename Derived::Scalar>(s)
);
}

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/IO.h

@ -11,7 +11,7 @@
#ifndef EIGEN_IO_H
#define EIGEN_IO_H
namespace Eigen {
namespace StormEigen {
enum { DontAlignCols = 1 };
enum { StreamPrecision = -1,
@ -236,7 +236,7 @@ std::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat&
* If you wish to print the matrix with a format different than the default, use DenseBase::format().
*
* It is also possible to change the default format by defining EIGEN_DEFAULT_IO_FORMAT before including Eigen headers.
* If not defined, this will automatically be defined to Eigen::IOFormat(), that is the Eigen::IOFormat with default parameters.
* If not defined, this will automatically be defined to StormEigen::IOFormat(), that is the StormEigen::IOFormat with default parameters.
*
* \sa DenseBase::format()
*/
@ -248,6 +248,6 @@ std::ostream & operator <<
return internal::print_matrix(s, m.eval(), EIGEN_DEFAULT_IO_FORMAT);
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_IO_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Inverse.h

@ -10,7 +10,7 @@
#ifndef EIGEN_INVERSE_H
#define EIGEN_INVERSE_H
namespace Eigen {
namespace StormEigen {
template<typename XprType,typename StorageKind> class InverseImpl;
@ -112,6 +112,6 @@ protected:
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_INVERSE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Map.h

@ -11,7 +11,7 @@
#ifndef EIGEN_MAP_H
#define EIGEN_MAP_H
namespace Eigen {
namespace StormEigen {
/** \class Map
* \ingroup Core_Module
@ -160,6 +160,6 @@ template<typename PlainObjectType, int MapOptions, typename StrideType> class Ma
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MAP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MapBase.h

@ -15,7 +15,7 @@
EIGEN_STATIC_ASSERT((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \
YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT)
namespace Eigen {
namespace StormEigen {
/** \class MapBase
* \ingroup Core_Module
@ -256,6 +256,6 @@ template<typename Derived> class MapBase<Derived, WriteAccessors>
#undef EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MAPBASE_H

8
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MathFunctions.h

@ -13,7 +13,7 @@
// source: http://www.geom.uiuc.edu/~huberty/math5337/groupe/digits.html
#define EIGEN_PI 3.141592653589793238462643383279502884197169399375105820974944592307816406
namespace Eigen {
namespace StormEigen {
// On WINCE, std::abs is defined for int only, so let's defined our own overloads:
// This issue has been confirmed with MSVC 2008 only, but the issue might exist for more recent versions too.
@ -63,8 +63,8 @@ struct global_math_functions_filtering_base
typedef typename T::Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl type;
};
#define EIGEN_MATHFUNC_IMPL(func, scalar) Eigen::internal::func##_impl<typename Eigen::internal::global_math_functions_filtering_base<scalar>::type>
#define EIGEN_MATHFUNC_RETVAL(func, scalar) typename Eigen::internal::func##_retval<typename Eigen::internal::global_math_functions_filtering_base<scalar>::type>::type
#define EIGEN_MATHFUNC_IMPL(func, scalar) StormEigen::internal::func##_impl<typename StormEigen::internal::global_math_functions_filtering_base<scalar>::type>
#define EIGEN_MATHFUNC_RETVAL(func, scalar) typename StormEigen::internal::func##_retval<typename StormEigen::internal::global_math_functions_filtering_base<scalar>::type>::type
/****************************************************************************
* Implementation of real *
@ -1122,6 +1122,6 @@ template<> struct scalar_fuzzy_impl<bool>
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATHFUNCTIONS_H

16
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Matrix.h

@ -11,7 +11,7 @@
#ifndef EIGEN_MATRIX_H
#define EIGEN_MATRIX_H
namespace Eigen {
namespace StormEigen {
/** \class Matrix
* \ingroup Core_Module
@ -54,13 +54,13 @@ namespace Eigen {
* You can access elements of vectors and matrices using normal subscripting:
*
* \code
* Eigen::VectorXd v(10);
* StormEigen::VectorXd v(10);
* v[0] = 0.1;
* v[1] = 0.2;
* v(0) = 0.3;
* v(1) = 0.4;
*
* Eigen::MatrixXi m(10, 10);
* StormEigen::MatrixXi m(10, 10);
* m(0, 1) = 1;
* m(0, 2) = 2;
* m(0, 3) = 3;
@ -105,7 +105,7 @@ namespace Eigen {
* <tr><td>\code Matrix<T,Dynamic,Dynamic> \endcode</td><td>\code
* struct {
* T *data; // with (size_t(data)%EIGEN_MAX_ALIGN_BYTES)==0
* Eigen::Index rows, cols;
* StormEigen::Index rows, cols;
* };
* \endcode</td></tr>
* <tr class="alt"><td>\code
@ -113,7 +113,7 @@ namespace Eigen {
* Matrix<T,1,Dynamic> \endcode</td><td>\code
* struct {
* T *data; // with (size_t(data)%EIGEN_MAX_ALIGN_BYTES)==0
* Eigen::Index size;
* StormEigen::Index size;
* };
* \endcode</td></tr>
* <tr><td>\code Matrix<T,Rows,Cols> \endcode</td><td>\code
@ -124,7 +124,7 @@ namespace Eigen {
* <tr class="alt"><td>\code Matrix<T,Dynamic,Dynamic,0,MaxRows,MaxCols> \endcode</td><td>\code
* struct {
* T data[MaxRows*MaxCols]; // with (size_t(data)%A(MaxRows*MaxCols*sizeof(T)))==0
* Eigen::Index rows, cols;
* StormEigen::Index rows, cols;
* };
* \endcode</td></tr>
* </table>
@ -155,7 +155,7 @@ private:
public:
typedef _Scalar Scalar;
typedef Dense StorageKind;
typedef Eigen::Index StorageIndex;
typedef StormEigen::Index StorageIndex;
typedef MatrixXpr XprKind;
enum {
RowsAtCompileTime = _Rows,
@ -456,6 +456,6 @@ EIGEN_MAKE_TYPEDEFS_ALL_SIZES(std::complex<double>, cd)
#undef EIGEN_MAKE_TYPEDEFS
#undef EIGEN_MAKE_FIXED_TYPEDEFS
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATRIX_H

14
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/MatrixBase.h

@ -11,7 +11,7 @@
#ifndef EIGEN_MATRIXBASE_H
#define EIGEN_MATRIXBASE_H
namespace Eigen {
namespace StormEigen {
/** \class MatrixBase
* \ingroup Core_Module
@ -34,7 +34,7 @@ namespace Eigen {
*
* \code
template<typename Derived>
void printFirstRow(const Eigen::MatrixBase<Derived>& x)
void printFirstRow(const StormEigen::MatrixBase<Derived>& x)
{
cout << x.row(0) << endl;
}
@ -122,7 +122,7 @@ template<typename Derived> class MatrixBase
internal::traits<Derived>::ColsAtCompileTime> BasisReturnType;
#endif // not EIGEN_PARSED_BY_DOXYGEN
#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::MatrixBase
#define EIGEN_CURRENT_STORAGE_BASE_CLASS StormEigen::MatrixBase
# include "../plugins/CommonCwiseUnaryOps.h"
# include "../plugins/CommonCwiseBinaryOps.h"
# include "../plugins/MatrixCwiseUnaryOps.h"
@ -303,7 +303,7 @@ template<typename Derived> class MatrixBase
inline bool operator!=(const MatrixBase<OtherDerived>& other) const
{ return cwiseNotEqual(other).any(); }
NoAlias<Derived,Eigen::MatrixBase > noalias();
NoAlias<Derived,StormEigen::MatrixBase > noalias();
// TODO forceAlignedAccess is temporarily disabled
// Need to find a nicer workaround.
@ -319,10 +319,10 @@ template<typename Derived> class MatrixBase
EIGEN_DEVICE_FUNC MatrixBase<Derived>& matrix() { return *this; }
EIGEN_DEVICE_FUNC const MatrixBase<Derived>& matrix() const { return *this; }
/** \returns an \link Eigen::ArrayBase Array \endlink expression of this matrix
/** \returns an \link StormEigen::ArrayBase Array \endlink expression of this matrix
* \sa ArrayBase::matrix() */
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE ArrayWrapper<Derived> array() { return ArrayWrapper<Derived>(derived()); }
/** \returns a const \link Eigen::ArrayBase Array \endlink expression of this matrix
/** \returns a const \link StormEigen::ArrayBase Array \endlink expression of this matrix
* \sa ArrayBase::matrix() */
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const ArrayWrapper<const Derived> array() const { return ArrayWrapper<const Derived>(derived()); }
@ -522,6 +522,6 @@ inline void MatrixBase<Derived>::applyOnTheLeft(const EigenBase<OtherDerived> &o
other.derived().applyThisOnTheLeft(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATRIXBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NestByValue.h

@ -11,7 +11,7 @@
#ifndef EIGEN_NESTBYVALUE_H
#define EIGEN_NESTBYVALUE_H
namespace Eigen {
namespace StormEigen {
/** \class NestByValue
* \ingroup Core_Module
@ -106,6 +106,6 @@ DenseBase<Derived>::nestByValue() const
return NestByValue<Derived>(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_NESTBYVALUE_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NoAlias.h

@ -10,7 +10,7 @@
#ifndef EIGEN_NOALIAS_H
#define EIGEN_NOALIAS_H
namespace Eigen {
namespace StormEigen {
/** \class NoAlias
* \ingroup Core_Module
@ -100,9 +100,9 @@ class NoAlias
template<typename Derived>
NoAlias<Derived,MatrixBase> MatrixBase<Derived>::noalias()
{
return NoAlias<Derived, Eigen::MatrixBase >(derived());
return NoAlias<Derived, StormEigen::MatrixBase >(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_NOALIAS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/NumTraits.h

@ -10,7 +10,7 @@
#ifndef EIGEN_NUMTRAITS_H
#define EIGEN_NUMTRAITS_H
namespace Eigen {
namespace StormEigen {
/** \class NumTraits
* \ingroup Core_Module
@ -166,6 +166,6 @@ struct NumTraits<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> >
static inline RealScalar dummy_precision() { return NumTraits<RealScalar>::dummy_precision(); }
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_NUMTRAITS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/PermutationMatrix.h

@ -11,7 +11,7 @@
#ifndef EIGEN_PERMUTATIONMATRIX_H
#define EIGEN_PERMUTATIONMATRIX_H
namespace Eigen {
namespace StormEigen {
/** \class PermutationBase
* \ingroup Core_Module
@ -631,6 +631,6 @@ template<> struct AssignmentKind<DenseShape,PermutationShape> { typedef EigenBas
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PERMUTATIONMATRIX_H

30
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/PlainObjectBase.h

@ -22,7 +22,7 @@
# define EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED
#endif
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -111,22 +111,22 @@ class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
using Base::IsVectorAtCompileTime;
using Base::Flags;
template<typename PlainObjectType, int MapOptions, typename StrideType> friend class Eigen::Map;
friend class Eigen::Map<Derived, Unaligned>;
typedef Eigen::Map<Derived, Unaligned> MapType;
friend class Eigen::Map<const Derived, Unaligned>;
typedef const Eigen::Map<const Derived, Unaligned> ConstMapType;
template<typename PlainObjectType, int MapOptions, typename StrideType> friend class StormEigen::Map;
friend class StormEigen::Map<Derived, Unaligned>;
typedef StormEigen::Map<Derived, Unaligned> MapType;
friend class StormEigen::Map<const Derived, Unaligned>;
typedef const StormEigen::Map<const Derived, Unaligned> ConstMapType;
#if EIGEN_MAX_ALIGN_BYTES>0
// for EIGEN_MAX_ALIGN_BYTES==0, AlignedMax==Unaligned, and many compilers generate warnings for friend-ing a class twice.
friend class Eigen::Map<Derived, AlignedMax>;
friend class Eigen::Map<const Derived, AlignedMax>;
friend class StormEigen::Map<Derived, AlignedMax>;
friend class StormEigen::Map<const Derived, AlignedMax>;
#endif
typedef Eigen::Map<Derived, AlignedMax> AlignedMapType;
typedef const Eigen::Map<const Derived, AlignedMax> ConstAlignedMapType;
template<typename StrideType> struct StridedMapType { typedef Eigen::Map<Derived, Unaligned, StrideType> type; };
template<typename StrideType> struct StridedConstMapType { typedef Eigen::Map<const Derived, Unaligned, StrideType> type; };
template<typename StrideType> struct StridedAlignedMapType { typedef Eigen::Map<Derived, AlignedMax, StrideType> type; };
template<typename StrideType> struct StridedConstAlignedMapType { typedef Eigen::Map<const Derived, AlignedMax, StrideType> type; };
typedef StormEigen::Map<Derived, AlignedMax> AlignedMapType;
typedef const StormEigen::Map<const Derived, AlignedMax> ConstAlignedMapType;
template<typename StrideType> struct StridedMapType { typedef StormEigen::Map<Derived, Unaligned, StrideType> type; };
template<typename StrideType> struct StridedConstMapType { typedef StormEigen::Map<const Derived, Unaligned, StrideType> type; };
template<typename StrideType> struct StridedAlignedMapType { typedef StormEigen::Map<Derived, AlignedMax, StrideType> type; };
template<typename StrideType> struct StridedConstAlignedMapType { typedef StormEigen::Map<const Derived, AlignedMax, StrideType> type; };
protected:
DenseStorage<Scalar, Base::MaxSizeAtCompileTime, Base::RowsAtCompileTime, Base::ColsAtCompileTime, Options> m_storage;
@ -989,6 +989,6 @@ struct matrix_swap_impl<MatrixTypeA, MatrixTypeB, true>
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_DENSESTORAGEBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Product.h

@ -10,7 +10,7 @@
#ifndef EIGEN_PRODUCT_H
#define EIGEN_PRODUCT_H
namespace Eigen {
namespace StormEigen {
template<typename Lhs, typename Rhs, int Option, typename StorageKind> class ProductImpl;
@ -217,6 +217,6 @@ class ProductImpl<Lhs,Rhs,Option,Dense>
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PRODUCT_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ProductEvaluators.h

@ -13,7 +13,7 @@
#ifndef EIGEN_PRODUCTEVALUATORS_H
#define EIGEN_PRODUCTEVALUATORS_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -1056,6 +1056,6 @@ struct generic_product_impl<Lhs, Transpose<Rhs>, MatrixShape, TranspositionsShap
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PRODUCT_EVALUATORS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Random.h

@ -10,7 +10,7 @@
#ifndef EIGEN_RANDOM_H
#define EIGEN_RANDOM_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -178,6 +178,6 @@ PlainObjectBase<Derived>::setRandom(Index rows, Index cols)
return setRandom();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_RANDOM_H

14
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Redux.h

@ -11,7 +11,7 @@
#ifndef EIGEN_REDUX_H
#define EIGEN_REDUX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -423,7 +423,7 @@ template<typename Derived>
EIGEN_STRONG_INLINE typename internal::traits<Derived>::Scalar
DenseBase<Derived>::minCoeff() const
{
return derived().redux(Eigen::internal::scalar_min_op<Scalar>());
return derived().redux(StormEigen::internal::scalar_min_op<Scalar>());
}
/** \returns the maximum of all coefficients of \c *this.
@ -433,7 +433,7 @@ template<typename Derived>
EIGEN_STRONG_INLINE typename internal::traits<Derived>::Scalar
DenseBase<Derived>::maxCoeff() const
{
return derived().redux(Eigen::internal::scalar_max_op<Scalar>());
return derived().redux(StormEigen::internal::scalar_max_op<Scalar>());
}
/** \returns the sum of all coefficients of *this
@ -446,7 +446,7 @@ DenseBase<Derived>::sum() const
{
if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0))
return Scalar(0);
return derived().redux(Eigen::internal::scalar_sum_op<Scalar>());
return derived().redux(StormEigen::internal::scalar_sum_op<Scalar>());
}
/** \returns the mean of all coefficients of *this
@ -457,7 +457,7 @@ template<typename Derived>
EIGEN_STRONG_INLINE typename internal::traits<Derived>::Scalar
DenseBase<Derived>::mean() const
{
return Scalar(derived().redux(Eigen::internal::scalar_sum_op<Scalar>())) / Scalar(this->size());
return Scalar(derived().redux(StormEigen::internal::scalar_sum_op<Scalar>())) / Scalar(this->size());
}
/** \returns the product of all coefficients of *this
@ -473,7 +473,7 @@ DenseBase<Derived>::prod() const
{
if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0))
return Scalar(1);
return derived().redux(Eigen::internal::scalar_product_op<Scalar>());
return derived().redux(StormEigen::internal::scalar_product_op<Scalar>());
}
/** \returns the trace of \c *this, i.e. the sum of the coefficients on the main diagonal.
@ -489,6 +489,6 @@ MatrixBase<Derived>::trace() const
return derived().diagonal().sum();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_REDUX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Ref.h

@ -10,7 +10,7 @@
#ifndef EIGEN_REF_H
#define EIGEN_REF_H
namespace Eigen {
namespace StormEigen {
/** \class Ref
* \ingroup Core_Module
@ -271,6 +271,6 @@ template<typename TPlainObjectType, int Options, typename StrideType> class Ref<
TPlainObjectType m_object;
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_REF_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Replicate.h

@ -10,7 +10,7 @@
#ifndef EIGEN_REPLICATE_H
#define EIGEN_REPLICATE_H
namespace Eigen {
namespace StormEigen {
/**
* \class Replicate
@ -136,6 +136,6 @@ VectorwiseOp<ExpressionType,Direction>::replicate(Index factor) const
(_expression(),Direction==Vertical?factor:1,Direction==Horizontal?factor:1);
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_REPLICATE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/ReturnByValue.h

@ -11,7 +11,7 @@
#ifndef EIGEN_RETURNBYVALUE_H
#define EIGEN_RETURNBYVALUE_H
namespace Eigen {
namespace StormEigen {
/** \class ReturnByValue
* \ingroup Core_Module
@ -113,6 +113,6 @@ protected:
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_RETURNBYVALUE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Reverse.h

@ -12,7 +12,7 @@
#ifndef EIGEN_REVERSE_H
#define EIGEN_REVERSE_H
namespace Eigen {
namespace StormEigen {
/** \class Reverse
* \ingroup Core_Module
@ -206,6 +206,6 @@ void VectorwiseOp<ExpressionType,Direction>::reverseInPlace()
internal::vectorwise_reverse_inplace_impl<Direction>::run(_expression().const_cast_derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_REVERSE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Select.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SELECT_H
#define EIGEN_SELECT_H
namespace Eigen {
namespace StormEigen {
/** \class Select
* \ingroup Core_Module
@ -157,6 +157,6 @@ DenseBase<Derived>::select(const typename ElseDerived::Scalar& thenScalar,
derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SELECT_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SelfAdjointView.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SELFADJOINTMATRIX_H
#define EIGEN_SELFADJOINTMATRIX_H
namespace Eigen {
namespace StormEigen {
/** \class SelfAdjointView
* \ingroup Core_Module
@ -269,6 +269,6 @@ MatrixBase<Derived>::selfadjointView()
return typename SelfAdjointViewReturnType<UpLo>::Type(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SELFADJOINTMATRIX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SelfCwiseBinaryOp.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SELFCWISEBINARYOP_H
#define EIGEN_SELFCWISEBINARYOP_H
namespace Eigen {
namespace StormEigen {
template<typename Derived>
inline Derived& DenseBase<Derived>::operator*=(const Scalar& other)
@ -44,6 +44,6 @@ inline Derived& DenseBase<Derived>::operator/=(const Scalar& other)
return derived();
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SELFCWISEBINARYOP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Solve.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SOLVE_H
#define EIGEN_SOLVE_H
namespace Eigen {
namespace StormEigen {
template<typename Decomposition, typename RhsType, typename StorageKind> class SolveImpl;
@ -168,6 +168,6 @@ struct Assignment<DstXprType, Solve<CwiseUnaryOp<internal::scalar_conjugate_op<t
} // end namepsace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SOLVE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SolveTriangular.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SOLVETRIANGULAR_H
#define EIGEN_SOLVETRIANGULAR_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -225,6 +225,6 @@ template<int Side, typename TriangularType, typename Rhs> struct triangular_solv
} // namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SOLVETRIANGULAR_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SolverBase.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SOLVERBASE_H
#define EIGEN_SOLVERBASE_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -125,6 +125,6 @@ struct generic_xpr_base<Derived, MatrixXpr, SolverStorage>
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SOLVERBASE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/SpecialFunctions.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SPECIAL_FUNCTIONS_H
#define EIGEN_SPECIAL_FUNCTIONS_H
namespace Eigen {
namespace StormEigen {
namespace internal {
/****************************************************************************
@ -155,6 +155,6 @@ inline EIGEN_MATHFUNC_RETVAL(erfc, Scalar) erfc(const Scalar& x)
} // end namespace numext
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SPECIAL_FUNCTIONS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/StableNorm.h

@ -10,7 +10,7 @@
#ifndef EIGEN_STABLENORM_H
#define EIGEN_STABLENORM_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -214,6 +214,6 @@ MatrixBase<Derived>::hypotNorm() const
return this->cwiseAbs().redux(internal::scalar_hypot_op<RealScalar>());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_STABLENORM_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Stride.h

@ -10,7 +10,7 @@
#ifndef EIGEN_STRIDE_H
#define EIGEN_STRIDE_H
namespace Eigen {
namespace StormEigen {
/** \class Stride
* \ingroup Core_Module
@ -44,7 +44,7 @@ template<int _OuterStrideAtCompileTime, int _InnerStrideAtCompileTime>
class Stride
{
public:
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
typedef StormEigen::Index Index; ///< \deprecated since Eigen 3.3
enum {
InnerStrideAtCompileTime = _InnerStrideAtCompileTime,
OuterStrideAtCompileTime = _OuterStrideAtCompileTime
@ -106,6 +106,6 @@ class OuterStride : public Stride<Value, 0>
EIGEN_DEVICE_FUNC OuterStride(Index v) : Base(v,0) {} // FIXME making this explicit could break valid code
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_STRIDE_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Swap.h

@ -10,7 +10,7 @@
#ifndef EIGEN_SWAP_H
#define EIGEN_SWAP_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -62,6 +62,6 @@ public:
} // namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_SWAP_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Transpose.h

@ -11,7 +11,7 @@
#ifndef EIGEN_TRANSPOSE_H
#define EIGEN_TRANSPOSE_H
namespace Eigen {
namespace StormEigen {
/** \class Transpose
* \ingroup Core_Module
@ -392,6 +392,6 @@ void check_for_aliasing(const Dst &dst, const Src &src)
#endif // EIGEN_NO_DEBUG
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_TRANSPOSE_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Transpositions.h

@ -10,7 +10,7 @@
#ifndef EIGEN_TRANSPOSITIONS_H
#define EIGEN_TRANSPOSITIONS_H
namespace Eigen {
namespace StormEigen {
/** \class Transpositions
* \ingroup Core_Module
@ -50,7 +50,7 @@ class TranspositionsBase
typedef typename Traits::IndicesType IndicesType;
typedef typename IndicesType::Scalar StorageIndex;
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
typedef StormEigen::Index Index; ///< \deprecated since Eigen 3.3
Derived& derived() { return *static_cast<Derived*>(this); }
const Derived& derived() const { return *static_cast<const Derived*>(this); }
@ -402,6 +402,6 @@ class Transpose<TranspositionsBase<TranspositionsDerived> >
const TranspositionType& m_transpositions;
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_TRANSPOSITIONS_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/TriangularMatrix.h

@ -11,7 +11,7 @@
#ifndef EIGEN_TRIANGULARMATRIX_H
#define EIGEN_TRIANGULARMATRIX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -977,6 +977,6 @@ struct Assignment<DstXprType, Product<Lhs,Rhs,DefaultProduct>, internal::sub_ass
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_TRIANGULARMATRIX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/VectorBlock.h

@ -11,7 +11,7 @@
#ifndef EIGEN_VECTORBLOCK_H
#define EIGEN_VECTORBLOCK_H
namespace Eigen {
namespace StormEigen {
/** \class VectorBlock
* \ingroup Core_Module
@ -92,6 +92,6 @@ template<typename VectorType, int Size> class VectorBlock
};
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_VECTORBLOCK_H

6
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/VectorwiseOp.h

@ -11,7 +11,7 @@
#ifndef EIGEN_PARTIAL_REDUX_H
#define EIGEN_PARTIAL_REDUX_H
namespace Eigen {
namespace StormEigen {
/** \class PartialReduxExpr
* \ingroup Core_Module
@ -159,7 +159,7 @@ template<typename ExpressionType, int Direction> class VectorwiseOp
typedef typename ExpressionType::Scalar Scalar;
typedef typename ExpressionType::RealScalar RealScalar;
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
typedef StormEigen::Index Index; ///< \deprecated since Eigen 3.3
typedef typename internal::ref_selector<ExpressionType>::non_const_type ExpressionTypeNested;
typedef typename internal::remove_all<ExpressionTypeNested>::type ExpressionTypeNestedCleaned;
@ -679,6 +679,6 @@ DenseBase<Derived>::rowwise()
return RowwiseReturnType(derived());
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PARTIAL_REDUX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/Visitor.h

@ -10,7 +10,7 @@
#ifndef EIGEN_VISITOR_H
#define EIGEN_VISITOR_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -266,6 +266,6 @@ DenseBase<Derived>::maxCoeff(IndexType* index) const
return maxVisitor.res;
}
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_VISITOR_H

12
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/Complex.h

@ -10,7 +10,7 @@
#ifndef EIGEN_COMPLEX_AVX_H
#define EIGEN_COMPLEX_AVX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -210,7 +210,7 @@ template<> struct conj_helper<Packet8f, Packet4cf, false,false>
{ return padd(c, pmul(x,y)); }
EIGEN_STRONG_INLINE Packet4cf pmul(const Packet8f& x, const Packet4cf& y) const
{ return Packet4cf(Eigen::internal::pmul(x, y.v)); }
{ return Packet4cf(StormEigen::internal::pmul(x, y.v)); }
};
template<> struct conj_helper<Packet4cf, Packet8f, false,false>
@ -219,7 +219,7 @@ template<> struct conj_helper<Packet4cf, Packet8f, false,false>
{ return padd(c, pmul(x,y)); }
EIGEN_STRONG_INLINE Packet4cf pmul(const Packet4cf& x, const Packet8f& y) const
{ return Packet4cf(Eigen::internal::pmul(x.v, y)); }
{ return Packet4cf(StormEigen::internal::pmul(x.v, y)); }
};
template<> EIGEN_STRONG_INLINE Packet4cf pdiv<Packet4cf>(const Packet4cf& a, const Packet4cf& b)
@ -406,7 +406,7 @@ template<> struct conj_helper<Packet4d, Packet2cd, false,false>
{ return padd(c, pmul(x,y)); }
EIGEN_STRONG_INLINE Packet2cd pmul(const Packet4d& x, const Packet2cd& y) const
{ return Packet2cd(Eigen::internal::pmul(x, y.v)); }
{ return Packet2cd(StormEigen::internal::pmul(x, y.v)); }
};
template<> struct conj_helper<Packet2cd, Packet4d, false,false>
@ -415,7 +415,7 @@ template<> struct conj_helper<Packet2cd, Packet4d, false,false>
{ return padd(c, pmul(x,y)); }
EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& x, const Packet4d& y) const
{ return Packet2cd(Eigen::internal::pmul(x.v, y)); }
{ return Packet2cd(StormEigen::internal::pmul(x.v, y)); }
};
template<> EIGEN_STRONG_INLINE Packet2cd pdiv<Packet2cd>(const Packet2cd& a, const Packet2cd& b)
@ -458,6 +458,6 @@ ptranspose(PacketBlock<Packet2cd,2>& kernel) {
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_COMPLEX_AVX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/MathFunctions.h

@ -19,7 +19,7 @@
* Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/
*/
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -436,6 +436,6 @@ Packet4d prsqrt<Packet4d>(const Packet4d& x) {
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATH_FUNCTIONS_AVX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/PacketMath.h

@ -10,7 +10,7 @@
#ifndef EIGEN_PACKET_MATH_AVX_H
#define EIGEN_PACKET_MATH_AVX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -602,6 +602,6 @@ template<> EIGEN_STRONG_INLINE Packet4d pblend(const Selector<4>& ifPacket, cons
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PACKET_MATH_AVX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AVX/TypeCasting.h

@ -10,7 +10,7 @@
#ifndef EIGEN_TYPE_CASTING_AVX_H
#define EIGEN_TYPE_CASTING_AVX_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -46,6 +46,6 @@ template<> EIGEN_STRONG_INLINE Packet8f pcast<Packet8i, Packet8f>(const Packet8i
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_TYPE_CASTING_AVX_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/Complex.h

@ -10,7 +10,7 @@
#ifndef EIGEN_COMPLEX32_ALTIVEC_H
#define EIGEN_COMPLEX32_ALTIVEC_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -425,6 +425,6 @@ EIGEN_STRONG_INLINE void ptranspose(PacketBlock<Packet1cd,2>& kernel)
#endif // __VSX__
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_COMPLEX32_ALTIVEC_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/MathFunctions.h

@ -15,7 +15,7 @@
#ifndef EIGEN_MATH_FUNCTIONS_ALTIVEC_H
#define EIGEN_MATH_FUNCTIONS_ALTIVEC_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -285,6 +285,6 @@ Packet2d pexp<Packet2d>(const Packet2d& _x)
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATH_FUNCTIONS_ALTIVEC_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/AltiVec/PacketMath.h

@ -10,7 +10,7 @@
#ifndef EIGEN_PACKET_MATH_ALTIVEC_H
#define EIGEN_PACKET_MATH_ALTIVEC_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -934,6 +934,6 @@ ptranspose(PacketBlock<Packet2d,2>& kernel) {
#endif // __VSX__
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PACKET_MATH_ALTIVEC_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/CUDA/MathFunctions.h

@ -10,7 +10,7 @@
#ifndef EIGEN_MATH_FUNCTIONS_CUDA_H
#define EIGEN_MATH_FUNCTIONS_CUDA_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -107,6 +107,6 @@ double2 perfc<double2>(const double2& a)
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_MATH_FUNCTIONS_CUDA_H

4
resources/3rdparty/eigen-3.3-beta1/Eigen/src/Core/arch/CUDA/PacketMath.h

@ -10,7 +10,7 @@
#ifndef EIGEN_PACKET_MATH_CUDA_H
#define EIGEN_PACKET_MATH_CUDA_H
namespace Eigen {
namespace StormEigen {
namespace internal {
@ -303,7 +303,7 @@ ptranspose(PacketBlock<double2,2>& kernel) {
} // end namespace internal
} // end namespace Eigen
} // end namespace StormEigen
#endif // EIGEN_PACKET_MATH_CUDA_H

Some files were not shown because too many files changed in this diff

Loading…
Cancel
Save