diff --git a/.clang-tidy b/.clang-tidy
new file mode 100644
index 00000000..9647d24f
--- /dev/null
+++ b/.clang-tidy
@@ -0,0 +1,394 @@
+---
+Checks: 'clang-diagnostic-*,clang-analyzer-*,*,-hicpp-uppercase-literal-suffix,-readability-uppercase-literal-suffix,-modernize-use-trailing-return-type,-readability-named-parameter,-hicpp-named-parameter,-cppcoreguidelines-pro-bounds-array-to-pointer-decay,-hicpp-no-array-decay,-llvm-header-guard,-cppcoreguidelines-macro-usage,-google-runtime-references,-readability-isolate-declaration,-fuchsia-default-arguments-calls,-fuchsia-overloaded-operator,-fuchsia-default-arguments-declarations,-readability-else-after-return,-google-runtime-int,-hicpp-signed-bitwise,-cert-dcl21-cpp,-cppcoreguidelines-avoid-magic-numbers,-readability-magic-numbers,-cppcoreguidelines-pro-bounds-pointer-arithmetic,-cppcoreguidelines-pro-type-reinterpret-cast,-cppcoreguidelines-avoid-c-arrays,-hicpp-avoid-c-arrays,-modernize-avoid-c-arrays,-modernize-use-transparent-functors,-cert-dcl16-c,-cppcoreguidelines-pro-type-union-access,-bugprone-branch-clone,-fuchsia-statically-constructed-objects,-cppcoreguidelines-pro-bounds-constant-array-index,-readability-static-accessed-through-instance,-cppcoreguidelines-pro-type-vararg,-hicpp-vararg,-llvmlibc-restrict-system-libc-headers,-llvmlibc-callee-namespace,-llvmlibc-implementation-in-namespace,-llvm-else-after-return,-fuchsia-trailing-return,-readability-identifier-length,-altera-unroll-loops,-altera-id-dependent-backward-branch,-altera-struct-pack-align,-performance-no-int-to-ptr,-readability-function-cognitive-complexity'
+WarningsAsErrors: '*'
+AnalyzeTemporaryDtors: false
+FormatStyle: none
+User: yardbird
+CheckOptions:
+ - key: abseil-string-find-startswith.AbseilStringsMatchHeader
+ value: 'absl/strings/match.h'
+ - key: abseil-string-find-startswith.IncludeStyle
+ value: llvm
+ - key: abseil-string-find-startswith.StringLikeClasses
+ value: '::std::basic_string'
+ - key: bugprone-argument-comment.CommentBoolLiterals
+ value: '0'
+ - key: bugprone-argument-comment.CommentCharacterLiterals
+ value: '0'
+ - key: bugprone-argument-comment.CommentFloatLiterals
+ value: '0'
+ - key: bugprone-argument-comment.CommentIntegerLiterals
+ value: '0'
+ - key: bugprone-argument-comment.CommentNullPtrs
+ value: '0'
+ - key: bugprone-argument-comment.CommentStringLiterals
+ value: '0'
+ - key: bugprone-argument-comment.CommentUserDefinedLiterals
+ value: '0'
+ - key: bugprone-argument-comment.IgnoreSingleArgument
+ value: '0'
+ - key: bugprone-argument-comment.StrictMode
+ value: '0'
+ - key: bugprone-assert-side-effect.AssertMacros
+ value: assert
+ - key: bugprone-assert-side-effect.CheckFunctionCalls
+ value: '0'
+ - key: bugprone-dangling-handle.HandleClasses
+ value: 'std::basic_string_view;std::experimental::basic_string_view'
+ - key: bugprone-dynamic-static-initializers.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: bugprone-exception-escape.FunctionsThatShouldNotThrow
+ value: ''
+ - key: bugprone-exception-escape.IgnoredExceptions
+ value: ''
+ - key: bugprone-misplaced-widening-cast.CheckImplicitCasts
+ value: '0'
+ - key: bugprone-not-null-terminated-result.WantToUseSafeFunctions
+ value: '1'
+ - key: bugprone-signed-char-misuse.CharTypdefsToIgnore
+ value: ''
+ - key: bugprone-sizeof-expression.WarnOnSizeOfCompareToConstant
+ value: '1'
+ - key: bugprone-sizeof-expression.WarnOnSizeOfConstant
+ value: '1'
+ - key: bugprone-sizeof-expression.WarnOnSizeOfIntegerExpression
+ value: '0'
+ - key: bugprone-sizeof-expression.WarnOnSizeOfThis
+ value: '1'
+ - key: bugprone-string-constructor.LargeLengthThreshold
+ value: '8388608'
+ - key: bugprone-string-constructor.WarnOnLargeLength
+ value: '1'
+ - key: bugprone-suspicious-enum-usage.StrictMode
+ value: '0'
+ - key: bugprone-suspicious-missing-comma.MaxConcatenatedTokens
+ value: '5'
+ - key: bugprone-suspicious-missing-comma.RatioThreshold
+ value: '0.200000'
+ - key: bugprone-suspicious-missing-comma.SizeThreshold
+ value: '5'
+ - key: bugprone-suspicious-string-compare.StringCompareLikeFunctions
+ value: ''
+ - key: bugprone-suspicious-string-compare.WarnOnImplicitComparison
+ value: '1'
+ - key: bugprone-suspicious-string-compare.WarnOnLogicalNotComparison
+ value: '0'
+ - key: bugprone-too-small-loop-variable.MagnitudeBitsUpperLimit
+ value: '16'
+ - key: bugprone-unhandled-self-assignment.WarnOnlyIfThisHasSuspiciousField
+ value: '1'
+ - key: bugprone-unused-return-value.CheckedFunctions
+ value: '::std::async;::std::launder;::std::remove;::std::remove_if;::std::unique;::std::unique_ptr::release;::std::basic_string::empty;::std::vector::empty'
+ - key: cert-dcl16-c.IgnoreMacros
+ value: '1'
+ - key: cert-dcl16-c.NewSuffixes
+ value: 'L;LL;LU;LLU'
+ - key: cert-dcl59-cpp.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: cert-err09-cpp.CheckThrowTemporaries
+ value: '1'
+ - key: cert-err61-cpp.CheckThrowTemporaries
+ value: '1'
+ - key: cert-msc32-c.DisallowedSeedTypes
+ value: 'time_t,std::time_t'
+ - key: cert-msc51-cpp.DisallowedSeedTypes
+ value: 'time_t,std::time_t'
+ - key: cert-oop11-cpp.IncludeStyle
+ value: llvm
+ - key: cert-oop54-cpp.WarnOnlyIfThisHasSuspiciousField
+ value: '0'
+ - key: cppcoreguidelines-avoid-magic-numbers.IgnoredFloatingPointValues
+ value: '1.0;100.0;'
+ - key: cppcoreguidelines-avoid-magic-numbers.IgnoredIntegerValues
+ value: '1;2;3;4;'
+ - key: cppcoreguidelines-explicit-virtual-functions.AllowOverrideAndFinal
+ value: '0'
+ - key: cppcoreguidelines-explicit-virtual-functions.FinalSpelling
+ value: final
+ - key: cppcoreguidelines-explicit-virtual-functions.IgnoreDestructors
+ value: '1'
+ - key: cppcoreguidelines-explicit-virtual-functions.OverrideSpelling
+ value: override
+ - key: cppcoreguidelines-no-malloc.Allocations
+ value: '::malloc;::calloc'
+ - key: cppcoreguidelines-no-malloc.Deallocations
+ value: '::free'
+ - key: cppcoreguidelines-no-malloc.Reallocations
+ value: '::realloc'
+ - key: cppcoreguidelines-non-private-member-variables-in-classes.IgnoreClassesWithAllMemberVariablesBeingPublic
+ value: '1'
+ - key: misc-non-private-member-variables-in-classes.IgnoreClassesWithAllMemberVariablesBeingPublic
+ value: '1'
+ - key: cppcoreguidelines-owning-memory.LegacyResourceConsumers
+ value: '::free;::realloc;::freopen;::fclose'
+ - key: cppcoreguidelines-owning-memory.LegacyResourceProducers
+ value: '::malloc;::aligned_alloc;::realloc;::calloc;::fopen;::freopen;::tmpfile'
+ - key: cppcoreguidelines-pro-bounds-constant-array-index.GslHeader
+ value: ''
+ - key: cppcoreguidelines-pro-bounds-constant-array-index.IncludeStyle
+ value: '0'
+ - key: cppcoreguidelines-pro-type-member-init.IgnoreArrays
+ value: '0'
+ - key: cppcoreguidelines-pro-type-member-init.UseAssignment
+ value: '0'
+ - key: cppcoreguidelines-special-member-functions.AllowMissingMoveFunctions
+ value: '0'
+ - key: cppcoreguidelines-special-member-functions.AllowSoleDefaultDtor
+ value: '0'
+ - key: fuchsia-header-anon-namespaces.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: fuchsia-restrict-system-includes.Includes
+ value: '*'
+ - key: google-build-namespaces.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: google-global-names-in-headers.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: google-readability-braces-around-statements.ShortStatementLines
+ value: '1'
+ - key: google-readability-function-size.BranchThreshold
+ value: '4294967295'
+ - key: google-readability-function-size.LineThreshold
+ value: '4294967295'
+ - key: google-readability-function-size.NestingThreshold
+ value: '4294967295'
+ - key: google-readability-function-size.ParameterThreshold
+ value: '4294967295'
+ - key: google-readability-function-size.StatementThreshold
+ value: '800'
+ - key: google-readability-function-size.VariableThreshold
+ value: '4294967295'
+ - key: google-readability-namespace-comments.ShortNamespaceLines
+ value: '10'
+ - key: google-readability-namespace-comments.SpacesBeforeComments
+ value: '2'
+ - key: google-runtime-int.SignedTypePrefix
+ value: int
+ - key: google-runtime-int.TypeSuffix
+ value: ''
+ - key: google-runtime-int.UnsignedTypePrefix
+ value: uint
+ - key: hicpp-braces-around-statements.ShortStatementLines
+ value: '0'
+ - key: hicpp-function-size.BranchThreshold
+ value: '4294967295'
+ - key: hicpp-function-size.LineThreshold
+ value: '4294967295'
+ - key: hicpp-function-size.NestingThreshold
+ value: '4294967295'
+ - key: hicpp-function-size.ParameterThreshold
+ value: '4294967295'
+ - key: hicpp-function-size.StatementThreshold
+ value: '800'
+ - key: hicpp-function-size.VariableThreshold
+ value: '4294967295'
+ - key: hicpp-member-init.IgnoreArrays
+ value: '0'
+ - key: hicpp-member-init.UseAssignment
+ value: '0'
+ - key: hicpp-move-const-arg.CheckTriviallyCopyableMove
+ value: '1'
+ - key: hicpp-multiway-paths-covered.WarnOnMissingElse
+ value: '0'
+ - key: hicpp-no-malloc.Allocations
+ value: '::malloc;::calloc'
+ - key: hicpp-no-malloc.Deallocations
+ value: '::free'
+ - key: hicpp-no-malloc.Reallocations
+ value: '::realloc'
+ - key: hicpp-signed-bitwise.IgnorePositiveIntegerLiterals
+ value: '0'
+ - key: hicpp-special-member-functions.AllowMissingMoveFunctions
+ value: '0'
+ - key: hicpp-special-member-functions.AllowSoleDefaultDtor
+ value: '0'
+ - key: hicpp-use-auto.MinTypeNameLength
+ value: '5'
+ - key: hicpp-use-auto.RemoveStars
+ value: '0'
+ - key: hicpp-use-emplace.ContainersWithPushBack
+ value: '::std::vector;::std::list;::std::deque'
+ - key: hicpp-use-emplace.SmartPointers
+ value: '::std::shared_ptr;::std::unique_ptr;::std::auto_ptr;::std::weak_ptr'
+ - key: hicpp-use-emplace.TupleMakeFunctions
+ value: '::std::make_pair;::std::make_tuple'
+ - key: hicpp-use-emplace.TupleTypes
+ value: '::std::pair;::std::tuple'
+ - key: hicpp-use-equals-default.IgnoreMacros
+ value: '1'
+ - key: hicpp-use-equals-delete.IgnoreMacros
+ value: '1'
+ - key: hicpp-use-noexcept.ReplacementString
+ value: ''
+ - key: hicpp-use-noexcept.UseNoexceptFalse
+ value: '1'
+ - key: hicpp-use-nullptr.NullMacros
+ value: ''
+ - key: hicpp-use-override.AllowOverrideAndFinal
+ value: '0'
+ - key: hicpp-use-override.FinalSpelling
+ value: final
+ - key: hicpp-use-override.IgnoreDestructors
+ value: '0'
+ - key: hicpp-use-override.OverrideSpelling
+ value: override
+ - key: llvm-namespace-comment.ShortNamespaceLines
+ value: '1'
+ - key: llvm-namespace-comment.SpacesBeforeComments
+ value: '1'
+ - key: misc-definitions-in-headers.HeaderFileExtensions
+ value: ',h,hh,hpp,hxx'
+ - key: misc-definitions-in-headers.UseHeaderFileExtension
+ value: '1'
+ - key: misc-throw-by-value-catch-by-reference.CheckThrowTemporaries
+ value: '1'
+ - key: misc-unused-parameters.StrictMode
+ value: '0'
+ - key: modernize-loop-convert.MaxCopySize
+ value: '16'
+ - key: modernize-loop-convert.MinConfidence
+ value: reasonable
+ - key: modernize-loop-convert.NamingStyle
+ value: CamelCase
+ - key: modernize-make-shared.IgnoreMacros
+ value: '1'
+ - key: modernize-make-shared.MakeSmartPtrFunction
+ value: 'std::make_shared'
+ - key: modernize-make-shared.MakeSmartPtrFunctionHeader
+ value: memory
+ - key: modernize-make-unique.IgnoreMacros
+ value: '1'
+ - key: modernize-make-unique.MakeSmartPtrFunction
+ value: 'std::make_unique'
+ - key: modernize-make-unique.MakeSmartPtrFunctionHeader
+ value: memory
+ - key: modernize-pass-by-value.IncludeStyle
+ value: llvm
+ - key: modernize-pass-by-value.ValuesOnly
+ value: '0'
+ - key: modernize-raw-string-literal.ReplaceShorterLiterals
+ value: '0'
+ - key: modernize-replace-auto-ptr.IncludeStyle
+ value: llvm
+ - key: modernize-replace-random-shuffle.IncludeStyle
+ value: llvm
+ - key: modernize-use-auto.MinTypeNameLength
+ value: '5'
+ - key: modernize-use-auto.RemoveStars
+ value: '0'
+ - key: modernize-use-default-member-init.IgnoreMacros
+ value: '1'
+ - key: modernize-use-default-member-init.UseAssignment
+ value: '0'
+ - key: modernize-use-emplace.ContainersWithPushBack
+ value: '::std::vector;::std::list;::std::deque'
+ - key: modernize-use-emplace.SmartPointers
+ value: '::std::shared_ptr;::std::unique_ptr;::std::auto_ptr;::std::weak_ptr'
+ - key: modernize-use-emplace.TupleMakeFunctions
+ value: '::std::make_pair;::std::make_tuple'
+ - key: modernize-use-emplace.TupleTypes
+ value: '::std::pair;::std::tuple'
+ - key: modernize-use-equals-default.IgnoreMacros
+ value: '1'
+ - key: modernize-use-equals-delete.IgnoreMacros
+ value: '1'
+ - key: modernize-use-nodiscard.ReplacementString
+ value: '[[nodiscard]]'
+ - key: modernize-use-noexcept.ReplacementString
+ value: ''
+ - key: modernize-use-noexcept.UseNoexceptFalse
+ value: '1'
+ - key: modernize-use-nullptr.NullMacros
+ value: 'NULL'
+ - key: modernize-use-override.AllowOverrideAndFinal
+ value: '0'
+ - key: modernize-use-override.FinalSpelling
+ value: final
+ - key: modernize-use-override.IgnoreDestructors
+ value: '0'
+ - key: modernize-use-override.OverrideSpelling
+ value: override
+ - key: modernize-use-transparent-functors.SafeMode
+ value: '0'
+ - key: modernize-use-using.IgnoreMacros
+ value: '1'
+ - key: objc-forbidden-subclassing.ForbiddenSuperClassNames
+ value: 'ABNewPersonViewController;ABPeoplePickerNavigationController;ABPersonViewController;ABUnknownPersonViewController;NSHashTable;NSMapTable;NSPointerArray;NSPointerFunctions;NSTimer;UIActionSheet;UIAlertView;UIImagePickerController;UITextInputMode;UIWebView'
+ - key: openmp-exception-escape.IgnoredExceptions
+ value: ''
+ - key: performance-faster-string-find.StringLikeClasses
+ value: 'std::basic_string'
+ - key: performance-for-range-copy.AllowedTypes
+ value: ''
+ - key: performance-for-range-copy.WarnOnAllAutoCopies
+ value: '0'
+ - key: performance-inefficient-string-concatenation.StrictMode
+ value: '0'
+ - key: performance-inefficient-vector-operation.EnableProto
+ value: '0'
+ - key: performance-inefficient-vector-operation.VectorLikeClasses
+ value: '::std::vector'
+ - key: performance-move-const-arg.CheckTriviallyCopyableMove
+ value: '1'
+ - key: performance-move-constructor-init.IncludeStyle
+ value: llvm
+ - key: performance-no-automatic-move.AllowedTypes
+ value: ''
+ - key: performance-type-promotion-in-math-fn.IncludeStyle
+ value: llvm
+ - key: performance-unnecessary-copy-initialization.AllowedTypes
+ value: ''
+ - key: performance-unnecessary-value-param.AllowedTypes
+ value: ''
+ - key: performance-unnecessary-value-param.IncludeStyle
+ value: llvm
+ - key: portability-simd-intrinsics.Std
+ value: ''
+ - key: portability-simd-intrinsics.Suggest
+ value: '0'
+ - key: readability-braces-around-statements.ShortStatementLines
+ value: '0'
+ - key: readability-else-after-return.WarnOnUnfixable
+ value: '1'
+ - key: readability-function-size.BranchThreshold
+ value: '4294967295'
+ - key: readability-function-size.LineThreshold
+ value: '4294967295'
+ - key: readability-function-size.NestingThreshold
+ value: '4294967295'
+ - key: readability-function-size.ParameterThreshold
+ value: '4294967295'
+ - key: readability-function-size.StatementThreshold
+ value: '800'
+ - key: readability-function-size.VariableThreshold
+ value: '4294967295'
+ - key: readability-identifier-naming.IgnoreFailedSplit
+ value: '0'
+ - key: readability-implicit-bool-conversion.AllowIntegerConditions
+ value: '0'
+ - key: readability-implicit-bool-conversion.AllowPointerConditions
+ value: '0'
+ - key: readability-inconsistent-declaration-parameter-name.IgnoreMacros
+ value: '1'
+ - key: readability-inconsistent-declaration-parameter-name.Strict
+ value: '0'
+ - key: readability-magic-numbers.IgnoredFloatingPointValues
+ value: '1.0;100.0;'
+ - key: readability-magic-numbers.IgnoredIntegerValues
+ value: '1;2;3;4;'
+ - key: readability-redundant-member-init.IgnoreBaseInCopyConstructors
+ value: '0'
+ - key: readability-redundant-smartptr-get.IgnoreMacros
+ value: '1'
+ - key: readability-redundant-string-init.StringNames
+ value: '::std::basic_string'
+ - key: readability-simplify-boolean-expr.ChainedConditionalAssignment
+ value: '0'
+ - key: readability-simplify-boolean-expr.ChainedConditionalReturn
+ value: '0'
+ - key: readability-simplify-subscript-expr.Types
+ value: '::std::basic_string;::std::basic_string_view;::std::vector;::std::array'
+ - key: readability-static-accessed-through-instance.NameSpecifierNestingThreshold
+ value: '3'
+ - key: zircon-temporary-objects.Names
+ value: ''
+...
diff --git a/.clangd b/.clangd
new file mode 100644
index 00000000..0305393d
--- /dev/null
+++ b/.clangd
@@ -0,0 +1,2 @@
+CompileFlags:
+ Add: '-std=c++17'
\ No newline at end of file
diff --git a/.gitignore b/.gitignore
index ab3627f2..f0f5eb89 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,16 +1,11 @@
# Build dirs.
build*
-# Docs.
-doc/_build
-doc/examples/out
-doc/generated
-
-# Notebooks bits.
-.ipynb_checkpoints
-
# clangd bits.
.cache
# vscode bits.
.vscode
+
+# config files
+include/kep3/config.hpp
diff --git a/CMakeLists.txt b/CMakeLists.txt
index 7515e08e..bc847314 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -130,6 +130,8 @@ endif()
# List of source files.
set(kep3_SRC_FILES
"${CMAKE_CURRENT_SOURCE_DIR}/src/epoch.cpp"
+ "${CMAKE_CURRENT_SOURCE_DIR}/src/planet.cpp"
+ "${CMAKE_CURRENT_SOURCE_DIR}/src/detail/type_name.cpp"
)
# Setup of the kep3 shared library.
@@ -176,9 +178,12 @@ endif()
find_package(spdlog CONFIG REQUIRED)
target_link_libraries(kep3 PRIVATE spdlog::spdlog)
+# Configure config.hpp.
+configure_file("${CMAKE_CURRENT_SOURCE_DIR}/config.hpp.in" "${CMAKE_CURRENT_SOURCE_DIR}/include/kep3/config.hpp" @ONLY)
+
# Installation of the header files.
install(DIRECTORY "${CMAKE_CURRENT_SOURCE_DIR}/include/kep3" DESTINATION include)
-#install(FILES "${CMAKE_CURRENT_BINARY_DIR}/include/kep3/config.hpp" DESTINATION include/kep3)
+install(FILES "${CMAKE_CURRENT_SOURCE_DIR}/include/kep3/config.hpp" DESTINATION include/kep3)
# Installation of the library.
install(TARGETS kep3
diff --git a/COPYING b/COPYING
new file mode 100644
index 00000000..f4bbcd20
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,373 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+ means each individual or legal entity that creates, contributes to
+ the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+ means the combination of the Contributions of others (if any) used
+ by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+ means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+ means Source Code Form to which the initial Contributor has attached
+ the notice in Exhibit A, the Executable Form of such Source Code
+ Form, and Modifications of such Source Code Form, in each case
+ including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+ means
+
+ (a) that the initial Contributor has attached the notice described
+ in Exhibit B to the Covered Software; or
+
+ (b) that the Covered Software was made available under the terms of
+ version 1.1 or earlier of the License, but not also under the
+ terms of a Secondary License.
+
+1.6. "Executable Form"
+ means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+ means a work that combines Covered Software with other material, in
+ a separate file or files, that is not Covered Software.
+
+1.8. "License"
+ means this document.
+
+1.9. "Licensable"
+ means having the right to grant, to the maximum extent possible,
+ whether at the time of the initial grant or subsequently, any and
+ all of the rights conveyed by this License.
+
+1.10. "Modifications"
+ means any of the following:
+
+ (a) any file in Source Code Form that results from an addition to,
+ deletion from, or modification of the contents of Covered
+ Software; or
+
+ (b) any new file in Source Code Form that contains any Covered
+ Software.
+
+1.11. "Patent Claims" of a Contributor
+ means any patent claim(s), including without limitation, method,
+ process, and apparatus claims, in any patent Licensable by such
+ Contributor that would be infringed, but for the grant of the
+ License, by the making, using, selling, offering for sale, having
+ made, import, or transfer of either its Contributions or its
+ Contributor Version.
+
+1.12. "Secondary License"
+ means either the GNU General Public License, Version 2.0, the GNU
+ Lesser General Public License, Version 2.1, the GNU Affero General
+ Public License, Version 3.0, or any later versions of those
+ licenses.
+
+1.13. "Source Code Form"
+ means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+ means an individual or a legal entity exercising rights under this
+ License. For legal entities, "You" includes any entity that
+ controls, is controlled by, or is under common control with You. For
+ purposes of this definition, "control" means (a) the power, direct
+ or indirect, to cause the direction or management of such entity,
+ whether by contract or otherwise, or (b) ownership of more than
+ fifty percent (50%) of the outstanding shares or beneficial
+ ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+ Licensable by such Contributor to use, reproduce, make available,
+ modify, display, perform, distribute, and otherwise exploit its
+ Contributions, either on an unmodified basis, with Modifications, or
+ as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+ for sale, have made, import, and otherwise transfer either its
+ Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+ or
+
+(b) for infringements caused by: (i) Your and any other third party's
+ modifications of Covered Software, or (ii) the combination of its
+ Contributions with other software (except as part of its Contributor
+ Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+ its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+ Form, as described in Section 3.1, and You must inform recipients of
+ the Executable Form how they can obtain a copy of such Source Code
+ Form by reasonable means in a timely manner, at a charge no more
+ than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+ License, or sublicense it under different terms, provided that the
+ license for the Executable Form does not attempt to limit or alter
+ the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+* *
+* 6. Disclaimer of Warranty *
+* ------------------------- *
+* *
+* Covered Software is provided under this License on an "as is" *
+* basis, without warranty of any kind, either expressed, implied, or *
+* statutory, including, without limitation, warranties that the *
+* Covered Software is free of defects, merchantable, fit for a *
+* particular purpose or non-infringing. The entire risk as to the *
+* quality and performance of the Covered Software is with You. *
+* Should any Covered Software prove defective in any respect, You *
+* (not any Contributor) assume the cost of any necessary servicing, *
+* repair, or correction. This disclaimer of warranty constitutes an *
+* essential part of this License. No use of any Covered Software is *
+* authorized under this License except under this disclaimer. *
+* *
+************************************************************************
+
+************************************************************************
+* *
+* 7. Limitation of Liability *
+* -------------------------- *
+* *
+* Under no circumstances and under no legal theory, whether tort *
+* (including negligence), contract, or otherwise, shall any *
+* Contributor, or anyone who distributes Covered Software as *
+* permitted above, be liable to You for any direct, indirect, *
+* special, incidental, or consequential damages of any character *
+* including, without limitation, damages for lost profits, loss of *
+* goodwill, work stoppage, computer failure or malfunction, or any *
+* and all other commercial damages or losses, even if such party *
+* shall have been informed of the possibility of such damages. This *
+* limitation of liability shall not apply to liability for death or *
+* personal injury resulting from such party's negligence to the *
+* extent applicable law prohibits such limitation. Some *
+* jurisdictions do not allow the exclusion or limitation of *
+* incidental or consequential damages, so this exclusion and *
+* limitation may not apply to You. *
+* *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+ This Source Code Form is subject to the terms of the Mozilla Public
+ License, v. 2.0. If a copy of the MPL was not distributed with this
+ file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+ This Source Code Form is "Incompatible With Secondary Licenses", as
+ defined by the Mozilla Public License, v. 2.0.
\ No newline at end of file
diff --git a/LICENSE b/LICENSE
deleted file mode 100644
index f288702d..00000000
--- a/LICENSE
+++ /dev/null
@@ -1,674 +0,0 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc.
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
- The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works. By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users. We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors. You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
- To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights. Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received. You must make sure that they, too, receive
-or can get the source code. And you must show them these terms so they
-know their rights.
-
- Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
- For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software. For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
- Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so. This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software. The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable. Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products. If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
- Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary. To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-
- TERMS AND CONDITIONS
-
- 0. Definitions.
-
- "This License" refers to version 3 of the GNU General Public License.
-
- "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
- "The Program" refers to any copyrightable work licensed under this
-License. Each licensee is addressed as "you". "Licensees" and
-"recipients" may be individuals or organizations.
-
- To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy. The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
- A "covered work" means either the unmodified Program or a work based
-on the Program.
-
- To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy. Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
- To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies. Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
- An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License. If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
- 1. Source Code.
-
- The "source code" for a work means the preferred form of the work
-for making modifications to it. "Object code" means any non-source
-form of a work.
-
- A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
- The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form. A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
- The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities. However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work. For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
- The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
- The Corresponding Source for a work in source code form is that
-same work.
-
- 2. Basic Permissions.
-
- All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met. This License explicitly affirms your unlimited
-permission to run the unmodified Program. The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work. This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
- You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force. You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright. Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
- Conveying under any other circumstances is permitted solely under
-the conditions stated below. Sublicensing is not allowed; section 10
-makes it unnecessary.
-
- 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
- No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
- When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
- 4. Conveying Verbatim Copies.
-
- You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
- You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
- 5. Conveying Modified Source Versions.
-
- You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
- a) The work must carry prominent notices stating that you modified
- it, and giving a relevant date.
-
- b) The work must carry prominent notices stating that it is
- released under this License and any conditions added under section
- 7. This requirement modifies the requirement in section 4 to
- "keep intact all notices".
-
- c) You must license the entire work, as a whole, under this
- License to anyone who comes into possession of a copy. This
- License will therefore apply, along with any applicable section 7
- additional terms, to the whole of the work, and all its parts,
- regardless of how they are packaged. This License gives no
- permission to license the work in any other way, but it does not
- invalidate such permission if you have separately received it.
-
- d) If the work has interactive user interfaces, each must display
- Appropriate Legal Notices; however, if the Program has interactive
- interfaces that do not display Appropriate Legal Notices, your
- work need not make them do so.
-
- A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit. Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
- 6. Conveying Non-Source Forms.
-
- You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
- a) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by the
- Corresponding Source fixed on a durable physical medium
- customarily used for software interchange.
-
- b) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by a
- written offer, valid for at least three years and valid for as
- long as you offer spare parts or customer support for that product
- model, to give anyone who possesses the object code either (1) a
- copy of the Corresponding Source for all the software in the
- product that is covered by this License, on a durable physical
- medium customarily used for software interchange, for a price no
- more than your reasonable cost of physically performing this
- conveying of source, or (2) access to copy the
- Corresponding Source from a network server at no charge.
-
- c) Convey individual copies of the object code with a copy of the
- written offer to provide the Corresponding Source. This
- alternative is allowed only occasionally and noncommercially, and
- only if you received the object code with such an offer, in accord
- with subsection 6b.
-
- d) Convey the object code by offering access from a designated
- place (gratis or for a charge), and offer equivalent access to the
- Corresponding Source in the same way through the same place at no
- further charge. You need not require recipients to copy the
- Corresponding Source along with the object code. If the place to
- copy the object code is a network server, the Corresponding Source
- may be on a different server (operated by you or a third party)
- that supports equivalent copying facilities, provided you maintain
- clear directions next to the object code saying where to find the
- Corresponding Source. Regardless of what server hosts the
- Corresponding Source, you remain obligated to ensure that it is
- available for as long as needed to satisfy these requirements.
-
- e) Convey the object code using peer-to-peer transmission, provided
- you inform other peers where the object code and Corresponding
- Source of the work are being offered to the general public at no
- charge under subsection 6d.
-
- A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
- A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling. In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage. For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product. A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
- "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source. The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
- If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information. But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
- The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed. Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
- Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
- 7. Additional Terms.
-
- "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law. If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
- When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it. (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.) You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
- Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
- a) Disclaiming warranty or limiting liability differently from the
- terms of sections 15 and 16 of this License; or
-
- b) Requiring preservation of specified reasonable legal notices or
- author attributions in that material or in the Appropriate Legal
- Notices displayed by works containing it; or
-
- c) Prohibiting misrepresentation of the origin of that material, or
- requiring that modified versions of such material be marked in
- reasonable ways as different from the original version; or
-
- d) Limiting the use for publicity purposes of names of licensors or
- authors of the material; or
-
- e) Declining to grant rights under trademark law for use of some
- trade names, trademarks, or service marks; or
-
- f) Requiring indemnification of licensors and authors of that
- material by anyone who conveys the material (or modified versions of
- it) with contractual assumptions of liability to the recipient, for
- any liability that these contractual assumptions directly impose on
- those licensors and authors.
-
- All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10. If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term. If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
- If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
- Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
- 8. Termination.
-
- You may not propagate or modify a covered work except as expressly
-provided under this License. Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
- However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
- Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License. If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
- 9. Acceptance Not Required for Having Copies.
-
- You are not required to accept this License in order to receive or
-run a copy of the Program. Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance. However,
-nothing other than this License grants you permission to propagate or
-modify any covered work. These actions infringe copyright if you do
-not accept this License. Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
- 10. Automatic Licensing of Downstream Recipients.
-
- Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License. You are not responsible
-for enforcing compliance by third parties with this License.
-
- An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations. If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
- You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License. For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
- 11. Patents.
-
- A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based. The
-work thus licensed is called the contributor's "contributor version".
-
- A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version. For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
- Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
- In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement). To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
- If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients. "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
- If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
- A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License. You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
- Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
- 12. No Surrender of Others' Freedom.
-
- If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all. For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
- 13. Use with the GNU Affero General Public License.
-
- Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work. The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
- 14. Revised Versions of this License.
-
- The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
- Each version is given a distinguishing version number. If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation. If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
- If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
- Later license versions may give you additional or different
-permissions. However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
- 15. Disclaimer of Warranty.
-
- THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. Limitation of Liability.
-
- IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
- 17. Interpretation of Sections 15 and 16.
-
- If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-
- Copyright (C)
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program. If not, see .
-
-Also add information on how to contact you by electronic and paper mail.
-
- If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
- Copyright (C)
- This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
- You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-.
-
- 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
-.
diff --git a/benchmark/convert_anomalies_benchmark.cpp b/benchmark/convert_anomalies_benchmark.cpp
index 99b4e869..11488d1a 100644
--- a/benchmark/convert_anomalies_benchmark.cpp
+++ b/benchmark/convert_anomalies_benchmark.cpp
@@ -1,6 +1,7 @@
-// Copyright 2020, 2021, 2022 Francesco Biscani (bluescarni@gmail.com), Dario Izzo (dario.izzo@gmail.com)
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
//
-// This file is part of the dsyre library.
+// This file is part of the kep3 library.
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
@@ -12,91 +13,89 @@
#include
-#include
-
+#include
using namespace kep3;
using namespace std::chrono;
-// In this benchmark we test the speed and accuracy of the Kepler's equation solvers
+// In this benchmark we test the speed and accuracy of the Kepler's equation
+// solvers
+
+void perform_test_speed(double min_ecc, double max_ecc, unsigned N) {
+ //
+ // Engines
+ //
+ std::mt19937 rng_engine(122012203u);
+ //
+ // Distribtuions
+ //
+ std::uniform_real_distribution ecc_d(min_ecc, max_ecc);
+ std::uniform_real_distribution M_d(-100, 100.);
+
+ // We generate the random dataset
+ std::vector eccenricities(N);
+ std::vector mean_anomalies(N);
-void perform_test_speed(double min_ecc, double max_ecc, unsigned N)
-{
- //
- // Engines
- //
- std::mt19937 rng_engine(122012203u);
- //
- // Distribtuions
- //
- std::uniform_real_distribution ecc_d(min_ecc, max_ecc);
- std::uniform_real_distribution M_d(-100, 100.);
-
- // We generate the random dataset
- std::vector eccenricities(N);
- std::vector mean_anomalies(N);
+ for (auto i = 0u; i < N; ++i) {
+ mean_anomalies[i] = M_d(rng_engine);
+ eccenricities[i] = ecc_d(rng_engine);
+ }
- for (auto i = 0u; i < N; ++i) {
- mean_anomalies[i] = M_d(rng_engine);
- eccenricities[i] = ecc_d(rng_engine);
- }
+ // We log progress
+ fmt::print("{:.2f} min_ecc, {:.2f} max_ecc, on {} data points: ", min_ecc,
+ max_ecc, N);
- // We log progress
- fmt::print("{:.2f} min_ecc, {:.2f} max_ecc, on {} data points: ", min_ecc, max_ecc, N);
-
- auto start = high_resolution_clock::now();
- for (auto i = 0u; i < N; ++i) {
- m2e(mean_anomalies[i], eccenricities[i]);
- }
- auto stop = high_resolution_clock::now();
- auto duration = duration_cast(stop - start);
- fmt::print("{:.3f}s\n", duration.count() / 1e6);
+ auto start = high_resolution_clock::now();
+ for (auto i = 0u; i < N; ++i) {
+ m2e(mean_anomalies[i], eccenricities[i]);
+ }
+ auto stop = high_resolution_clock::now();
+ auto duration = duration_cast(stop - start);
+ fmt::print("{:.3f}s\n", duration.count() / 1e6);
}
-void perform_test_accuracy(double min_ecc, double max_ecc, unsigned N)
-{
- //
- // Engines
- //
- std::mt19937 rng_engine(122012203u);
- //
- // Distribtuions
- //
- std::uniform_real_distribution ecc_d(min_ecc, max_ecc);
- std::uniform_real_distribution M_d(-100, 100.);
-
- // We generate the random dataset
- std::vector eccenricities(N);
- std::vector mean_anomalies(N);
+void perform_test_accuracy(double min_ecc, double max_ecc, unsigned N) {
+ //
+ // Engines
+ //
+ std::mt19937 rng_engine(122012203u);
+ //
+ // Distribtuions
+ //
+ std::uniform_real_distribution ecc_d(min_ecc, max_ecc);
+ std::uniform_real_distribution M_d(-100, 100.);
- for (auto i = 0u; i < N; ++i) {
- mean_anomalies[i] = M_d(rng_engine);
- eccenricities[i] = ecc_d(rng_engine);
- }
+ // We generate the random dataset
+ std::vector eccenricities(N);
+ std::vector mean_anomalies(N);
- // We log progress
- fmt::print("{:.2f} min_ecc, {:.2f} max_ecc, on {} data points: ", min_ecc, max_ecc, N);
- std::vector err(N);
- for (auto i = 0u; i < N; ++i) {
- auto res = e2m(m2e(mean_anomalies[i], eccenricities[i]), eccenricities[i]);
- err[i] = std::abs(res - mean_anomalies[i]);
- }
- auto max_it = max_element(std::begin(err), std::end(err));
- auto min_it = min_element(std::begin(err), std::end(err));
- auto avg = std::accumulate(err.begin(), err.end(), 0.0) / err.size();
- fmt::print("{:.3e} avg, {:.3e} min, {:.3e} max\n", avg, *min_it, *max_it );
-}
+ for (auto i = 0u; i < N; ++i) {
+ mean_anomalies[i] = M_d(rng_engine);
+ eccenricities[i] = ecc_d(rng_engine);
+ }
+ // We log progress
+ fmt::print("{:.2f} min_ecc, {:.2f} max_ecc, on {} data points: ", min_ecc,
+ max_ecc, N);
+ std::vector err(N);
+ for (auto i = 0u; i < N; ++i) {
+ auto res = e2m(m2e(mean_anomalies[i], eccenricities[i]), eccenricities[i]);
+ err[i] = std::abs(res - mean_anomalies[i]);
+ }
+ auto max_it = max_element(std::begin(err), std::end(err));
+ auto min_it = min_element(std::begin(err), std::end(err));
+ auto avg = std::accumulate(err.begin(), err.end(), 0.0) / err.size();
+ fmt::print("{:.3e} avg, {:.3e} min, {:.3e} max\n", avg, *min_it, *max_it);
+}
-int main()
-{
- unsigned seed = 7898935u;
- fmt::print("\nComputes speed different eccentricity ranges:\n");
- perform_test_speed(0, 0.5, 1000000);
- perform_test_speed(0.5, 0.9, 1000000);
- perform_test_speed(0.9, 0.99, 1000000);
- fmt::print("\nComputes error at different eccentricity ranges:\n");
- perform_test_accuracy(0, 0.5, 100000);
- perform_test_accuracy(0.5, 0.9, 100000);
- perform_test_accuracy(0.9, 0.99, 100000);
+int main() {
+ unsigned seed = 7898935u;
+ fmt::print("\nComputes speed different eccentricity ranges:\n");
+ perform_test_speed(0, 0.5, 1000000);
+ perform_test_speed(0.5, 0.9, 1000000);
+ perform_test_speed(0.9, 0.99, 1000000);
+ fmt::print("\nComputes error at different eccentricity ranges:\n");
+ perform_test_accuracy(0, 0.5, 100000);
+ perform_test_accuracy(0.5, 0.9, 100000);
+ perform_test_accuracy(0.9, 0.99, 100000);
}
\ No newline at end of file
diff --git a/clang-format b/clang-format
index 8217f86e..aee11add 100644
--- a/clang-format
+++ b/clang-format
@@ -9,7 +9,7 @@ AllowAllParametersOfDeclarationOnNextLine: true
AllowShortBlocksOnASingleLine: false
AllowShortCaseLabelsOnASingleLine: false
AllowShortFunctionsOnASingleLine: Empty
-AllowShortIfStatementsOnASingleLine: true
+AllowShortIfStatementsOnASingleLine: false
AllowShortLoopsOnASingleLine: false
AlwaysBreakAfterDefinitionReturnType: None
AlwaysBreakBeforeMultilineStrings: false
diff --git a/config.hpp.in b/config.hpp.in
new file mode 100644
index 00000000..ccecc2de
--- /dev/null
+++ b/config.hpp.in
@@ -0,0 +1,34 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_CONFIG_HPP
+#define kep3_CONFIG_HPP
+
+// NOTE: include this so that we can
+// detect _LIBCPP_VERSION below.
+#include
+
+// Start of defines instantiated by CMake.
+#define kep3_VERSION "@kep3_VERSION@"
+#define kep3_VERSION_MAJOR @kep3_VERSION_MAJOR@
+#define kep3_VERSION_MINOR @kep3_VERSION_MINOR@
+#define kep3_VERSION_PATCH @kep3_VERSION_PATCH@
+
+// End of defines instantiated by CMake.
+
+#if defined(__clang__) && defined(_LIBCPP_VERSION)
+
+// When using clang + libc++, prefer the name-based
+// extract() implementation for UDx classes. See
+// the explanation in typeid_name_extract.hpp.
+#define kep3_PREFER_TYPEID_NAME_EXTRACT
+
+#endif
+
+#endif
diff --git a/include/kep3/core_astro/convert_anomalies.hpp b/include/kep3/core_astro/convert_anomalies.hpp
index 6aff203c..1b22b94e 100644
--- a/include/kep3/core_astro/convert_anomalies.hpp
+++ b/include/kep3/core_astro/convert_anomalies.hpp
@@ -1,27 +1,11 @@
-/*****************************************************************************
- * Copyright (C) 2023 The pykep development team, *
- * Advanced Concepts Team (ACT), European Space Agency (ESA) *
- * *
- * https://gitter.im/esa/pykep *
- * https://github.com/esa/pykep *
- * *
- * act@esa.int *
- * *
- * 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 *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- *****************************************************************************/
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef kep3_CONVERT_ANOMALIES_H
#define kep3_CONVERT_ANOMALIES_H
@@ -35,7 +19,8 @@
namespace kep3 {
-// mean to eccentric (only ellipses) e<1. Preserves the sign and integer number of revolutions.
+// mean to eccentric (only ellipses) e<1. Preserves the sign and integer number
+// of revolutions.
inline double m2e(double M, double ecc) {
// We use as intial guess the Mean Anomaly
// (tests indicated that any higher order expansion does not really improve)
@@ -43,9 +28,11 @@ inline double m2e(double M, double ecc) {
const int digits = std::numeric_limits::digits;
double sol = boost::math::tools::halley_iterate(
[M, ecc](double E) {
- return std::make_tuple(kepE(E, M, ecc), d_kepE(E, ecc), dd_kepE(E, ecc));
+ return std::make_tuple(kepE(E, M, ecc), d_kepE(E, ecc),
+ dd_kepE(E, ecc));
},
- IG, IG - boost::math::constants::pi(), IG + boost::math::constants::pi(), digits);
+ IG, IG - boost::math::constants::pi(),
+ IG + boost::math::constants::pi(), digits);
return sol;
}
// eccentric to mean (only ellipses) e<1
diff --git a/include/kep3/core_astro/convert_julian_dates.hpp b/include/kep3/core_astro/convert_julian_dates.hpp
index 8335b3e5..b26c509e 100644
--- a/include/kep3/core_astro/convert_julian_dates.hpp
+++ b/include/kep3/core_astro/convert_julian_dates.hpp
@@ -1,57 +1,22 @@
-/*****************************************************************************
- * Copyright (C) 2023 The pykep development team, *
- * Advanced Concepts Team (ACT), European Space Agency (ESA) *
- * *
- * https://gitter.im/esa/pykep *
- * https://github.com/esa/pykep *
- * *
- * act@esa.int *
- * *
- * 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 *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- *****************************************************************************/
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef kep3_CONVERT_JULIAN_DATES_H
#define kep3_CONVERT_JULIAN_DATES_H
-namespace kep3
-{
-inline double jd2mjd(double in)
-{
- return (in - 2400000.5);
-}
-inline double jd2mjd2000(double in)
-{
- return (in - 2451544.5);
-}
-inline double mjd2jd(double in)
-{
- return (in + 2400000.5);
-}
-inline double mjd2mjd2000(double in)
-{
- return (in - 51544);
-}
-inline double mjd20002jd(double in)
-{
- return (in + 2451544.5);
-}
-inline double mjd20002mjd(double in)
-{
- return (in + 51544);
-}
-}
+namespace kep3 {
+inline double jd2mjd(double in) { return (in - 2400000.5); }
+inline double jd2mjd2000(double in) { return (in - 2451544.5); }
+inline double mjd2jd(double in) { return (in + 2400000.5); }
+inline double mjd2mjd2000(double in) { return (in - 51544); }
+inline double mjd20002jd(double in) { return (in + 2451544.5); }
+inline double mjd20002mjd(double in) { return (in + 51544); }
+} // namespace kep3
#endif // kep3_CONVERT_JULIAN_DATES_H
diff --git a/include/kep3/core_astro/kepler_equations.hpp b/include/kep3/core_astro/kepler_equations.hpp
index 0df1c784..8cf68d76 100644
--- a/include/kep3/core_astro/kepler_equations.hpp
+++ b/include/kep3/core_astro/kepler_equations.hpp
@@ -1,30 +1,14 @@
-/*****************************************************************************
- * Copyright (C) 2023 The pykep development team, *
- * Advanced Concepts Team (ACT), European Space Agency (ESA) *
- * *
- * https://gitter.im/esa/pykep *
- * https://github.com/esa/pykep *
- * *
- * act@esa.int *
- * *
- * 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 *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- *****************************************************************************/
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-#ifndef kep3_kep3LER_EQUATIONS_H
-#define kep3_kep3LER_EQUATIONS_H
+#ifndef kep3_KEPLER_EQUATIONS_H
+#define kep3_KEPLER_EQUATIONS_H
#include
@@ -77,4 +61,4 @@ inline double d_kepDH(double DH, double sigma0, double sqrta, double a,
return (-1. + sigma0 / sqrta * std::sinh(DH) + (1 - R / a) * std::cosh(DH));
}
} // namespace kep3
-#endif // kep3_kep3LER_EQUATIONS_H
+#endif // kep3_KEPLER_EQUATIONS_H
diff --git a/include/kep3/detail/exceptions.hpp b/include/kep3/detail/exceptions.hpp
new file mode 100644
index 00000000..cd72af39
--- /dev/null
+++ b/include/kep3/detail/exceptions.hpp
@@ -0,0 +1,24 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_DETAIL_EXCEPTIONS_HPP
+#define kep3_DETAIL_EXCEPTIONS_HPP
+
+#include
+
+#include
+#include
+
+namespace kep3 {
+struct kep3_DLL_PUBLIC not_implemented_error final : std::runtime_error {
+ using std::runtime_error::runtime_error;
+};
+
+} // namespace kep3
+#endif
\ No newline at end of file
diff --git a/include/kep3/detail/s11n.hpp b/include/kep3/detail/s11n.hpp
index 21153de5..54be0add 100644
--- a/include/kep3/detail/s11n.hpp
+++ b/include/kep3/detail/s11n.hpp
@@ -1,33 +1,14 @@
-/* Copyright 2017-2021 PaGMO development team
-
-This file is part of the PaGMO library.
-
-The PaGMO library is free software; you can redistribute it and/or modify
-it under the terms of either:
-
- * the GNU Lesser General Public License as published by the Free
- Software Foundation; either version 3 of the License, or (at your
- option) any later version.
-
-or
-
- * the GNU General Public License as published by the Free Software
- Foundation; either version 3 of the License, or (at your option) any
- later version.
-
-or both in parallel, as here.
-
-The PaGMO library is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
-or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received copies of the GNU General Public License and the
-GNU Lesser General Public License along with the PaGMO library. If not,
-see https://www.gnu.org/licenses/. */
-
-#ifndef KEP2_S11N_HPP
-#define KEP2_S11N_HPP
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef KEP3_DETAIL_S11N_HPP
+#define KEP3_DETAIL_S11N_HPP
#include
#include
@@ -55,85 +36,76 @@ see https://www.gnu.org/licenses/. */
#include
#include
-namespace pagmo
-{
-
-namespace detail
-{
+namespace kep3::detail {
// Implementation of tuple serialization.
-template
-struct tuple_s11n {
- template
- static void serialize(Archive &ar, std::tuple &t, unsigned version)
- {
- ar &std::get(t);
- tuple_s11n::serialize(ar, t, version);
- }
+template struct tuple_s11n {
+ template
+ static void serialize(Archive &ar, std::tuple &t, unsigned version) {
+ ar &std::get(t);
+ tuple_s11n::serialize(ar, t, version);
+ }
};
-template <>
-struct tuple_s11n<0> {
- template
- static void serialize(Archive &, std::tuple &, unsigned)
- {
- }
+template <> struct tuple_s11n<0> {
+ template
+ static void serialize(Archive &, std::tuple &, unsigned) {}
};
-} // namespace detail
+} // namespace kep3::detail
-} // namespace pagmo
-
-namespace boost
-{
-
-namespace serialization
-{
+namespace boost::serialization {
// Implement serialization for std::tuple.
template
-inline void serialize(Archive &ar, std::tuple &t, unsigned version)
-{
- pagmo::detail::tuple_s11n::serialize(ar, t, version);
+inline void serialize(Archive &ar, std::tuple &t, unsigned version) {
+ kep3::detail::tuple_s11n::serialize(ar, t, version);
}
// Implement serialization for the Mersenne twister engine.
-template
-inline void save(Archive &ar, std::mersenne_twister_engine const &e,
- unsigned)
-{
- std::ostringstream oss;
- // Use the "C" locale.
- oss.imbue(std::locale::classic());
- oss << e;
- ar << oss.str();
+template
+inline void save(Archive &ar,
+ std::mersenne_twister_engine const &e,
+ unsigned) {
+ std::ostringstream oss;
+ // Use the "C" locale.
+ oss.imbue(std::locale::classic());
+ oss << e;
+ ar << oss.str();
}
-template
-inline void load(Archive &ar, std::mersenne_twister_engine &e,
- unsigned)
-{
- std::istringstream iss;
- // Use the "C" locale.
- iss.imbue(std::locale::classic());
- std::string tmp;
- ar >> tmp;
- iss.str(tmp);
- iss >> e;
+template
+inline void load(Archive &ar,
+ std::mersenne_twister_engine &e,
+ unsigned) {
+ std::istringstream iss;
+ // Use the "C" locale.
+ iss.imbue(std::locale::classic());
+ std::string tmp;
+ ar >> tmp;
+ iss.str(tmp);
+ iss >> e;
}
-template
-inline void serialize(Archive &ar, std::mersenne_twister_engine &e,
- unsigned version)
-{
- split_free(ar, e, version);
+template
+inline void serialize(Archive &ar,
+ std::mersenne_twister_engine &e,
+ unsigned version) {
+ split_free(ar, e, version);
}
-} // namespace serialization
-
-} // namespace boost
+} // namespace boost::serialization
#endif
\ No newline at end of file
diff --git a/include/kep3/detail/type_name.hpp b/include/kep3/detail/type_name.hpp
new file mode 100644
index 00000000..0b41c327
--- /dev/null
+++ b/include/kep3/detail/type_name.hpp
@@ -0,0 +1,66 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_DETAIL_TYPE_NAME_HPP
+#define kep3_DETAIL_TYPE_NAME_HPP
+
+#include
+#include
+#include
+
+#include
+
+namespace kep3::detail {
+
+kep3_DLL_PUBLIC std::string demangle_from_typeid(const char *);
+
+// Determine the name of the type T at runtime.
+template inline std::string type_name() {
+ // Get the demangled name without cvref.
+ auto ret = demangle_from_typeid(
+ typeid(typename std::remove_cv<
+ typename std::remove_reference::type>::type)
+ .name());
+
+ // Redecorate it with cv qualifiers.
+ constexpr unsigned flag =
+ unsigned(std::is_const::type>::value) +
+ (unsigned(
+ std::is_volatile::type>::value)
+ << 1);
+ switch (flag) {
+ case 0u:
+ // NOTE: handle this explicitly to keep compiler warnings at bay.
+ break;
+ case 1u:
+ ret += " const";
+ break;
+ case 2u:
+ ret += " volatile";
+ break;
+ case 3u:
+ ret += " const volatile";
+ default:
+ // you should never go here
+ throw;
+ }
+
+ // Re-add the reference, if necessary.
+ if (std::is_lvalue_reference::value) {
+ ret += " &";
+ } else if (std::is_rvalue_reference::value) {
+ ret += " &&";
+ }
+
+ return ret;
+}
+
+} // namespace kep3::detail
+
+#endif
\ No newline at end of file
diff --git a/include/kep3/detail/type_traits.hpp b/include/kep3/detail/type_traits.hpp
new file mode 100644
index 00000000..04e5cdb4
--- /dev/null
+++ b/include/kep3/detail/type_traits.hpp
@@ -0,0 +1,100 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_DETAIL_TYPE_TRAITS_HPP
+#define kep3_DETAIL_TYPE_TRAITS_HPP
+
+#include
+#include
+#include
+#include
+
+namespace kep3::detail {
+
+template
+using uncvref_t = std::remove_cv_t>;
+
+template
+inline constexpr bool always_false_v = false;
+
+// http://en.cppreference.com/w/cpp/experimental/is_detected
+template class Op, class... Args>
+struct detector {
+ using value_t = std::false_type;
+ using type = Default;
+};
+
+template class Op, class... Args>
+struct detector>, Op, Args...> {
+ using value_t = std::true_type;
+ using type = Op;
+};
+
+// http://en.cppreference.com/w/cpp/experimental/nonesuch
+struct nonesuch {
+ nonesuch() = delete;
+ ~nonesuch() = delete;
+ nonesuch(nonesuch const &) = delete;
+ nonesuch(nonesuch &&) noexcept = delete;
+ void operator=(nonesuch const &) = delete;
+ void operator=(nonesuch &&) noexcept = delete;
+};
+
+template class Op, class... Args>
+using is_detected = typename detector::value_t;
+
+template class Op, class... Args>
+using detected_t = typename detector::type;
+
+template class Op, class... Args>
+inline constexpr bool is_detected_v = is_detected::value;
+
+// Helper to detect if T is a supported floating-point type.
+template
+struct is_supported_fp : std::false_type {
+};
+
+template <>
+struct is_supported_fp : std::true_type {
+};
+
+template <>
+struct is_supported_fp : std::true_type {
+};
+
+template
+inline constexpr bool is_supported_fp_v = is_supported_fp::value;
+
+// Detect vector type.
+template
+struct is_any_vector : std::false_type {
+};
+
+template
+struct is_any_vector> : std::true_type {
+};
+
+template
+inline constexpr bool is_any_vector_v = is_any_vector::value;
+
+// Detect initializer_list type.
+template
+struct is_any_ilist : std::false_type {
+};
+
+template
+struct is_any_ilist> : std::true_type {
+};
+
+template
+inline constexpr bool is_any_ilist_v = is_any_ilist::value;
+
+} // namespace kep3::detail
+
+#endif
\ No newline at end of file
diff --git a/include/kep3/detail/typeid_name_extract.hpp b/include/kep3/detail/typeid_name_extract.hpp
new file mode 100644
index 00000000..160cbd9f
--- /dev/null
+++ b/include/kep3/detail/typeid_name_extract.hpp
@@ -0,0 +1,54 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_DETAIL_TYPEID_NAME_EXTRACT_HPP
+#define kep3_DETAIL_TYPEID_NAME_EXTRACT_HPP
+
+#include
+#include
+#include
+
+#include
+
+namespace kep3::detail {
+
+// This is an implementation of the extract() functionality
+// for UDx classes based on the name() of the UDx C++ type,
+// as returned by typeid().name(). This is needed
+// because the dynamic_cast() used in the
+// usual extract() implementations can fail on some
+// compiler/platform/stdlib implementations
+// when crossing boundaries between dlopened()
+// modules. See:
+// https://github.com/pybind/pybind11/issues/912#issuecomment-310157016
+// https://bugs.llvm.org/show_bug.cgi?id=33542
+template
+inline typename std::conditional::value, const T *, T *>::type
+typeid_name_extract(C &class_inst) {
+ // NOTE: typeid() strips away both reference and cv qualifiers. Thus,
+ // if T is cv-qualified or a reference type, return nullptr preemptively
+ // (in any case, extraction cannot be successful in such cases).
+ if (!std::is_same>::value || std::is_reference::value) {
+ return nullptr;
+ }
+
+ if (std::strcmp(class_inst.get_type_index().name(), typeid(T).name()) != 0) {
+ // The names differ, return null.
+ return nullptr;
+ } else {
+ // The names match, cast to the correct type and return.
+ return static_cast::value,
+ const T *, T *>::type>(
+ class_inst.get_ptr());
+ }
+}
+
+} // namespace kep3::detail
+
+#endif
diff --git a/include/kep3/detail/visibility.hpp b/include/kep3/detail/visibility.hpp
index 23ed9af4..c881a6c5 100644
--- a/include/kep3/detail/visibility.hpp
+++ b/include/kep3/detail/visibility.hpp
@@ -1,6 +1,7 @@
-// Copyright 2023 Francesco Biscani (bluescarni@gmail.com), Dario Izzo (dario.izzo@gmail.com)
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
//
-// This file is part of the cascade library.
+// This file is part of the kep3 library.
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
@@ -43,12 +44,14 @@
#endif
// NOTE: it seems like on Windows using dllimport/dllexport on inline classes
-// is generally not helpful (and potentially harmful), apart from special use cases:
+// is generally not helpful (and potentially harmful), apart from special use
+// cases:
// https://stackoverflow.com/questions/8876279/c-inline-functions-with-dllimport-dllexport
// https://stackoverflow.com/questions/24511376/how-to-dllexport-a-class-derived-from-stdruntime-error
// https://devblogs.microsoft.com/oldnewthing/20140109-00/?p=2123
-// Setting the visibility attribute on GCC-like compilers for inline classes, however, seems to be ok.
-// Thus, we use a specialised definition for marking "public"ly visible inline classes.
+// Setting the visibility attribute on GCC-like compilers for inline classes,
+// however, seems to be ok. Thus, we use a specialised definition for marking
+// "public"ly visible inline classes.
#if defined(_WIN32) || defined(__CYGWIN__)
#define kep3_DLL_PUBLIC_INLINE_CLASS
diff --git a/include/kep3/epoch.hpp b/include/kep3/epoch.hpp
index 04e73af6..2ea5fcdc 100644
--- a/include/kep3/epoch.hpp
+++ b/include/kep3/epoch.hpp
@@ -1,27 +1,11 @@
-/*****************************************************************************
- * Copyright (C) 2004-2018 The pykep development team, *
- * Advanced Concepts Team (ACT), European Space Agency (ESA) *
- * *
- * https://gitter.im/esa/pykep *
- * https://github.com/esa/pykep *
- * *
- * act@esa.int *
- * *
- * 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 *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- *****************************************************************************/
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef kep3_EPOCH_H
#define kep3_EPOCH_H
@@ -48,7 +32,7 @@ namespace kep3 {
* gregorian dates (see boost documentation at
* http://www.boost.org/doc/libs/1_42_0/doc/html/date_time.html)
* using the posix time.
- * To achieve higher performance the date is defined in MJD2000 (double) as a
+ * The date is defined in MJD2000 (double) as a
* private member
*
* @author Dario Izzo (dario.izzo _AT_ googlemail.com)
@@ -64,19 +48,19 @@ class kep3_DLL_PUBLIC epoch {
enum julian_type { MJD2000, MJD, JD };
/** Constructors */
- epoch(const double & = 0., julian_type = MJD2000);
+ explicit epoch(const double & = 0., julian_type = MJD2000);
epoch(const boost::gregorian::greg_day &day,
const boost::gregorian::greg_month &month,
const boost::gregorian::greg_year &year);
- epoch(const boost::posix_time::ptime &posix_time);
+ explicit epoch(const boost::posix_time::ptime &posix_time);
/** Computing non-gregorian dates */
- double mjd2000() const;
- double jd() const;
- double mjd() const;
+ [[nodiscard]] double mjd2000() const;
+ [[nodiscard]] double jd() const;
+ [[nodiscard]] double mjd() const;
/** Interface to boost::posix_time::ptime */
- boost::posix_time::ptime get_posix_time() const;
+ [[nodiscard]] boost::posix_time::ptime get_posix_time() const;
void set_posix_time(const boost::posix_time::ptime &);
/** operators overloads for sum diff (epoch-days) and the comparison operators
@@ -105,8 +89,8 @@ class kep3_DLL_PUBLIC epoch {
double m_mjd2000;
};
-kep3_DLL_PUBLIC epoch epoch_from_string(const std::string date);
-kep3_DLL_PUBLIC epoch epoch_from_iso_string(const std::string date);
+kep3_DLL_PUBLIC epoch epoch_from_string(const std::string &date);
+kep3_DLL_PUBLIC epoch epoch_from_iso_string(const std::string &date);
kep3_DLL_PUBLIC std::ostream &operator<<(std::ostream &s,
const epoch &epoch_in);
diff --git a/include/kep3/planet.hpp b/include/kep3/planet.hpp
new file mode 100644
index 00000000..6fc21f38
--- /dev/null
+++ b/include/kep3/planet.hpp
@@ -0,0 +1,327 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#ifndef kep3_PLANET_H
+#define kep3_PLANET_H
+
+#include
+#include
+#include
+#include
+
+#include
+#if defined(kep3_PREFER_TYPEID_NAME_EXTRACT)
+#include
+#endif
+#include
+#include
+#include
+#include
+
+#define kep3_S11N_PLANET_EXPORT_KEY(PLA) \
+ BOOST_CLASS_EXPORT_KEY2(kep3::detail::planet_inner, "udpla " #PLA) \
+ BOOST_CLASS_TRACKING(kep3::detail::planet_inner, \
+ boost::serialization::track_never)
+
+#define kep3_S11N_PLANET_IMPLEMENT(PLA) \
+ BOOST_CLASS_EXPORT_IMPLEMENT(kep3::detail::planet_inner)
+
+#define kep3_S11N_PLANET_EXPORT(PLA) \
+ kep3_S11N_PLANET_EXPORT_KEY(PLA) kep3_S11N_PLANET_IMPLEMENT(PLA)
+
+namespace kep3::detail {
+// Type traits to detect whether user classes have certain methods implemented.
+
+// This macro assembles the necessary boilerplate to detect the generic getter
+// method double udpla_get_NAME()
+#define UDPLA_HAS_GET(NAME) \
+ template \
+ using udpla_get_##NAME##_t = \
+ decltype(std::declval>() \
+ .get_##NAME()); \
+ template \
+ inline constexpr bool udpla_has_get_##NAME##_v = \
+ std::is_same_v, double>
+
+UDPLA_HAS_GET(mu_central_body);
+UDPLA_HAS_GET(mu_self);
+UDPLA_HAS_GET(radius);
+UDPLA_HAS_GET(safe_radius);
+
+// udpla_has_eph detects whether T has the method:
+// std::array, 2> eph(const epoch&)
+// method
+template
+using udpla_eph_t =
+ decltype(std::declval>().eph(
+ std::declval()));
+
+template
+using udpla_has_eph = std::is_same,
+ std::array, 2>>;
+
+// udpla_has_get_name_v is True if T has the method:
+// std::string get_name()
+template
+using udpla_get_name_t =
+ decltype(std::declval>().get_name());
+template
+inline constexpr bool udpla_has_get_name_v =
+ std::is_same_v, std::string>;
+
+// udpla_has_get_extra_info_v is True if T has the method:
+// std::string get_extra_info()
+template
+using udpla_get_extra_info_t =
+ decltype(std::declval>()
+ .get_extra_info());
+template
+inline constexpr bool udpla_has_get_extra_info_v =
+ std::is_same_v, std::string>;
+
+// This defines the main interface for a class to be type erased into a kep3
+// planet
+struct kep3_DLL_PUBLIC_INLINE_CLASS planet_inner_base {
+ planet_inner_base() = default;
+ planet_inner_base(const planet_inner_base &) = delete;
+ planet_inner_base(planet_inner_base &&) noexcept = delete;
+ planet_inner_base &operator=(const planet_inner_base &) = delete;
+ planet_inner_base &operator=(planet_inner_base &&) noexcept = delete;
+ virtual ~planet_inner_base() = default;
+
+ [[nodiscard]] virtual std::unique_ptr clone() const = 0;
+
+ [[nodiscard]] virtual std::type_index get_type_index() const = 0;
+ [[nodiscard]] virtual const void *get_ptr() const = 0;
+ virtual void *get_ptr() = 0;
+
+ // mandatory methods
+ [[nodiscard]] virtual std::array, 2>
+ eph(const epoch &) const = 0;
+ // optional methods with default implementations
+ [[nodiscard]] virtual std::string get_name() const = 0;
+ [[nodiscard]] virtual std::string get_extra_info() const = 0;
+ [[nodiscard]] virtual double get_mu_central_body() const = 0;
+ [[nodiscard]] virtual double get_mu_self() const = 0;
+ [[nodiscard]] virtual double get_radius() const = 0;
+ [[nodiscard]] virtual double get_safe_radius() const = 0;
+
+private:
+ // Serialization.
+ friend class boost::serialization::access;
+ template void serialize(Archive &, unsigned) {}
+};
+
+template
+struct kep3_DLL_PUBLIC_INLINE_CLASS planet_inner final : planet_inner_base {
+ T m_value;
+
+ // We just need the def ctor, delete everything else.
+ planet_inner() = default;
+ planet_inner(const planet_inner &) = delete;
+ planet_inner(planet_inner &&) = delete;
+ planet_inner &operator=(const planet_inner &) = delete;
+ planet_inner &operator=(planet_inner &&) = delete;
+ ~planet_inner() final = default;
+
+ // Constructors from T (copy and move variants).
+ explicit planet_inner(const T &x) : m_value(x) {}
+ explicit planet_inner(T &&x) : m_value(std::move(x)) {}
+
+ // The clone method, used in the copy constructor of planet.
+ [[nodiscard]] std::unique_ptr clone() const final {
+ return std::make_unique(m_value);
+ }
+
+ // Get the type at runtime.
+ [[nodiscard]] std::type_index get_type_index() const final {
+ return std::type_index{typeid(T)};
+ }
+
+ // Raw getters for the internal instance.
+ [[nodiscard]] const void *get_ptr() const final { return &m_value; }
+ void *get_ptr() final { return &m_value; }
+
+ // Mandatory methods.
+ [[nodiscard]] std::array, 2>
+ eph(const epoch &ep) const final {
+ return m_value.eph(ep);
+ }
+ // optional methods with default implementations
+ // these require added boiler plate as to detect whether they have been
+ // implemented by the user class.
+ [[nodiscard]] std::string get_name() const final {
+ if constexpr (udpla_has_get_name_v) {
+ return m_value.get_name();
+ } else {
+ return detail::type_name();
+ }
+ }
+ [[nodiscard]] std::string get_extra_info() const final {
+ if constexpr (udpla_has_get_name_v) {
+ return m_value.get_extra_info();
+ } else {
+ return "";
+ }
+ }
+ [[nodiscard]] double get_mu_central_body() const final {
+ if constexpr (udpla_has_get_mu_central_body_v) {
+ return m_value.get_mu_central_body();
+ } else {
+ return -1.; // by convention, in kep3 this signals the planet does not
+ // expose this physical value
+ }
+ }
+ [[nodiscard]] double get_mu_self() const final {
+ if constexpr (udpla_has_get_mu_self_v) {
+ return m_value.get_mu_self();
+ } else {
+ return -1.; // by convention, in kep3 this signals the planet does not
+ // expose this physical value
+ }
+ }
+ [[nodiscard]] double get_radius() const final {
+ if constexpr (udpla_has_get_radius_v) {
+ return m_value.get_radius();
+ } else {
+ return -1.; // by convention, in kep3 this signals the planet does not
+ // expose this physical value
+ }
+ }
+ [[nodiscard]] double get_safe_radius() const final {
+ if constexpr (udpla_has_get_safe_radius_v) {
+ return m_value.get_safe_radius();
+ } else {
+ return -1.; // by convention, in kep3 this signals the planet does not
+ // expose this physical value
+ }
+ }
+
+private:
+ // Serialization.
+ friend class boost::serialization::access;
+ template void serialize(Archive &ar, unsigned) {
+ ar &boost::serialization::base_object(*this);
+ ar &m_value;
+ }
+};
+template
+using is_udpla = std::conjunction<
+ std::is_same>, std::is_default_constructible,
+ std::is_copy_constructible, std::is_move_constructible,
+ std::is_destructible, udpla_has_eph>;
+
+struct kep3_DLL_PUBLIC null_udpla {
+ null_udpla() = default;
+ static std::array, 2> eph(const epoch &);
+
+private:
+ friend class boost::serialization::access;
+ template void serialize(Archive &, unsigned){};
+};
+} // namespace kep3::detail
+kep3_S11N_PLANET_EXPORT_KEY(kep3::detail::null_udpla);
+
+// Disable Boost.Serialization tracking for the implementation
+// details of the planet.
+BOOST_CLASS_TRACKING(kep3::detail::planet_inner_base,
+ boost::serialization::track_never)
+
+namespace kep3 {
+// The final class
+class kep3_DLL_PUBLIC planet {
+ // Pointer to the inner base.
+ std::unique_ptr m_ptr;
+
+ // Serialization.
+ friend class boost::serialization::access;
+ template void serialize(Archive &ar, unsigned) {
+ ar &m_ptr;
+ }
+
+ // Just two small helpers to make sure via assertions that whenever we require
+ // access to the pointer it actually points to something.
+ [[nodiscard]] const detail::planet_inner_base *ptr() const;
+ detail::planet_inner_base *ptr();
+
+ template
+ using generic_ctor_enabler = std::enable_if_t<
+ std::conjunction_v<
+ std::negation>>,
+ detail::is_udpla>>,
+ int>;
+
+public:
+ // Default constructor
+ planet();
+ // Constructor from the UDPLA
+ template = 0>
+ explicit planet(T &&x)
+ : m_ptr(std::make_unique>>(
+ std::forward(x))) {}
+ // Copy constructor
+ planet(const planet &);
+ // Move ctor.
+ planet(planet &&) noexcept;
+ // Move assignment.
+ planet &operator=(planet &&) noexcept;
+ // Copy assignment.
+ planet &operator=(const planet &);
+ // Default destructor
+ ~planet() = default;
+ // Assignment from a user-defined planet of type \p T
+ template = 0> planet &operator=(T &&x) {
+ return (*this) = planet(std::forward(x));
+ }
+ // Extract a const pointer to the UDPLA.
+ template const T *extract() const noexcept {
+#if defined(kep3_PREFER_TYPEID_NAME_EXTRACT)
+ return detail::typeid_name_extract(*this);
+#else
+ auto p = dynamic_cast *>(ptr());
+ return p == nullptr ? nullptr : &(p->m_value);
+#endif
+ }
+ /// Extract a pointer to the UDA.
+ template T *extract() noexcept {
+#if defined(kep3_PREFER_TYPEID_NAME_EXTRACT)
+ return detail::typeid_name_extract(*this);
+#else
+ auto p = dynamic_cast *>(ptr());
+ return p == nullptr ? nullptr : &(p->m_value);
+#endif
+ }
+ // Checks the user-defined algorithm type at run-time.
+ template [[nodiscard]] bool is() const noexcept {
+ return extract() != nullptr;
+ }
+ // Check if the planet is valid (i.e. has not been moved from)
+ [[nodiscard]] bool is_valid() const;
+ // Gets the type of the UDPLA at runtime.
+ [[nodiscard]] std::type_index get_type_index() const;
+ /// Gets a const pointer to the UDPLA.
+ [[nodiscard]] const void *get_ptr() const;
+ // Gets a mutable pointer to the UDPLA.
+ void *get_ptr();
+
+ std::array, 2> eph(const epoch &);
+ [[nodiscard]] std::string get_name() const;
+ [[nodiscard]] std::string get_extra_info() const;
+ [[nodiscard]] double get_mu_central_body() const;
+ [[nodiscard]] double get_mu_self() const;
+ [[nodiscard]] double get_radius() const;
+ [[nodiscard]] double get_safe_radius() const;
+};
+
+// Streaming operator for algorithm.
+kep3_DLL_PUBLIC std::ostream &operator<<(std::ostream &, const planet &);
+
+} // namespace kep3
+
+#endif // kep3_PLANET_H
diff --git a/src/detail/type_name.cpp b/src/detail/type_name.cpp
new file mode 100644
index 00000000..2c7bd176
--- /dev/null
+++ b/src/detail/type_name.cpp
@@ -0,0 +1,49 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#include
+
+#if defined(__GNUC__) || (defined(__clang__) && !defined(_MSC_VER))
+
+// GCC demangle. This is available also for clang, both with libstdc++ and
+// libc++.
+#include
+#include
+#include
+
+#endif
+
+#include
+
+namespace kep3::detail {
+
+std::string demangle_from_typeid(const char *s) {
+#if defined(__GNUC__) || (defined(__clang__) && !defined(_MSC_VER))
+ // NOTE: wrap std::free() in a local lambda, so we avoid
+ // potential ambiguities when taking the address of std::free().
+ // See:
+ // https://stackoverflow.com/questions/27440953/stdunique-ptr-for-c-functions-that-need-free
+ // NOLINTNEXTLINE(cppcoreguidelines-owning-memory, hicpp-no-malloc, cppcoreguidelines-no-malloc)
+ auto deleter = [](void *ptr) { std::free(ptr); };
+
+ // NOTE: abi::__cxa_demangle will return a pointer allocated by std::malloc,
+ // which we will delete via std::free().
+ std::unique_ptr res{
+ ::abi::__cxa_demangle(s, nullptr, nullptr, nullptr), deleter};
+
+ // NOTE: return the original string if demangling fails.
+ return res ? std::string(res.get()) : std::string(s);
+#else
+ // If no demangling is available, just return the mangled name.
+ // NOTE: MSVC already returns the demangled name from typeid.
+ return std::string(s);
+#endif
+}
+
+} // namespace kep3::detail
diff --git a/src/epoch.cpp b/src/epoch.cpp
index e7b2a59e..40ca411f 100644
--- a/src/epoch.cpp
+++ b/src/epoch.cpp
@@ -1,27 +1,11 @@
-/*****************************************************************************
- * Copyright (C) 2023 The pykep development team, *
- * Advanced Concepts Team (ACT), European Space Agency (ESA) *
- * *
- * https://gitter.im/esa/pykep *
- * https://github.com/esa/pykep *
- * *
- * act@esa.int *
- * *
- * 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 *
- * (at your option) any later version. *
- * *
- * This program is distributed in the hope that it will be useful, *
- * but WITHOUT ANY WARRANTY; without even the implied warranty of *
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
- * GNU General Public License for more details. *
- * *
- * You should have received a copy of the GNU General Public License *
- * along with this program; if not, write to the *
- * Free Software Foundation, Inc., *
- * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
- *****************************************************************************/
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#include
#include
@@ -37,8 +21,15 @@
#define BOOST_DATE_PRECISION 1e-6
namespace kep3 {
-using namespace boost::gregorian;
-using namespace boost::posix_time;
+using ::boost::gregorian::date;
+using ::boost::gregorian::greg_day;
+using ::boost::gregorian::greg_month;
+using ::boost::gregorian::greg_year;
+using ::boost::posix_time::ptime;
+using ::boost::posix_time::time_duration;
+using ::boost::posix_time::time_from_string;
+using ::boost::posix_time::from_iso_string;
+
/// Constructor.
/**
@@ -67,7 +58,9 @@ epoch::epoch(const double &epoch_in, julian_type epoch_type)
* the year \param[in] day The day of the month
*/
epoch::epoch(const greg_day &day, const greg_month &month,
- const greg_year &year) {
+ const greg_year &year)
+ : m_mjd2000(0) {
+ // member m_mjd2000 will be here assigned.
set_posix_time(ptime(date(year, month, day)));
}
@@ -76,7 +69,7 @@ epoch::epoch(const greg_day &day, const greg_month &month,
* Constructs an epoch from a boost ptime object (posix time)
* \param[in] posix_time The posix_time
*/
-epoch::epoch(const boost::posix_time::ptime &posix_time) {
+epoch::epoch(const ptime &posix_time) {
time_duration dt = posix_time - ptime(date(2000, 1, 1));
bool flag = false;
if (dt.is_negative()) {
@@ -88,8 +81,9 @@ epoch::epoch(const boost::posix_time::ptime &posix_time) {
m_mjd2000 = static_cast(dt.hours()) / 24.0 +
static_cast(dt.minutes()) / 1440.0 +
(static_cast(dt.seconds()) + fr_secs) / 86400.0;
- if (flag)
+ if (flag) {
m_mjd2000 = -m_mjd2000;
+ }
}
/// jd getter.
@@ -128,7 +122,7 @@ double epoch::mjd2000() const { return m_mjd2000; }
*
*/
ptime epoch::get_posix_time() const {
- long hrs, min, sec, fsec;
+ long hrs = 0., min = 0., sec = 0., fsec = 0.;
bool flag = false;
double copy = m_mjd2000;
if (copy < 0) {
@@ -152,10 +146,11 @@ ptime epoch::get_posix_time() const {
fsec = boost::lexical_cast(fsecstr.str().substr(
2, static_cast(-std::log10(BOOST_DATE_PRECISION) + 1)));
ptime retval;
- if (flag)
+ if (flag) {
retval = ptime(date(2000, 1, 1), time_duration(-hrs, -min, -sec, -fsec));
- else
+ } else {
retval = ptime(date(2000, 1, 1), time_duration(hrs, min, sec, fsec));
+ }
return retval;
}
@@ -166,7 +161,7 @@ ptime epoch::get_posix_time() const {
* \param[in] posix_time containing the posix time
*
*/
-void epoch::set_posix_time(const boost::posix_time::ptime &posix_time) {
+void epoch::set_posix_time(const ptime &posix_time) {
m_mjd2000 = epoch(posix_time).mjd2000();
}
@@ -194,9 +189,8 @@ epoch &epoch::operator-=(double rhs) {
* epoch e(epoch_from_string(ts))
*
*/
-epoch epoch_from_string(const std::string date) {
- return epoch(
- boost::posix_time::ptime(boost::posix_time::time_from_string(date)));
+epoch epoch_from_string(const std::string &date) {
+ return epoch(time_from_string(date));
}
/// Returns an epoch constructed from a non delimited iso string containing a
@@ -209,9 +203,9 @@ epoch epoch_from_string(const std::string date) {
* epoch e(epoch_from_iso_string(ts))
*
*/
-epoch epoch_from_iso_string(const std::string date) {
+epoch epoch_from_iso_string(const std::string &date) {
return epoch(
- boost::posix_time::ptime(boost::posix_time::from_iso_string(date)));
+ from_iso_string(date));
}
/// Overload the stream operator for kep_toolbox::epoch
@@ -224,27 +218,27 @@ epoch epoch_from_iso_string(const std::string date) {
* \return reference to s
*
*/
-std::ostream &operator<<(std::ostream &s, const epoch &now) {
- s << now.get_posix_time();
+std::ostream &operator<<(std::ostream &s, const epoch &epoch_in) {
+ s << epoch_in.get_posix_time();
return s;
}
bool operator>(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 > c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 > c2.m_mjd2000;
}
bool operator<(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 < c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 < c2.m_mjd2000;
}
bool operator>=(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 >= c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 >= c2.m_mjd2000;
}
bool operator<=(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 <= c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 <= c2.m_mjd2000;
}
bool operator==(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 == c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 == c2.m_mjd2000;
}
bool operator!=(const epoch &c1, const epoch &c2) {
- return (c1.m_mjd2000 != c2.m_mjd2000) ? true : false;
+ return c1.m_mjd2000 != c2.m_mjd2000;
}
epoch operator+(epoch lhs, double rhs) {
lhs += rhs; // reuse compound assignment
diff --git a/src/planet.cpp b/src/planet.cpp
new file mode 100644
index 00000000..b5773bcc
--- /dev/null
+++ b/src/planet.cpp
@@ -0,0 +1,107 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#include
+#include
+
+
+namespace kep3::detail {
+
+std::array, 2> null_udpla::eph(const epoch &) {
+ std::array pos = {1., 0., 0.};
+ std::array vel = {0., 1., 0.};
+ return {pos, vel};
+};
+} // namespace kep3::detail
+
+namespace kep3 {
+planet::planet() : planet(detail::null_udpla{}){};
+planet::planet(const planet &other) : m_ptr(other.m_ptr->clone()){};
+planet::planet(planet &&other) noexcept : m_ptr(std::move(other.m_ptr)){};
+
+planet &planet::operator=(planet &&other) noexcept {
+ if (this != &other) {
+ m_ptr = std::move(other.m_ptr);
+ }
+ return *this;
+}
+
+planet &planet::operator=(const planet &other) { return *this = planet(other); }
+
+bool planet::is_valid() const { return static_cast(m_ptr); }
+
+std::type_index planet::get_type_index() const {
+ return ptr()->get_type_index();
+}
+
+const void *planet::get_ptr() const { return ptr()->get_ptr(); }
+
+void *planet::get_ptr() { return ptr()->get_ptr(); }
+
+detail::planet_inner_base const *planet::ptr() const {
+ assert(m_ptr.get() != nullptr);
+ return m_ptr.get();
+}
+
+detail::planet_inner_base *planet::ptr() {
+ assert(m_ptr.get() != nullptr);
+ return m_ptr.get();
+}
+
+std::array, 2> planet::eph(const epoch &ep) {
+ return ptr()->eph(ep);
+}
+
+std::string planet::get_name() const { return ptr()->get_name(); }
+
+std::string planet::get_extra_info() const { return ptr()->get_extra_info(); }
+
+double planet::get_mu_central_body() const {
+ double mu = ptr()->get_mu_central_body();
+ if (mu == -1.) {
+ throw not_implemented_error("A central body mu has not been declared for '" + get_name() + "'");
+ }
+ return mu;
+}
+
+double planet::get_mu_self() const {
+ double mu = ptr()->get_mu_self();
+ if (mu == -1.) {
+ throw not_implemented_error("A body mu has not been declared for '" + get_name() + "'");
+ }
+ return mu;
+}
+
+double planet::get_radius() const {
+ double mu = ptr()->get_radius();
+ if (mu == -1.) {
+ throw not_implemented_error("A body radius has not been declared for '" + get_name() + "'");
+ }
+ return mu;
+}
+
+double planet::get_safe_radius() const {
+ double mu = ptr()->get_safe_radius();
+ if (mu == -1.) {
+ throw not_implemented_error("A body safe radius has has not been declared for '" + get_name() + "'");
+ }
+ return mu;
+}
+
+std::ostream &operator<<(std::ostream &os, const planet &p) {
+ os << "Planet name: " << p.get_name();
+ os << "\nC++ class name: "
+ << detail::demangle_from_typeid(p.get_type_index().name()) << '\n';
+ const auto extra_str = p.get_extra_info();
+ if (!extra_str.empty()) {
+ os << "\nExtra info:\n" << extra_str;
+ }
+ return os;
+}
+} // namespace kep3
\ No newline at end of file
diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
index 83eb4db0..6f5c66d8 100644
--- a/test/CMakeLists.txt
+++ b/test/CMakeLists.txt
@@ -27,4 +27,5 @@ function(ADD_kep3_TESTCASE arg1)
endfunction()
ADD_kep3_TESTCASE(convert_anomalies_test)
-ADD_kep3_TESTCASE(epoch_test)
\ No newline at end of file
+ADD_kep3_TESTCASE(epoch_test)
+ADD_kep3_TESTCASE(planet_test)
\ No newline at end of file
diff --git a/test/convert_anomalies_test.cpp b/test/convert_anomalies_test.cpp
index 104ff37e..90b82669 100644
--- a/test/convert_anomalies_test.cpp
+++ b/test/convert_anomalies_test.cpp
@@ -1,125 +1,131 @@
-// Copyright 2023 Francesco Biscani (bluescarni@gmail.com), Dario Izzo (dario.izzo@gmail.com)
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
//
-// This file is part of the cascade library.
+// This file is part of the kep3 library.
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-#include
-#include
+#include
+#include
-#include
+#include
#include "catch.hpp"
using namespace kep3;
-TEST_CASE("m2e")
-{
- using Catch::Detail::Approx;
- std::random_device rd;
- //
- // Engines
- //
- std::mt19937 rng_engine(rd());
- //
- // Distribtuions
- //
- std::uniform_real_distribution ecc_difficult_d(0.9, 0.99);
- std::uniform_real_distribution ecc_easy_d(0., 0.9);
- std::uniform_real_distribution M_d(-100, 100.);
+TEST_CASE("m2e") {
+ using Catch::Detail::Approx;
+ std::random_device rd;
+ //
+ // Engines
+ //
+ std::mt19937 rng_engine(rd());
+ //
+ // Distribtuions
+ //
+ std::uniform_real_distribution ecc_difficult_d(0.9, 0.99);
+ std::uniform_real_distribution ecc_easy_d(0., 0.9);
+ std::uniform_real_distribution M_d(-100, 100.);
- // Testing on N random calls (easy)
- unsigned N = 10000;
- for (auto i = 0u; i < N; ++i) {
- double mean_anom = M_d(rng_engine);
- double ecc = ecc_easy_d(rng_engine);
- double res = e2m(m2e(mean_anom, ecc), ecc);
- // We require 1e-13 and not 1e-14 as the range for m is [-100,100]. For high values of M some precision loss is to be expected
- // as to maintain digits of the higher number.
- REQUIRE(std::sin(res) == Approx(std::sin(mean_anom)).epsilon(0.).margin(1e-13));
- REQUIRE(std::cos(res) == Approx(std::cos(mean_anom)).epsilon(0.).margin(1e-13));
-
- }
- // Testing on N random calls (difficult)
- for (auto i = 0u; i < N; ++i) {
- double mean_anom = M_d(rng_engine);
- double ecc = ecc_difficult_d(rng_engine);
- double res = e2m(m2e(mean_anom, ecc), ecc);
- REQUIRE(std::sin(res) == Approx(std::sin(mean_anom)).epsilon(0.).margin(1e-13));
- REQUIRE(std::cos(res) == Approx(std::cos(mean_anom)).epsilon(0.).margin(1e-13));
- }
+ // Testing on N random calls (easy)
+ unsigned N = 10000;
+ for (auto i = 0u; i < N; ++i) {
+ double mean_anom = M_d(rng_engine);
+ double ecc = ecc_easy_d(rng_engine);
+ double res = e2m(m2e(mean_anom, ecc), ecc);
+ // We require 1e-13 and not 1e-14 as the range for m is [-100,100]. For high
+ // values of M some precision loss is to be expected as to maintain digits
+ // of the higher number.
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(mean_anom)).epsilon(0.).margin(1e-13));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(mean_anom)).epsilon(0.).margin(1e-13));
+ }
+ // Testing on N random calls (difficult)
+ for (auto i = 0u; i < N; ++i) {
+ double mean_anom = M_d(rng_engine);
+ double ecc = ecc_difficult_d(rng_engine);
+ double res = e2m(m2e(mean_anom, ecc), ecc);
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(mean_anom)).epsilon(0.).margin(1e-13));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(mean_anom)).epsilon(0.).margin(1e-13));
+ }
}
-TEST_CASE("f2e")
-{
- using Catch::Detail::Approx;
- std::random_device rd;
- //
- // Engines
- //
- std::mt19937 rng_engine(rd());
- //
- // Distribtuions
- //
- std::uniform_real_distribution ecc_difficult_d(0.9, 0.99);
- std::uniform_real_distribution ecc_easy_d(0., 0.9);
- std::uniform_real_distribution f_d(-100, 100.);
-
- // Testing on N random calls (easy)
- unsigned N = 10000;
- for (auto i = 0u; i < N; ++i) {
- double true_anom = f_d(rng_engine);
- double ecc = ecc_easy_d(rng_engine);
- double res = e2f(f2e(true_anom, ecc), ecc);
- REQUIRE(std::sin(res) == Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
- REQUIRE(std::cos(res) == Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
-
- }
- // Testing on N random calls (difficult)
- for (auto i = 0u; i < N; ++i) {
- double true_anom = f_d(rng_engine);
- double ecc = ecc_difficult_d(rng_engine);
- double res = e2f(f2e(true_anom, ecc), ecc);
- REQUIRE(std::sin(res) == Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
- REQUIRE(std::cos(res) == Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+TEST_CASE("f2e") {
+ using Catch::Detail::Approx;
+ std::random_device rd;
+ //
+ // Engines
+ //
+ std::mt19937 rng_engine(rd());
+ //
+ // Distribtuions
+ //
+ std::uniform_real_distribution ecc_difficult_d(0.9, 0.99);
+ std::uniform_real_distribution ecc_easy_d(0., 0.9);
+ std::uniform_real_distribution f_d(-100, 100.);
- }
+ // Testing on N random calls (easy)
+ unsigned N = 10000;
+ for (auto i = 0u; i < N; ++i) {
+ double true_anom = f_d(rng_engine);
+ double ecc = ecc_easy_d(rng_engine);
+ double res = e2f(f2e(true_anom, ecc), ecc);
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+ }
+ // Testing on N random calls (difficult)
+ for (auto i = 0u; i < N; ++i) {
+ double true_anom = f_d(rng_engine);
+ double ecc = ecc_difficult_d(rng_engine);
+ double res = e2f(f2e(true_anom, ecc), ecc);
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+ }
}
-TEST_CASE("zeta2e")
-{
- using Catch::Detail::Approx;
- std::random_device rd;
- //
- // Engines
- //
- std::mt19937 rng_engine(rd());
- //
- // Distribtuions
- //
- std::uniform_real_distribution ecc_difficult_d(1.01, 1.1);
- std::uniform_real_distribution ecc_easy_d(2.,100.);
- std::uniform_real_distribution f_d(-100, 100.);
-
- // Testing on N random calls (easy)
- unsigned N = 10000;
- for (auto i = 0u; i < N; ++i) {
- double true_anom = f_d(rng_engine);
- double ecc = ecc_easy_d(rng_engine);
- double res = zeta2f(f2zeta(true_anom, ecc), ecc);
- REQUIRE(std::sin(res) == Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
- REQUIRE(std::cos(res) == Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
-
- }
- // Testing on N random calls (difficult)
- for (auto i = 0u; i < N; ++i) {
- double true_anom = f_d(rng_engine);
- double ecc = ecc_difficult_d(rng_engine);
- double res = zeta2f(f2zeta(true_anom, ecc), ecc);
- REQUIRE(std::sin(res) == Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
- REQUIRE(std::cos(res) == Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+TEST_CASE("zeta2e") {
+ using Catch::Detail::Approx;
+ std::random_device rd;
+ //
+ // Engines
+ //
+ std::mt19937 rng_engine(rd());
+ //
+ // Distribtuions
+ //
+ std::uniform_real_distribution ecc_difficult_d(1.01, 1.1);
+ std::uniform_real_distribution ecc_easy_d(2., 100.);
+ std::uniform_real_distribution f_d(-100, 100.);
- }
+ // Testing on N random calls (easy)
+ unsigned N = 10000;
+ for (auto i = 0u; i < N; ++i) {
+ double true_anom = f_d(rng_engine);
+ double ecc = ecc_easy_d(rng_engine);
+ double res = zeta2f(f2zeta(true_anom, ecc), ecc);
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+ }
+ // Testing on N random calls (difficult)
+ for (auto i = 0u; i < N; ++i) {
+ double true_anom = f_d(rng_engine);
+ double ecc = ecc_difficult_d(rng_engine);
+ double res = zeta2f(f2zeta(true_anom, ecc), ecc);
+ REQUIRE(std::sin(res) ==
+ Approx(std::sin(true_anom)).epsilon(0.).margin(1e-14));
+ REQUIRE(std::cos(res) ==
+ Approx(std::cos(true_anom)).epsilon(0.).margin(1e-14));
+ }
}
diff --git a/test/epoch_test.cpp b/test/epoch_test.cpp
index f25505f0..218ba098 100644
--- a/test/epoch_test.cpp
+++ b/test/epoch_test.cpp
@@ -1,7 +1,7 @@
-// Copyright 2023 Francesco Biscani (bluescarni@gmail.com), Dario Izzo
-// (dario.izzo@gmail.com)
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
//
-// This file is part of the cascade library.
+// This file is part of the kep3 library.
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
@@ -16,12 +16,13 @@
#include "catch.hpp"
-using namespace kep3;
-using namespace boost::gregorian;
-using namespace boost::posix_time;
+using kep3::epoch;
+using kep3::epoch_from_iso_string;
+using kep3::epoch_from_string;
+using boost::gregorian::date;
+using boost::posix_time::ptime;
-TEST_CASE("construct")
-{
+TEST_CASE("construct") {
// test syntax
REQUIRE_NOTHROW(epoch());
REQUIRE_NOTHROW(epoch(123.456));
@@ -45,8 +46,7 @@ TEST_CASE("construct")
REQUIRE(epoch(31, 12, 2034).jd() == epoch(posix_time_test).jd());
}
-TEST_CASE("epoch_operators")
-{
+TEST_CASE("epoch_operators") {
REQUIRE(epoch(0.) == epoch(0.));
REQUIRE(epoch(0.) != epoch(1.));
REQUIRE(epoch(1.) > epoch(0.));
@@ -67,8 +67,7 @@ TEST_CASE("epoch_operators")
REQUIRE_NOTHROW((std::cout << epoch()));
}
-TEST_CASE("conversions_from_string")
-{
+TEST_CASE("conversions_from_string") {
{
std::string ts("20020131T000000");
epoch e(epoch_from_iso_string(ts));
diff --git a/test/planet_test.cpp b/test/planet_test.cpp
new file mode 100644
index 00000000..8b3348c9
--- /dev/null
+++ b/test/planet_test.cpp
@@ -0,0 +1,412 @@
+// Copyright 2023, 2024 Dario Izzo (dario.izzo@gmail.com), Francesco Biscani
+// (bluescarni@gmail.com)
+//
+// This file is part of the kep3 library.
+//
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+#include
+#include
+
+#include
+
+#include
+#include
+#include