.drone.yml

@@ -1,56 +0,0 @@
-kind: pipeline
-type: kubernetes
-name: cicd-pipeline
-
-steps:
-  - name: Build docs
-    image: ubuntu
-    commands:
-        - apt-get update
-        - >-
-          apt-get
-          install
-          make
-          doxygen
-          graphviz
-          -y          
-        - cd "Eule/doxygen"
-        - make
-       
-  - name: Deploy docs to production
-    image: ubuntu
-    environment:
-      SSH_PRIV:
-        from_secret: ssh-priv
-      SSH_PUB:
-        from_secret: ssh-pub
-      KNOWN_HOSTS:
-        from_secret: known-hosts # this is just $(ssh-keyscan -p 2222 leonetienne.de)
-    commands:
-      - apt-get update
-      - >-
-        apt-get
-        install
-        openssh-client
-        rsync
-        -y        
-      - eval "$(ssh-agent -s)"
-      - mkdir -p ~/.ssh
-      - echo "$SSH_PRIV" > ~/.ssh/id_ed25519
-      - echo "$SSH_PUB" > ~/.ssh/id_ed25519.pub
-      - echo "$KNOWN_HOSTS" > ~/.ssh/known_hosts
-      - chmod 600 ~/.ssh/id_ed25519
-      - chmod 644 ~/.ssh/id_ed25519.pub
-      - chmod 644 ~/.ssh/known_hosts
-      - ssh-add
-      - cd "Eule/doxygen"
-      - >-
-        rsync
-        -avz
-        --recursive
-        --delete
-        --delete-excluded
-        -e
-        "ssh -o IdentitiesOnly=yes -p 2222"
-        ./build/
-        doxygen-eule@leonetienne.de:app        

.gitignore

@@ -1,2 +1,357 @@
-build/
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+##
+## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore
 
+#infilename-tag
+*_gitignore_*
+
+# User-specific files
+*.rsuser
+*.suo
+*.user
+*.userosscache
+*.sln.docstates
+
+# User-specific files (MonoDevelop/Xamarin Studio)
+*.userprefs
+
+# Mono auto generated files
+mono_crash.*
+
+# Visual Paradigm Shitfiles
+*tornado.vpp.bak*
+*tornado.*lck*
+
+# Build results
+[Dd]ebug/
+[Dd]ebugPublic/
+[Rr]elease/
+[Rr]eleases/
+x64/
+x86/
+[Aa][Rr][Mm]/
+[Aa][Rr][Mm]64/
+bld/
+[Bb]in/
+[Oo]bj/
+[Ll]og/
+[Ll]ogs/
+
+# Visual Studio 2015/2017 cache/options directory
+.vs/
+# Uncomment if you have tasks that create the project's static files in wwwroot
+#wwwroot/
+
+# Visual Studio 2017 auto generated files
+Generated\ Files/
+
+# MSTest test Results
+[Tt]est[Rr]esult*/
+[Bb]uild[Ll]og.*
+
+# NUnit
+*.VisualState.xml
+TestResult.xml
+nunit-*.xml
+
+# Build Results of an ATL Project
+[Dd]ebugPS/
+[Rr]eleasePS/
+dlldata.c
+
+# Benchmark Results
+BenchmarkDotNet.Artifacts/
+
+# .NET Core
+project.lock.json
+project.fragment.lock.json
+artifacts/
+
+# StyleCop
+StyleCopReport.xml
+
+# Files built by Visual Studio
+*_i.c
+*_p.c
+*_h.h
+*.ilk
+*.meta
+*.obj
+*.iobj
+*.pch
+*.pdb
+*.ipdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.tmp_proj
+*_wpftmp.csproj
+*.log
+*.vspscc
+*.vssscc
+.builds
+*.pidb
+*.svclog
+*.scc
+
+# Chutzpah Test files
+_Chutzpah*
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opendb
+*.opensdf
+*.sdf
+*.cachefile
+*.VC.db
+*.VC.VC.opendb
+
+# Visual Studio profiler
+*.psess
+*.vsp
+*.vspx
+*.sap
+
+# Visual Studio Trace Files
+*.e2e
+
+# TFS 2012 Local Workspace
+$tf/
+
+# Guidance Automation Toolkit
+*.gpState
+
+# ReSharper is a .NET coding add-in
+_ReSharper*/
+*.[Rr]e[Ss]harper
+*.DotSettings.user
+
+# TeamCity is a build add-in
+_TeamCity*
+
+# DotCover is a Code Coverage Tool
+*.dotCover
+
+# AxoCover is a Code Coverage Tool
+.axoCover/*
+!.axoCover/settings.json
+
+# Visual Studio code coverage results
+*.coverage
+*.coveragexml
+
+# NCrunch
+_NCrunch_*
+.*crunch*.local.xml
+nCrunchTemp_*
+
+# MightyMoose
+*.mm.*
+AutoTest.Net/
+
+# Web workbench (sass)
+.sass-cache/
+
+# Installshield output folder
+[Ee]xpress/
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish/
+
+# Publish Web Output
+*.[Pp]ublish.xml
+*.azurePubxml
+# Note: Comment the next line if you want to checkin your web deploy settings,
+# but database connection strings (with potential passwords) will be unencrypted
+*.pubxml
+*.publishproj
+
+# Microsoft Azure Web App publish settings. Comment the next line if you want to
+# checkin your Azure Web App publish settings, but sensitive information contained
+# in these scripts will be unencrypted
+PublishScripts/
+
+# NuGet Packages
+*.nupkg
+# NuGet Symbol Packages
+*.snupkg
+# The packages folder can be ignored because of Package Restore
+**/[Pp]ackages/*
+# except build/, which is used as an MSBuild target.
+!**/[Pp]ackages/build/
+# Uncomment if necessary however generally it will be regenerated when needed
+#!**/[Pp]ackages/repositories.config
+# NuGet v3's project.json files produces more ignorable files
+*.nuget.props
+*.nuget.targets
+
+# Microsoft Azure Build Output
+csx/
+*.build.csdef
+
+# Microsoft Azure Emulator
+ecf/
+rcf/
+
+# Windows Store app package directories and files
+AppPackages/
+BundleArtifacts/
+Package.StoreAssociation.xml
+_pkginfo.txt
+*.appx
+*.appxbundle
+*.appxupload
+
+# Visual Studio cache files
+# files ending in .cache can be ignored
+*.[Cc]ache
+# but keep track of directories ending in .cache
+!?*.[Cc]ache/
+
+# Others
+ClientBin/
+~$*
+*~
+*.dbmdl
+*.dbproj.schemaview
+*.jfm
+*.pfx
+*.publishsettings
+orleans.codegen.cs
+
+# Including strong name files can present a security risk
+# (https://github.com/github/gitignore/pull/2483#issue-259490424)
+#*.snk
+
+# Since there are multiple workflows, uncomment next line to ignore bower_components
+# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
+#bower_components/
+
+# RIA/Silverlight projects
+Generated_Code/
+
+# Backup & report files from converting an old project file
+# to a newer Visual Studio version. Backup files are not needed,
+# because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+UpgradeLog*.htm
+ServiceFabricBackup/
+*.rptproj.bak
+
+# SQL Server files
+*.mdf
+*.ldf
+*.ndf
+
+# Business Intelligence projects
+*.rdl.data
+*.bim.layout
+*.bim_*.settings
+*.rptproj.rsuser
+*- [Bb]ackup.rdl
+*- [Bb]ackup ([0-9]).rdl
+*- [Bb]ackup ([0-9][0-9]).rdl
+
+# Microsoft Fakes
+FakesAssemblies/
+
+# GhostDoc plugin setting file
+*.GhostDoc.xml
+
+# Node.js Tools for Visual Studio
+.ntvs_analysis.dat
+node_modules/
+
+# Visual Studio 6 build log
+*.plg
+
+# Visual Studio 6 workspace options file
+*.opt
+
+# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
+*.vbw
+
+# Visual Studio LightSwitch build output
+**/*.HTMLClient/GeneratedArtifacts
+**/*.DesktopClient/GeneratedArtifacts
+**/*.DesktopClient/ModelManifest.xml
+**/*.Server/GeneratedArtifacts
+**/*.Server/ModelManifest.xml
+_Pvt_Extensions
+
+# Paket dependency manager
+.paket/paket.exe
+paket-files/
+
+# FAKE - F# Make
+.fake/
+
+# CodeRush personal settings
+.cr/personal
+
+# Python Tools for Visual Studio (PTVS)
+__pycache__/
+*.pyc
+
+# Cake - Uncomment if you are using it
+# tools/**
+# !tools/packages.config
+
+# Tabs Studio
+*.tss
+
+# Telerik's JustMock configuration file
+*.jmconfig
+
+# BizTalk build output
+*.btp.cs
+*.btm.cs
+*.odx.cs
+*.xsd.cs
+
+# OpenCover UI analysis results
+OpenCover/
+
+# Azure Stream Analytics local run output
+ASALocalRun/
+
+# MSBuild Binary and Structured Log
+*.binlog
+
+# NVidia Nsight GPU debugger configuration file
+*.nvuser
+
+# MFractors (Xamarin productivity tool) working folder
+.mfractor/
+
+# Local History for Visual Studio
+.localhistory/
+
+# BeatPulse healthcheck temp database
+healthchecksdb
+
+# Backup folder for Package Reference Convert tool in Visual Studio 2017
+MigrationBackup/
+
+# Ionide (cross platform F# VS Code tools) working folder
+.ionide/

Doxygen/doxyfig

@@ -829,7 +829,7 @@ WARN_LOGFILE           =
 # spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
 # Note: If this tag is empty the current directory is searched.
 
-INPUT                  = "../src/" "../include/" "index.md"
+INPUT                  = "../Eule/" "index.md"
 
 # This tag can be used to specify the character encoding of the source files
 # that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses

Doxygen/doxyrun.sh

@@ -0,0 +1,9 @@
+# Copy repository readme here to be used as a cover page
+tail ../readme.md -n +2 > index.md
+
+# Run doxygen
+doxygen doxyfig
+
+# Cleanup index.md
+rm -f index.md
+

Eule/CMakeLists.txt

@@ -1,24 +1,18 @@
 cmake_minimum_required(VERSION 3.16)
 project(Eule)
 
-## Library
 set(CMAKE_CXX_STANDARD 17)
 
 add_compile_definitions(_EULE_NO_INTRINSICS_)
 
-FILE(GLOB main_src src/*.cpp)
 add_library(Eule
-  ${main_src}
+        Collider.cpp
+        Math.cpp
+        Matrix4x4.cpp
+        Quaternion.cpp
+        Random.cpp
+        TrapazoidalPrismCollider.cpp
+        Vector2.cpp
+        Vector3.cpp
+        Vector4.cpp
 )
-
-target_include_directories(Eule PRIVATE include)
-
-## Tests
-FILE(GLOB test_src test/*.cpp)
-add_executable(Eule_tests
-  test/Catch2.h
-  ${test_src}
-)
-target_link_libraries(Eule_tests Eule)
-
-target_include_directories(Eule_tests PRIVATE include)

Eule/Collider.cpp

@@ -0,0 +1 @@
+#include "Collider.h"

Eule/Collider.h

@@ -1,7 +1,7 @@
 #pragma once
-#include "Eule/Vector3.h"
+#include "Vector3.h"
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	/** Abstract class of a collider domain.
 	* Specializations describe a shape in 3d space, and provide implementations of the methods below,

Eule/Constants.h

@@ -0,0 +1,15 @@
+#pragma once
+
+// Pretty sure the compiler will optimize these calculations out...
+
+//! Pi up to 50 decimal places
+static constexpr double PI = 3.14159265358979323846264338327950288419716939937510;
+
+//! Pi divided by two
+static constexpr double HALF_PI = 1.57079632679489661923132169163975144209858469968755;
+
+//! Factor to convert degrees to radians 
+static constexpr double Deg2Rad = 0.0174532925199432957692369076848861271344287188854172222222222222;
+
+//! Factor to convert radians to degrees
+static constexpr double Rad2Deg = 57.295779513082320876798154814105170332405472466564427711013084788;

Eule/Math.cpp

@@ -0,0 +1,29 @@
+#include "Math.h"
+#include "Constants.h"
+#include <array>
+
+using namespace Eule;
+
+int Math::Mod(const int numerator, const int denominator)
+{
+	if (denominator == 0)
+		throw std::logic_error("Division by zero");
+
+	// Quick optimizations:
+
+	// -> 0/n is always 0
+	if (numerator == 0)
+		return 0;
+
+	// -> operator% works for a > 0 && b > 0
+	if (denominator > 0 && numerator > 0)
+		return numerator % denominator;
+
+	// Else: generalized formula
+	return (denominator + (numerator % denominator)) % denominator;
+}
+
+double Math::Oscillate(const double a, const double b, const double counter, const double speed)
+{
+	return (sin(counter * speed * PI - HALF_PI) * 0.5 + 0.5) * (b - a) + a;
+}

Eule/Math.h

@@ -2,7 +2,7 @@
 #include <stdexcept>
 #include <math.h>
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	/** Math utility class containing basic functions.
 	*/

Eule/Matrix4x4.cpp

@@ -0,0 +1,659 @@
+#include "Matrix4x4.h"
+#include "Vector3.h"
+#include "Math.h"
+
+//#define _EULE_NO_INTRINSICS_
+#ifndef _EULE_NO_INTRINSICS_
+#include <immintrin.h>
+#endif
+
+using namespace Eule;
+
+Matrix4x4::Matrix4x4()
+{
+	// Create identity matrix
+	for (std::size_t i = 0; i < 4; i++)
+		for (std::size_t j = 0; j < 4; j++)
+			v[i][j] = double(i == j);
+
+	return;
+}
+
+Matrix4x4::Matrix4x4(const Matrix4x4& other)
+{
+	v = other.v;
+	return;
+}
+
+Matrix4x4::Matrix4x4(Matrix4x4&& other) noexcept
+{
+	v = std::move(other.v);
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator*(const Matrix4x4& other) const
+{
+	Matrix4x4 newMatrix;
+	newMatrix.p = 1;
+
+	#ifndef _EULE_NO_INTRINSICS_
+
+
+	/*     <=  Matrix3x3 multiplication =>     */
+
+	// Load matrix components
+	__m256d __va1 = _mm256_set_pd(v[0][0], v[0][0], v[0][0], v[1][0]);
+	__m256d __va2 = _mm256_set_pd(v[1][0], v[1][0], v[2][0], v[2][0]);
+
+	__m256d __oa1 = _mm256_set_pd(other[0][0], other[0][1], other[0][2], other[0][0]);
+	__m256d __oa2 = _mm256_set_pd(other[0][1], other[0][2], other[0][0], other[0][1]);
+
+	__m256d __vb1 = _mm256_set_pd(v[0][1], v[0][1], v[0][1], v[1][1]);
+	__m256d __vb2 = _mm256_set_pd(v[1][1], v[1][1], v[2][1], v[2][1]);
+
+	__m256d __ob1 = _mm256_set_pd(other[1][0], other[1][1], other[1][2], other[1][0]);
+	__m256d __ob2 = _mm256_set_pd(other[1][1], other[1][2], other[1][0], other[1][1]);
+
+	__m256d __vc1 = _mm256_set_pd(v[0][2], v[0][2], v[0][2], v[1][2]);
+	__m256d __vc2 = _mm256_set_pd(v[1][2], v[1][2], v[2][2], v[2][2]);
+
+	__m256d __oc1 = _mm256_set_pd(other[2][0], other[2][1], other[2][2], other[2][0]);
+	__m256d __oc2 = _mm256_set_pd(other[2][1], other[2][2], other[2][0], other[2][1]);
+
+	// Initialize sums
+	__m256d __sum1 = _mm256_set1_pd(0);
+	__m256d __sum2 = _mm256_set1_pd(0);
+
+	// Let's multiply-add them together
+	// First, the first block
+	__sum1 = _mm256_fmadd_pd(__va1, __oa1, __sum1);
+	__sum1 = _mm256_fmadd_pd(__vb1, __ob1, __sum1);
+	__sum1 = _mm256_fmadd_pd(__vc1, __oc1, __sum1);
+
+	// Then the second block
+	__sum2 = _mm256_fmadd_pd(__va2, __oa2, __sum2);
+	__sum2 = _mm256_fmadd_pd(__vb2, __ob2, __sum2);
+	__sum2 = _mm256_fmadd_pd(__vc2, __oc2, __sum2);
+
+	// Retrieve results
+	double sum1[4];
+	double sum2[4];
+	
+	_mm256_storeu_pd(sum1, __sum1);
+	_mm256_storeu_pd(sum2, __sum2);
+
+	// Apply results
+	// Block 1
+	newMatrix[0][0] = sum1[3];
+	newMatrix[0][1] = sum1[2];
+	newMatrix[0][2] = sum1[1];
+	newMatrix[1][0] = sum1[0];
+	
+	// Block 2
+	newMatrix[1][1] = sum2[3];
+	newMatrix[1][2] = sum2[2];
+	newMatrix[2][0] = sum2[1];
+	newMatrix[2][1] = sum2[0];
+
+	// Does not fit in the intrinsic calculation. Might just calculate 'by hand'.
+	newMatrix[2][2] = (v[2][0] * other[0][2]) + (v[2][1] * other[1][2]) + (v[2][2] * other[2][2]);
+
+
+	/*     <=  Translation component =>     */
+
+	// Load translation components into registers
+	__m256d __transSelf = _mm256_set_pd(0, l, h, d);
+	__m256d __transOther = _mm256_set_pd(0, other.l, other.h, other.d);
+
+	// Let's add them
+	__m256d __sum = _mm256_add_pd(__transSelf, __transOther);
+
+	// Retrieve results
+	double sum[4];
+	_mm256_storeu_pd(sum, __sum);
+
+	// Apply them
+	newMatrix.d = sum[0];
+	newMatrix.h = sum[1];
+	newMatrix.l = sum[2];
+
+	#else
+
+
+	// Rotation, Scaling
+	newMatrix[0][0] = (v[0][0] * other[0][0]) + (v[0][1] * other[1][0]) + (v[0][2] * other[2][0]);
+	newMatrix[0][1] = (v[0][0] * other[0][1]) + (v[0][1] * other[1][1]) + (v[0][2] * other[2][1]);
+	newMatrix[0][2] = (v[0][0] * other[0][2]) + (v[0][1] * other[1][2]) + (v[0][2] * other[2][2]);
+	
+	newMatrix[1][0] = (v[1][0] * other[0][0]) + (v[1][1] * other[1][0]) + (v[1][2] * other[2][0]);
+	newMatrix[1][1] = (v[1][0] * other[0][1]) + (v[1][1] * other[1][1]) + (v[1][2] * other[2][1]);
+	newMatrix[1][2] = (v[1][0] * other[0][2]) + (v[1][1] * other[1][2]) + (v[1][2] * other[2][2]);
+	
+	newMatrix[2][0] = (v[2][0] * other[0][0]) + (v[2][1] * other[1][0]) + (v[2][2] * other[2][0]);
+	newMatrix[2][1] = (v[2][0] * other[0][1]) + (v[2][1] * other[1][1]) + (v[2][2] * other[2][1]);
+	newMatrix[2][2] = (v[2][0] * other[0][2]) + (v[2][1] * other[1][2]) + (v[2][2] * other[2][2]);
+	
+
+	// Translation
+	newMatrix[0][3] = v[0][3] + other[0][3];
+	newMatrix[1][3] = v[1][3] + other[1][3];
+	newMatrix[2][3] = v[2][3] + other[2][3];
+
+	#endif
+
+	return newMatrix;
+}
+
+void Matrix4x4::operator*=(const Matrix4x4& other)
+{
+	*this = *this * other;
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator/(const Matrix4x4& other) const
+{
+	return *this * other.Inverse3x3();
+}
+
+void Matrix4x4::operator/=(const Matrix4x4& other)
+{
+	*this = *this * other.Inverse3x3();
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator*(const double scalar) const
+{
+	Matrix4x4 m;
+
+	#ifndef _EULE_NO_INTRINSICS_
+
+	// Load matrix rows
+	__m256d __row0 = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
+	__m256d __row1 = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
+	__m256d __row2 = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
+	__m256d __row3 = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
+
+	// Load scalar
+	__m256d __scalar = _mm256_set1_pd(scalar);
+
+	// Scale values
+	__m256d __sr0 = _mm256_mul_pd(__row0, __scalar);
+	__m256d __sr1 = _mm256_mul_pd(__row1, __scalar);
+	__m256d __sr2 = _mm256_mul_pd(__row2, __scalar);
+	__m256d __sr3 = _mm256_mul_pd(__row3, __scalar);
+
+	// Extract results
+	_mm256_storeu_pd(m.v[0].data(), __sr0);
+	_mm256_storeu_pd(m.v[1].data(), __sr1);
+	_mm256_storeu_pd(m.v[2].data(), __sr2);
+	_mm256_storeu_pd(m.v[3].data(), __sr3);
+
+	#else
+
+	for (std::size_t x = 0; x < 4; x++)
+	for (std::size_t y = 0; y < 4; y++)
+		m[x][y] = v[x][y] * scalar;
+
+	#endif
+
+	return m;
+}
+
+void Matrix4x4::operator*=(const double scalar)
+{
+	*this = *this * scalar;
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator/(const double denominator) const
+{
+	const double precomputeDivision = 1.0 / denominator;
+
+	return *this * precomputeDivision;
+}
+
+void Matrix4x4::operator/=(const double denominator)
+{
+	*this = *this / denominator;
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator+(const Matrix4x4& other) const
+{
+	Matrix4x4 m;
+
+	#ifndef _EULE_NO_INTRINSICS_
+
+	// Load matrix rows
+	__m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
+	__m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
+	__m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
+	__m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
+
+	__m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
+	__m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
+	__m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
+	__m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
+
+	// Add rows
+	__m256d __sr0 = _mm256_add_pd(__row0a, __row0b);
+	__m256d __sr1 = _mm256_add_pd(__row1a, __row1b);
+	__m256d __sr2 = _mm256_add_pd(__row2a, __row2b);
+	__m256d __sr3 = _mm256_add_pd(__row3a, __row3b);
+
+	// Extract results
+	_mm256_storeu_pd(m.v[0].data(), __sr0);
+	_mm256_storeu_pd(m.v[1].data(), __sr1);
+	_mm256_storeu_pd(m.v[2].data(), __sr2);
+	_mm256_storeu_pd(m.v[3].data(), __sr3);
+
+	#else
+
+	for (std::size_t x = 0; x < 4; x++)
+	for (std::size_t y = 0; y < 4; y++)
+		m[x][y] = v[x][y] + other[x][y];
+
+	#endif
+
+	return m;
+}
+
+void Matrix4x4::operator+=(const Matrix4x4& other)
+{
+	#ifndef _EULE_NO_INTRINSICS_
+	// Doing it again is a tad directer, and thus faster. We avoid an intermittent Matrix4x4 instance
+
+	// Load matrix rows
+	__m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
+	__m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
+	__m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
+	__m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
+
+	__m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
+	__m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
+	__m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
+	__m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
+
+	// Add rows
+	__m256d __sr0 = _mm256_add_pd(__row0a, __row0b);
+	__m256d __sr1 = _mm256_add_pd(__row1a, __row1b);
+	__m256d __sr2 = _mm256_add_pd(__row2a, __row2b);
+	__m256d __sr3 = _mm256_add_pd(__row3a, __row3b);
+
+	// Extract results
+	_mm256_storeu_pd(v[0].data(), __sr0);
+	_mm256_storeu_pd(v[1].data(), __sr1);
+	_mm256_storeu_pd(v[2].data(), __sr2);
+	_mm256_storeu_pd(v[3].data(), __sr3);
+
+	#else
+	
+	*this = *this + other;
+	
+	#endif
+
+	return;
+}
+
+Matrix4x4 Matrix4x4::operator-(const Matrix4x4& other) const
+{
+	Matrix4x4 m;
+
+	#ifndef _EULE_NO_INTRINSICS_
+
+	// Load matrix rows
+	__m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
+	__m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
+	__m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
+	__m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
+
+	__m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
+	__m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
+	__m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
+	__m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
+
+	// Subtract rows
+	__m256d __sr0 = _mm256_sub_pd(__row0a, __row0b);
+	__m256d __sr1 = _mm256_sub_pd(__row1a, __row1b);
+	__m256d __sr2 = _mm256_sub_pd(__row2a, __row2b);
+	__m256d __sr3 = _mm256_sub_pd(__row3a, __row3b);
+
+	// Extract results
+	_mm256_storeu_pd(m.v[0].data(), __sr0);
+	_mm256_storeu_pd(m.v[1].data(), __sr1);
+	_mm256_storeu_pd(m.v[2].data(), __sr2);
+	_mm256_storeu_pd(m.v[3].data(), __sr3);
+
+	#else
+
+	for (std::size_t x = 0; x < 4; x++)
+		for (std::size_t y = 0; y < 4; y++)
+			m[x][y] = v[x][y] - other[x][y];
+
+	#endif
+
+	return m;
+}
+
+void Matrix4x4::operator-=(const Matrix4x4& other)
+{
+	#ifndef _EULE_NO_INTRINSICS_
+	// Doing it again is a tad directer, and thus faster. We avoid an intermittent Matrix4x4 instance
+
+	// Load matrix rows
+	__m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
+	__m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
+	__m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
+	__m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
+
+	__m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
+	__m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
+	__m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
+	__m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
+
+	// Subtract rows
+	__m256d __sr0 = _mm256_sub_pd(__row0a, __row0b);
+	__m256d __sr1 = _mm256_sub_pd(__row1a, __row1b);
+	__m256d __sr2 = _mm256_sub_pd(__row2a, __row2b);
+	__m256d __sr3 = _mm256_sub_pd(__row3a, __row3b);
+
+	// Extract results
+	_mm256_storeu_pd(v[0].data(), __sr0);
+	_mm256_storeu_pd(v[1].data(), __sr1);
+	_mm256_storeu_pd(v[2].data(), __sr2);
+	_mm256_storeu_pd(v[3].data(), __sr3);
+
+	#else
+
+	* this = *this - other;
+
+	#endif
+
+	return;
+}
+
+std::array<double, 4>& Matrix4x4::operator[](std::size_t y)
+{
+	return v[y];
+}
+
+const std::array<double, 4>& Matrix4x4::operator[](std::size_t y) const
+{
+	return v[y];
+}
+
+void Matrix4x4::operator=(const Matrix4x4& other)
+{
+	v = other.v;
+	return;
+}
+
+void Matrix4x4::operator=(Matrix4x4&& other) noexcept
+{
+	v = std::move(other.v);
+	return;
+}
+
+bool Matrix4x4::operator==(const Matrix4x4& other)
+{
+	return v == other.v;
+}
+
+bool Matrix4x4::operator!=(const Matrix4x4& other)
+{
+	return !operator==(other);
+}
+
+bool Matrix4x4::operator==(const Matrix4x4& other) const
+{
+	return v == other.v;
+}
+
+bool Matrix4x4::operator!=(const Matrix4x4& other) const
+{
+	return !operator==(other);
+}
+
+const Vector3d Matrix4x4::GetTranslationComponent() const
+{
+	return Vector3d(d, h, l);
+}
+
+void Matrix4x4::SetTranslationComponent(const Vector3d& trans)
+{
+	d = trans.x;
+	h = trans.y;
+	l = trans.z;
+	return;
+}
+
+Matrix4x4 Matrix4x4::DropTranslationComponents() const
+{
+	Matrix4x4 m(*this);
+	m.d = 0;
+	m.h = 0;
+	m.l = 0;
+	return m;
+}
+
+Matrix4x4 Matrix4x4::Transpose3x3() const
+{
+	Matrix4x4 trans(*this); // Keep other cells
+
+	for (std::size_t i = 0; i < 3; i++)
+		for (std::size_t j = 0; j < 3; j++)
+			trans[j][i] = v[i][j];
+
+	return trans;
+}
+
+Matrix4x4 Matrix4x4::Transpose4x4() const
+{
+	Matrix4x4 trans;
+
+	for (std::size_t i = 0; i < 4; i++)
+		for (std::size_t j = 0; j < 4; j++)
+			trans[j][i] = v[i][j];
+
+	return trans;
+}
+
+Matrix4x4 Matrix4x4::Multiply4x4(const Matrix4x4& o) const
+{
+	Matrix4x4 m;
+
+	m[0][0] = (v[0][0]*o[0][0]) + (v[0][1]*o[1][0]) + (v[0][2]*o[2][0]) + (v[0][3]*o[3][0]);
+	m[0][1] = (v[0][0]*o[0][1]) + (v[0][1]*o[1][1]) + (v[0][2]*o[2][1]) + (v[0][3]*o[3][1]);
+	m[0][2] = (v[0][0]*o[0][2]) + (v[0][1]*o[1][2]) + (v[0][2]*o[2][2]) + (v[0][3]*o[3][2]);
+	m[0][3] = (v[0][0]*o[0][3]) + (v[0][1]*o[1][3]) + (v[0][2]*o[2][3]) + (v[0][3]*o[3][3]);
+
+	m[1][0] = (v[1][0]*o[0][0]) + (v[1][1]*o[1][0]) + (v[1][2]*o[2][0]) + (v[1][3]*o[3][0]);
+	m[1][1] = (v[1][0]*o[0][1]) + (v[1][1]*o[1][1]) + (v[1][2]*o[2][1]) + (v[1][3]*o[3][1]);
+	m[1][2] = (v[1][0]*o[0][2]) + (v[1][1]*o[1][2]) + (v[1][2]*o[2][2]) + (v[1][3]*o[3][2]);
+	m[1][3] = (v[1][0]*o[0][3]) + (v[1][1]*o[1][3]) + (v[1][2]*o[2][3]) + (v[1][3]*o[3][3]);
+
+	m[2][0] = (v[2][0]*o[0][0]) + (v[2][1]*o[1][0]) + (v[2][2]*o[2][0]) + (v[2][3]*o[3][0]);
+	m[2][1] = (v[2][0]*o[0][1]) + (v[2][1]*o[1][1]) + (v[2][2]*o[2][1]) + (v[2][3]*o[3][1]);
+	m[2][2] = (v[2][0]*o[0][2]) + (v[2][1]*o[1][2]) + (v[2][2]*o[2][2]) + (v[2][3]*o[3][2]);
+	m[2][3] = (v[2][0]*o[0][3]) + (v[2][1]*o[1][3]) + (v[2][2]*o[2][3]) + (v[2][3]*o[3][3]);
+
+	m[3][0] = (v[3][0]*o[0][0]) + (v[3][1]*o[1][0]) + (v[3][2]*o[2][0]) + (v[3][3]*o[3][0]);
+	m[3][1] = (v[3][0]*o[0][1]) + (v[3][1]*o[1][1]) + (v[3][2]*o[2][1]) + (v[3][3]*o[3][1]);
+	m[3][2] = (v[3][0]*o[0][2]) + (v[3][1]*o[1][2]) + (v[3][2]*o[2][2]) + (v[3][3]*o[3][2]);
+	m[3][3] = (v[3][0]*o[0][3]) + (v[3][1]*o[1][3]) + (v[3][2]*o[2][3]) + (v[3][3]*o[3][3]);
+
+	return m;
+}
+
+Matrix4x4 Matrix4x4::GetCofactors(std::size_t p, std::size_t q, std::size_t n) const
+{
+	if (n > 4)
+		throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
+
+	Matrix4x4 cofs;
+
+	std::size_t i = 0;
+	std::size_t j = 0;
+
+	for (std::size_t y = 0; y < n; y++)
+		for (std::size_t x = 0; x < n; x++)
+		{
+			if ((y != p) && (x != q))
+			{
+				cofs[i][j] = v[y][x];
+				j++;
+			}
+
+			if (j == n - 1)
+			{
+				j = 0;
+				i++;
+			}
+		}
+
+	return cofs;
+}
+
+/*
+* BEGIN_REF
+* https://www.geeksforgeeks.org/adjoint-inverse-matrix/
+*/
+double Matrix4x4::Determinant(std::size_t n) const
+{
+	if (n > 4)
+		throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
+
+	double d = 0;
+	double sign = 1;
+
+	if (n == 1)
+		return v[0][0];
+
+	for (std::size_t x = 0; x < n; x++)
+	{
+		Matrix4x4 cofs = GetCofactors(0, x, n);
+
+		d += sign * v[0][x] * cofs.Determinant(n - 1);
+		sign = -sign;
+	}
+
+	return d;
+}
+
+Matrix4x4 Matrix4x4::Adjoint(std::size_t n) const
+{
+	if (n > 4)
+		throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
+
+	Matrix4x4 adj;
+	double sign = 1;
+
+	for (std::size_t i = 0; i < n; i++)
+		for (std::size_t j = 0; j < n; j++)
+		{
+			Matrix4x4 cofs = GetCofactors(i, j, n);
+
+			// sign of adj[j][i] positive if sum of row
+			// and column indexes is even.
+			sign = ((i + j) % 2 == 0) ? 1 : -1;
+
+			// Interchanging rows and columns to get the
+			// transpose of the cofactor matrix
+			adj[j][i] = sign * (cofs.Determinant(n - 1));
+		}
+
+	return adj;
+}
+
+Matrix4x4 Matrix4x4::Inverse3x3() const
+{
+	Matrix4x4 inv;
+
+	double det = Determinant(3);
+	if (det == 0.0)
+		throw std::runtime_error("Matrix3x3 not inversible!");
+
+	Matrix4x4 adj = Adjoint(3);
+
+	for (std::size_t i = 0; i < 3; i++)
+		for (std::size_t j = 0; j < 3; j++)
+			inv[i][j] = adj[i][j] / det;
+
+	inv.SetTranslationComponent(-GetTranslationComponent());
+
+	return inv;
+}
+
+Matrix4x4 Matrix4x4::Inverse4x4() const
+{
+	Matrix4x4 inv;
+
+	double det = Determinant(4);
+	if (det == 0.0)
+		throw std::runtime_error("Matrix4x4 not inversible!");
+
+	Matrix4x4 adj = Adjoint(4);
+
+	for (std::size_t i = 0; i < 4; i++)
+		for (std::size_t j = 0; j < 4; j++)
+			inv[i][j] = adj[i][j] / det;
+
+	return inv;
+}
+
+/*
+* END REF
+*/
+
+bool Matrix4x4::IsInversible3x3() const
+{
+	return (Determinant(3) != 0);
+}
+
+bool Matrix4x4::IsInversible4x4() const
+{
+	return (Determinant(4) != 0);
+}
+
+bool Matrix4x4::Similar(const Matrix4x4& other, double epsilon) const
+{
+	for (std::size_t i = 0; i < 4; i++)
+		for (std::size_t j = 0; j < 4; j++)
+			if (!Math::Similar(v[i][j], other[i][j], epsilon))
+				return false;
+
+	return true;
+}
+
+namespace Eule
+{
+	std::ostream& operator<< (std::ostream& os, const Matrix4x4& m)
+	{
+		os << std::endl;
+
+		for (std::size_t y = 0; y < 4; y++)
+		{
+			for (std::size_t x = 0; x < 4; x++)
+				os << " | " << m[y][x];
+
+			os << " |" << std::endl;
+		}
+
+		return os;
+	}
+
+	std::wostream& operator<< (std::wostream& os, const Matrix4x4& m)
+	{
+		os << std::endl;
+
+		for (std::size_t y = 0; y < 4; y++)
+		{
+			for (std::size_t x = 0; x < 4; x++)
+				os << L" | " << m[y][x];
+
+			os << L" |" << std::endl;
+		}
+
+		return os;
+	}
+}

Eule/Matrix4x4.h

@@ -3,7 +3,7 @@
 #include <array>
 #include <ostream>
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	template <class T>
 	class Vector3;

Eule/Quaternion.cpp

@@ -1,5 +1,5 @@
-#include "Eule/Quaternion.h"
+#include "Quaternion.h"
-#include "Eule/Constants.h"
+#include "Constants.h"
 #include <algorithm>
 #include <functional>
 #include <cmath>
@@ -7,10 +7,10 @@
 //#define _EULE_NO_INTRINSICS_
 #ifndef _EULE_NO_INTRINSICS_
 #include <immintrin.h>
-#include "Eule/gcccompat.h"
+#include "gcccompat.h"
 #endif
 
-namespace Leonetienne::Eule {
+namespace Eule {
 
     Quaternion::Quaternion()
     {

Eule/Quaternion.h

@@ -1,10 +1,10 @@
 #pragma once
-#include "Eule/Vector3.h"
+#include "Vector3.h"
-#include "Eule/Vector4.h"
+#include "Vector4.h"
-#include "Eule/Matrix4x4.h"
+#include "Matrix4x4.h"
 #include <mutex>
 
-namespace Leonetienne::Eule
+namespace Eule
 {
     /** 3D rotation representation
     */

Eule/Random.cpp

@@ -0,0 +1,76 @@
+#include "Random.h"
+#include <array>
+#include <algorithm>
+
+using namespace Eule;
+
+// Checks if the random number generator is initialized. Does nothing if it is, initializes if it isn't.
+#define MAKE_SURE_RNG_IS_INITIALIZED if (!isRngInitialized) InitRng();
+
+void Random::InitRng()
+{
+	// Create truly random source (from hardware events)
+	std::random_device randomSource;
+
+	// Generate enough truly random values to populate the entire state of the mersenne twister
+	std::array<int, std::mt19937::state_size> seedValues;
+	std::generate_n(seedValues.data(), seedValues.size(), std::ref(randomSource));
+	std::seed_seq seedSequence(seedValues.begin(), seedValues.end());
+
+	// Seed the mersenne twister with these values
+	rng = std::mt19937(seedSequence);
+
+	isRngInitialized = true;
+
+	return;
+}
+
+// Will return a random double between 0 and 1
+double Random::RandomFloat()
+{
+	MAKE_SURE_RNG_IS_INITIALIZED;
+
+	return (rng() % 694206942069ll) / 694206942069.0;
+}
+
+// Will return a random unsigned integer.
+unsigned int Random::RandomUint()
+{
+	MAKE_SURE_RNG_IS_INITIALIZED;
+
+	return rng();
+}
+
+// Will return a random integer
+unsigned int Random::RandomInt()
+{
+	MAKE_SURE_RNG_IS_INITIALIZED;
+
+	// Since this is supposed to return a random value anyways,
+	// we can let the random uint overflow without any problems.
+	return (int)rng();
+}
+
+// Will return a random double within a range  
+// These bounds are INCLUSIVE!
+double Random::RandomRange(double min, double max)
+{
+	return (RandomFloat() * (max - min)) + min;
+}
+
+// Will return a random integer within a range. This is faster than '(int)RandomRange(x,y)'
+// These bounds are INCLUSIVE!
+int Random::RandomIntRange(int min, int max)
+{
+	MAKE_SURE_RNG_IS_INITIALIZED;
+
+	return (rng() % (max + 1 - min)) + min;
+}
+
+bool Random::RandomChance(const double chance)
+{
+	return RandomFloat() <= chance;
+}
+
+std::mt19937 Random::rng;
+bool Random::isRngInitialized = false;

Eule/Random.h

@@ -1,7 +1,7 @@
 #pragma once
 #include <random>
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	/** Extensive random number generator
 	*/

Eule/Rect.h

@@ -1,7 +1,7 @@
 #pragma once
-#include "Eule/Vector2.h"
+#include "../Eule/Vector2.h"
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	/** Trivial data structure representing a rectangle
 	*/

Eule/TrapazoidalPrismCollider.cpp

@@ -1,6 +1,6 @@
-#include "Eule/TrapazoidalPrismCollider.h"
+#include "TrapazoidalPrismCollider.h"
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 TrapazoidalPrismCollider::TrapazoidalPrismCollider()
 {

Eule/TrapazoidalPrismCollider.h

@@ -1,9 +1,9 @@
 #pragma once
-#include "Eule/Vector3.h"
+#include "Vector3.h"
-#include "Eule/Collider.h"
+#include "Collider.h"
 #include <array>
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	/** A collider describing a trapazoidal prism.
 	* A trapazoidal prism is basically a box, but each vertex can be manipulated individually, altering

Eule/Vector2.cpp

@@ -1,8 +1,8 @@
-#include "Eule/Vector2.h"
+#include "Vector2.h"
-#include "Eule/Vector3.h"
+#include "Vector3.h"
-#include "Eule/Vector4.h"
+#include "Vector4.h"
 
-#include "Eule/Math.h"
+#include "Math.h"
 #include <iostream>
 
 //#define _EULE_NO_INTRINSICS_
@@ -19,7 +19,7 @@
 	The T=int instantiation only exists to store a value-pair of two ints. Not so-much as a vector in terms of vector calculus.
 */
 
-namespace Leonetienne::Eule {
+namespace Eule {
 
     template<typename T>
     Vector2<T>::operator Vector3<T>() const
@@ -322,8 +322,8 @@ namespace Leonetienne::Eule {
     bool Vector2<T>::Similar(const Vector2<T>& other, double epsilon) const
     {
         return
-                (::Leonetienne::Eule::Math::Similar(x, other.x, epsilon)) &&
+                (::Eule::Math::Similar(x, other.x, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(y, other.y, epsilon))
+                (::Eule::Math::Similar(y, other.y, epsilon))
                 ;
     }
 

Eule/Vector2.h

@@ -2,7 +2,7 @@
 #include <cstdlib>
 #include <sstream>
 
-namespace Leonetienne::Eule {
+namespace Eule {
     template<typename T>
     class Vector3;
 

Eule/Vector3.cpp

@@ -1,8 +1,8 @@
-#include "Eule/Vector3.h"
+#include "Vector3.h"
-#include "Eule/Vector2.h"
+#include "Vector2.h"
-#include "Eule/Vector4.h"
+#include "Vector4.h"
 
-#include "Eule/Math.h"
+#include "Math.h"
 #include <iostream>
 
 //#define _EULE_NO_INTRINSICS_
@@ -19,7 +19,7 @@
 	The T=int instantiation only exists to store a value-pair of two ints. Not so-much as a vector in terms of vector calculus.
 */
 
-namespace Leonetienne::Eule {
+namespace Eule {
     template<typename T>
     Vector3<T>::operator Vector2<T>() const
     {
@@ -235,9 +235,9 @@ namespace Leonetienne::Eule {
     bool Vector3<T>::Similar(const Vector3<T>& other, double epsilon) const
     {
         return
-                (::Leonetienne::Eule::Math::Similar(x, other.x, epsilon)) &&
+                (::Eule::Math::Similar(x, other.x, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(y, other.y, epsilon)) &&
+                (::Eule::Math::Similar(y, other.y, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(z, other.z, epsilon))
+                (::Eule::Math::Similar(z, other.z, epsilon))
         ;
     }
 

Eule/Vector3.h

@@ -3,9 +3,9 @@
 #include <iomanip>
 #include <ostream>
 #include <sstream>
-#include "Eule/Matrix4x4.h"
+#include "Matrix4x4.h"
 
-namespace Leonetienne::Eule {
+namespace Eule {
     template<typename T>
     class Vector2;
 

Eule/Vector4.cpp

@@ -1,8 +1,8 @@
-#include "Eule/Vector4.h"
+#include "Vector4.h"
-#include "Eule/Vector2.h"
+#include "Vector2.h"
-#include "Eule/Vector3.h"
+#include "Vector3.h"
 
-#include "Eule/Math.h"
+#include "Math.h"
 #include <iostream>
 
 //#define _EULE_NO_INTRINSICS_
@@ -19,7 +19,7 @@
 	The T=int instantiation only exists to store a value-pair of two ints. Not so-much as a vector in terms of vector calculus.
 */
 
-namespace Leonetienne::Eule {
+namespace Eule {
 
     template<typename T>
     Vector4<T>::operator Vector2<T>() const
@@ -183,10 +183,10 @@ namespace Leonetienne::Eule {
     bool Vector4<T>::Similar(const Vector4<T>& other, double epsilon) const
     {
         return
-                (::Leonetienne::Eule::Math::Similar(x, other.x, epsilon)) &&
+                (::Eule::Math::Similar(x, other.x, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(y, other.y, epsilon)) &&
+                (::Eule::Math::Similar(y, other.y, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(z, other.z, epsilon)) &&
+                (::Eule::Math::Similar(z, other.z, epsilon)) &&
-                (::Leonetienne::Eule::Math::Similar(w, other.w, epsilon))
+                (::Eule::Math::Similar(w, other.w, epsilon))
                 ;
     }
 

Eule/Vector4.h

@@ -3,9 +3,9 @@
 #include <iomanip>
 #include <ostream>
 #include <sstream>
-#include "Eule/Matrix4x4.h"
+#include "Matrix4x4.h"
 
-namespace Leonetienne::Eule
+namespace Eule
 {
 	template <typename T> class Vector2;
 	template <typename T> class Vector3;

Eule/doxygen/Makefile

@@ -1,10 +0,0 @@
-all:
-	# Copy all but the header of the readme here
-	tail ../../readme.md -n +4 > index.md
-	#
-	# Run doxygen
-	doxygen doxyfig
-	#
-	# Cleanup index.md
-	rm index.md
-

Eule/include/Eule/Constants.h

@@ -1,17 +0,0 @@
-#pragma once
-
-// Pretty sure the compiler will optimize these calculations out...
-
-namespace Leonetienne::Eule {
-    //! Pi up to 50 decimal places
-    static constexpr double PI = 3.14159265358979323846264338327950288419716939937510;
-
-    //! Pi divided by two
-    static constexpr double HALF_PI = 1.57079632679489661923132169163975144209858469968755;
-
-    //! Factor to convert degrees to radians
-    static constexpr double Deg2Rad = 0.0174532925199432957692369076848861271344287188854172222222222222;
-
-    //! Factor to convert radians to degrees
-    static constexpr double Rad2Deg = 57.295779513082320876798154814105170332405472466564427711013084788;
-}

Eule/include/Eule/version.h

@@ -1,2 +0,0 @@
-#pragma once
-#define EULE_VERSION (0.11)

Eule/src/Collider.cpp

@@ -1 +0,0 @@
-#include "Eule/Collider.h"

Eule/src/Math.cpp

@@ -1,28 +0,0 @@
-#include "Eule/Math.h"
-#include "Eule/Constants.h"
-#include <array>
-
-namespace Leonetienne::Eule {
-
-    int Math::Mod(const int numerator, const int denominator) {
-        if (denominator == 0)
-            throw std::logic_error("Division by zero");
-
-        // Quick optimizations:
-
-        // -> 0/n is always 0
-        if (numerator == 0)
-            return 0;
-
-        // -> operator% works for a > 0 && b > 0
-        if (denominator > 0 && numerator > 0)
-            return numerator % denominator;
-
-        // Else: generalized formula
-        return (denominator + (numerator % denominator)) % denominator;
-    }
-
-    double Math::Oscillate(const double a, const double b, const double counter, const double speed) {
-        return (sin(counter * speed * PI - HALF_PI) * 0.5 + 0.5) * (b - a) + a;
-    }
-}

Eule/src/Matrix4x4.cpp

@@ -1,611 +0,0 @@
-#include "Eule/Matrix4x4.h"
-#include "Eule/Vector3.h"
-#include "Eule/Math.h"
-
-//#define _EULE_NO_INTRINSICS_
-#ifndef _EULE_NO_INTRINSICS_
-#include <immintrin.h>
-#endif
-
-namespace Leonetienne::Eule {
-
-    Matrix4x4::Matrix4x4() {
-        // Create identity matrix
-        for (std::size_t i = 0; i < 4; i++)
-            for (std::size_t j = 0; j < 4; j++)
-                v[i][j] = double(i == j);
-
-        return;
-    }
-
-    Matrix4x4::Matrix4x4(const Matrix4x4 &other) {
-        v = other.v;
-        return;
-    }
-
-    Matrix4x4::Matrix4x4(Matrix4x4 &&other) noexcept {
-        v = std::move(other.v);
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator*(const Matrix4x4 &other) const {
-        Matrix4x4 newMatrix;
-        newMatrix.p = 1;
-
-#ifndef _EULE_NO_INTRINSICS_
-
-
-        /*     <=  Matrix3x3 multiplication =>     */
-
-        // Load matrix components
-        __m256d __va1 = _mm256_set_pd(v[0][0], v[0][0], v[0][0], v[1][0]);
-        __m256d __va2 = _mm256_set_pd(v[1][0], v[1][0], v[2][0], v[2][0]);
-
-        __m256d __oa1 = _mm256_set_pd(other[0][0], other[0][1], other[0][2], other[0][0]);
-        __m256d __oa2 = _mm256_set_pd(other[0][1], other[0][2], other[0][0], other[0][1]);
-
-        __m256d __vb1 = _mm256_set_pd(v[0][1], v[0][1], v[0][1], v[1][1]);
-        __m256d __vb2 = _mm256_set_pd(v[1][1], v[1][1], v[2][1], v[2][1]);
-
-        __m256d __ob1 = _mm256_set_pd(other[1][0], other[1][1], other[1][2], other[1][0]);
-        __m256d __ob2 = _mm256_set_pd(other[1][1], other[1][2], other[1][0], other[1][1]);
-
-        __m256d __vc1 = _mm256_set_pd(v[0][2], v[0][2], v[0][2], v[1][2]);
-        __m256d __vc2 = _mm256_set_pd(v[1][2], v[1][2], v[2][2], v[2][2]);
-
-        __m256d __oc1 = _mm256_set_pd(other[2][0], other[2][1], other[2][2], other[2][0]);
-        __m256d __oc2 = _mm256_set_pd(other[2][1], other[2][2], other[2][0], other[2][1]);
-
-        // Initialize sums
-        __m256d __sum1 = _mm256_set1_pd(0);
-        __m256d __sum2 = _mm256_set1_pd(0);
-
-        // Let's multiply-add them together
-        // First, the first block
-        __sum1 = _mm256_fmadd_pd(__va1, __oa1, __sum1);
-        __sum1 = _mm256_fmadd_pd(__vb1, __ob1, __sum1);
-        __sum1 = _mm256_fmadd_pd(__vc1, __oc1, __sum1);
-
-        // Then the second block
-        __sum2 = _mm256_fmadd_pd(__va2, __oa2, __sum2);
-        __sum2 = _mm256_fmadd_pd(__vb2, __ob2, __sum2);
-        __sum2 = _mm256_fmadd_pd(__vc2, __oc2, __sum2);
-
-        // Retrieve results
-        double sum1[4];
-        double sum2[4];
-
-        _mm256_storeu_pd(sum1, __sum1);
-        _mm256_storeu_pd(sum2, __sum2);
-
-        // Apply results
-        // Block 1
-        newMatrix[0][0] = sum1[3];
-        newMatrix[0][1] = sum1[2];
-        newMatrix[0][2] = sum1[1];
-        newMatrix[1][0] = sum1[0];
-
-        // Block 2
-        newMatrix[1][1] = sum2[3];
-        newMatrix[1][2] = sum2[2];
-        newMatrix[2][0] = sum2[1];
-        newMatrix[2][1] = sum2[0];
-
-        // Does not fit in the intrinsic calculation. Might just calculate 'by hand'.
-        newMatrix[2][2] = (v[2][0] * other[0][2]) + (v[2][1] * other[1][2]) + (v[2][2] * other[2][2]);
-
-
-        /*     <=  Translation component =>     */
-
-        // Load translation components into registers
-        __m256d __transSelf = _mm256_set_pd(0, l, h, d);
-        __m256d __transOther = _mm256_set_pd(0, other.l, other.h, other.d);
-
-        // Let's add them
-        __m256d __sum = _mm256_add_pd(__transSelf, __transOther);
-
-        // Retrieve results
-        double sum[4];
-        _mm256_storeu_pd(sum, __sum);
-
-        // Apply them
-        newMatrix.d = sum[0];
-        newMatrix.h = sum[1];
-        newMatrix.l = sum[2];
-
-#else
-
-
-        // Rotation, Scaling
-        newMatrix[0][0] = (v[0][0] * other[0][0]) + (v[0][1] * other[1][0]) + (v[0][2] * other[2][0]);
-        newMatrix[0][1] = (v[0][0] * other[0][1]) + (v[0][1] * other[1][1]) + (v[0][2] * other[2][1]);
-        newMatrix[0][2] = (v[0][0] * other[0][2]) + (v[0][1] * other[1][2]) + (v[0][2] * other[2][2]);
-
-        newMatrix[1][0] = (v[1][0] * other[0][0]) + (v[1][1] * other[1][0]) + (v[1][2] * other[2][0]);
-        newMatrix[1][1] = (v[1][0] * other[0][1]) + (v[1][1] * other[1][1]) + (v[1][2] * other[2][1]);
-        newMatrix[1][2] = (v[1][0] * other[0][2]) + (v[1][1] * other[1][2]) + (v[1][2] * other[2][2]);
-
-        newMatrix[2][0] = (v[2][0] * other[0][0]) + (v[2][1] * other[1][0]) + (v[2][2] * other[2][0]);
-        newMatrix[2][1] = (v[2][0] * other[0][1]) + (v[2][1] * other[1][1]) + (v[2][2] * other[2][1]);
-        newMatrix[2][2] = (v[2][0] * other[0][2]) + (v[2][1] * other[1][2]) + (v[2][2] * other[2][2]);
-
-
-        // Translation
-        newMatrix[0][3] = v[0][3] + other[0][3];
-        newMatrix[1][3] = v[1][3] + other[1][3];
-        newMatrix[2][3] = v[2][3] + other[2][3];
-
-#endif
-
-        return newMatrix;
-    }
-
-    void Matrix4x4::operator*=(const Matrix4x4 &other) {
-        *this = *this * other;
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator/(const Matrix4x4 &other) const {
-        return *this * other.Inverse3x3();
-    }
-
-    void Matrix4x4::operator/=(const Matrix4x4 &other) {
-        *this = *this * other.Inverse3x3();
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator*(const double scalar) const {
-        Matrix4x4 m;
-
-#ifndef _EULE_NO_INTRINSICS_
-
-        // Load matrix rows
-        __m256d __row0 = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
-        __m256d __row1 = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
-        __m256d __row2 = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
-        __m256d __row3 = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
-
-        // Load scalar
-        __m256d __scalar = _mm256_set1_pd(scalar);
-
-        // Scale values
-        __m256d __sr0 = _mm256_mul_pd(__row0, __scalar);
-        __m256d __sr1 = _mm256_mul_pd(__row1, __scalar);
-        __m256d __sr2 = _mm256_mul_pd(__row2, __scalar);
-        __m256d __sr3 = _mm256_mul_pd(__row3, __scalar);
-
-        // Extract results
-        _mm256_storeu_pd(m.v[0].data(), __sr0);
-        _mm256_storeu_pd(m.v[1].data(), __sr1);
-        _mm256_storeu_pd(m.v[2].data(), __sr2);
-        _mm256_storeu_pd(m.v[3].data(), __sr3);
-
-#else
-
-        for (std::size_t x = 0; x < 4; x++)
-            for (std::size_t y = 0; y < 4; y++)
-                m[x][y] = v[x][y] * scalar;
-
-#endif
-
-        return m;
-    }
-
-    void Matrix4x4::operator*=(const double scalar) {
-        *this = *this * scalar;
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator/(const double denominator) const {
-        const double precomputeDivision = 1.0 / denominator;
-
-        return *this * precomputeDivision;
-    }
-
-    void Matrix4x4::operator/=(const double denominator) {
-        *this = *this / denominator;
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator+(const Matrix4x4 &other) const {
-        Matrix4x4 m;
-
-#ifndef _EULE_NO_INTRINSICS_
-
-        // Load matrix rows
-        __m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
-        __m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
-        __m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
-        __m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
-
-        __m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
-        __m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
-        __m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
-        __m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
-
-        // Add rows
-        __m256d __sr0 = _mm256_add_pd(__row0a, __row0b);
-        __m256d __sr1 = _mm256_add_pd(__row1a, __row1b);
-        __m256d __sr2 = _mm256_add_pd(__row2a, __row2b);
-        __m256d __sr3 = _mm256_add_pd(__row3a, __row3b);
-
-        // Extract results
-        _mm256_storeu_pd(m.v[0].data(), __sr0);
-        _mm256_storeu_pd(m.v[1].data(), __sr1);
-        _mm256_storeu_pd(m.v[2].data(), __sr2);
-        _mm256_storeu_pd(m.v[3].data(), __sr3);
-
-#else
-
-        for (std::size_t x = 0; x < 4; x++)
-            for (std::size_t y = 0; y < 4; y++)
-                m[x][y] = v[x][y] + other[x][y];
-
-#endif
-
-        return m;
-    }
-
-    void Matrix4x4::operator+=(const Matrix4x4 &other) {
-#ifndef _EULE_NO_INTRINSICS_
-        // Doing it again is a tad directer, and thus faster. We avoid an intermittent Matrix4x4 instance
-
-        // Load matrix rows
-        __m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
-        __m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
-        __m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
-        __m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
-
-        __m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
-        __m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
-        __m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
-        __m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
-
-        // Add rows
-        __m256d __sr0 = _mm256_add_pd(__row0a, __row0b);
-        __m256d __sr1 = _mm256_add_pd(__row1a, __row1b);
-        __m256d __sr2 = _mm256_add_pd(__row2a, __row2b);
-        __m256d __sr3 = _mm256_add_pd(__row3a, __row3b);
-
-        // Extract results
-        _mm256_storeu_pd(v[0].data(), __sr0);
-        _mm256_storeu_pd(v[1].data(), __sr1);
-        _mm256_storeu_pd(v[2].data(), __sr2);
-        _mm256_storeu_pd(v[3].data(), __sr3);
-
-#else
-
-        *this = *this + other;
-
-#endif
-
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::operator-(const Matrix4x4 &other) const {
-        Matrix4x4 m;
-
-#ifndef _EULE_NO_INTRINSICS_
-
-        // Load matrix rows
-        __m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
-        __m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
-        __m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
-        __m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
-
-        __m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
-        __m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
-        __m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
-        __m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
-
-        // Subtract rows
-        __m256d __sr0 = _mm256_sub_pd(__row0a, __row0b);
-        __m256d __sr1 = _mm256_sub_pd(__row1a, __row1b);
-        __m256d __sr2 = _mm256_sub_pd(__row2a, __row2b);
-        __m256d __sr3 = _mm256_sub_pd(__row3a, __row3b);
-
-        // Extract results
-        _mm256_storeu_pd(m.v[0].data(), __sr0);
-        _mm256_storeu_pd(m.v[1].data(), __sr1);
-        _mm256_storeu_pd(m.v[2].data(), __sr2);
-        _mm256_storeu_pd(m.v[3].data(), __sr3);
-
-#else
-
-        for (std::size_t x = 0; x < 4; x++)
-            for (std::size_t y = 0; y < 4; y++)
-                m[x][y] = v[x][y] - other[x][y];
-
-#endif
-
-        return m;
-    }
-
-    void Matrix4x4::operator-=(const Matrix4x4 &other) {
-#ifndef _EULE_NO_INTRINSICS_
-        // Doing it again is a tad directer, and thus faster. We avoid an intermittent Matrix4x4 instance
-
-        // Load matrix rows
-        __m256d __row0a = _mm256_set_pd(v[0][3], v[0][2], v[0][1], v[0][0]);
-        __m256d __row1a = _mm256_set_pd(v[1][3], v[1][2], v[1][1], v[1][0]);
-        __m256d __row2a = _mm256_set_pd(v[2][3], v[2][2], v[2][1], v[2][0]);
-        __m256d __row3a = _mm256_set_pd(v[3][3], v[3][2], v[3][1], v[3][0]);
-
-        __m256d __row0b = _mm256_set_pd(other[0][3], other[0][2], other[0][1], other[0][0]);
-        __m256d __row1b = _mm256_set_pd(other[1][3], other[1][2], other[1][1], other[1][0]);
-        __m256d __row2b = _mm256_set_pd(other[2][3], other[2][2], other[2][1], other[2][0]);
-        __m256d __row3b = _mm256_set_pd(other[3][3], other[3][2], other[3][1], other[3][0]);
-
-        // Subtract rows
-        __m256d __sr0 = _mm256_sub_pd(__row0a, __row0b);
-        __m256d __sr1 = _mm256_sub_pd(__row1a, __row1b);
-        __m256d __sr2 = _mm256_sub_pd(__row2a, __row2b);
-        __m256d __sr3 = _mm256_sub_pd(__row3a, __row3b);
-
-        // Extract results
-        _mm256_storeu_pd(v[0].data(), __sr0);
-        _mm256_storeu_pd(v[1].data(), __sr1);
-        _mm256_storeu_pd(v[2].data(), __sr2);
-        _mm256_storeu_pd(v[3].data(), __sr3);
-
-#else
-
-        *this = *this - other;
-
-#endif
-
-        return;
-    }
-
-    std::array<double, 4> &Matrix4x4::operator[](std::size_t y) {
-        return v[y];
-    }
-
-    const std::array<double, 4> &Matrix4x4::operator[](std::size_t y) const {
-        return v[y];
-    }
-
-    void Matrix4x4::operator=(const Matrix4x4 &other) {
-        v = other.v;
-        return;
-    }
-
-    void Matrix4x4::operator=(Matrix4x4 &&other) noexcept {
-        v = std::move(other.v);
-        return;
-    }
-
-    bool Matrix4x4::operator==(const Matrix4x4 &other) {
-        return v == other.v;
-    }
-
-    bool Matrix4x4::operator!=(const Matrix4x4 &other) {
-        return !operator==(other);
-    }
-
-    bool Matrix4x4::operator==(const Matrix4x4 &other) const {
-        return v == other.v;
-    }
-
-    bool Matrix4x4::operator!=(const Matrix4x4 &other) const {
-        return !operator==(other);
-    }
-
-    const Vector3d Matrix4x4::GetTranslationComponent() const {
-        return Vector3d(d, h, l);
-    }
-
-    void Matrix4x4::SetTranslationComponent(const Vector3d &trans) {
-        d = trans.x;
-        h = trans.y;
-        l = trans.z;
-        return;
-    }
-
-    Matrix4x4 Matrix4x4::DropTranslationComponents() const {
-        Matrix4x4 m(*this);
-        m.d = 0;
-        m.h = 0;
-        m.l = 0;
-        return m;
-    }
-
-    Matrix4x4 Matrix4x4::Transpose3x3() const {
-        Matrix4x4 trans(*this); // Keep other cells
-
-        for (std::size_t i = 0; i < 3; i++)
-            for (std::size_t j = 0; j < 3; j++)
-                trans[j][i] = v[i][j];
-
-        return trans;
-    }
-
-    Matrix4x4 Matrix4x4::Transpose4x4() const {
-        Matrix4x4 trans;
-
-        for (std::size_t i = 0; i < 4; i++)
-            for (std::size_t j = 0; j < 4; j++)
-                trans[j][i] = v[i][j];
-
-        return trans;
-    }
-
-    Matrix4x4 Matrix4x4::Multiply4x4(const Matrix4x4 &o) const {
-        Matrix4x4 m;
-
-        m[0][0] = (v[0][0] * o[0][0]) + (v[0][1] * o[1][0]) + (v[0][2] * o[2][0]) + (v[0][3] * o[3][0]);
-        m[0][1] = (v[0][0] * o[0][1]) + (v[0][1] * o[1][1]) + (v[0][2] * o[2][1]) + (v[0][3] * o[3][1]);
-        m[0][2] = (v[0][0] * o[0][2]) + (v[0][1] * o[1][2]) + (v[0][2] * o[2][2]) + (v[0][3] * o[3][2]);
-        m[0][3] = (v[0][0] * o[0][3]) + (v[0][1] * o[1][3]) + (v[0][2] * o[2][3]) + (v[0][3] * o[3][3]);
-
-        m[1][0] = (v[1][0] * o[0][0]) + (v[1][1] * o[1][0]) + (v[1][2] * o[2][0]) + (v[1][3] * o[3][0]);
-        m[1][1] = (v[1][0] * o[0][1]) + (v[1][1] * o[1][1]) + (v[1][2] * o[2][1]) + (v[1][3] * o[3][1]);
-        m[1][2] = (v[1][0] * o[0][2]) + (v[1][1] * o[1][2]) + (v[1][2] * o[2][2]) + (v[1][3] * o[3][2]);
-        m[1][3] = (v[1][0] * o[0][3]) + (v[1][1] * o[1][3]) + (v[1][2] * o[2][3]) + (v[1][3] * o[3][3]);
-
-        m[2][0] = (v[2][0] * o[0][0]) + (v[2][1] * o[1][0]) + (v[2][2] * o[2][0]) + (v[2][3] * o[3][0]);
-        m[2][1] = (v[2][0] * o[0][1]) + (v[2][1] * o[1][1]) + (v[2][2] * o[2][1]) + (v[2][3] * o[3][1]);
-        m[2][2] = (v[2][0] * o[0][2]) + (v[2][1] * o[1][2]) + (v[2][2] * o[2][2]) + (v[2][3] * o[3][2]);
-        m[2][3] = (v[2][0] * o[0][3]) + (v[2][1] * o[1][3]) + (v[2][2] * o[2][3]) + (v[2][3] * o[3][3]);
-
-        m[3][0] = (v[3][0] * o[0][0]) + (v[3][1] * o[1][0]) + (v[3][2] * o[2][0]) + (v[3][3] * o[3][0]);
-        m[3][1] = (v[3][0] * o[0][1]) + (v[3][1] * o[1][1]) + (v[3][2] * o[2][1]) + (v[3][3] * o[3][1]);
-        m[3][2] = (v[3][0] * o[0][2]) + (v[3][1] * o[1][2]) + (v[3][2] * o[2][2]) + (v[3][3] * o[3][2]);
-        m[3][3] = (v[3][0] * o[0][3]) + (v[3][1] * o[1][3]) + (v[3][2] * o[2][3]) + (v[3][3] * o[3][3]);
-
-        return m;
-    }
-
-    Matrix4x4 Matrix4x4::GetCofactors(std::size_t p, std::size_t q, std::size_t n) const {
-        if (n > 4)
-            throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
-
-        Matrix4x4 cofs;
-
-        std::size_t i = 0;
-        std::size_t j = 0;
-
-        for (std::size_t y = 0; y < n; y++)
-            for (std::size_t x = 0; x < n; x++) {
-                if ((y != p) && (x != q)) {
-                    cofs[i][j] = v[y][x];
-                    j++;
-                }
-
-                if (j == n - 1) {
-                    j = 0;
-                    i++;
-                }
-            }
-
-        return cofs;
-    }
-
-/*
-* BEGIN_REF
-* https://www.geeksforgeeks.org/adjoint-inverse-matrix/
-*/
-    double Matrix4x4::Determinant(std::size_t n) const {
-        if (n > 4)
-            throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
-
-        double d = 0;
-        double sign = 1;
-
-        if (n == 1)
-            return v[0][0];
-
-        for (std::size_t x = 0; x < n; x++) {
-            Matrix4x4 cofs = GetCofactors(0, x, n);
-
-            d += sign * v[0][x] * cofs.Determinant(n - 1);
-            sign = -sign;
-        }
-
-        return d;
-    }
-
-    Matrix4x4 Matrix4x4::Adjoint(std::size_t n) const {
-        if (n > 4)
-            throw std::runtime_error("Dimension out of range! 0 <= n <= 4");
-
-        Matrix4x4 adj;
-        double sign = 1;
-
-        for (std::size_t i = 0; i < n; i++)
-            for (std::size_t j = 0; j < n; j++) {
-                Matrix4x4 cofs = GetCofactors(i, j, n);
-
-                // sign of adj[j][i] positive if sum of row
-                // and column indexes is even.
-                sign = ((i + j) % 2 == 0) ? 1 : -1;
-
-                // Interchanging rows and columns to get the
-                // transpose of the cofactor matrix
-                adj[j][i] = sign * (cofs.Determinant(n - 1));
-            }
-
-        return adj;
-    }
-
-    Matrix4x4 Matrix4x4::Inverse3x3() const {
-        Matrix4x4 inv;
-
-        double det = Determinant(3);
-        if (det == 0.0)
-            throw std::runtime_error("Matrix3x3 not inversible!");
-
-        Matrix4x4 adj = Adjoint(3);
-
-        for (std::size_t i = 0; i < 3; i++)
-            for (std::size_t j = 0; j < 3; j++)
-                inv[i][j] = adj[i][j] / det;
-
-        inv.SetTranslationComponent(-GetTranslationComponent());
-
-        return inv;
-    }
-
-    Matrix4x4 Matrix4x4::Inverse4x4() const {
-        Matrix4x4 inv;
-
-        double det = Determinant(4);
-        if (det == 0.0)
-            throw std::runtime_error("Matrix4x4 not inversible!");
-
-        Matrix4x4 adj = Adjoint(4);
-
-        for (std::size_t i = 0; i < 4; i++)
-            for (std::size_t j = 0; j < 4; j++)
-                inv[i][j] = adj[i][j] / det;
-
-        return inv;
-    }
-
-/*
-* END REF
-*/
-
-    bool Matrix4x4::IsInversible3x3() const {
-        return (Determinant(3) != 0);
-    }
-
-    bool Matrix4x4::IsInversible4x4() const {
-        return (Determinant(4) != 0);
-    }
-
-    bool Matrix4x4::Similar(const Matrix4x4 &other, double epsilon) const {
-        for (std::size_t i = 0; i < 4; i++)
-            for (std::size_t j = 0; j < 4; j++)
-                if (!Math::Similar(v[i][j], other[i][j], epsilon))
-                    return false;
-
-        return true;
-    }
-
-    std::ostream &operator<<(std::ostream &os, const Matrix4x4 &m) {
-        os << std::endl;
-
-        for (std::size_t y = 0; y < 4; y++) {
-            for (std::size_t x = 0; x < 4; x++)
-                os << " | " << m[y][x];
-
-            os << " |" << std::endl;
-        }
-
-        return os;
-    }
-
-    std::wostream &operator<<(std::wostream &os, const Matrix4x4 &m) {
-        os << std::endl;
-
-        for (std::size_t y = 0; y < 4; y++) {
-            for (std::size_t x = 0; x < 4; x++)
-                os << L" | " << m[y][x];
-
-            os << L" |" << std::endl;
-        }
-
-        return os;
-    }
-}

Eule/src/Random.cpp

@@ -1,69 +0,0 @@
-#include "Eule/Random.h"
-#include <array>
-#include <algorithm>
-
-namespace Leonetienne::Eule {
-// Checks if the random number generator is initialized. Does nothing if it is, initializes if it isn't.
-#define MAKE_SURE_RNG_IS_INITIALIZED if (!isRngInitialized) InitRng();
-
-    void Random::InitRng() {
-        // Create truly random source (from hardware events)
-        std::random_device randomSource;
-
-        // Generate enough truly random values to populate the entire state of the mersenne twister
-        std::array<int, std::mt19937::state_size> seedValues;
-        std::generate_n(seedValues.data(), seedValues.size(), std::ref(randomSource));
-        std::seed_seq seedSequence(seedValues.begin(), seedValues.end());
-
-        // Seed the mersenne twister with these values
-        rng = std::mt19937(seedSequence);
-
-        isRngInitialized = true;
-
-        return;
-    }
-
-// Will return a random double between 0 and 1
-    double Random::RandomFloat() {
-        MAKE_SURE_RNG_IS_INITIALIZED;
-
-        return (rng() % 694206942069ll) / 694206942069.0;
-    }
-
-// Will return a random unsigned integer.
-    unsigned int Random::RandomUint() {
-        MAKE_SURE_RNG_IS_INITIALIZED;
-
-        return rng();
-    }
-
-// Will return a random integer
-    unsigned int Random::RandomInt() {
-        MAKE_SURE_RNG_IS_INITIALIZED;
-
-        // Since this is supposed to return a random value anyways,
-        // we can let the random uint overflow without any problems.
-        return (int) rng();
-    }
-
-// Will return a random double within a range  
-// These bounds are INCLUSIVE!
-    double Random::RandomRange(double min, double max) {
-        return (RandomFloat() * (max - min)) + min;
-    }
-
-// Will return a random integer within a range. This is faster than '(int)RandomRange(x,y)'
-// These bounds are INCLUSIVE!
-    int Random::RandomIntRange(int min, int max) {
-        MAKE_SURE_RNG_IS_INITIALIZED;
-
-        return (rng() % (max + 1 - min)) + min;
-    }
-
-    bool Random::RandomChance(const double chance) {
-        return RandomFloat() <= chance;
-    }
-
-    std::mt19937 Random::rng;
-    bool Random::isRngInitialized = false;
-}

Eule/test/TestingUtilities/HandyMacros.h

@@ -1,5 +0,0 @@
-#pragma once
-#define LARGE_RAND_DOUBLE (((long long int)(rng() % 6969000ll) - 3500000ll) / 1000.0)
-#define LARGE_RAND_POSITIVE_DOUBLE (((rng() % 35000)) / 100.0)
-#define LARGE_RAND_INT ((long long int)(rng() % 6969) - 3500ll)
-#define LARGE_RAND_POSITIVE_INT ((rng() % 3500))

Eule/version.h

@@ -0,0 +1,2 @@
+#pragma once
+#define EULE_VERSION (0.11)

INCLUDE/generate.sh

@@ -0,0 +1,8 @@
+# Build the include files
+echo "Building the include files..."
+./deggl -i ../Eule/*.cpp -o Eule
+
+# Verify that they compile cleanly
+# For simplicity, we'll test without intrisics enabled
+echo "Verifying that they compile"
+g++ Eule.cpp -c -S -std=c++17 -o - -Wall -Wextra -Wpedantic -mavx -D _EULE_NO_INTRINSICS_ > /dev/null

LICENSE

@@ -1,674 +1,26 @@
-                    GNU GENERAL PUBLIC LICENSE
+BSD 2-Clause License
-                       Version 3, 29 June 2007
 
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+Copyright (c) 2022, Leon Etienne
- Everyone is permitted to copy and distribute verbatim copies
+All rights reserved.
- of this license document, but changing it is not allowed.
 
-                            Preamble
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
 
-  The GNU General Public License is a free, copyleft license for
+1. Redistributions of source code must retain the above copyright notice, this
-software and other kinds of works.
+   list of conditions and the following disclaimer.
 
-  The licenses for most software and other practical works are designed
+2. Redistributions in binary form must reproduce the above copyright notice,
-to take away your freedom to share and change the works.  By contrast,
+   this list of conditions and the following disclaimer in the documentation
-the GNU General Public License is intended to guarantee your freedom to
+   and/or other materials provided with the distribution.
-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
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-price.  Our General Public Licenses are designed to make sure that you
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-have the freedom to distribute copies of free software (and charge for
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-them if you wish), that you receive source code or can get it if you
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-want it, that you can change the software or use pieces of it in new
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-free programs, and that you know you can do these things.
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-  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.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    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 <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.

Test/Math__Abs.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 *		-- value > 0

Test/Math__Clamp.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 *		-- min < v < max	-> v

Test/Math__Lerp.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 *		-- a < b, 0 < t < 1		-> a < result < b

Test/Math__Max.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 *		-- a < b

Test/Math__Min.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 *		-- min < v < max

Test/Math__Mod.cpp

@@ -2,7 +2,7 @@
 #include <Eule/Math.h>
 #include <stdexcept>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 /** Equivalence classes:
 * a -> numerator

Test/Math__Oscillate.cpp

@@ -1,10 +1,10 @@
-#include "TestingUtilities/Testutil.h"
+#include "../_TestingUtilities/Testutil.h"
 #include "Catch2.h"
 #include <Eule/Random.h>
 #include <Eule/Math.h>
 #include <Eule/Constants.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that an oscillation of speed 1 between -1 and 1 is just equal to sin(counter*pi-pi/2)
 TEST_CASE(__FILE__"/Oracle_Sin", "[Math][Oscillate]")

Test/Math__Similar.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Math.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that the similar function works with an exact comparison -> true
 TEST_CASE(__FILE__"/Exact_Comparison_True", "[Math][Similar]")

Test/Matrix4x4.cpp

@@ -1,10 +1,10 @@
 #include "Catch2.h"
 #include <Eule/Matrix4x4.h>
 #include <Eule/Vector3.h>
-#include "TestingUtilities/HandyMacros.h"
+#include "../_TestingUtilities/HandyMacros.h"
 #include <random>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());

Test/Quaternion.cpp

@@ -1,11 +1,11 @@
 #include "Catch2.h"
 #include <Eule/Quaternion.h>
 #include <Eule/Math.h>
-#include "TestingUtilities/HandyMacros.h"
+#include "../_TestingUtilities/HandyMacros.h"
 #include <random>
 #include <sstream>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());

Test/Random_RandomIntRange.cpp

@@ -1,10 +1,10 @@
 #include "Catch2.h"
-#include "TestingUtilities/Testutil.h"
+#include "../_TestingUtilities/Testutil.h"
 #include <Eule/Random.h>
 #include <array>
 #include <sstream>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that a random integer is never outside the specification, two positive values
 TEST_CASE(__FILE__"/Never_Outside_Specification__pos__pos", "[Random][RandomIntRange]")

Test/Random__RandomFloat.cpp

@@ -1,7 +1,7 @@
 #include "Catch2.h"
 #include <Eule/Random.h>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that all values are always 0 <= v <= 1
 TEST_CASE(__FILE__"/Always_Satisfies_0_lt_v_lt_1", "[Random][RandomFloat]")

Test/Random__RandomInteger.cpp

@@ -1,9 +1,9 @@
 #include "Catch2.h"
-#include "TestingUtilities/Testutil.h"
+#include "../_TestingUtilities/Testutil.h"
 #include <Eule/Random.h>
 #include <array>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that the produced unsigned-integer distribution shows a big standard deviation
 TEST_CASE(__FILE__"/Uint_Big_Standard_Deviation", "[Random][RandomInt]")

Test/Random__RandomRange.cpp

@@ -1,9 +1,9 @@
 #include "Catch2.h"
-#include "TestingUtilities/Testutil.h"
+#include "../_TestingUtilities/Testutil.h"
 #include <Eule/Random.h>
 #include <array>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 // Checks that a random double is never outside the specification, two positive values
 TEST_CASE(__FILE__"/Random_Doublerange_Never_Outside_Specification__pos__pos", "[Random][RandomRange]")

Test/TrapazoidalPrismCollider.cpp

@@ -4,7 +4,7 @@
 #include <random>
 #include <array>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 using TPC = TrapazoidalPrismCollider;
 
 namespace {

Test/Vector2.cpp

@@ -1,11 +1,11 @@
 #include "Catch2.h"
 #include <Eule/Vector2.h>
 #include <Eule/Math.h>
-#include "TestingUtilities/HandyMacros.h"
+#include "../_TestingUtilities/HandyMacros.h"
 #include <random>
 #include <sstream>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());
@@ -251,7 +251,7 @@ TEST_CASE(__FILE__"/CrossProduct_Opposite_Direction", "[Vector][Vector2]")
         Vector2d a = Vector2d( x,  y) * (LARGE_RAND_DOUBLE / 1000.0);
         Vector2d b = Vector2d(-x, -y) * (LARGE_RAND_DOUBLE / 1000.0);
 
-        INFO(a << " CROSS " << b << " = " << a.CrossProduct(b) << " in iteration #" << i << ". Shared x and y are: [" << x << ", " << y << "]");
+        INFO(a << " CROSS " << b << " = " << a.CrossProduct(b));
         REQUIRE(Math::Similar(a.CrossProduct(b), 0.0, 10));
     }
 
@@ -287,14 +287,15 @@ TEST_CASE(__FILE__"/CrossProduct_BToTheLeft", "[Vector][Vector2]")
     for (std::size_t i = 0; i < 1000; i++)
     {
         double x = LARGE_RAND_DOUBLE;
-        double y = LARGE_RAND_POSITIVE_DOUBLE; // The dot product also flips if both points are negative in height.. let's keep it positive.
+        double y = LARGE_RAND_DOUBLE;
         if (x == 0) x++;
         if (y == 0) y++;
 
-        Vector2d a = Vector2d(x, y);
+        // Vector length should not matter, so randomize it
-        Vector2d b = Vector2d(x - (rng() % 6969ll + 1.0), y);
+        Vector2d a = Vector2d(x, y) * (rng() % 6969 + 1.0);
+        Vector2d b = Vector2d(x - (rng() % 6969 + 1.0), y) * (rng() % 6969 + 1.0);
 
-        INFO(a << " CROSS " << b << " = " << a.CrossProduct(b) << " in iteration #" << i );
+        INFO(a << " CROSS " << b << " = " << a.CrossProduct(b));
         REQUIRE(a.CrossProduct(b) > 0);
     }
 
@@ -308,12 +309,13 @@ TEST_CASE(__FILE__"/CrossProduct_BToTheRight", "[Vector][Vector2]")
     for (std::size_t i = 0; i < 1000; i++)
     {
         double x = LARGE_RAND_DOUBLE;
-        double y = LARGE_RAND_POSITIVE_DOUBLE; // The dot product also flips if both points are negative in height.. let's keep it positive.
+        double y = LARGE_RAND_DOUBLE;
         if (x == 0) x++;
         if (y == 0) y++;
 
-        Vector2d a = Vector2d(x, y);
+        // Vector length should not matter, so randomize it
-        Vector2d b = Vector2d(x + (rng() % 6969ll + 1.0), y);
+        Vector2d a = Vector2d(x, y) * (rng() % 6969 + 1.0);
+        Vector2d b = Vector2d(x + (rng() % 6969 + 1.0), y) * (rng() % 6969 + 1.0);
 
         INFO(a << L" CROSS " << b << L" = " << a.CrossProduct(b))
         REQUIRE(a.CrossProduct(b) < 0);

Test/Vector3.cpp

@@ -1,10 +1,10 @@
 #include "Catch2.h"
 #include <Eule/Vector3.h>
 #include <Eule/Math.h>
-#include "TestingUtilities/HandyMacros.h"
+#include "../_TestingUtilities/HandyMacros.h"
 #include <random>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());

Test/Vector4.cpp

@@ -2,10 +2,10 @@
 #include <Eule/Vector4.h>
 #include <Eule/Matrix4x4.h>
 #include <Eule/Math.h>
-#include "TestingUtilities/HandyMacros.h"
+#include <_TestingUtilities/HandyMacros.h>
 #include <random>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());

Test/VectorConversion.cpp

@@ -2,11 +2,11 @@
 #include <Eule/Vector2.h>
 #include <Eule/Vector3.h>
 #include <Eule/Vector4.h>
-#include "TestingUtilities/HandyMacros.h"
+#include "../_TestingUtilities/HandyMacros.h"
 #include <random>
 #include <sstream>
 
-using namespace Leonetienne::Eule;
+using namespace Eule;
 
 namespace {
     static std::mt19937 rng = std::mt19937((std::random_device())());

_TestingUtilities/HandyMacros.h

@@ -0,0 +1,5 @@
+#pragma once
+#define LARGE_RAND_DOUBLE (((rng() % 6969000) - 3500000) / 1000.0)
+#define LARGE_RAND_POSITIVE_DOUBLE (((rng() % 3500000)) / 1000.0)
+#define LARGE_RAND_INT ((rng() % 6969) - 3500)
+#define LARGE_RAND_POSITIVE_INT ((rng() % 3500))

_TestingUtilities/MemoryLeakDetector.h

@@ -0,0 +1,44 @@
+#pragma once
+#include <crtdbg.h>
+
+// Don't even allow compilation in release mode unless handled correctly.
+// This class ONLY WORKS IN DEBUG MODE!!!
+#ifdef _DEBUG
+class MemoryLeakDetector
+{
+public:
+	// Defines the initial mem state to check against
+	void Init()
+	{
+		_CrtMemCheckpoint(&stateInit);
+		return;
+	};
+
+	// Returns whether or not the process uses more memory than at the point when Init() was called
+	bool DetectLeak()
+	{
+		_CrtMemCheckpoint(&stateEnd);
+		return Evaluate();
+	};
+
+	// Returns the absolute memory difference since calling Init(). WARNING: The ABSOLUTE difference! No negative values!
+	int Difference()
+	{
+		// I know that it's the exact same code as in DetectedLeak().
+		_CrtMemCheckpoint(&stateEnd);
+		return Evaluate();
+	}
+
+
+private:
+	int Evaluate()
+	{
+		return _CrtMemDifference(&stateBfr, &stateInit, &stateEnd);
+	}
+
+	_CrtMemState stateInit;
+	_CrtMemState stateEnd;
+	_CrtMemState stateBfr;
+
+};
+#endif

_TestingUtilities/_MemoryLeakDetector.cpp

@@ -0,0 +1,105 @@
+#include "CppUnitTest.h"
+#include "MemoryLeakDetector.h"
+
+using namespace Microsoft::VisualStudio::CppUnitTestFramework;
+
+namespace TestingUtilities
+{
+	TEST_CLASS(_MemoryLeakDetector)
+	{
+	public:
+		// =========== MEMORY LEAK TESTS ===========
+		// These tests depends on debug-mode for memory insights.
+		// Thus, they only works in debug mode.
+		#ifdef _DEBUG
+
+		// Tests to detect no memory leak, if the test does nothing at all
+		TEST_METHOD(No_Memleak_For_Nothing)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				// Do nothing here
+			}
+
+			Assert::IsFalse(mld.DetectLeak());
+			return;
+		}
+
+		// Tests to detect no memory leak when not even touching pointers
+		TEST_METHOD(No_Memleak_For_No_Pointer_Action)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				int i = 33;
+				int c = i * 9;
+			}
+
+			Assert::IsFalse(mld.DetectLeak());
+			return;
+		}
+
+		// Tests to detect no memory leak when correctly cleaning up pointers
+		TEST_METHOD(No_Memleak_For_Cleaned_Up_Pointers)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				int* ptr = new int[333];
+				delete[] ptr;
+			}
+
+			Assert::IsFalse(mld.DetectLeak());
+			return;
+		}
+
+
+		// Tests to detect a memory leak when not cleaning up pointers
+		TEST_METHOD(Memleak_For_No_Pointer_Cleanup)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				int* ptr = new int[333];
+			}
+
+			Assert::IsTrue(mld.DetectLeak());
+			return;
+		}
+
+		// Tests to detect no memory leak when correctly cleaning up pointers, using C-Methods
+		TEST_METHOD(No_Memleak_For_Cleaned_Up_Pointers_C_Like)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				int* ptr = (int*)malloc(sizeof(int) * 333);
+				free(ptr);
+			}
+
+			Assert::IsFalse(mld.DetectLeak());
+			return;
+		}
+
+		// Tests to detect a memory leak when not cleaning up pointers, using C-Methods
+		TEST_METHOD(Memleak_For_No_Pointer_Cleanup_C_Like)
+		{
+			MemoryLeakDetector mld;
+			mld.Init();
+
+			{
+				int* ptr = (int*)malloc(sizeof(int) * 333);
+			}
+
+			Assert::IsTrue(mld.DetectLeak());
+			return;
+		}
+		#endif
+	};
+}

readme.md

@@ -1,683 +1,32 @@
-[![Build Status](https://drone.leonetienne.de/api/badges/leonetienne/Eule/status.svg)](https://drone.leonetienne.de/leonetienne/Eule)
-
 # Eule
 Eule is a homemade math library, mainly targetted towards computer graphics.
 
 # LICENSE
 ```
-                    GNU GENERAL PUBLIC LICENSE
+BSD 2-Clause License
-                       Version 3, 29 June 2007
+
-
+Copyright (c) 2022, Leon Etienne
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+All rights reserved.
- Everyone is permitted to copy and distribute verbatim copies
+
- of this license document, but changing it is not allowed.
+Redistribution and use in source and binary forms, with or without
-
+modification, are permitted provided that the following conditions are met:
-                            Preamble
+
-
+1. Redistributions of source code must retain the above copyright notice, this
-  The GNU General Public License is a free, copyleft license for
+   list of conditions and the following disclaimer.
-software and other kinds of works.
+
-
+2. Redistributions in binary form must reproduce the above copyright notice,
-  The licenses for most software and other practical works are designed
+   this list of conditions and the following disclaimer in the documentation
-to take away your freedom to share and change the works.  By contrast,
+   and/or other materials provided with the distribution.
-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
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-software for all its users.  We, the Free Software Foundation, use the
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-GNU General Public License for most of our software; it applies also to
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-any other work released this way by its authors.  You can apply it to
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-your programs, too.
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-  When we speak of free software, we are referring to freedom, not
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-price.  Our General Public Licenses are designed to make sure that you
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-have the freedom to distribute copies of free software (and charge for
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-them if you wish), that you receive source code or can get it if you
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-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.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    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 <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
 ```