[
{
"path": ".gradle/5.1.1/gc.properties",
"content": ""
},
{
"path": ".gradle/buildOutputCleanup/cache.properties",
"content": "#Tue Mar 02 01:28:27 UTC 2021\ngradle.version=5.1.1\n"
},
{
"path": ".gradle/vcs-1/gc.properties",
"content": ""
},
{
"path": ".idea/.gitignore",
"content": "# Default ignored files\n/shelf/\n/workspace.xml\n"
},
{
"path": ".idea/codeStyles/Project.xml",
"content": "\n \n \n \n \n \n \n \n \n \n \n xmlns:android \n ^$ \n \n \n \n \n \n \n \n \n xmlns:.* \n ^$ \n \n \n BY_NAME \n \n \n \n \n \n \n .*:id \n http://schemas.android.com/apk/res/android \n \n \n \n \n \n \n \n \n .*:name \n http://schemas.android.com/apk/res/android \n \n \n \n \n \n \n \n \n name \n ^$ \n \n \n \n \n \n \n \n \n style \n ^$ \n \n \n \n \n \n \n \n \n .* \n ^$ \n \n \n BY_NAME \n \n \n \n \n \n \n .* \n http://schemas.android.com/apk/res/android \n \n \n ANDROID_ATTRIBUTE_ORDER \n \n \n \n \n \n \n .* \n .* \n \n \n BY_NAME \n \n \n \n \n \n \n "
},
{
"path": ".idea/compiler.xml",
"content": "\n\n \n \n "
},
{
"path": ".idea/encodings.xml",
"content": "\n\n \n \n "
},
{
"path": ".idea/gradle.xml",
"content": "\n\n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": ".idea/is-Engine.iml",
"content": "\n\n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": ".idea/jarRepositories.xml",
"content": "\n\n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": ".idea/misc.xml",
"content": "\n\n "
},
{
"path": ".idea/modules/app/is-Engine.app.iml",
"content": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n generateDebugSources \n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": ".idea/modules/is-Engine.iml",
"content": "\n\n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": ".idea/modules.xml",
"content": "\n\n \n \n \n \n "
},
{
"path": ".idea/runConfigurations.xml",
"content": "\n\n \n \n \n \n \n \n "
},
{
"path": ".idea/vcs.xml",
"content": "\n\n \n \n "
},
{
"path": "CMakeLists.txt",
"content": "cmake_minimum_required (VERSION 3.1) \n\nproject(isengine)\n\nset(ISENGINE_PC true) # This confirms that we are using is::Engine to develop on PC (Windows / Linux)\nset(ISENGINE_MAIN_DIR \"${CMAKE_CURRENT_SOURCE_DIR}/app/src/main\")\nset(ISENGINE_SRC_DIR \"${CMAKE_CURRENT_SOURCE_DIR}/app/src/main/cpp\")\nset(ISENGINE_CMAKE_DIR \"${CMAKE_CURRENT_SOURCE_DIR}/app/src/main/cmake\")\nset(CMAKE_CXX_STANDARD 17)\nset(CMAKE_RUNTIME_OUTPUT_DIRECTORY bin)\n\n# SFML on Windows OS\nif (WIN32)\n\tset (SFML_DIR \"C:/SFML/lib/cmake/SFML\")\n set(SFML_STATIC_LIBRARIES TRUE)\n\t\n\t# OpenAL lib\n\tfile(COPY \"C:/SFML/bin/openal32.dll\" DESTINATION ${CMAKE_RUNTIME_OUTPUT_DIRECTORY})\t\nendif()\n\n# Find SFML\nfind_package(SFML REQUIRED COMPONENTS system window graphics network audio)\n\ninclude(${ISENGINE_CMAKE_DIR}/isengine.cmake)\ninclude(${ISENGINE_CMAKE_DIR}/app_src.cmake)\n\n# game resources files (image, sound, music, ...)\nfile(COPY ${ISENGINE_MAIN_DIR}/assets DESTINATION ${CMAKE_RUNTIME_OUTPUT_DIRECTORY})\n\nadd_executable(isengine\n ${isengine}\n\t${app_src}\n\t${ISENGINE_CMAKE_DIR}/resource.rc # application icon\n)\n\ntarget_include_directories(isengine PRIVATE include)\ntarget_link_libraries(isengine sfml-system sfml-window sfml-graphics sfml-network sfml-audio)\n"
},
{
"path": "LICENSE.md",
"content": "# zlib license\n\nThis software is provided 'as-is', without any express or implied warranty. In\nno event will the authors be held liable for any damages arising from the use\nof this software.\n\nPermission is granted to anyone to use this software for any purpose, including\ncommercial applications, and to alter it and redistribute it freely, subject to\nthe following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not claim\n that you wrote the original software. If you use this software in a product,\n an acknowledgment in the product documentation would be appreciated but is\n not required.\n\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\n 3. This notice may not be removed or altered from any source distribution.\n"
},
{
"path": "README.md",
"content": "\n----------------------------\n\n# is::Engine (Infinity Solutions::Engine) 4.0.1\nOpen source C++ framework which uses the mechanisms of **SFML 2** and which also allows to develop with several libraries at the same time **(SDL 2, Emscripten)** in order to easily export your games / applications on the **Nintendo Switch, Web (HTML 5), Mobile** and **PC (Windows, Linux, macOS)**.\n\n## Contents\n- [Features](#features)\n- [What's new in this version](#whats-new-in-this-version)\n- [Extras](#extras)\n- [Game Engine User Guide and Youtube Tutorial](#game-engine-user-guide-and-youtube-tutorial)\n- [Example of a project created with the engine](#example-of-a-project-created-with-the-engine)\n- [Hello Scene Example](#hello-scene-example)\n- [Prerequisites](#prerequisites)\n- [How to use is::Engine with the different development tools](#how-to-use-isengine-with-the-different-development-tools)\n- [Description of the project structure](#description-of-the-project-structure)\n- [How to update an is::Engine project](#how-to-update-an-isengine-project)\n- [Special things to know about the engine](#special-things-to-know-about-the-engine)\n- [How to activate the use of Admob](#how-to-activate-the-use-of-admob)\n- [Contribute](#contribute)\n\n## \n\n[](https://www.sfml-dev.org) [](https://www.libsdl.org/)  [](https://github.com/erincatto/box2d) [](https://www.mapeditor.org) [](https://admob.google.com/) [](https://github.com/native-toolkit/tinyfiledialogs) [](https://visualstudio.microsoft.com/fr/vs/community/)\n\n## Features\n- Run SFML game / application on SDL 2 (Like an Emulator)\n- Language manager (English and French language support by default)\n- Scene System\n- Automatic management of a window\n- Multi support for development tools ([Nintendo-Switch](#-nintendo-switch),\n[Android Studio](#-android-studio), \n[Qt](#-qt), \n[CMake](#-cmake), \n[Emscripten](#-web-html-5---css-3), \n[Visual Studio Code](#-visual-studio-code), \n[Code::Block](#-codeblocks), \n[Visual Studio](#-visual-studio)\n- [is::LibConnect](#islibconnect)\n- [Web Push Notification](#-web-push-notification)\n- SDM (Step and Draw Manager)\n- GSM (Game Sound Manager)\n- GRM (Graphics Resources Manager)\n- CFF (CMake Files Fusion)\n- [TMX Lite](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-TMXLite)\n- [TMX Loader (Old version)](https://github.com/Is-Daouda/is-Engine-TMXLoader)\n- Entity system\n- Object Event System\n- [Button System](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-TinyFileDialog)\n- Background System\n- [Game Slider](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-GameSlider)\n- [Sprite Animation](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-GameSlider)\n- Basic collision engine\n- [2D physic engine (Box 2D)](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-Box2D)\n- Message Box System (Modifiable appearance via Sprites and Font)\n- Dialog Box System (as for RPG games)\n- [[Windows, Linux] Tiny File Dialogs to manage the dialog boxes of type: Message, File Save, Load File, Folder Selection](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-TinyFileDialog)\n- [Game Configuration System (sound, music, language, keyboard key, file path, ...)](./app/src/main/cpp/app_src/config/GameConfig.h)\n- Game Save System\n- [[Android] Virtual Game Pad with 6 keys (multi directional cross and A - B button)](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-VirtualGamePad)\n- [[Android] Virtual Game Pad Configuration (Adjust Position, transparency, ...)](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-VirtualGamePad)\n- [[Android] Show Ad Banner](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-Admob)\n- [[Android] Show Reward Video](https://github.com/Is-Daouda/is-Engine-Example-Pack/tree/main/is-Engine-Admob)\n\n## What's new in this version\n- [Using Visual Studio and SDL 2 to develop with SFML.](#-visual-studio-sdl-2)\n- Bug Fixes\n\n### 4.0.1\n- Nintendo Switch Support\n- The **[Demo](https://github.com/Is-Daouda/is-Engine-Demo)** and **[tutorials](https://github.com/Is-Daouda/is-Engine-Tutorial)** are compatible with the Nintendo Switch.\n- Visual Studio 2022 can be used with all projects.\n- Vertex Arrays support (Simulation with SDL 2).(texBg, 0.f, 0.f, this, 0.5f, -0.5f, false, false));\n\n // add an object at position x = 0, y = 0 which will be updated and displayed in the scene\n SDMaddSceneObject(std::make_shared(0.f, 0.f, this));\n\n // add RPG style game dialog\n auto gameDialog = std::make_shared(texDialog, GRMgetFont(\"font_msg\"), this);\n gameDialog->setDepth(-2); // the display depth (make it appear on all objects. The object with the smallest value appears on the others)\n gameDialog->setDialog(is::GameDialog::DialogIndex::DIALOG_HELLO); // set the corresponding dialog (See GameDialog.h and GameLanguage.h for more details on creating a message for dialogue)\n SDMaddSceneObject(gameDialog);\n\n GSMaddSound(\"game_music\", is::GameConfig::MUSIC_DIR + \"game_music.wav\"); // add music\n GSMplaySound(\"game_music\"); // play music\n }\n};\n```\n\n## Prerequisites\n- [SFML Library (2.4 +)](https://www.sfml-dev.org/download.php)\n- [SDL 2 (2.0.12 +)]()\n- GCC Compiler (7.3 +)\n\n---\n\n## How to use is::Engine with the different development tools:\n##  Nintendo Switch\nThis project uses the template of **[carstene1ns](https://github.com/carstene1ns/switch-sdl2-demo)**.\n\n**1. Prerequisites**\n- DevkitPro with MSYS2\n\n##  Very important\n- Not affiliated with Nintendo.\n- All your source files (only .cpp or .c) must be located in the root of the **[cpp](./app/src/main/cpp/)** folder otherwise the compiler will not find them!\n- The Switch uses the same touch functions as Android.\n- The engine has been configured so that you can use the PC functions **keyIsPressed(is::GameConfig::KEY_UP)** or **keyIsPressed(is::GameConfig::KEY_A), etc.** on the Switch.\n- Some SFML functions like: **Render Texture** are not yet supported. These additions will be made soon!\n\n**2. Installation**\n##### Windows\n1. Download [devkitPro](https://github.com/devkitPro/installer/releases/download/v3.0.3/devkitProUpdater-3.0.3.exe) and install it in **C:/devkitPro/**.\n2. During installation:\n- Check \"devkitA64\" (for Switch)\n- Check \"MSYS2 Base System\"\n- Check \"portlibs\" if available\n3. Once installed, open the MSYS2 terminal (C:\\devkitPro\\msys2\\msys2.exe)\n4. Enter these commands in the console to download libraries:\n```bash\npacman -Syu\npacman -S switch-sdl2 switch-sdl2_image switch-sdl2_mixer switch-sdl2_net switch-sdl2_ttf\n```\n6. Move the **is-Engine** project to your **C:/ (C:/is-Engine)**.\n7. Run the file **[copy_assets.cmd](./app/src/main/copy_assets.cmd)** so that it transfers your resources which are in the **[assets](./app/src/main/assets) folder** to romfs (this folder will be created when executing the copy_assets.cmd file) necessary for the compilation.\n8. Enter these commands in the console:\n```bash\ncd c:/is-Engine/app/src/main/\nmake\n```\n\nIf all goes well you will have a **main.nro file** in the [main](./app/src/main/) folder that you can launch via Nintendo Switch emulators (Yuzu, Ryujinx, ...).\n\n\n\n**Enjoy!**\n\n---\n\n##  Android Studio\nThis project uses the template of **[Georgik](https://github.com/georgik/sdl2-android-example)** and **[Lauchmelder23](https://github.com/Lauchmelder23/SDLU)**.\n\n**1. Prerequisites**\n- Android Studio (4.0.1 +)\n- Android SDK and NDK (r20b)\n\n##  Very important\n- On Android SFML games run with SDL library. If you want to use SDL functions in your source code, use the **IS_ENGINE_SDL_2 macro**.\n- The audio format supported at the moment is **.WAV**\n- Some SFML functions like: **Render Texture** are not yet supported. These additions will be made soon!\n- **Your help to improve the engine will be welcome!**\n- [Please read this](#Contribute).\n\n**2. Installation**\n##### Windows\n1. Download [Android Studio 3.x](https://developer.android.com/studio) (recommended version 4.0.1).\n2. Download the [Android SDK](https://developer.android.com/studio) and install it in **C:/Android/SDK**.\n3. Download [Android NDK android-ndk-r20b-windows-x86_64](https://developer.android.com/ndk/downloads/older_releases.html) and create a folder on your disk as follows **C:/Android/NDK** then extract the contents of the zip in this folder.\n4. Set the environment variable **ANDROID_NDK** with the path **C:/Android/NDK**.\n6. Move the **is-Engine** project to your **C:/ (C:/is-Engine)**.\n7. Open the **is-Engine** folder with **Android Studio** and start the compilation.\n\nIf all goes well you will have a **Hello World Screen** on your **Android emulator**.\n\n\n\n**Enjoy!**\n\n**2. How to replace the package name (com.author.isengine) of the application**\n- Follow these steps carefully. A single error and the application will crash wonderfully when launching on emulator / mobile!\n1. Replace this line in the [gradle.app](./app/build.gradle#L32) file.\n2. Replace this line in the [AndroidManifest.xml](./app/src/main/AndroidManifest.xml#L3) file.\n3. Replace this line in the [SDLActivity.java](./app/src/main/java/com/author/isengine/SDLActivity.java#L1) file.\n4. Replace the abresence **[com/author/isengine](./app/src/main/java/com/author/isengine/)** in which is the file [SDLActivity.java](./app/src/main/java/com/author/isengine/SDLActivity.java#L1) that you have just modified at the top by yours (example **com/yourname/yourgamename**).\n5. Replace this part **..._ com_author_isengine _...** of line [20](./app/src/main/cpp/SDL_android_main.c#L20) and [23](./app/src/main/cpp/SDL_android_main.c#L23) in the file [SDL_android_main.c](./app/src/main/cpp/SDL_android_main.c#L20) by yours (example **com_yourname_yourgamename)**.\n6. Replace this part **..._ com_author_isengine _...** on the 23 lines of the file [SDL_android.c](./libs/SDL2/src/core/android/SDL_android.c#L156) by yours (example **com_yourname_yourgamename**).\n- **I strongly advise you to use the replace function of your text editor** (on Notepad++ we use Ctrl + F + Replace option).\n7. Replace this line in the [GameConfig.h](./app/src/main/cpp/app_src/config/GameConfig.h#L148) file.\n- Note that this part is only required if you want to use the game engine data save / load functions.\n\n**3. Adding Source Files**\n- So that Android Studio can detect your source files (.cpp) you must include them in the **[app_src.cmake](./app/src/main/cmake/app_src.cmake) or [isengine.cmake](./app/src/main/cmake/isengine.cmake)** file which is located in the **[is-Engine/app/src/main/cmake](./app/src/main/cmake/)** location.\n\n**4. Application location**\n- The application can be found in **is-Engine/app/build/outputs/apk**.\n\n---\n\n##  Web (HTML 5 - CSS 3)\nIf you want to make your SFML project compatible with the Web (Be able to run it in a web browser), please watch this **[video tutorial](https://youtu.be/x_YQLHoPMbc)**.\n\n \t\n \n \n \n\t\n\t\t\n \n \n \n \t\t\t\n \n \n\n "
},
{
"path": "app/src/main/CMakeLists.txt",
"content": "cmake_minimum_required(VERSION 3.15)\nproject(isengine)\n\nset(CMAKE_CXX_STANDARD 20)\nset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -Wall -Wextra\")\n\nif( ${CMAKE_SYSTEM_NAME} MATCHES \"Emscripten\")\n set(USE_FLAGS \"-s USE_SDL=2 -s USE_SDL_IMAGE=2 -s SDL2_IMAGE_FORMATS=\\\"['png']\\\" -s -s USE_SDL_TTF=2 -s USE_SDL_MIXER=2 -s USE_OGG=1 -s USE_VORBIS=1 -s USE_FREETYPE=1\")\n set(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} ${USE_FLAGS}\")\n set(CMAKE_C_FLAGS \"${CMAKE_C_FLAGS} ${USE_FLAGS}\")\n set(CMAKE_EXE_LINKER_FLAGS \"${CMAKE_EXE_LINKER_FLAGS} ${USE_FLAGS}\")\nendif()\n\ninclude_directories(${CMAKE_SOURCE_DIR}/include ${SDL2_INCLUDE_DIRS} ${SDL2_IMAGE_INCLUDE_DIRS} ${SDL2_TTF_INCLUDE_DIRS} ${SDL2_MIXER_INCLUDE_DIRS} ${FREETYPE_INCLUDE_DIRS})\n\nset(ISENGINE_HTML_5 true) # This confirms that we are using is::Engine to develop on the Web\nset(ISENGINE_SRC_DIR \"cpp\")\nset(ISENGINE_CMAKE_DIR \"cmake\")\n\nadd_compile_definitions(IS_ENGINE_HTML_5)\n\ninclude(${ISENGINE_CMAKE_DIR}/app_src.cmake)\ninclude(${ISENGINE_CMAKE_DIR}/isengine.cmake)\n\nadd_executable(isengine\n\t${app_src}\n\t${isengine}\n)\n\ntarget_link_libraries(isengine ${SDL2_LIBRARIES} ${SDL2IMAGE_LIBRARIES} ${SDL2MIXER_LIBRARIES} ${SDL2TTF_LIBRARIES} ${FREETYPE_LIBRARIES} -lidbfs.js)\n\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" -s ALLOW_MEMORY_GROWTH=1\")\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" -s DISABLE_EXCEPTION_CATCHING=2\")\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" -s WASM=1\")\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" -s TOTAL_MEMORY=134217728\")\n\n# Release flags\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" --emrun\")\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" -O3\")\nset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" --bind\")\n\n# Copy the web files\nconfigure_file(${CMAKE_CURRENT_SOURCE_DIR}/web/index.html ${CMAKE_CURRENT_BINARY_DIR}/index.html COPYONLY)\nconfigure_file(${CMAKE_CURRENT_SOURCE_DIR}/web/sw.js ${CMAKE_CURRENT_BINARY_DIR}/sw.js COPYONLY)\nfile(COPY ${CMAKE_CURRENT_SOURCE_DIR}/web/images DESTINATION ${CMAKE_CURRENT_BINARY_DIR})\nfile(COPY ${CMAKE_CURRENT_SOURCE_DIR}/web/scripts DESTINATION ${CMAKE_CURRENT_BINARY_DIR})\nfile(COPY ${CMAKE_CURRENT_SOURCE_DIR}/web/styles DESTINATION ${CMAKE_CURRENT_BINARY_DIR})\n\n# Allow some files to be fetched.\nfile(GLOB files \"./assets/*\" \"./assets/*/*\")\nforeach(file ${files})\n\tfile(RELATIVE_PATH relative_file ${CMAKE_SOURCE_DIR} ${file})\n\tset_property(TARGET isengine APPEND_STRING PROPERTY LINK_FLAGS \" --preload-file ${file}@/${relative_file}\")\nendforeach()"
},
{
"path": "app/src/main/Makefile",
"content": "#---------------------------------------------------------------------------------\n.SUFFIXES:\n#---------------------------------------------------------------------------------\n\nifeq ($(strip $(DEVKITPRO)),)\n$(error \"Please set DEVKITPRO in your environment. export DEVKITPRO=/devkitpro\")\nendif\n\nTOPDIR ?= $(CURDIR)\ninclude $(DEVKITPRO)/libnx/switch_rules\n\n#---------------------------------------------------------------------------------\n# TARGET is the name of the output\n# BUILD is the directory where object files & intermediate files will be placed\n# SOURCES is a list of directories containing source code\n# DATA is a list of directories containing data files\n# INCLUDES is a list of directories containing header files\n# ROMFS is the directory containing data to be added to RomFS, relative to the Makefile (Optional)\n#\n# NO_ICON: if set to anything, do not use icon.\n# NO_NACP: if set to anything, no .nacp file is generated.\n# APP_TITLE is the name of the app stored in the .nacp file (Optional)\n# APP_AUTHOR is the author of the app stored in the .nacp file (Optional)\n# APP_VERSION is the version of the app stored in the .nacp file (Optional)\n# APP_TITLEID is the titleID of the app stored in the .nacp file (Optional)\n# ICON is the filename of the icon (.jpg), relative to the project folder.\n# If not set, it attempts to use one of the following (in this order):\n# - .jpg\n# - icon.jpg\n# - /default_icon.jpg\n#\n# CONFIG_JSON is the filename of the NPDM config file (.json), relative to the project folder.\n# If not set, it attempts to use one of the following (in this order):\n# - .json\n# - config.json\n# If a JSON file is provided or autodetected, an ExeFS PFS0 (.nsp) is built instead\n# of a homebrew executable (.nro). This is intended to be used for sysmodules.\n# NACP building is skipped as well.\n#---------------------------------------------------------------------------------\nTARGET\t\t:=\t$(notdir $(CURDIR))\nBUILD\t\t:=\tbuild\nSOURCES\t\t:=\tcpp\nDATA\t\t:=\tdata\nINCLUDES\t:=\tcpp\nROMFS\t\t:=\tromfs\n\nAPP_TITLE := is::Engine\nAPP_AUTHOR := author\nAPP_VERSION := 1.0\nICON\t\t:= icon.jpg\nPC_LIBS := SDL2_image SDL2_mixer SDL2_ttf sdl2\n\n#---------------------------------------------------------------------------------\n# options for code generation\n#---------------------------------------------------------------------------------\nARCH\t:=\t-march=armv8-a+crc+crypto -mtune=cortex-a57 -mtp=soft -fPIE\n\nCFLAGS\t:=\t`$(PREFIX)pkg-config --cflags $(PC_LIBS)` \\\n\t\t\t-g -Wall -O2 -ffunction-sections \\\n\t\t\t$(ARCH) $(DEFINES)\n\nCFLAGS\t+=\t$(INCLUDE) -D__SWITCH__ -DIS_ENGINE_SWITCH\n\nCXXFLAGS\t:= $(CFLAGS) -fno-rtti -fno-exceptions -std=gnu++11 -std=gnu++17\n\nASFLAGS\t:=\t-g $(ARCH)\nLDFLAGS\t=\t-specs=$(DEVKITPRO)/libnx/switch.specs -g $(ARCH) -Wl,-Map,$(notdir $*.map)\n\nLIBS\t:=\t`$(PREFIX)pkg-config --libs $(PC_LIBS)` \\\n\t\t\t-lnx -lm -lstdc++\n\n#---------------------------------------------------------------------------------\n# list of directories containing libraries, this must be the top level containing\n# include and lib\n#---------------------------------------------------------------------------------\nLIBDIRS\t:= $(PORTLIBS) $(LIBNX)\n\n\n#---------------------------------------------------------------------------------\n# no real need to edit anything past this point unless you need to add additional\n# rules for different file extensions\n#---------------------------------------------------------------------------------\nifneq ($(BUILD),$(notdir $(CURDIR)))\n#---------------------------------------------------------------------------------\n\nexport OUTPUT\t:=\t$(CURDIR)/$(TARGET)\nexport TOPDIR\t:=\t$(CURDIR)\n\nexport VPATH\t:=\t$(foreach dir,$(SOURCES),$(CURDIR)/$(dir)) \\\n\t\t\t$(foreach dir,$(DATA),$(CURDIR)/$(dir))\n\nexport DEPSDIR\t:=\t$(CURDIR)/$(BUILD)\n\nCFILES\t\t:=\t$(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.c)))\nCPPFILES\t:=\t$(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.cpp)))\nSFILES\t\t:=\t$(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.s)))\nBINFILES\t:=\t$(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.*)))\n\n#---------------------------------------------------------------------------------\n# use CXX for linking C++ projects, CC for standard C\n#---------------------------------------------------------------------------------\nifeq ($(strip $(CPPFILES)),)\n#---------------------------------------------------------------------------------\n\texport LD\t:=\t$(CC)\n#---------------------------------------------------------------------------------\nelse\n#---------------------------------------------------------------------------------\n\texport LD\t:=\t$(CXX)\n#---------------------------------------------------------------------------------\nendif\n#---------------------------------------------------------------------------------\n\nexport OFILES_BIN\t:=\t$(addsuffix .o,$(BINFILES))\nexport OFILES_SRC\t:=\t$(CPPFILES:.cpp=.o) $(CFILES:.c=.o) $(SFILES:.s=.o)\nexport OFILES \t:=\t$(OFILES_BIN) $(OFILES_SRC)\nexport HFILES_BIN\t:=\t$(addsuffix .h,$(subst .,_,$(BINFILES)))\n\nexport INCLUDE\t:=\t$(foreach dir,$(INCLUDES),-I$(CURDIR)/$(dir)) \\\n\t\t\t$(foreach dir,$(LIBDIRS),-I$(dir)/include) \\\n\t\t\t-I$(CURDIR)/$(BUILD)\n\nexport LIBPATHS\t:=\t$(foreach dir,$(LIBDIRS),-L$(dir)/lib)\n\nifeq ($(strip $(CONFIG_JSON)),)\n\tjsons := $(wildcard *.json)\n\tifneq (,$(findstring $(TARGET).json,$(jsons)))\n\t\texport APP_JSON := $(TOPDIR)/$(TARGET).json\n\telse\n\t\tifneq (,$(findstring config.json,$(jsons)))\n\t\t\texport APP_JSON := $(TOPDIR)/config.json\n\t\tendif\n\tendif\nelse\n\texport APP_JSON := $(TOPDIR)/$(CONFIG_JSON)\nendif\n\nifeq ($(strip $(ICON)),)\n\ticons := $(wildcard *.jpg)\n\tifneq (,$(findstring $(TARGET).jpg,$(icons)))\n\t\texport APP_ICON := $(TOPDIR)/$(TARGET).jpg\n\telse\n\t\tifneq (,$(findstring icon.jpg,$(icons)))\n\t\t\texport APP_ICON := $(TOPDIR)/icon.jpg\n\t\tendif\n\tendif\nelse\n\texport APP_ICON := $(TOPDIR)/$(ICON)\nendif\n\nifeq ($(strip $(NO_ICON)),)\n\texport NROFLAGS += --icon=$(APP_ICON)\nendif\n\nifeq ($(strip $(NO_NACP)),)\n\texport NROFLAGS += --nacp=$(CURDIR)/$(TARGET).nacp\nendif\n\nifneq ($(APP_TITLEID),)\n\texport NACPFLAGS += --titleid=$(APP_TITLEID)\nendif\n\nifneq ($(ROMFS),)\n\texport NROFLAGS += --romfsdir=$(CURDIR)/$(ROMFS)\nendif\n\n.PHONY: $(BUILD) clean all\n\n#---------------------------------------------------------------------------------\nall: $(BUILD)\n\n$(BUILD):\n\t@[ -d $@ ] || mkdir -p $@\n\t@$(MAKE) --no-print-directory -C $(BUILD) -f $(CURDIR)/Makefile\n\n#---------------------------------------------------------------------------------\nclean:\n\t@echo clean ...\nifeq ($(strip $(APP_JSON)),)\n\t@rm -fr $(BUILD) $(TARGET).nro $(TARGET).nacp $(TARGET).elf\nelse\n\t@rm -fr $(BUILD) $(TARGET).nsp $(TARGET).nso $(TARGET).npdm $(TARGET).elf\nendif\n\n\n#---------------------------------------------------------------------------------\nelse\n.PHONY:\tall\n\nDEPENDS\t:=\t$(OFILES:.o=.d)\n\n#---------------------------------------------------------------------------------\n# main targets\n#---------------------------------------------------------------------------------\nifeq ($(strip $(APP_JSON)),)\n\nall\t:\t$(OUTPUT).nro\n\nifeq ($(strip $(NO_NACP)),)\n$(OUTPUT).nro\t:\t$(OUTPUT).elf $(OUTPUT).nacp\nelse\n$(OUTPUT).nro\t:\t$(OUTPUT).elf\nendif\n\nelse\n\nall\t:\t$(OUTPUT).nsp\n\n$(OUTPUT).nsp\t:\t$(OUTPUT).nso $(OUTPUT).npdm\n\n$(OUTPUT).nso\t:\t$(OUTPUT).elf\n\nendif\n\n$(OUTPUT).elf\t:\t$(OFILES)\n\n$(OFILES_SRC)\t: $(HFILES_BIN)\n\n#---------------------------------------------------------------------------------\n# you need a rule like this for each extension you use as binary data\n#---------------------------------------------------------------------------------\n%.bin.o\t%_bin.h :\t%.bin\n#---------------------------------------------------------------------------------\n\t@echo $(notdir $<)\n\t@$(bin2o)\n\n-include $(DEPENDS)\n\n#---------------------------------------------------------------------------------------\nendif\n#---------------------------------------------------------------------------------------\n"
},
{
"path": "app/src/main/Makefile-vscode",
"content": ".SUFFIXES:\nSUFFIXES =\n.SUFFIXES: .c .cpp .h .hpp .rc .res .inl .o .d .asm\n\n\n#==============================================================================\nMAKEFLAGS += --no-print-directory\n#==============================================================================\n# Build platform\nPLATFORM?=linux\n# Build description (Primarily uses Debug/Release)\nBUILD?=Release\n_BUILDL := $(shell echo $(BUILD) | tr A-Z a-z)\nifeq ($(BUILD),Tests)\n\t_BUILDL := release\nendif\n\n# The sub-folder containing the target source files\nSRC_TARGET?=\nifneq ($(SRC_TARGET),)\n\t_SRC_TARGET := /$(SRC_TARGET)\nendif\n\n# Maximum parallel jobs during build process\nMAX_PARALLEL_JOBS?=8\n\n# Dump assembly?\nDUMP_ASSEMBLY?=false\n\n# Clean output?\nCLEAN_OUTPUT?=true\n\n# If dll, build as a static library?\nBUILD_STATIC?=false\n\n# Platform specific environment variables\n-include env/.all.mk\n-include env/.$(_BUILDL).mk\n-include env/$(PLATFORM).all.mk\n-include env/$(PLATFORM).$(_BUILDL).mk\n\n# Target specific variables\nifneq ($(SRC_TARGET),)\n-include env/$(SRC_TARGET)/.all.mk\n-include env/$(SRC_TARGET)/.$(_BUILDL).mk\n-include env/$(SRC_TARGET)/$(PLATFORM).all.mk\n-include env/$(SRC_TARGET)/$(PLATFORM).$(_BUILDL).mk\nendif\n\n#==============================================================================\n# File/Folder dependencies for the production build recipe (makeproduction)\nPRODUCTION_DEPENDENCIES?=\n# Extensions to exclude from production builds\nPRODUCTION_EXCLUDE?=\n# Folder location (relative or absolute) to place the production build into\nPRODUCTION_FOLDER?=build\nPRODUCTION_FOLDER_RESOURCES := $(PRODUCTION_FOLDER)\n\n#==============================================================================\n# Library directories (separated by spaces)\nLIB_DIRS?=\nINCLUDE_DIRS?=\n# Link libraries (separated by spaces)\nLINK_LIBRARIES?=\n\n# Precompiled header filename (no extension)\n# This file will be excluded from Rebuild, but if the bin/(build) directory is removed, it will be as well.\nPRECOMPILED_HEADER?=\n\n# Build-specific preprocessor macros\nBUILD_MACROS?=\n# Build-specific compiler flags to be appended to the final build step (with prefix)\nBUILD_FLAGS?=\n\n# Build dependencies to copy into the bin/(build) folder - example: openal32.dll\nBUILD_DEPENDENCIES?=\n\n# NAME should always be passed as an argument from tasks.json as the root folder name, but uses a fallback of \"game.exe\"\n# This is used for the output filename (game.exe)\nNAME?=game.exe\n\n#==============================================================================\n# The source file directory\nSRC_DIR := cpp$(_SRC_TARGET)\nLIB_DIR := lib\n\n# Project .cpp or .rc files (relative to $(SRC_DIR) directory)\nSOURCE_FILES := $(patsubst $(SRC_DIR)/%,%,$(shell find $(SRC_DIR) -name '*.cpp' -o -name '*.c' -o -name '*.cc' -o -name '*.rc'))\n# Project subdirectories within $(SRC_DIR)/ that contain source files\nPROJECT_DIRS := $(patsubst $(SRC_DIR)/%,%,$(shell find $(SRC_DIR) -mindepth 1 -maxdepth 99 -type d))\n\n# Add prefixes to the above variables\n_INCLUDE_DIRS := $(patsubst %,-I%,$(SRC_DIR)/ $(LIB_DIR)/ $(INCLUDE_DIRS))\n\n_BUILD_MACROS := $(BUILD_MACROS:%=-D%)\n_LINK_LIBRARIES := $(LINK_LIBRARIES:%=-l%)\n\n#==============================================================================\n# Unit Testing\nTEST_DIR :=\nifeq ($(BUILD),Tests)\n\tTEST_DIR := test\n\tSOURCE_FILES := $(SOURCE_FILES:Main.cpp=)\n\tSOURCE_FILES := $(patsubst $(TEST_DIR)/%,.$(TEST_DIR)/%,$(shell find $(TEST_DIR) -name '*.cpp' -o -name '*.c' -o -name '*.cc' -o -name '*.rc')) $(SOURCE_FILES)\n\t_INCLUDE_DIRS := $(patsubst %,-I%,$(TEST_DIR)/) $(_INCLUDE_DIRS)\n\tPROJECT_DIRS := .$(TEST_DIR) $(PROJECT_DIRS)\n\tBUILD_FLAGS := $(BUILD_FLAGS:-mwindows=)\nendif\n\n#==============================================================================\n# Linux Specific\nPRODUCTION_LINUX_ICON?=icon\n\n# The full working directory\nifeq ($(PLATFORM),linux)\n\t_LINUX_GREP_CWD := $(shell echo $(CURDIR) | sed 's/\\//\\\\\\//g')\nendif\n\n#==============================================================================\n# MacOS Specific\nPRODUCTION_MACOS_ICON?=icon\nPRODUCTION_MACOS_BUNDLE_COMPANY?=developer\nPRODUCTION_MACOS_BUNDLE_DISPLAY_NAME?=App\nPRODUCTION_MACOS_BUNDLE_NAME?=App\nPRODUCTION_MACOS_MAKE_DMG?=true\nPRODUCTION_MACOS_BACKGROUND?=dmg-background\n\nifeq ($(PLATFORM),osx)\n\tPRODUCTION_MACOS_BUNDLE_COMPANY := '$(PRODUCTION_MACOS_BUNDLE_COMPANY)'\n\tPRODUCTION_MACOS_BUNDLE_DISPLAY_NAME := '$(PRODUCTION_MACOS_BUNDLE_DISPLAY_NAME)'\n\tPRODUCTION_MACOS_BUNDLE_NAME := '$(PRODUCTION_MACOS_BUNDLE_NAME)'\n\tPRODUCTION_FOLDER_MACOS := $(PRODUCTION_FOLDER)\n\tPRODUCTION_FOLDER := $(PRODUCTION_FOLDER)/$(PRODUCTION_MACOS_BUNDLE_NAME).app/Contents\n\tPRODUCTION_FOLDER_RESOURCES := $(PRODUCTION_FOLDER)/Resources\n\tPRODUCTION_DEPENDENCIES := $(PRODUCTION_DEPENDENCIES)\n\tPRODUCTION_MACOS_DYLIBS := $(PRODUCTION_MACOS_DYLIBS:%=%.dylib)\n\tMACOS_FRAMEWORKS?=CoreFoundation\n\tPRODUCTION_MACOS_FRAMEWORKS := $(PRODUCTION_MACOS_FRAMEWORKS:%=%.framework)\n\tPRODUCTION_MACOS_BACKGROUND := env/osx/$(PRODUCTION_MACOS_BACKGROUND)\n\tMACOS_FRAMEWORK_PATHS := $(MACOS_FRAMEWORK_PATHS:%=-F%)\n\tBUILD_FLAGS := $(BUILD_FLAGS) $(MACOS_FRAMEWORK_PATHS) $(MACOS_FRAMEWORKS:%=-framework %)\nendif\n\n#==============================================================================\n# Directories & Dependencies\nBLD_DIR := bin-vscode/$(BUILD)\nifeq ($(BUILD),Tests)\n\tBLD_DIR := bin-vscode/Release\nendif\nBLD_DIR := $(BLD_DIR:%/=%)\nTARGET := $(BLD_DIR)/$(NAME)\n_NAMENOEXT := $(NAME:.exe=)\n_NAMENOEXT := $(_NAMENOEXT:.dll=)\n\nifneq ($(SRC_TARGET),)\n\tLIB_DIRS := $(LIB_DIRS) $(BLD_DIR)\nendif\n_LIB_DIRS := $(LIB_DIR:%=-L%/) $(LIB_DIRS:%=-L%)\n\n_SOURCES_IF_RC := $(if $(filter windows,$(PLATFORM)),$(SOURCE_FILES:.rc=.res),$(SOURCE_FILES:%.rc=))\n\nOBJ_DIR := $(BLD_DIR)/obj$(_SRC_TARGET)\n_OBJS := $(_SOURCES_IF_RC:.c=.c.o)\n_OBJS := $(_OBJS:.cpp=.cpp.o)\n_OBJS := $(_OBJS:.cc=.cc.o)\nOBJS := $(_OBJS:%=$(OBJ_DIR)/%)\nOBJ_SUBDIRS := $(PROJECT_DIRS:%=$(OBJ_DIR)/%)\n\nDEP_DIR := $(BLD_DIR)/dep$(_SRC_TARGET)\n_DEPS := $(_SOURCES_IF_RC)\n_DEPS := $(_DEPS:%=%.d)\nDEPS := $(_DEPS:%=$(DEP_DIR)/%) $(DEP_DIR)/$(PRECOMPILED_HEADER).d\nDEP_SUBDIRS := $(PROJECT_DIRS:%=$(DEP_DIR)/%)\n\n_PCH_HFILE := $(shell find $(SRC_DIR) -name '$(PRECOMPILED_HEADER).hpp' -o -name '$(PRECOMPILED_HEADER).h' -o -name '$(PRECOMPILED_HEADER).hh')\n_PCH_HFILE := $(_PCH_HFILE:$(SRC_DIR)/%=%)\n_PCH_EXT := $(_PCH_HFILE:$(PRECOMPILED_HEADER).%=%)\n_PCH_COMPILER_EXT := $(if $(filter osx,$(PLATFORM)),p,g)ch\n\n_SYMBOLS := $(if $(filter osx,$(PLATFORM)),,$(if $(filter Release,$(BUILD)),-s,))\n\n\n_PCH := $(_PCH_HFILE:%=$(OBJ_DIR)/%)\nifneq ($(_PCH),)\n\t_PCH_GCH := $(_PCH).$(_PCH_COMPILER_EXT)\nendif\n\nifeq ($(DUMP_ASSEMBLY),true)\n\tASM_DIR := $(BLD_DIR)/asm$(_SRC_TARGET)\n\t_ASMS := $(_OBJS:%.res=)\n\t_ASMS := $(_ASMS:.o=.o.asm)\n\tASMS := $(_ASMS:%=$(ASM_DIR)/%)\n\tASM_SUBDIRS := $(PROJECT_DIRS:%=$(ASM_DIR)/%)\nendif\n\n_DIRECTORIES := $(sort bin-vscode $(BLD_DIR) $(OBJ_DIR) $(OBJ_SUBDIRS) $(DEP_DIR) $(DEP_SUBDIRS) $(ASM_DIR) $(ASM_SUBDIRS))\n\n_CLEAN := $(filter true,$(CLEAN_OUTPUT))\n\n# Quiet flag\n_Q := $(if $(_CLEAN),@)\n\n#==============================================================================\n# Compiler & flags\nCC?=g++\nRC?=windres.exe\nCFLAGS?=-O2 -Wall -fdiagnostics-color=always\n\nCFLAGS_DEPS = -MT $@ -MMD -MP -MF $(DEP_DIR)/$*.Td\nCFLAGS_DEPS_T = -MT $@ -MMD -MP -MF $(DEP_DIR)/.$(TEST_DIR)/$*.Td\nPCH_COMPILE = $(CC) $(CFLAGS_DEPS) $(_BUILD_MACROS) $(CFLAGS) $(_INCLUDE_DIRS) -o $@ -c $<\nifneq ($(_PCH),)\n\t_INCLUDE_PCH := -include $(_PCH)\nendif\n\nOBJ_COMPILE = $(CC) $(CFLAGS_DEPS) $(_BUILD_MACROS) $(_INCLUDE_DIRS) $(_INCLUDE_PCH) $(CFLAGS) -o $@ -c $<\nOBJ_COMPILE_T = $(CC) $(CFLAGS_DEPS_T) $(_BUILD_MACROS) $(_INCLUDE_DIRS) $(_INCLUDE_PCH) $(CFLAGS) -o $@ -c $<\n\nRC_COMPILE = -$(RC) -J rc -O coff -i $< -o $@\nifeq ($(PLATFORM),osx)\n\tASM_COMPILE = otool -tvV $< | c++filt > $@\nelse\n\tASM_COMPILE = objdump -d -C -Mintel $< > $@\nendif\nPOST_COMPILE = mv -f $(DEP_DIR)/$*.Td $(DEP_DIR)/$*.d && touch $@\nPOST_COMPILE_T = mv -f $(DEP_DIR)/.$(TEST_DIR)/$*.Td $(DEP_DIR)/.$(TEST_DIR)/$*.d && touch $@\n\n#==============================================================================\n# Build Scripts\nall:\n\t@$(MAKE) makepch\n\t@$(MAKE) -j$(MAX_PARALLEL_JOBS) makebuild\n.DELETE_ON_ERROR: all\n\nrebuild: clean all\n.PHONY: rebuild\n\nbuildprod: all makeproduction\n.PHONY: buildprod\n\n#==============================================================================\n# Functions\ncolor_reset := @tput setaf 4\n\ndefine compile_with\n\t$(color_reset)\n\t$(if $(_CLEAN),@echo ' $($(2):$(OBJ_DIR)/%=%)')\n\t$(_Q)$(3) && $(4)\nendef\n\nMKDIR := $(_Q)mkdir -p\n\nmakepch: $(_PCH_GCH)\n\t@echo > /dev/null\n.PHONY: makepch\n\nmakebuild: $(TARGET)\n\t$(color_reset)\nifeq ($(SRC_TARGET),)\n\t@echo ' Target is up to date.'\nelse\n\t@echo ' $(NAME): Target is up to date.'\nendif\n.PHONY: makebuild\n\n#==============================================================================\n# Build Recipes\n$(OBJ_DIR)/%.o: $(SRC_DIR)/%\n$(OBJ_DIR)/%.o: $(SRC_DIR)/% $(_PCH_GCH) $(DEP_DIR)/%.d | $(_DIRECTORIES)\n\t$(call compile_with,@,<,$(OBJ_COMPILE),$(POST_COMPILE))\n\n$(OBJ_DIR)/.$(TEST_DIR)/%.o: $(TEST_DIR)/%\n$(OBJ_DIR)/.$(TEST_DIR)/%.o: $(TEST_DIR)/% $(_PCH_GCH) $(DEP_DIR)/.$(TEST_DIR)/%.d | $(_DIRECTORIES)\n\t$(call compile_with,@,<,$(OBJ_COMPILE_T),$(POST_COMPILE_T))\n\n$(OBJ_DIR)/%.$(_PCH_EXT).$(_PCH_COMPILER_EXT) : $(SRC_DIR)/%.$(_PCH_EXT)\n$(OBJ_DIR)/%.$(_PCH_EXT).$(_PCH_COMPILER_EXT) : $(SRC_DIR)/%.$(_PCH_EXT) $(DEP_DIR)/%.d | $(_DIRECTORIES)\n\t$(call compile_with,@,<,$(PCH_COMPILE),$(POST_COMPILE))\n\n$(OBJ_DIR)/%.res: $(SRC_DIR)/%.rc\n$(OBJ_DIR)/%.res: $(SRC_DIR)/%.rc $(DEP_DIR)/%.d | $(_DIRECTORIES)\n\t$(color_reset)\n\t$(if $(_CLEAN),@echo \" $(<:$(OBJ_DIR)/%=%)\")\n\t$(_Q)$(RC_COMPILE)\n\n$(ASM_DIR)/%.o.asm: $(OBJ_DIR)/%.o\n\t@tput setaf 6\n\t$(if $(_CLEAN),@echo \" $@\")\n\t$(_Q)$(ASM_COMPILE)\n\n$(TARGET): $(_PCH_GCH) $(OBJS) $(ASMS) $(TEST_DIR)\n\t$(color_reset)\n\t$(if $(_CLEAN),@echo; printf '\\xE2\\x87\\x9B'; echo ' Linking: $(TARGET)')\nifeq ($(suffix $(TARGET)),.dll)\nifeq ($(BUILD_STATIC),true)\n\t-$(_Q)rm -rf $(BLD_DIR)/lib$(_NAMENOEXT).a\n\t$(_Q)ar.exe -r -s $(BLD_DIR)/lib$(_NAMENOEXT).a $(OBJS)\nelse\n\t-$(_Q)rm -rf $(BLD_DIR)/lib$(_NAMENOEXT).def $(BLD_DIR)/lib$(_NAMENOEXT).a\n\t$(_Q)$(CC) -shared -Wl,--output-def=\"$(BLD_DIR)/lib$(_NAMENOEXT).def\" -Wl,--out-implib=\"$(BLD_DIR)/lib$(_NAMENOEXT).a\" -Wl,--dll $(_LIB_DIRS) $(OBJS) -o $@ $(_SYMBOLS) $(_LINK_LIBRARIES) $(BUILD_FLAGS)\nendif\nelse\n\t$(_Q)$(CC) $(_LIB_DIRS) $(_SYMBOLS) -o $@ $(OBJS) $(_LINK_LIBRARIES) $(BUILD_FLAGS)\nendif\n\t@echo\nifneq ($(BUILD_DEPENDENCIES),)\n\t$(foreach dep,$(BUILD_DEPENDENCIES),$(call copy_to,$(dep),$(BLD_DIR)))\nendif\n\n$(_DIRECTORIES):\n\t$(if $(_CLEAN),,$(color_reset))\n\t$(MKDIR) $@\n\t$(if $(_CLEAN),,@echo)\n\nclean:\n\t$(color_reset)\n\t$(if $(_CLEAN),@echo ' Cleaning old build files & folders...'; echo)\n\t$(_Q)$(RM) $(TARGET) $(DEPS) $(OBJS)\n.PHONY: clean\n\n#==============================================================================\n# Production recipes\n\nrmprod:\n\t$(color_reset)\n\t@echo\n\t-$(_Q)rm -rf $(if $(filter osx,$(PLATFORM)),$(PRODUCTION_FOLDER_MACOS),$(PRODUCTION_FOLDER))\nifeq ($(PLATFORM),linux)\n\t-$(_Q)rm -rf ~/.local/share/applications/$(NAME).desktop\nendif\n.PHONY: rmprod\n\nmkdirprod:\n\t$(color_reset)\n\t$(MKDIR) $(PRODUCTION_FOLDER)\n.PHONY: mkdirprod\n\ndefine do_copy_to_clean\n\t@printf \"\\xE2\\x9E\\xA6\"\n\t@echo \" Copying \\\"$(1)\\\" to \\\"$(CURDIR)/$(2)\\\"\"\n\t$(shell cp -r $(1) $(2))\nendef\n\ndefine do_copy_to\n\t@echo \"cp -r $(1) $(2)\"\n\t$(shell cp -r $(1) $(2))\nendef\n\ndefine copy_to\n\t$(if $(wildcard $(2)/$(notdir $(1))),,$(if $(_CLEAN),$(call do_copy_to_clean,$(1),$(2)),$(call do_copy_to,$(1),$(2))))\nendef\n\nreleasetoprod: $(TARGET)\n\t$(color_reset)\nifeq ($(PLATFORM),osx)\n\t@echo ' Creating the MacOS application bundle...'\n\t@echo\n\t$(MKDIR) $(PRODUCTION_FOLDER)/Resources $(PRODUCTION_FOLDER)/Frameworks $(PRODUCTION_FOLDER)/MacOS\nifeq ($(shell brew ls --versions makeicns),)\n\tbrew install makeicns\n\t$(color_reset)\nendif\n\t$(_Q)makeicns -in env/osx/$(PRODUCTION_MACOS_ICON).png -out $(PRODUCTION_FOLDER)/Resources/$(PRODUCTION_MACOS_ICON).icns\n\t@echo\n\t$(_Q)plutil -convert binary1 env/osx/Info.plist.json -o $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)plutil -replace CFBundleExecutable -string $(NAME) $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)plutil -replace CFBundleName -string $(PRODUCTION_MACOS_BUNDLE_NAME) $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)plutil -replace CFBundleIconFile -string $(PRODUCTION_MACOS_ICON) $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)plutil -replace CFBundleDisplayName -string \"$(PRODUCTION_MACOS_BUNDLE_DISPLAY_NAME)\" $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)plutil -replace CFBundleIdentifier -string com.$(PRODUCTION_MACOS_BUNDLE_DEVELOPER).$(PRODUCTION_MACOS_BUNDLE_NAME) $(PRODUCTION_FOLDER)/Info.plist\n\t$(_Q)cp $(TARGET) $(PRODUCTION_FOLDER)/MacOS\n\t$(_Q)chmod +x $(PRODUCTION_FOLDER)/MacOS/$(NAME)\nelse ifeq ($(PLATFORM),linux)\n\t$(_Q)cp $(TARGET) $(PRODUCTION_FOLDER)\n\t$(_Q)cp env/linux/$(PRODUCTION_LINUX_ICON).png $(PRODUCTION_FOLDER)/$(PRODUCTION_LINUX_ICON).png\n\t$(_Q)cp env/linux/exec.desktop $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)sed -i 's/^Exec=.*/Exec=$(_LINUX_GREP_CWD)\\/$(PRODUCTION_FOLDER)\\/$(NAME)/' $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)sed -i 's/^Path=.*/Path=$(_LINUX_GREP_CWD)\\/$(PRODUCTION_FOLDER)/' $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)sed -i 's/^Name=.*/Name=$(PRODUCTION_LINUX_APP_NAME)/' $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)sed -i 's/^Comment=.*/Comment=$(PRODUCTION_LINUX_APP_COMMENT)/' $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)sed -i 's/^Icon=.*/Icon=$(_LINUX_GREP_CWD)\\/$(PRODUCTION_FOLDER)\\/$(PRODUCTION_LINUX_ICON).png/' $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)chmod +x $(PRODUCTION_FOLDER)/$(NAME)\n\t$(_Q)chmod +x $(PRODUCTION_FOLDER)/$(NAME).desktop\n\t$(_Q)cp $(PRODUCTION_FOLDER)/$(NAME).desktop ~/.local/share/applications\nelse\n\t$(_Q)cp $(TARGET) $(PRODUCTION_FOLDER)\n\t$(if $(_CLEAN),,@echo)\nendif\n.PHONY: releasetoprod\n\nmakeproduction: rmprod mkdirprod releasetoprod\n\t$(color_reset)\nifneq ($(PRODUCTION_DEPENDENCIES),)\n\t@echo ' Adding dynamic libraries & project dependencies...'\n\t@echo\n\t$(foreach dep,$(PRODUCTION_DEPENDENCIES),$(call copy_to,$(dep),$(PRODUCTION_FOLDER_RESOURCES)))\n\t$(foreach excl,$(PRODUCTION_EXCLUDE),$(shell find $(PRODUCTION_FOLDER_RESOURCES) -name '$(excl)' -delete))\nendif\nifeq ($(PLATFORM),osx)\n\t$(foreach dylib,$(PRODUCTION_MACOS_DYLIBS),$(call copy_to,$(dylib),$(PRODUCTION_FOLDER)/MacOS))\n\t$(_Q)install_name_tool -add_rpath @executable_path/../Frameworks $(PRODUCTION_FOLDER)/MacOS/$(NAME)\n\t$(_Q)install_name_tool -add_rpath @loader_path/.. $(PRODUCTION_FOLDER)/MacOS/$(NAME)\n\t$(foreach dylib,$(PRODUCTION_MACOS_DYLIBS),$(shell install_name_tool -change $(notdir $(dylib)) @rpath/MacOS/$(notdir $(dylib)) $(PRODUCTION_FOLDER)/MacOS/$(NAME)))\n\t$(foreach framework,$(PRODUCTION_MACOS_FRAMEWORKS),$(call copy_to,$(framework),$(PRODUCTION_FOLDER)/Frameworks))\nifeq ($(PRODUCTION_MACOS_MAKE_DMG),true)\n\t$(shell hdiutil detach /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/ &> /dev/null)\n\t@echo\n\t@echo ' Creating the dmg image for the application...'\n\t@echo\n\t$(_Q)hdiutil create -megabytes 54 -fs HFS+ -volname $(PRODUCTION_MACOS_BUNDLE_NAME) $(PRODUCTION_FOLDER_MACOS)/.tmp.dmg > /dev/null\n\t$(_Q)hdiutil attach $(PRODUCTION_FOLDER_MACOS)/.tmp.dmg > /dev/null\n\t$(_Q)cp -r $(PRODUCTION_FOLDER_MACOS)/$(PRODUCTION_MACOS_BUNDLE_NAME).app /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/\n\t-$(_Q)rm -rf /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/.fseventsd\n\t$(MKDIR) /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/.background\n\t$(_Q)tiffutil -cathidpicheck $(PRODUCTION_MACOS_BACKGROUND).png $(PRODUCTION_MACOS_BACKGROUND)@2x.png -out /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/.background/background.tiff\n\t$(_Q)ln -s /Applications /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/Applications\n\t$(_Q)appName=$(PRODUCTION_MACOS_BUNDLE_NAME) osascript env/osx/dmg.applescript\n\t$(_Q)hdiutil detach /Volumes/$(PRODUCTION_MACOS_BUNDLE_NAME)/ > /dev/null\n\t$(_Q)hdiutil convert $(PRODUCTION_FOLDER_MACOS)/.tmp.dmg -format UDZO -o $(PRODUCTION_FOLDER_MACOS)/$(PRODUCTION_MACOS_BUNDLE_NAME).dmg > /dev/null\n\t$(_Q)rm -f $(PRODUCTION_FOLDER_MACOS)/.tmp.dmg\n\t@echo\n\t@echo ' Created $(PRODUCTION_FOLDER_MACOS)/$(PRODUCTION_MACOS_BUNDLE_NAME).dmg'\nendif\nendif\n.PHONY: makeproduction\n\n#==============================================================================\n# Dependency recipes\n$(DEP_DIR)/%.d: ;\n.PRECIOUS: $(DEP_DIR)/%.d\n\ninclude $(wildcard $(DEPS))\n"
},
{
"path": "app/src/main/SDL2_SFML.sln",
"content": "\nMicrosoft Visual Studio Solution File, Format Version 12.00\n# Visual Studio Version 17\nVisualStudioVersion = 17.14.36408.4 d17.14\nMinimumVisualStudioVersion = 10.0.40219.1\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"SDL2_SFML\", \"SDL2_SFML.vcxproj\", \"{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}\"\nEndProject\nGlobal\n\tGlobalSection(SolutionConfigurationPlatforms) = preSolution\n\t\tDebug|x64 = Debug|x64\n\t\tDebug|x86 = Debug|x86\n\t\tRelease|x64 = Release|x64\n\t\tRelease|x86 = Release|x86\n\tEndGlobalSection\n\tGlobalSection(ProjectConfigurationPlatforms) = postSolution\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Debug|x64.Build.0 = Debug|x64\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Debug|x86.Build.0 = Debug|Win32\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Release|x64.ActiveCfg = Release|x64\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Release|x64.Build.0 = Release|x64\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Release|x86.ActiveCfg = Release|Win32\n\t\t{5F4AA128-1C3B-458F-9B6D-7E140CBE20A5}.Release|x86.Build.0 = Release|Win32\n\tEndGlobalSection\n\tGlobalSection(SolutionProperties) = preSolution\n\t\tHideSolutionNode = FALSE\n\tEndGlobalSection\n\tGlobalSection(ExtensibilityGlobals) = postSolution\n\t\tSolutionGuid = {4BC0C116-C5DF-4722-B40C-C405E183D77F}\n\tEndGlobalSection\nEndGlobal\n"
},
{
"path": "app/src/main/SDL2_SFML.vcxproj",
"content": "\n\n \n \n Debug \n Win32 \n \n \n Release \n Win32 \n \n \n Debug \n x64 \n \n \n Release \n x64 \n \n \n \n 16.0 \n Win32Proj \n {5f4aa128-1c3b-458f-9b6d-7e140cbe20a5} \n SDL2_SFML \n 10.0 \n \n \n Application \n true \n v143 \n Unicode \n \n \n Application \n false \n v143 \n true \n Unicode \n \n \n Application \n true \n v143 \n Unicode \n \n \n Application \n false \n v143 \n true \n Unicode \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Level3 \n true \n IS_ENGINE_SDL_2;IS_ENGINE_VS;_CRT_SECURE_NO_WARNINGS \n true \n stdcpp20 \n \n Console \n true \n \n \n \n \n Level3 \n true \n true \n true \n WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) \n true \n \n Console \n true \n true \n true \n \n \n \n \n Level3 \n true \n IS_ENGINE_SDL_2;IS_ENGINE_VS;_CRT_SECURE_NO_WARNINGS \n true \n C:\\SDL2-2.26.3\\include;%(AdditionalIncludeDirectories) \n stdcpp20 \n \n Console \n true \n C:\\SDL2-2.26.3\\lib\\x64;%(AdditionalLibraryDirectories) \n SDL2.lib;SDL2main.lib;SDL2_image.lib;SDL2_mixer.lib;SDL2_ttf.lib;%(AdditionalDependencies) \n \n \n \n \n Level3 \n true \n true \n true \n NDEBUG;_CONSOLE;%(PreprocessorDefinitions) \n true \n \n Console \n true \n true \n true \n \n \n \n \n \n \n \n \n \n \n "
},
{
"path": "app/src/main/SDL2_SFML.vcxproj.filters",
"content": "\n\n \n \n {4FC737F1-C7A5-4376-A066-2A32D752A2FF} \n cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx \n \n \n {93995380-89BD-4b04-88EB-625FBE52EBFB} \n h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd \n \n \n {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} \n rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms \n \n \n {685a88e6-fbc8-479e-8305-bfd706b9dc45} \n \n \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n Source Files \n \n \n \n \n Resource Files \n \n \n \n \n "
},
{
"path": "app/src/main/SDL2_SFML.vcxproj.user",
"content": "\n\n "
},
{
"path": "app/src/main/build.sh",
"content": "#!/bin/bash\n\nCMD=$1\nBUILD=$2\nVSCODE=$3\nOPTIONS=$4\n\ncwd=${PWD##*/}\n\nexport GCC_COLORS=\"error=01;31:warning=01;33:note=01;36:locus=00;34\"\n\n#==============================================================================\n# Function declarations\n\ndisplay_styled_symbol() {\n\ttput setaf $1\n\ttput bold\n\techo \"$2 $3\"\n\ttput sgr0\n}\n\nbuild_success() {\n\techo\n\tdisplay_styled_symbol 2 \"✔\" \"Succeeded!\"\n\techo\n}\n\nlaunch() {\n\tdisplay_styled_symbol 2 \" \" \"Launching bin-vscode/$BUILD/$NAME\"\n\techo\n}\n\nbuild_success_launch() {\n\techo\n\tdisplay_styled_symbol 2 \"✔\" \"Succeeded!\"\n\tlaunch\n}\n\nbuild_fail() {\n\techo\n\tdisplay_styled_symbol 1 \"✘\" \"Failed!\"\n\tdisplay_styled_symbol 1 \" \" \"Review the compile errors above.\"\n\techo\n\ttput sgr0\n\texit 1\n}\n\nbuild_prod_error() {\n\techo\n\tdisplay_styled_symbol 1 \"⭙\" \"Error: buildprod must be run on Release build.\"\n\ttput sgr0\n\texit 1\n}\n\nprofiler_done() {\n\techo\n\tdisplay_styled_symbol 2 \"⯌\" \"Profiler Completed: View $PROF_ANALYSIS_FILE for details\"\n\techo\n}\n\nprofiler_error() {\n\techo\n\tdisplay_styled_symbol 1 \"⭙\" \"Error: Profiler must be run on Debug build.\"\n\ttput sgr0\n\texit 1\n}\n\nprofiler_osx() {\n\tdisplay_styled_symbol 1 \"⭙\" \"Error: Profiling (with gprof) is not supported on Mac OSX.\"\n\ttput sgr0\n\texit 1\n}\n\nbuildrun() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Build & Run: $BUILD (target: $NAME)\"\n\techo\n\tBLD=$BUILD\n\tif [[ $BUILD == 'Tests' && $1 != 'main' ]]; then\n\t\tBLD=Release\n\tfi\n\tif $MAKE_EXEC BUILD=$BLD; then\n\t\tbuild_success_launch\n\t\tif [[ $BUILD == 'Tests' ]]; then\n\t\t\tbin-vscode/Release/$NAME $OPTIONS\n\t\telse\n\t\t\tbin-vscode/$BUILD/$NAME $OPTIONS\n\t\tfi\n\telse\n\t\tbuild_fail\n\tfi\n}\n\nbuild() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Build: $BUILD (target: $NAME)\"\n\techo\n\tBLD=$BUILD\n\tif [[ $BUILD == 'Tests' && $1 != 'main' ]]; then\n\t\tBLD=Release\n\tfi\n\tif $MAKE_EXEC BUILD=$BLD; then\n\t\tbuild_success\n\telse\n\t\tbuild_fail\n\tfi\n}\n\nrebuild() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Rebuild: $BUILD (target: $NAME)\"\n\techo\n\tBLD=$BUILD\n\tif [[ $BUILD == 'Tests' && $1 != 'main' ]]; then\n\t\tBLD=Release\n\tfi\n\tif $MAKE_EXEC BUILD=$BLD rebuild; then\n\t\tbuild_success\n\telse\n\t\tbuild_fail\n\tfi\n}\n\nrun() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Run: $BUILD (target: $NAME)\"\n\techo\n\tlaunch\n\tif [[ $BUILD == 'Tests' ]]; then\n\t\tbin-vscode/Release/$NAME $OPTIONS\n\telse\n\t\tbin-vscode/$BUILD/$NAME $OPTIONS\n\tfi\n}\n\nbuildprod() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Production Build: $BUILD (target: $NAME)\"\n\techo\n\tif [[ $BUILD == 'Release' ]]; then\n\t\tRECIPE=buildprod\n\t\tif [[ $1 != 'main' ]]; then\n\t\t\tRECIPE=\n\t\tfi\n\t\tif $MAKE_EXEC BUILD=$BUILD $RECIPE; then\n\t\t\tbuild_success\n\t\telse\n\t\t\tbuild_fail\n\t\tfi\n\telse\n\t\tbuild_prod_error\n\tfi\n}\n\nprofile() {\n\tdisplay_styled_symbol 3 \"⬤\" \"Profile: $BUILD (target: $NAME)\"\n\techo\n\tif [[ $PLATFORM == 'osx' ]]; then\n\t\tprofiler_osx\n\telif [[ $BUILD == 'Debug' ]]; then\n\t\tif $MAKE_EXEC BUILD=$BUILD; then\n\t\t\tbuild_success_launch\n\t\t\ttput sgr0\n\t\t\tbin-vscode/$BUILD/$NAME\n\t\t\ttput setaf 4\n\t\t\tgprof bin-vscode/Debug/$NAME gmon.out > $PROF_ANALYSIS_FILE 2> /dev/null\n\t\t\tprofiler_done\n\t\telse\n\t\t\tbuild_fail\n\t\tfi\n\telse\n\t\tprofiler_error\n\tfi\n}\n\n#==============================================================================\n# Environment\n\nif [[ $CMD == '' ]]; then\n\tCMD=buildprod\nfi\nif [[ $BUILD == '' ]]; then\n\tBUILD=Release\nfi\n\nif [[ $OSTYPE == 'linux-gnu'* || $OSTYPE == 'cygwin'* ]]; then\n\tif [[ $OSTYPE == 'linux-gnueabihf' ]]; then\n\t\texport PLATFORM=rpi\n\telse\n\t\texport PLATFORM=linux\n\tfi\nelif [[ $OSTYPE == 'darwin'* ]]; then\n\texport PLATFORM=osx\nelif [[ $OSTYPE == 'msys' || $OSTYPE == 'win32' ]]; then\n\texport PLATFORM=windows\nfi\n\n\nif [[ $VSCODE != 'vscode' ]]; then\n\texport PATH=\"/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin\"\n\tif [[ $PLATFORM == 'windows' ]]; then\n\t\texport PATH=\"/c/SFML/bin:/c/mingw32/bin:$PATH\"\n\telse\n\t\tif [[ $PLATFORM == 'rpi' ]]; then\n\t\t\texport PATH=\"/usr/local/gcc-8.1.0/bin:$PATH\"\n\t\tfi\n\tfi\n\techo\n\techo build.sh PATH=$PATH\n\techo\nfi\n\nexport MAKE_EXEC=make\nif [[ $PLATFORM == 'windows' ]]; then\n\tif [ $(type -P \"mingw32-make.exe\") ]; then\n\t\texport MAKE_EXEC=mingw32-make.exe\n\telif [ $(type -P \"make.exe\") ]; then\n\t\texport MAKE_EXEC=make.exe\n\tfi\nfi\n\nif [[ $BUILD != \"Release\" && $BUILD != 'Debug' && $BUILD != 'Tests' ]]; then\n\tBUILD=Release\nfi\n\nPROF_EXEC=gprof\nPROF_ANALYSIS_FILE=profiler_analysis.stats\n\n#==============================================================================\n# Main script\n\nif [[ $BUILD_TARGETS == '' ]]; then\n\tBUILD_TARGETS=main\n\tNO_SRC_TARGET=1\nfi\n\nfor target in $BUILD_TARGETS; do\n\tif [[ $PLATFORM == 'windows' ]]; then\n\t\tif [[ $target == 'main' ]]; then\n\t\t\texport NAME=$cwd.exe\n\t\t\tif [[ $BUILD == 'Tests' ]]; then\n\t\t\t\tNAME=tests_$NAME\n\t\t\tfi\n\t\telse\n\t\t\tif [[ $BUILD == 'Debug' ]]; then\n\t\t\t\texport NAME=$target-d.dll\n\t\t\telse\n\t\t\t\texport NAME=$target.dll\n\t\t\tfi\n\t\tfi\n\telse\n\t\tif [[ $target == 'main' ]]; then\n\t\t\texport NAME=$cwd\n\t\t\tif [[ $BUILD == 'Tests' ]]; then\n\t\t\t\tNAME=tests_$NAME\n\t\t\tfi\n\t\telse\n\t\t\tif [[ $BUILD == 'Debug' ]]; then\n\t\t\t\texport NAME=$target-d.so\n\t\t\telse\n\t\t\t\texport NAME=$target.so\n\t\t\tfi\n\t\tfi\n\tfi\n\n\tif [[ $NO_SRC_TARGET != 1 ]]; then\n\t\texport SRC_TARGET=$target\n\tfi\n\n\tCHILD_CMD=\"$CMD $target\"\n\tif [[ $CMD == 'buildrun' && $target != 'main' ]]; then\n\t\tCHILD_CMD=build\n\tfi\n\n\n\ttput setaf 4\n\tif $CHILD_CMD ; then\n\t\ttput sgr0\n\telse\n\t\ttput setaf 1\n\t\ttput bold\n\t\techo $dec Error: Command \\\"$CHILD_CMD\\\" not recognized. $dec\n\t\ttput sgr0\n\t\texit 1\n\tfi\n\n\tRESULT=$?\n\tif [[ $RESULT != 0 ]]; then\n\t\tbreak\n\tfi\n\ndone\n\nexit 0\n"
},
{
"path": "app/src/main/cmake/app_src.cmake",
"content": "# game source file\nset(\n app_src\n\t\n\t# game system extended\n\t${ISENGINE_SRC_DIR}/GameSystemExtended.cpp\n\n\t# game scene\n\t# ${ISENGINE_SRC_DIR}/app_src/scenes/...\n\n\t# game level objects\n\t# ${ISENGINE_SRC_DIR}/app_src/objects/...\n\n\t# widgets\n\t${ISENGINE_SRC_DIR}/GameDialog.cpp\n)"
},
{
"path": "app/src/main/cmake/isengine.cmake",
"content": "# box 2d source file\nset(\n\tbox2d_sources\n\t\n\t${ISENGINE_SRC_DIR}/b2BroadPhase.cpp\n\t${ISENGINE_SRC_DIR}/b2CollideCircle.cpp\n\t${ISENGINE_SRC_DIR}/b2CollideEdge.cpp\n\t${ISENGINE_SRC_DIR}/b2CollidePolygon.cpp\n\t${ISENGINE_SRC_DIR}/b2Collision.cpp\n\t${ISENGINE_SRC_DIR}/b2Distance.cpp\n\t${ISENGINE_SRC_DIR}/b2DynamicTree.cpp\n\t${ISENGINE_SRC_DIR}/b2TimeOfImpact.cpp\n\t${ISENGINE_SRC_DIR}/b2CircleShape.cpp\n\t${ISENGINE_SRC_DIR}/b2EdgeShape.cpp\n\t${ISENGINE_SRC_DIR}/b2ChainShape.cpp\n\t${ISENGINE_SRC_DIR}/b2PolygonShape.cpp\n\t${ISENGINE_SRC_DIR}/b2BlockAllocator.cpp\n\t${ISENGINE_SRC_DIR}/b2Draw.cpp\n\t${ISENGINE_SRC_DIR}/b2Math.cpp\n\t${ISENGINE_SRC_DIR}/b2Settings.cpp\n\t${ISENGINE_SRC_DIR}/b2StackAllocator.cpp\n\t${ISENGINE_SRC_DIR}/b2Timer.cpp\n\t${ISENGINE_SRC_DIR}/b2Body.cpp\n\t${ISENGINE_SRC_DIR}/b2ContactManager.cpp\n\t${ISENGINE_SRC_DIR}/b2Fixture.cpp\n\t${ISENGINE_SRC_DIR}/b2Island.cpp\n\t${ISENGINE_SRC_DIR}/b2World.cpp\n\t${ISENGINE_SRC_DIR}/b2WorldCallbacks.cpp\n\t${ISENGINE_SRC_DIR}/b2CircleContact.cpp\n\t${ISENGINE_SRC_DIR}/b2Contact.cpp\n\t${ISENGINE_SRC_DIR}/b2ContactSolver.cpp\n\t${ISENGINE_SRC_DIR}/b2PolygonAndCircleContact.cpp\n\t${ISENGINE_SRC_DIR}/b2EdgeAndCircleContact.cpp\n\t${ISENGINE_SRC_DIR}/b2EdgeAndPolygonContact.cpp\n\t${ISENGINE_SRC_DIR}/b2ChainAndCircleContact.cpp\n\t${ISENGINE_SRC_DIR}/b2ChainAndPolygonContact.cpp\n\t${ISENGINE_SRC_DIR}/b2PolygonContact.cpp\n\t${ISENGINE_SRC_DIR}/b2DistanceJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2FrictionJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2GearJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2Joint.cpp\n\t${ISENGINE_SRC_DIR}/b2MotorJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2MouseJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2PrismaticJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2PulleyJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2RevoluteJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2RopeJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2WeldJoint.cpp\n\t${ISENGINE_SRC_DIR}/b2WheelJoint.cpp\n)\n\n# engine source file\nset(\n\tcommun_sources\n\t\n\t${ISENGINE_SRC_DIR}/main.cpp\n\n\t# Basic SFML rendering loop\n\t${ISENGINE_SRC_DIR}/basicSFMLmain.cpp\n\n\t# core\n\t${ISENGINE_SRC_DIR}/GameEngine.cpp\n\n\t# islibconnect\n\t${ISENGINE_SRC_DIR}/isEngineWrapper.cpp\n\t${ISENGINE_SRC_DIR}/isEngineSDLWrapper.cpp\n\t\n\t# display\n\t${ISENGINE_SRC_DIR}/GameDisplay.cpp\n\t\n\t# entity\n\t${ISENGINE_SRC_DIR}/MainObject.cpp\n\t\n\t# graphic\n\t${ISENGINE_SRC_DIR}/TransitionEffect.cpp\n\t\n\t# function\n\t${ISENGINE_SRC_DIR}/GameFunction.cpp\t\t\n\t${ISENGINE_SRC_DIR}/GameKeyData.cpp\n\t${ISENGINE_SRC_DIR}/GameSlider.cpp\n\t${ISENGINE_SRC_DIR}/GameSystem.cpp\n\t${ISENGINE_SRC_DIR}/GameTime.cpp\n\t\n\t# box 2d\n\t${box2d_sources}\n)\n\n# tmx lite\nset(\n\ttmxlite_sources\n\t\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/FreeFuncs.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/ImageLayer.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/LayerGroup.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/Map.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/Object.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/ObjectGroup.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/Property.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/TileLayer.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/Tileset.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/detail/pugixml.cpp\n\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TMXLite/miniz.c\n\t)\n\n# is::Engine Windows & Linux version\nif (DEFINED ISENGINE_PC)\n\tset(\n\t\tisengine\n\t\t${commun_sources}\n\t\t${tmxlite_sources}\n\t\t\n\t\t# tiny file dialogs\n\t\t${ISENGINE_SRC_DIR}/isEngine/ext_lib/TinyFileDialogs/tinyfiledialogs.cpp\n\t\t)\n# is::Engine Android version\nelseif (DEFINED ISENGINE_ANDROID)\n\tset(\n\t\tisengine\n\t\t${commun_sources}\n\t\t${ISENGINE_SRC_DIR}/SDL_android_main.c\n\t\t#${tmxlite_sources}\n\t\t)\n# is::Engine HTML version\nelseif (DEFINED ISENGINE_HTML_5)\n\tset(\n\t\tisengine\n\t\t${commun_sources}\n\t\t)\nendif()\n"
},
{
"path": "app/src/main/cmake/resource.rc",
"content": "// application icon\nMAINICON ICON DISCARDABLE \"../env/windows/icon.ico\"\n"
},
{
"path": "app/src/main/codeblocks/resource.rc",
"content": "// application icon\nMAINICON ICON \"../env/windows/icon.ico\"\n"
},
{
"path": "app/src/main/copy_assets.cmd",
"content": "@echo off\nsetlocal ENABLEEXTENSIONS\n\nREM Define source and destination\nset \"SOURCE=assets\"\nset \"DEST=romfs\"\n\nREM Check if source exists\nif not exist \"%SOURCE%\" (\n echo [ERROR] The folder '%SOURCE%' does not exist.\n exit /b 1\n)\n\nREM Create destination if it doesn't exist\nif not exist \"%DEST%\" (\n echo [INFO] The folder '%DEST%' does not exist. Creating it...\n mkdir \"%DEST%\"\n)\n\nREM Copy the 'assets' folder itself (and all contents) into 'data'\necho [INFO] Copying the '%SOURCE%' folder into '%DEST%'...\nxcopy \"%SOURCE%\" \"%DEST%\\%SOURCE%\\\" /E /I /Y /H >nul\n\necho [SUCCESS] The folder '%SOURCE%' has been copied to '%DEST%\\%SOURCE%\\'.\npause\n"
},
{
"path": "app/src/main/cpp/GameDialog.cpp",
"content": "#include \"app_src/objects/widgets/GameDialog.h\"\n\nnamespace is\n{\nGameDialog::GameDialog(sf::Texture &tex, sf::Font &fnt, GameDisplay *m_scene) :\n MainObject(),\n m_scene(m_scene),\n m_showDialog(false),\n m_mouseInCollison(false),\n m_dialogEnd(false),\n m_newLine(true),\n m_msgIndex(0),\n m_msgIndexMax(0),\n m_size(0),\n m_blindTime(0.f),\n m_dialogIndex(DIALOG_NONE)\n{\n m_strName = \"GameDialog\"; // object name\n\n m_imageScale = 0.f;\n is::createText(fnt, m_txtDialog, \"\", m_x, m_y, is::GameConfig::DEFAULT_RPG_DIALOG_TEXT_COLOR, is::GameConfig::DEFAULT_RPG_DIALOG_TEXT_SIZE);\n is::createText(fnt, m_txtSkip, is::lang::pad_dialog_skip[m_scene->getGameSystem().m_gameLanguage],\n m_x, m_y, is::GameConfig::DEFAULT_RPG_DIALOG_SELECTED_TEXT_COLOR, true, is::GameConfig::DEFAULT_RPG_DIALOG_BUTTON_TEXT_SIZE);\n m_strDialog = \"\";\n is::createSprite(tex, m_sprParent, sf::IntRect(0, 0, 480, 96), sf::Vector2f(0.f, 0.f), sf::Vector2f(240.f, 48.f));\n is::createSprite(tex, m_sprNext, sf::IntRect(64, 96, 32, 32), sf::Vector2f(0.f, 0.f), sf::Vector2f(16.f, 16.f));\n is::createSprite(tex, m_sprSkip, sf::IntRect(0, 96, 64, 24), sf::Vector2f(0.f, 0.f), sf::Vector2f(32.f, 12.f));\n is::setSFMLObjScale(m_txtDialog, 0.f);\n is::centerSFMLObj(m_txtSkip);\n is::setSFMLObjScale(m_txtSkip, 0.f);\n is::setSFMLObjScale(m_sprParent, 0.f);\n is::setSFMLObjScale(m_sprNext, 0.f);\n}\n\nvoid GameDialog::step(const float &DELTA_TIME)\n{\n if (m_showDialog)\n {\n if (!m_scene->getGameSystem().keyIsPressed(is::GameConfig::KEY_A) && !m_scene->getGameSystem().isPressed(is::GameSystem::MOUSE))\n m_scene->getGameSystem().m_keyIsPressed = false;\n\n setPosition(m_scene->getViewX(), m_scene->getViewY() + 32.f);\n\n float const _VAL(is::getMSecond(DELTA_TIME));\n m_time += (0.8f * is::VALUE_CONVERSION) * DELTA_TIME;\n m_blindTime += _VAL;\n if (m_blindTime > 30.f) m_blindTime = 0.f;\n\n auto getDialogChar = [this](int index = -1)\n {\n int n = m_strDialog.length();\n wchar_t* char_array = new wchar_t[n + 1];\n for (int i(0); i < n; i++) char_array[i] = m_strDialog[i];\n auto my_char = char_array[((index == -1) ? m_size + 1: index)];\n delete[] char_array;\n return my_char;\n };\n\n linkArrayToEnum();\n\n if (m_size < static_cast(m_strDialog.size()) - 1)\n {\n if (m_time > 1.f)\n {\n std::wstring tempoStr = m_txtDialog.\n #if !defined(IS_ENGINE_SFML)\n getWString();\n #else\n getString();\n #endif\n if (m_newLine)\n {\n m_scene->GSMplaySound(\"change_option\"); // We play this sound\n m_txtDialog.setString(getDialogChar(0));\n m_newLine = false;\n }\n else\n {\n m_txtDialog.setString(tempoStr + getDialogChar());\n m_size++;\n }\n m_time = 0.f;\n }\n }\n\n bool mouseInCollisonSkip(false);\n if (m_scene->mouseCollision(m_sprSkip)) mouseInCollisonSkip = true;\n if (m_scene->getGameSystem().isPressed(is::GameSystem::ValidationButton::MOUSE) && mouseInCollisonSkip &&\n !m_dialogEnd)\n {\n m_scene->GSMplaySound(\"cancel\"); // We play this sound\n m_scene->getGameSystem().useVibrate(60);\n m_dialogEnd = true;\n }\n\n m_mouseInCollison = m_scene->mouseCollision(m_sprParent);\n if (!m_mouseInCollison && m_scene->getGameSystem().isPressed(is::GameSystem::MOUSE))\n m_scene->getGameSystem().m_keyIsPressed = true;\n\n if ((m_scene->getGameSystem().keyIsPressed(is::GameConfig::KEY_A) ||\n (m_scene->getGameSystem().isPressed(is::GameSystem::ValidationButton::MOUSE) && m_mouseInCollison)) &&\n !m_scene->getGameSystem().m_keyIsPressed && !m_dialogEnd)\n {\n m_scene->getGameSystem().m_keyIsPressed = true;\n m_scene->getGameSystem().useVibrate(60);\n\n if (m_size < static_cast(m_strDialog.size()) - 1)\n {\n m_txtDialog.setString(m_strDialog);\n m_size = static_cast(m_strDialog.size()) - 1;\n }\n else\n {\n m_msgIndex += 2;\n if (m_msgIndex == m_msgIndexMax)\n {\n m_scene->GSMplaySound(\"cancel\"); // We play this sound\n m_dialogEnd = true;\n }\n else\n {\n m_newLine = true;\n m_size = 0;\n m_txtDialog.setString(\"\");\n }\n }\n }\n\n if (!m_dialogEnd) is::increaseVar(DELTA_TIME, m_imageScale, 0.1f, 1.f, 1.f);\n else\n {\n is::decreaseVar(DELTA_TIME, m_imageScale, 0.1f, 0.f, 0.f);\n if (m_imageScale < 0.05f) m_showDialog = false;\n }\n\n is::setSFMLObjX_Y(m_sprParent, m_x, m_y - 90.f);\n is::setSFMLObjX_Y(m_txtDialog, is::getSFMLObjX(m_sprParent) - 225.f,\n is::getSFMLObjY(m_sprParent) - 38.f);\n is::setSFMLObjX_Y(m_sprNext, is::getSFMLObjX(m_sprParent) + 220.f,\n is::getSFMLObjY(m_sprParent) + 29.f);\n\n is::setSFMLObjX_Y(m_sprSkip, m_x, m_y + 145.f);\n is::setSFMLObjX_Y(m_txtSkip, m_x, is::getSFMLObjY(m_sprSkip));\n }\n\n is::setSFMLObjScale(m_txtDialog, m_imageScale);\n is::setSFMLObjScale(m_txtSkip, m_imageScale);\n is::setSFMLObjScale(m_sprSkip, m_imageScale);\n is::setSFMLObjScale(m_sprParent, m_imageScale);\n is::setSFMLObjScale(m_sprNext, m_imageScale);\n}\n\nvoid GameDialog::setDialog(DialogIndex dialogIndex)\n{\n m_dialogEnd = false;\n m_msgIndex = 0;\n m_size = 0;\n m_dialogIndex = dialogIndex;\n m_strDialog = \"\";\n m_txtDialog.setString(\"\");\n m_showDialog = true;\n m_newLine = true;\n}\n\nvoid GameDialog::setMouseInCollison(bool val)\n{\n m_mouseInCollison = val;\n}\n\nvoid GameDialog::draw(is::Render &surface)\n{\n if (m_imageScale > 0.05)\n {\n is::draw(surface, m_sprParent);\n is::draw(surface, m_txtDialog);\n is::draw(surface, m_txtSkip);\n is::draw(surface, m_sprSkip);\n if (m_blindTime < 18.f && m_size == (static_cast(m_strDialog.size()) - 1)) is::draw(surface, m_sprNext);\n }\n}\n}\n"
},
{
"path": "app/src/main/cpp/GameDisplay.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/display/GameDisplay.h\"\n#include \"app_src/language/GameLanguage.h\"\n\nnamespace is\n{\nsf::Vector2f getMapPixelToCoords(GameDisplay const *scene, sf::Vector2i pixelPos)\n{\n return scene->getRenderWindow().mapPixelToCoords(pixelPos, scene->getView());\n}\n\nGameDisplay::GameDisplay(GameSystemExtended &gameSysExt, sf::Color bgColor) :\n m_isClosed(false),\n m_window(gameSysExt.m_window),\n m_view(sf::Vector2f(is::GameConfig::VIEW_WIDTH / 2.f,\n is::GameConfig::VIEW_HEIGHT / 2.f),\n sf::Vector2f(is::GameConfig::VIEW_WIDTH, is::GameConfig::VIEW_HEIGHT)),\n m_surface(gameSysExt.m_window),\n m_gameSysExt(gameSysExt),\n m_timeVibrateDuration(40),\n m_optionIndex(0),\n m_waitTime(0),\n m_msgWaitTime(0),\n m_sceneWidth(is::GameConfig::VIEW_WIDTH),\n m_sceneHeight(is::GameConfig::VIEW_HEIGHT),\n DELTA_TIME(0.f),\n m_viewW(is::GameConfig::VIEW_WIDTH),\n m_viewH(is::GameConfig::VIEW_HEIGHT),\n m_viewX(m_viewW / 2.f),\n m_viewY(m_viewH / 2.f),\n m_sprButtonSelectScale(1.f),\n m_isRunning(true),\n m_windowIsActive(true),\n m_isPlaying(true),\n m_sceneStart(true),\n m_sceneEnd(false),\n m_keyBackPressed(false),\n m_showMsg(false),\n m_mbYesNo(false),\n m_msgBoxMouseInCollision(false),\n m_mouseInCollision(false)\n{\n setViewSize(m_viewW, m_viewH);\n setView(m_viewX, m_viewY);\n m_windowBgColor = bgColor;\n}\n\nGameDisplay::~GameDisplay() {}\n\nvoid GameDisplay::setOptionIndex(int optionIndexValue, bool callWhenClick, float buttonScale)\n{\n if (m_waitTime == 0) {\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n GSMplaySound(\"change_option\");\n m_sprButtonSelectScale = buttonScale;\n if (!callWhenClick) {\n m_optionIndex += optionIndexValue;\n m_gameSysExt.m_keyIsPressed = true;\n } else m_optionIndex = optionIndexValue;\n }\n}\n\nvoid GameDisplay::setOptionIndex(int optionIndexValue)\n{\n m_optionIndex = optionIndexValue;\n}\n\nvoid GameDisplay::setTextAnimation(sf::Text &txt, sf::Sprite &spr, int val)\n{\n if (m_optionIndex == val)\n {\n is::setSFMLObjX_Y(m_sprButtonSelect, is::getSFMLObjX(spr), is::getSFMLObjY(spr));\n is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_SELECTED_TEXT_COLOR);\n }\n else is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_TEXT_COLOR);\n}\n\nvoid GameDisplay::setSprButtonSelectScale(float val)\n{\n m_sprButtonSelectScale = val;\n}\n\nvoid GameDisplay::setView(sf::Vector2f v)\n{\n m_view.setCenter(v.x, v.y);\n m_surface.setView(m_view);\n}\n\nvoid GameDisplay::setView(float x, float y)\n{\n m_view.setCenter(x, y);\n m_surface.setView(m_view);\n}\n\nvoid GameDisplay::setView()\n{\n m_view.setCenter(m_viewX, m_viewY);\n m_surface.setView(m_view);\n}\n\nvoid GameDisplay::setViewVarX(float val)\n{\n m_viewX = val;\n}\n\nvoid GameDisplay::setViewVarY(float val)\n{\n m_viewY = val;\n}\n\nvoid GameDisplay::setViewVarXY(float x, float y)\n{\n m_viewX = x;\n m_viewY = y;\n}\n\nvoid GameDisplay::setViewSize(sf::Vector2f v)\n{\n m_view.setSize(v.x, v.y);\n}\n\nvoid GameDisplay::setViewSize(float x, float y)\n{\n m_view.setSize(x, y);\n}\n\nvoid GameDisplay::setWindowSize(sf::Vector2u v, bool updateViewSize)\n{\n#if defined(__ANDROID__)\n m_window.setSize(v);\n if (updateViewSize) {\n m_viewW = v.x;\n m_viewH = v.y;\n m_viewX = m_viewW / 2.f;\n m_viewY = m_viewH / 2.f;\n m_view.setSize(m_viewW, m_viewH);\n m_view.setCenter(m_viewX, m_viewY);\n m_window.setView(m_view);\n m_surface.setView(m_view);\n }\n#endif\n}\n\nvoid GameDisplay::setWindowTitle(const std::string &title)\n{\n m_window.setTitle(title);\n}\n\nvoid GameDisplay::setWindowBgColor(sf::Color color)\n{\n m_windowBgColor = color;\n}\n\nvoid GameDisplay::controlEventFocusClosing(sf::Event &event)\n{\n // Manage the state of window\n if (event.type == sf::Event::GainedFocus) m_windowIsActive = true;\n if (event.type == sf::Event::LostFocus) m_windowIsActive = false;\n\n // Closing the application\n if (event.type == sf::Event::Closed)\n {\n m_isRunning = false; // quit the main render loop\n m_window.close();\n }\n}\n\nvoid GameDisplay::showMessageBox(const std::string &msgBody, bool mbYesNo)\n{\n setMessageBoxData(mbYesNo);\n m_txtMsgBox.setString(msgBody);\n}\n\nvoid GameDisplay::showMessageBox(std::wstring const &msgBody, bool mbYesNo)\n{\n setMessageBoxData(mbYesNo);\n m_txtMsgBox.setString(msgBody);\n}\n\nvoid GameDisplay::setWidgetsPosition()\n{\n setSFMLObjX_Y(m_recMsgBox, sf::Vector2f(m_view.getCenter().x, m_view.getCenter().y));\n setSFMLObjX_Y(m_sprMsgBox, sf::Vector2f(m_view.getCenter().x, m_view.getCenter().y));\n const float dim(6.f),\n boxXOrigin(is::getSFMLObjOriginX(m_sprMsgBox)),\n boxYOrigin(is::getSFMLObjOriginY(m_sprMsgBox));\n setSFMLObjX_Y(m_sprMsgBoxButton1,\n is::getSFMLObjX(m_sprMsgBox) - boxXOrigin +\n is::getSFMLObjOriginX(m_sprMsgBoxButton1) + dim,\n is::getSFMLObjY(m_sprMsgBox) + boxYOrigin -\n is::getSFMLObjHeight(m_sprMsgBoxButton1) + dim);\n setSFMLObjX_Y(m_sprMsgBoxButton2,\n is::getSFMLObjX(m_sprMsgBox) + boxXOrigin -\n is::getSFMLObjOriginX(m_sprMsgBoxButton2) - dim,\n is::getSFMLObjY(m_sprMsgBox) + boxYOrigin -\n is::getSFMLObjHeight(m_sprMsgBoxButton2) + dim);\n setSFMLObjX_Y(m_sprMsgBoxButton3,\n is::getSFMLObjX(m_sprMsgBox),\n is::getSFMLObjY(m_sprMsgBox) + boxYOrigin -\n is::getSFMLObjHeight(m_sprMsgBoxButton1) + dim);\n setSFMLObjX_Y(m_txtMsgBox,\n is::getSFMLObjX(m_sprMsgBox) - boxXOrigin + 16.f,\n is::getSFMLObjY(m_sprMsgBox) - boxYOrigin + 8.f);\n\n // Adjust the text on button\n setSFMLObjX_Y(m_txtMsgBoxYes, is::getSFMLObjX(m_sprMsgBoxButton1),\n is::getSFMLObjY(m_sprMsgBoxButton1)\n#if defined(IS_ENGINE_SFML)\n - is::getSFMLObjHeight(m_txtMsgBoxYes) / 4.f\n#endif\n );\n setSFMLObjX_Y(m_txtMsgBoxNo, is::getSFMLObjX(m_sprMsgBoxButton2),\n is::getSFMLObjY(m_sprMsgBoxButton2)\n#if defined(IS_ENGINE_SFML)\n - is::getSFMLObjHeight(m_txtMsgBoxNo) / 4.f\n#endif\n );\n setSFMLObjX_Y(m_txtMsgBoxOK, is::getSFMLObjX(m_sprMsgBoxButton3),\n is::getSFMLObjY(m_sprMsgBoxButton3)\n#if defined(IS_ENGINE_SFML)\n - is::getSFMLObjHeight(m_txtMsgBoxOK) / 4.f\n#endif\n );\n}\n\nvoid GameDisplay::setMessageBoxData(bool mbYesNo)\n{\n m_showMsg = true;\n m_mbYesNo = mbYesNo;\n if (m_mbYesNo) m_msgAnswer = MsgAnswer::NO;\n m_msgWaitTime = 0;\n m_msgBoxMouseInCollision = false;\n m_txtMsgBoxYes.setString(is::lang::pad_answer_yes[m_gameSysExt.m_gameLanguage]);\n m_txtMsgBoxNo.setString(is::lang::pad_answer_no[m_gameSysExt.m_gameLanguage]);\n m_txtMsgBoxOK.setString(is::lang::pad_answer_ok[m_gameSysExt.m_gameLanguage]);\n\n centerSFMLObj(m_txtMsgBoxYes);\n centerSFMLObj(m_txtMsgBoxNo);\n centerSFMLObj(m_txtMsgBoxOK);\n setView();\n\n setWidgetsPosition();\n\n is::setSFMLObjAlpha(m_sprMsgBoxButton1, m_msgWaitTime);\n is::setSFMLObjAlpha(m_sprMsgBoxButton2, m_msgWaitTime);\n is::setSFMLObjAlpha(m_sprMsgBoxButton3, m_msgWaitTime);\n is::setSFMLObjAlpha(m_sprMsgBox, m_msgWaitTime);\n is::setSFMLObjAlpha2(m_txtMsgBoxNo, m_msgWaitTime);\n is::setSFMLObjAlpha2(m_txtMsgBoxYes, m_msgWaitTime);\n is::setSFMLObjAlpha2(m_txtMsgBoxOK, m_msgWaitTime);\n is::setSFMLObjAlpha2(m_txtMsgBox, m_msgWaitTime);\n}\n\nvoid GameDisplay::updateMsgBox(int sliderDirection, bool rightSideValidation,\n sf::Color textDefaultColor, sf::Color selectedTextColor)\n{\n if (m_msgWaitTime < 240) m_msgWaitTime += static_cast((8.f * is::VALUE_CONVERSION) * DELTA_TIME);\n else m_msgWaitTime = 255;\n if (!m_gameSysExt.isPressed()) m_gameSysExt.m_keyIsPressed = false;\n\n // Check collision with all objects of message box\n if (mouseCollision(m_sprMsgBoxButton1, m_mousePosCurrent) ||\n mouseCollision(m_sprMsgBoxButton2, m_mousePosCurrent) ||\n mouseCollision(m_sprMsgBoxButton3))\n m_msgBoxMouseInCollision = true;\n else m_msgBoxMouseInCollision = false;\n\n /*\n * sliderDirection is the enum variable found in is::GameSlider. It was not called from the instance\n * because its use is not mandatory in a Scene. This avoids the error message which implies that the\n * instance has not been declared because here we have implemented are not used in even if it does not exist\n * These different values (represents the enum of the class)\n SLIDE_NONE = 0,\n SLIDE_UP = 1,\n SLIDE_DOWN = 2,\n SLIDE_RIGHT = 3,\n SLIDE_LEFT = 4\n */\n\n // Avoid the long pressing button effect\n if (!m_msgBoxMouseInCollision && sliderDirection == 0 &&\n m_gameSysExt.isPressed(is::GameSystem::MOUSE))\n m_gameSysExt.m_keyIsPressed = true;\n\n if (m_msgWaitTime == 255 && m_windowIsActive)\n {\n // If it's YES / NO message box\n if (m_mbYesNo)\n {\n if ((m_gameSysExt.keyIsPressed(is::GameConfig::KEY_LEFT) || (sliderDirection == 4) ||\n (mouseCollision(m_sprMsgBoxButton1, m_mousePosCurrent) && m_mousePosPrevious != m_mousePosCurrent)) &&\n m_msgAnswer != MsgAnswer::YES)\n {\n if (m_msgBoxMouseInCollision) m_mousePosPrevious = m_mousePosCurrent;\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n GSMplaySound(\"change_option\");\n m_msgAnswer = MsgAnswer::YES; // answer = yes\n }\n else if ((m_gameSysExt.keyIsPressed(is::GameConfig::KEY_RIGHT) || (sliderDirection == 3) ||\n (mouseCollision(m_sprMsgBoxButton2, m_mousePosCurrent) && m_mousePosPrevious != m_mousePosCurrent)) &&\n m_msgAnswer != MsgAnswer::NO)\n {\n if (m_msgBoxMouseInCollision) m_mousePosPrevious = m_mousePosCurrent;\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n GSMplaySound(\"change_option\");\n m_msgAnswer = MsgAnswer::NO; // answer = no\n }\n else if (m_gameSysExt.isPressed(is::GameSystem::KEYBOARD) || (rightSideValidation) ||\n ((mouseCollision(m_sprMsgBoxButton1, m_mousePosCurrent) ||\n mouseCollision(m_sprMsgBoxButton2, m_mousePosCurrent)) &&\n m_gameSysExt.isPressed(is::GameSystem::MOUSE) && !m_gameSysExt.m_keyIsPressed))\n {\n m_showMsg = false;\n m_gameSysExt.m_keyIsPressed = true;\n }\n else if (m_keyBackPressed)\n {\n m_msgAnswer = MsgAnswer::NO; // answer = no (canceled)\n m_showMsg = false;\n m_keyBackPressed = false;\n }\n\n // Texts animations\n if (m_msgAnswer == MsgAnswer::YES)\n {\n is::setSFMLObjFillColor(m_txtMsgBoxYes, selectedTextColor);\n is::setSFMLObjFillColor(m_txtMsgBoxNo, textDefaultColor);\n }\n else\n {\n is::setSFMLObjFillColor(m_txtMsgBoxNo, selectedTextColor);\n is::setSFMLObjFillColor(m_txtMsgBoxYes, textDefaultColor);\n }\n }\n else // If it's OK message box\n {\n if (mouseCollision(m_sprMsgBoxButton3) && m_msgAnswer == MsgAnswer::NO)\n {\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n GSMplaySound(\"change_option\");\n m_msgAnswer = MsgAnswer::YES; // answer = OK\n is::setSFMLObjFillColor(m_txtMsgBoxOK, selectedTextColor);\n }\n else if (((m_gameSysExt.isPressed(is::GameSystem::KEYBOARD) || m_keyBackPressed) &&\n !mouseCollision(m_sprMsgBoxButton3)) || (rightSideValidation)|| (mouseCollision(m_sprMsgBoxButton3) &&\n m_gameSysExt.isPressed(is::GameSystem::MOUSE) && !m_gameSysExt.m_keyIsPressed))\n {\n m_showMsg = false;\n m_keyBackPressed = false;\n m_gameSysExt.m_keyIsPressed = true;\n }\n else if (!mouseCollision(m_sprMsgBoxButton3) && m_msgAnswer == MsgAnswer::YES)\n {\n m_msgAnswer = MsgAnswer::NO; // answer = NO\n is::setSFMLObjFillColor(m_txtMsgBoxOK, textDefaultColor);\n }\n }\n }\n\n if (m_msgWaitTime != 255)\n {\n if (m_mbYesNo)\n {\n is::setSFMLObjColor(m_sprMsgBoxButton1, sf::Color(255, 255, 255, m_msgWaitTime));\n is::setSFMLObjColor(m_sprMsgBoxButton2, sf::Color(255, 255, 255, m_msgWaitTime));\n is::setSFMLObjFillColor(m_txtMsgBoxNo, sf::Color(selectedTextColor.r, selectedTextColor.g, selectedTextColor.b, m_msgWaitTime));\n is::setSFMLObjFillColor(m_txtMsgBoxYes, sf::Color(textDefaultColor.r, textDefaultColor.g, textDefaultColor.b, m_msgWaitTime));\n }\n else\n {\n is::setSFMLObjColor(m_sprMsgBoxButton3, sf::Color(255, 255, 255, m_msgWaitTime));\n is::setSFMLObjFillColor(m_txtMsgBoxOK, sf::Color(textDefaultColor.r, textDefaultColor.g, textDefaultColor.b, m_msgWaitTime));\n }\n }\n is::setSFMLObjColor(m_sprMsgBox, sf::Color(255, 255, 255, m_msgWaitTime));\n is::setSFMLObjFillColor(m_txtMsgBox, sf::Color(textDefaultColor.r, textDefaultColor.g, textDefaultColor.b, m_msgWaitTime));\n\n if (!m_showMsg)\n {\n if (m_msgAnswer == MsgAnswer::NO)\n {\n // If is OK message box the answer is automatically YES\n if (!m_mbYesNo)\n {\n m_msgAnswer = MsgAnswer::YES;\n GSMplaySound(\"select_option\");\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n }\n else GSMplaySound(\"cancel\");\n }\n else\n {\n GSMplaySound(\"select_option\");\n m_gameSysExt.useVibrate(m_timeVibrateDuration);\n }\n }\n}\n\nvoid GameDisplay::updateTimeWait()\n{\n // Waiting time before validating an option\n if (m_waitTime > 0)\n {\n m_waitTime -= is::getMSecond(DELTA_TIME);\n }\n else m_waitTime = 0;\n}\n\nvoid GameDisplay::drawMsgBox()\n{\n if (m_showMsg)\n {\n is::draw(m_surface, m_recMsgBox);\n is::draw(m_surface, m_sprMsgBox);\n\n if (m_mbYesNo)\n {\n is::draw(m_surface, m_sprMsgBoxButton1);\n is::draw(m_surface, m_sprMsgBoxButton2);\n is::draw(m_surface, m_txtMsgBoxYes);\n is::draw(m_surface, m_txtMsgBoxNo);\n }\n else\n {\n is::draw(m_surface, m_sprMsgBoxButton3);\n is::draw(m_surface, m_txtMsgBoxOK);\n }\n is::draw(m_surface, m_txtMsgBox);\n }\n}\n\nvoid GameDisplay::drawScreen()\n{\n is::clear(m_surface, m_windowBgColor);\n #if defined(__ANDROID__)\n // On Android when the window is no longer active, nothing is displayed just a black screen.\n // Its allows to optimize the application\n if (m_windowIsActive)\n {\n #endif\n draw();\n #if defined(__ANDROID__)\n }\n #endif\n is::display(m_window);\n}\n\nvoid GameDisplay::showTempLoading(float time)\n{\n float timeToQuit(0.f);\n sf::Sprite sprTmploading, sprTmploading2;\n is::createSprite(GRMgetTexture(\"temp_loading\"), sprTmploading, sf::Vector2f(m_viewX, m_viewY), sf::Vector2f(320.f, 240.f));\n is::createSprite(GRMgetTexture(\"loading_icon\"), sprTmploading2, sf::Vector2f(m_viewX, m_viewY), sf::Vector2f(16.f, 16.f));\n while (timeToQuit < time)\n {\n float dTime = getDeltaTime();\n timeToQuit += is::getMSecond(dTime);\n sprTmploading2.rotate((5.f * is::VALUE_CONVERSION) * dTime);\n\n sf::Event ev;\n while (m_window.pollEvent(ev))\n {\n if (ev.type == sf::Event::Closed) is::closeApplication();\n }\n\n is::clear(m_window, sf::Color::Black);\n is::draw(m_surface, sprTmploading);\n is::draw(m_surface, sprTmploading2);\n is::display(m_window);\n }\n}\n\nvoid GameDisplay::loadParentResources()\n{\n if (!m_gameSysExt.m_loadParentResources)\n {\n // Load sound\n m_gameSysExt.GSMaddSound(\"change_option\", is::GameConfig::SFX_DIR + \"change_option\" + SND_FILE_EXTENSION);\n m_gameSysExt.GSMaddSound(\"cancel\", is::GameConfig::SFX_DIR + \"cancel\" + SND_FILE_EXTENSION);\n m_gameSysExt.GSMaddSound(\"select_option\", is::GameConfig::SFX_DIR + \"select_option\" + SND_FILE_EXTENSION);\n\n // Load message box sprite\n m_gameSysExt.GRMaddTexture(\"confirm_box\", is::GameConfig::GUI_DIR + \"confirm_box.png\");\n m_gameSysExt.GRMaddTexture(\"confirm_box_button\", is::GameConfig::GUI_DIR + \"confirm_box_button.png\");\n\n // Temporal loading texture\n m_gameSysExt.GRMaddTexture(\"temp_loading\", is::GameConfig::GUI_DIR + \"temp_loading.png\");\n m_gameSysExt.GRMaddTexture(\"loading_icon\", is::GameConfig::GUI_DIR + \"loading_icon.png\");\n\n // Load font\n m_gameSysExt.GRMaddFont(\"font_system\", GameConfig::FONT_DIR + \"font_system.ttf\");\n m_gameSysExt.GRMaddFont(\"font_msg\", GameConfig::FONT_DIR + \"font_msg.ttf\");\n\n m_gameSysExt.m_loadParentResources = true;\n }\n\n if (m_gameSysExt.m_loadParentResources)\n {\n GRMuseGameSystemFont();\n GRMuseGameSystemTexture();\n GSMuseGameSystemSound();\n }\n\n auto &texMsgButton = GRMgetTexture(\"confirm_box_button\");\n is::createSprite(GRMgetTexture(\"confirm_box\"), m_sprMsgBox, sf::Vector2f(0.f, 0.f), sf::Vector2f(0.f, 0.f));\n is::createSprite(texMsgButton, m_sprMsgBoxButton1, sf::Vector2f(0.f, 0.f), sf::Vector2f(0.f, 0.f));\n is::createSprite(texMsgButton, m_sprMsgBoxButton2, sf::Vector2f(0.f, 0.f), sf::Vector2f(0.f, 0.f));\n is::createSprite(texMsgButton, m_sprMsgBoxButton3, sf::Vector2f(0.f, 0.f), sf::Vector2f(0.f, 0.f));\n\n is::createRectangle(m_recMsgBox, sf::Vector2f(m_viewW + 40.f, m_viewH + 40.f), sf::Color(0, 0, 0, 200), 0.f, 0.f);\n\n is::centerSFMLObj(m_sprMsgBox);\n is::centerSFMLObj(m_sprMsgBoxButton1);\n is::centerSFMLObj(m_sprMsgBoxButton2);\n is::centerSFMLObj(m_sprMsgBoxButton3);\n\n // Load font\n auto &fontSystem = GRMgetFont(\"font_system\");\n\n is::createText(fontSystem, m_txtMsgBox, \"\", 0.f, 0.f, is::GameConfig::DEFAULT_MSG_BOX_TEXT_SIZE);\n#if defined(IS_ENGINE_SDL_2)\n m_txtMsgBox.m_SDLaddTextRecWSize += 32;\n#endif\n is::createText(fontSystem, m_txtMsgBoxYes, is::lang::pad_answer_yes[m_gameSysExt.m_gameLanguage],\n 0.f, 0.f, true, is::GameConfig::DEFAULT_MSG_BOX_BUTTON_TEXT_SIZE);\n is::createText(fontSystem, m_txtMsgBoxNo, is::lang::pad_answer_no[m_gameSysExt.m_gameLanguage],\n 0.f, 0.f, true, is::GameConfig::DEFAULT_MSG_BOX_BUTTON_TEXT_SIZE);\n is::createText(fontSystem, m_txtMsgBoxOK, is::lang::pad_answer_ok[m_gameSysExt.m_gameLanguage],\n 0.f, 0.f, true, is::GameConfig::DEFAULT_MSG_BOX_BUTTON_TEXT_SIZE);\n\n is::createSprite(GRMgetTexture(\"temp_loading\"), m_sprLoading, sf::Vector2f(m_viewX, m_viewY), sf::Vector2f(320.f, 240.f));\n}\n\nvoid GameDisplay::setIsRunning(bool val)\n{\n m_isRunning = val;\n}\n\nvoid GameDisplay::setIsPlaying(bool val)\n{\n m_isPlaying = val;\n}\n\nvoid GameDisplay::quitScene(int nextScene)\n{\n if (nextScene != -1)\n {\n m_gameSysExt.m_launchOption = static_cast(nextScene);\n m_isRunning = false;\n }\n else is::closeApplication();\n}\n\nvoid GameDisplay::setWaitTime(int val)\n{\n m_waitTime = val;\n}\n\nvoid GameDisplay::setSceneStart(bool val)\n{\n m_sceneStart = val;\n}\n\nvoid GameDisplay::setSceneEnd(bool val)\n{\n m_sceneEnd = val;\n}\n\nvoid GameDisplay::setKeyBackPressed(bool val)\n{\n m_keyBackPressed = val;\n}\n\nvoid GameDisplay::setMouseInCollision()\n{\n if (m_mousePosCurrent != m_mousePosPrevious)\n {\n is::setVector2(m_mousePosPrevious, m_mousePosCurrent.x, m_mousePosCurrent.y);\n m_mouseInCollision = true;\n }\n}\n\nfloat GameDisplay::getDeltaTime()\n{\n float dt = m_clock.restart().asSeconds();\n if (dt > is::MAX_CLOCK_TIME) dt = is::MAX_CLOCK_TIME;\n return dt;\n}\n\nsf::Vector2f GameDisplay::getCursor(unsigned int finger) const\n{\n return is::getCursor(m_window, finger);\n}\n\nbool GameDisplay::getMouseCurrentEqualToPrevious()\n{\n return (m_mousePosCurrent == m_mousePosPrevious);\n}\n\nbool GameDisplay::inViewRec(is::MainObject *obj, bool useTexRec)\n{\n is::Rectangle testRec;\n if (useTexRec)\n {\n testRec.m_left = obj->getX();\n testRec.m_top = obj->getY();\n testRec.m_right = obj->getX() + is::getSFMLObjWidth(obj->getSprite());\n testRec.m_bottom = obj->getY() + is::getSFMLObjHeight(obj->getSprite());\n }\n else testRec = obj->getMask();\n\n bool isCollision = false;\n is::Rectangle viewRec;\n viewRec.m_left = getViewX() - (getViewW() / 2) - 16;\n viewRec.m_right = getViewX() + (getViewW() / 2) + 16;\n viewRec.m_top = getViewY() - (getViewH() / 2);\n viewRec.m_bottom = getViewY() + (getViewH() / 2);\n if (is::collisionTest(testRec, viewRec))\n {\n isCollision = true;\n }\n return isCollision;\n}\n\nbool GameDisplay::inViewRec(is::MainObject &obj, bool useTexRec)\n{\n return (inViewRec(&obj, useTexRec));\n}\n\nbool GameDisplay::getIsRunning() const\n{\n return m_isRunning;\n}\n\n#if defined(IS_ENGINE_USE_SDM)\nvoid GameDisplay::SDMmanageScene()\n{\n DELTA_TIME = getDeltaTime();\n updateTimeWait();\n\n // even loop\n SDMmanageSceneEvents();\n\n // starting mechanism\n if (m_sceneStart)\n {\n // window has focus\n if (m_windowIsActive)\n {\n if (!m_showMsg)\n {\n SDMstep();\n }\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n// MESSAGE BOX\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n else\n {\n updateMsgBox(0, false);\n\n // when user closes message box in update function execute this instruction\n // \"m_waitTime\" allow to disable clicks on objects during a moment when user closes message box\n if (!m_showMsg) SDMmanageSceneMsgAnswers();\n }\n }\n }\n}\n\nvoid GameDisplay::SDMmanageSceneEvents()\n{\n sf::Event event;\n while (m_window.pollEvent(event)) // even loop\n {\n controlEventFocusClosing(event);\n if (m_gameSysExt.keyIsPressed(is::GameConfig::KEY_CANCEL))\n {\n if (!m_showMsg) showMessageBox(is::lang::msg_quit_game[m_gameSysExt.m_gameLanguage]);\n else if (m_msgWaitTime == 255) /* Allows to close the message box with the Cancel key when it is visible*/ m_keyBackPressed = true;\n }\n SDMcallObjectsEvents(event);\n }\n}\n\nvoid GameDisplay::SDMmanageSceneMsgAnswers()\n{\n if (m_msgAnswer == MsgAnswer::YES) // if answers is YES close application\n {\n m_window.close();\n m_isRunning = false;\n }\n else // if answers is NO continue execution\n {\n m_waitTime = 20;\n }\n}\n\nvoid GameDisplay::SDMcallObjectsEvents(sf::Event &event)\n{\n if (m_SDMObjectsEvent)\n {\n // call objects events\n for (std::list>::iterator it = m_SDMsceneObjects.begin();\n it != m_SDMsceneObjects.end(); ++it)\n {\n if (is::instanceExist(*it))\n {\n if ((*it)->m_SDMcallEvent)\n {\n (*it)->event(event);\n }\n }\n }\n }\n}\n\nvoid GameDisplay::SDMstep()\n{\n if (m_SDMObjectsStep)\n {\n // update scene objects\n for (std::list>::iterator it = m_SDMsceneObjects.begin();\n it != m_SDMsceneObjects.end(); ++it)\n {\n if (is::instanceExist(*it))\n {\n if ((*it)->m_SDMcallStep)\n {\n (*it)->step(DELTA_TIME);\n }\n if (*it != nullptr)\n {\n if ((*it)->isDestroyed())\n {\n it->reset();\n }\n }\n }\n }\n if (m_SDMsortArray)\n {\n is::sortObjArrayByDepth(m_SDMsceneObjects);\n m_SDMsortArray = false;\n }\n }\n}\n\nvoid GameDisplay::SDMdraw()\n{\n if (m_SDMObjectsDraw)\n {\n#if defined(IS_ENGINE_SDL_2)\n std::shared_ptr obj = nullptr;\n#endif\n // draw scene objects\n for (std::list>::iterator it = m_SDMsceneObjects.begin();\n it != m_SDMsceneObjects.end(); ++it)\n {\n if (is::instanceExist(*it))\n {\n if ((*it)->m_SDMcallDraw)\n {\n if ((*it)->m_SDMblitSprTextureName != \"\")\n {\n#if defined(IS_ENGINE_SDL_2)\n if (obj.get() != nullptr)\n {\n if (obj->m_strTextureName != (*it)->m_SDMblitSprTextureName)\n {\n for (unsigned int i(0); i < m_SDMblitSDLSprite.size(); ++i)\n {\n if (m_SDMblitSDLSprite[i]->m_strTextureName == (*it)->m_SDMblitSprTextureName)\n {\n obj = m_SDMblitSDLSprite[i];\n break;\n }\n }\n }\n }\n else\n {\n for (unsigned int i(0); i < m_SDMblitSDLSprite.size(); ++i)\n {\n if (m_SDMblitSDLSprite[i]->m_strTextureName == (*it)->m_SDMblitSprTextureName)\n {\n obj = m_SDMblitSDLSprite[i];\n break;\n }\n }\n }\n obj->m_sprBlit.setTextureRect(sf::IntRect((*it)->getSprite().getTextureRect().left,\n (*it)->getSprite().getTextureRect().top,\n (*it)->getSprite().getTextureRect().width,\n (*it)->getSprite().getTextureRect().height));\n obj->m_sprBlit.setPosition(is::getSFMLObjX((*it)->getSprite()), is::getSFMLObjY((*it)->getSprite()));\n obj->m_sprBlit.setOrigin(is::getSFMLObjOriginX((*it)->getSprite()), is::getSFMLObjOriginY((*it)->getSprite()));\n obj->m_sprBlit.setScale(is::getSFMLObjXScale((*it)->getSprite()), is::getSFMLObjYScale((*it)->getSprite()));\n obj->m_sprBlit.setColor((*it)->getSprite().getColor().r, (*it)->getSprite().getColor().g,\n (*it)->getSprite().getColor().b, (*it)->getSprite().getColor().a);\n#endif\n if (inViewRec(it->get(), true))\n {\n if ((*it)->getVisible()) m_window.draw(\n #if defined(IS_ENGINE_SDL_2)\n obj->m_sprBlit\n #else\n (*it)->getSprite()\n #endif\n );\n }\n }\n else (*it)->draw(m_surface);\n }\n }\n }\n }\n drawMsgBox();\n}\n\nvoid GameDisplay::createSprite(const std::string &spriteName, is::MainObject &obj, sf::IntRect rec, sf::Vector2f position, sf::Vector2f origin, sf::Vector2f scale, unsigned int alpha)\n{\n auto &tex = GRMgetTexture(spriteName);\n obj.m_SDMblitSprTextureName =\n#if !defined(IS_ENGINE_SDL_2)\n spriteName;\n is::createSprite(tex, obj.getSprite(), rec, sf::Vector2f(position.x, position.y), sf::Vector2f(origin.x, origin.y), false, false);\n#else\n GRMgetTexture(spriteName).getFileName();\n bool exists = false;\n for (unsigned int i(0); i < m_SDMblitSDLSprite.size(); ++i)\n {\n if (m_SDMblitSDLSprite[i]->m_strTextureName == obj.m_SDMblitSprTextureName)\n {\n exists = true;\n break;\n }\n }\n if (!exists) m_SDMblitSDLSprite.push_back(std::make_shared(obj.m_SDMblitSprTextureName, tex));\n\n obj.getSprite().setTextureRect(sf::IntRect(rec.left, rec.top, rec.width, rec.height));\n obj.getSprite().setPosition(position.x, position.y);\n obj.getSprite().setOrigin(origin.x, origin.y);\n obj.getSprite().setScale(scale.x, scale.y);\n obj.getSprite().setColor(255, 255, 255, alpha);\n#endif\n}\n\n#endif\n}\n"
},
{
"path": "app/src/main/cpp/GameEngine.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2025 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/core/GameEngine.h\"\n\n#if defined(IS_ENGINE_HTML_5)\nstd::function mainLoop;\nvoid MainLoop()\n{\n return mainLoop();\n}\n#endif\n\nnamespace is\n{\nGameEngine::GameEngine():\n m_gameSysExt(m_window)\n{}\n\nGameEngine::~GameEngine()\n{\n#if defined(IS_ENGINE_SDL_2)\n is::SDL2freeLib();\n#endif\n};\n\nvoid GameEngine::initEngine()\n{\n m_gameSysExt.initSystemData();\n m_window.create(sf::VideoMode(is::GameConfig::WINDOW_WIDTH, is::GameConfig::WINDOW_HEIGHT),\n is::GameConfig::GAME_NAME,\n is::getWindowStyle());\n\n #if !defined(__ANDROID__)\n #if defined(IS_ENGINE_SFML)\n // load application icon\n sf::Image iconTex;\n if (iconTex.loadFromFile(is::GameConfig::GUI_DIR + \"icon.png\"))\n \tm_window.setIcon(iconTex.getSize().x, iconTex.getSize().y, iconTex.getPixelsPtr());\n #endif\n\n // create saving directory\n#if (!defined(IS_ENGINE_HTML_5) && !defined(IS_ENGINE_SWITCH))\n if (!m_gameSysExt.fileExist(is::GameConfig::CONFIG_FILE))\n {\n#if defined(IS_ENGINE_VS)\n _mkdir\n#else\n mkdir\n#endif\n (is::GameConfig::DATA_PARENT_DIR.c_str()\n #if defined(SFML_SYSTEM_LINUX) || defined(IS_ENGINE_LINUX)\n , S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH\n #endif\n );\n m_gameSysExt.saveConfig(is::GameConfig::CONFIG_FILE);\n }\n#endif\n #endif // defined\n\n setFPS(m_window, is::GameConfig::FPS);\n}\n\n#if defined(IS_ENGINE_HTML_5)\nvoid GameEngine::execMainLoop(std::function loop)\n{\n mainLoop = [myLoop = loop] {(void)myLoop();};\n emscripten_set_main_loop(&MainLoop, -1, 1);\n}\n\nvoid GameEngine::execMainLoop(std::function loop)\n{\n mainLoop = loop;\n emscripten_set_main_loop(&MainLoop, -1, 1);\n}\n#endif\n\nbool GameEngine::play()\n{\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n// GAME INTILISATION\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n initEngine();\n\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n// GAME STARTUP\n//////////////////////////////////////////////////////////////////////////////////////////////////////\n std::unique_ptr app = nullptr;\n#if !defined(IS_ENGINE_HTML_5)\n while (m_window.isOpen()\n#ifdef __SWITCH__\n && appletMainLoop()\n#endif\n )\n#else\n EM_ASM(console.log(\"Start successfully!\");, 0);\n execMainLoop([&]\n {\n if (emscripten_run_script_int(\"Module.syncdone\") == 1)\n#endif\n {\n if (app == nullptr) app = std::make_unique(m_gameSysExt);\n else\n {\n app->update();\n app->draw();\n }\n }\n#if defined(IS_ENGINE_HTML_5)\n });\n#endif\n return true;\n}\n}\n"
},
{
"path": "app/src/main/cpp/GameFunction.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/function/GameFunction.h\"\n\n#if defined(IS_ENGINE_HTML_5)\n#include \n#include \n\n// Allows to send C++ string vector in javascript code\ninline std::vector *vectorFromIntPointer(uintptr_t vec) {\n return reinterpret_cast *>(vec);\n}\nEMSCRIPTEN_BINDINGS(Wrappers) {\n emscripten::register_vector(\"VectorString\").constructor(&vectorFromIntPointer, emscripten::allow_raw_pointers());\n};\n#endif\n\nnamespace is\n{\nconst float MAX_CLOCK_TIME = 0.018f;\nconst float VALUE_CONVERSION = 65.f;\nconst float SECOND = 59.f;\nconst float VALUE_TIME = 1.538f;\n\nstd::string w_chart_tToStr(wchar_t const *val)\n{\n std::wstring ws(val);\n return (std::string(ws.begin(), ws.end()));\n}\n\nstd::wstring strToWStr(const std::string &str)\n{\n std::wstring wsTemp(str.begin(), str.end());\n return wsTemp;\n}\n\nint getMSecond(const float &DELTA_TIME)\n{\n return static_cast(DELTA_TIME * (VALUE_TIME * VALUE_CONVERSION));\n}\n\nstd::tm makeTime(int year, int month, int day)\n{\n std::tm tm = {0};\n tm.tm_year = year - 1900; // years count from 1900\n tm.tm_mon = month - 1; // months count from January=0\n tm.tm_mday = day; // days count from 1\n return tm;\n}\n\nbool checkDateLimit(int year, int mont, int day)\n{\n time_t currentTime = time(0);\n std::tm tm1 = makeTime(year, mont, day);\n std::time_t expirationDate = std::mktime(&tm1);\n const int seconds_per_day = 60 * 60 * 24;\n return (std::difftime(expirationDate, currentTime) / seconds_per_day < 0.f);\n}\n\nvoid showLog(const std::string& str, bool stopApplication)\n{\n #if defined(IS_ENGINE_USE_SHOWLOG)\n #if !defined(__ANDROID__)\n std::cout << str.c_str() << \"\\n\";\n #else\n __android_log_print(ANDROID_LOG_DEBUG, \"LOG_INFO\", \"%s\\n\", str.c_str());\n #endif\n #endif\n if (stopApplication) is::closeApplication();\n}\n\nbool isIn(unsigned short valNumber, const int var, int x1, int x2, int x3, int x4, int x5, int x6, int x7, int x8, int x9)\n{\n if (var == x1) return true;\n else if (var == x2) return true;\n else if (var == x3) return (valNumber > 2);\n else if (var == x4) return (valNumber > 3);\n else if (var == x5) return (valNumber > 4);\n else if (var == x6) return (valNumber > 5);\n else if (var == x7) return (valNumber > 6);\n else if (var == x8) return (valNumber > 7);\n else if (var == x9) return (valNumber > 8);\n return false;\n}\n\nbool isBetween(float a, float b, float c)\n{\n if (b <= c) return (b <= a && a <= c);\n else return (c <= a && a <= b);\n}\n\nint sign(float x)\n{\n if (x > 0.f) return 1;\n else if (x < 0.f) return -1;\n else return 0;\n}\n\nfloat pointDirection(float x1, float y1, float x2, float y2)\n{\n return atan((y1 - y2) / (x1 - x2));\n}\n\nfloat radToDeg(float x)\n{\n return static_cast((x * 180.f) / 3.14159235f);\n}\n\nfloat degToRad(float x)\n{\n return static_cast((x * 3.14159235f) / 180.f);\n}\n\nfloat lengthDirX(float dir, float angle, bool useScreenScale)\n{\n#if defined(IS_ENGINE_SDL_2)\n if (useScreenScale)\n {\n if (static_cast(is::IS_ENGINE_SDL_screenXScale) != 1)\n {\n float tempDir(dir);\n dir += tempDir / is::IS_ENGINE_SDL_screenXScale;\n }\n return (dir * std::cos(degToRad(angle))) / is::IS_ENGINE_SDL_screenXScale;\n }\n#endif\n return dir * std::cos(degToRad(angle));\n}\n\nfloat lengthDirY(float dir, float angle, bool useScreenScale)\n{\n#if defined(IS_ENGINE_SDL_2)\n if (useScreenScale)\n {\n if (static_cast(is::IS_ENGINE_SDL_screenXScale) != 1)\n {\n float tempDir(dir);\n dir += tempDir / is::IS_ENGINE_SDL_screenXScale;\n return (dir * std::sin(degToRad(angle))) / is::IS_ENGINE_SDL_screenYScale;\n }\n }\n#endif\n return dir * std::sin(degToRad(angle));\n}\n\nbool collisionTest(Rectangle const &a, Rectangle const &b)\n{\n if (a.m_bottom <= b.m_top) return false;\n if (a.m_top >= b.m_bottom) return false;\n if (a.m_right <= b.m_left) return false;\n if (a.m_left >= b.m_right) return false;\n return true;\n}\n\nbool collisionTest(Circle const &a, Circle const &b)\n{\n auto distanceSquared = [](int x1, int y1, int x2, int y2)\n {\n int deltaX = x2 - x1;\n int deltaY = y2 - y1;\n return deltaX * deltaX + deltaY * deltaY;\n };\n\n // Calculate total radius squared\n int totalRadiusSquared = a.m_raduis + b.m_raduis;\n totalRadiusSquared = totalRadiusSquared * totalRadiusSquared;\n\n // If the distance between the centers of the circles is less than the sum of their radii\n if (distanceSquared(a.m_x, a.m_y, b.m_x, b.m_y) < totalRadiusSquared) return true; // The circles have collided\n return false; // If not\n}\n\nbool collisionTest(Circle const &circle, Rectangle const &rec)\n{\n // temporary variables to set edges for testing\n float testX = circle.m_x;\n float testY = circle.m_y;\n\n // which edge is closest?\n if (circle.m_x < rec.m_left) testX = rec.m_left; // test left edge\n else if (circle.m_x > rec.m_right) testX = rec.m_right; // right edge\n if (circle.m_y < rec.m_top) testY = rec.m_top; // top edge\n else if (circle.m_y > rec.m_bottom) testY = rec.m_bottom; // bottom edge\n\n // get distance from closest edges\n float distX = circle.m_x - testX;\n float distY = circle.m_y - testY;\n float distance = sqrt((distX * distX) + (distY * distY));\n\n // if the distance is less than the radius, collision!\n if (distance <= circle.m_raduis) return true;\n return false;\n}\n\nbool collisionTest(Rectangle const &rec, Circle const &circle)\n{\n return collisionTest(circle, rec);\n}\n\nvoid setTextAnimation(sf::Text &txt, sf::Sprite &spr, sf::Sprite &sprSelected, int &var, int val)\n{\n if (var == val)\n {\n is::setSFMLObjX_Y(sprSelected, is::getSFMLObjX(spr), is::getSFMLObjY(spr));\n is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_SELECTED_TEXT_COLOR);\n }\n else is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_TEXT_COLOR);\n}\n\nvoid setTextAnimation(sf::Text &txt, int &var, int val)\n{\n if (var == val) is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_SELECTED_TEXT_COLOR);\n else is::setSFMLObjFillColor(txt, is::GameConfig::DEFAULT_SFML_TEXT_COLOR);\n}\n\nvoid setFrame(sf::Sprite &sprite, float frame, int subFrame, int frameWidth, int frameHeight, int recWidth, int recHeight)\n{\n /* Description of the image decoupage algorithm\n * be << frame >> number of the image to get (to have it start counting images from 0 to X)\n * either << subFrame >> number of images on one line\n * be << frameLineIndex >> number of the line corresponding to the image\n * (frame / subFrame) returns the number of times there is << frame >> in << subFrame >> to determine the number of the line of the image\n * 32 * (frame - (subFrame * frameLineIndex)) returns the position (number) of the image on the X axis can return the value 0 (1st image on the line)\n * when the value of << frame >> exceeds the number of image on the X axis (the value of << subFrame >>) then we are on a new line\n * (32 * frameLineIndex) gives the position of the image on the Y axis its value varies according to the << frame >>\n * example: 32 * frameLineIndex = 1 when frame > subFrame; 32 * frameLineIndex = 2 when frame > subFrame * 2; ...\n */\n int frameLineIndex = (frame / subFrame);\n setSFMLObjTexRec(sprite, frameWidth * (static_cast(frame) - (subFrame * frameLineIndex)), frameHeight * frameLineIndex, recWidth, recHeight);\n}\n\nvoid setFrame(sf::Sprite &sprite, float frame, int subFrame, int frameSize)\n{\n setFrame(sprite, frame, subFrame, frameSize, frameSize, frameSize, frameSize);\n}\n\n/*\nvoid createRenderTexture(sf::RenderTexture &renderTexture, unsigned int width, unsigned int height)\n{\n renderTexture.create(width, height);\n}*/\n\nvoid createRectangle(sf::RectangleShape &rec, sf::Vector2f recSize, sf::Color color, float x, float y, bool center)\n{\n rec.setSize(recSize);\n if (center) is::centerSFMLObj(rec);\n setSFMLObjFillColor(rec, color);\n is::setSFMLObjX_Y(rec, x, y);\n}\n\nvoid textStyleConfig(sf::Text &txt, bool underLined, bool boldText, bool italicText)\n{\n if (underLined && boldText && italicText) txt.setStyle(sf::Text::Underlined | sf::Text::Bold | sf::Text::Italic);\n else if (underLined && boldText) txt.setStyle(sf::Text::Underlined | sf::Text::Bold);\n else if (underLined && italicText) txt.setStyle(sf::Text::Underlined | sf::Text::Italic);\n else if (boldText && italicText) txt.setStyle(sf::Text::Bold | sf::Text::Italic);\n else if (underLined) txt.setStyle(sf::Text::Underlined);\n else if (boldText) txt.setStyle(sf::Text::Bold);\n else if (italicText) txt.setStyle(sf::Text::Italic);\n}\n\nvoid setSFMLTextOutlineColor(sf::Text &txt, float thickness, sf::Color color)\n{\n txt.setOutlineColor(color);\n txt.setOutlineThickness(thickness);\n}\n\nvoid createSprite(sf::Texture &tex, sf::Sprite &spr, sf::Vector2f position, sf::Vector2f origin, bool smooth)\n{\n #if defined(IS_ENGINE_SFML)\n tex.setSmooth(smooth);\n #endif\n spr.setTexture(tex);\n spr.setOrigin(origin.x, origin.y);\n is::setSFMLObjX_Y(spr, position.x, position.y);\n}\n\nvoid createSprite(sf::Texture &tex, sf::Sprite &spr, sf::IntRect rec, sf::Vector2f position, sf::Vector2f origin, bool repeatTexture, bool smooth)\n{\n createSprite(tex, spr, position, origin, smooth);\n is::setSFMLObjTexRec(spr, rec.left, rec.top, rec.width, rec.height);\n #if defined(IS_ENGINE_SFML)\n if (repeatTexture) tex.setRepeated(true);\n #endif\n}\n\nvoid createSprite(sf::Texture &tex, sf::Sprite &spr, sf::IntRect rec, sf::Vector2f position, sf::Vector2f origin, sf::Vector2f scale, unsigned int alpha, bool repeatTexture, bool smooth)\n{\n createSprite(tex, spr, rec, position, origin, repeatTexture, smooth);\n is::setSFMLObjScaleX_Y(spr, scale.x, scale.y);\n is::setSFMLObjAlpha(spr, alpha);\n}\n\nsf::Vector2f getCursor(sf::RenderWindow &window, unsigned int finger)\n{\n sf::Vector2i pixelPos =\n ((IS_ENGINE_MOBILE_OS) ?\n sf::Touch::getPosition(finger, window)\n :\n sf::Mouse::getPosition(window)\n );\n\n sf::Vector2f worldPos = window.mapPixelToCoords(pixelPos, window.getView());\n\n float dx = pointDistance(window.getView().getCenter().x, window.getView().getCenter().y,\n worldPos.x, window.getView().getCenter().y);\n float dy = pointDistance(window.getView().getCenter().x, window.getView().getCenter().y,\n window.getView().getCenter().x, worldPos.y);\n\n if (worldPos.x < window.getView().getCenter().x) dx *= -1;\n if (worldPos.y < window.getView().getCenter().y) dy *= -1;\n\n return sf::Vector2f(window.getView().getCenter().x + dx, window.getView().getCenter().y + dy);\n}\n\nshort vibrate(short duration)\n{\n #if defined(__ANDROID__)\n JNIEnv* env = (JNIEnv*)SDL_AndroidGetJNIEnv();\n jobject activity = (jobject)SDL_AndroidGetActivity();\n jclass clazz(env->GetObjectClass(activity));\n JavaVM* vm;\n env->GetJavaVM(&vm);\n\n // First, attach this thread to the main thread\n JavaVMAttachArgs attachargs;\n attachargs.version = JNI_VERSION_1_6;\n attachargs.name = \"NativeThread\";\n attachargs.group = NULL;\n jint res = vm->AttachCurrentThread(&env, &attachargs);\n\n if (res == JNI_ERR) return EXIT_FAILURE;\n\n // Retrieve class information\n jclass natact = env->FindClass(\"android/app/NativeActivity\");\n jclass context = env->FindClass(\"android/content/Context\");\n\n // Get the value of a constant\n jfieldID fid = env->GetStaticFieldID(context, \"VIBRATOR_SERVICE\", \"Ljava/lang/String;\");\n jobject svcstr = env->GetStaticObjectField(context, fid);\n\n // Get the method 'getSystemService' and call it\n jmethodID getss = env->GetMethodID(natact, \"getSystemService\", \"(Ljava/lang/String;)Ljava/lang/Object;\");\n jobject vib_obj = env->CallObjectMethod(activity, getss, svcstr);\n\n // Get the object's class and retrieve the member name\n jclass vib_cls = env->GetObjectClass(vib_obj);\n jmethodID vibrate = env->GetMethodID(vib_cls, \"vibrate\", \"(J)V\");\n\n // Determine the timeframe\n jlong length = duration;\n\n // Bzzz!\n env->CallVoidMethod(vib_obj, vibrate, length);\n\n // Free references\n env->DeleteLocalRef(vib_obj);\n env->DeleteLocalRef(vib_cls);\n env->DeleteLocalRef(svcstr);\n env->DeleteLocalRef(context);\n env->DeleteLocalRef(natact);\n env->DeleteLocalRef(clazz);\n\n // Detach thread again\n // this line is comment because it cause a bug\n // vm->DetachCurrentThread();\n #elif defined(IS_ENGINE_HTML_5)\n EM_ASM_ARGS({\n navigator.vibrate($0);\n }, duration);\n #else\n is::showLog(\"Vibrate Called ! Time : \" + is::numToStr(duration) + \" ms\");\n #endif\n\n return 1; // EXIT_SUCCESS;\n}\n\nvoid openURL(const std::string& url, OpenURLAction action)\n{\n std::string urlStr;\n switch(action)\n {\n case OpenURLAction::Http: urlStr = \"http://\" + url; break;\n case OpenURLAction::Tel: urlStr = \"tel:\" + url; break;\n default: urlStr = \"mailto:\" + url; break;\n }\n\n#if defined(__ANDROID__)\n JNIEnv* env = (JNIEnv*)SDL_AndroidGetJNIEnv();\n jobject activity = (jobject)SDL_AndroidGetActivity();\n JavaVM* vm;\n env->GetJavaVM(&vm);\n\n vm->AttachCurrentThread(&env, NULL);\n\n // Retrieve class information\n jclass activityClass = env->FindClass(\"android/app/Activity\");\n jclass intentClass = env->FindClass(\"android/content/Intent\");\n jclass uriClass = env->FindClass(\"android/net/Uri\");\n\n // convert URL std::string to jstring\n jstring uriString = env->NewStringUTF(urlStr.c_str());\n\n // call parse method\n jmethodID uriParse = env->GetStaticMethodID(uriClass, \"parse\", \"(Ljava/lang/String;)Landroid/net/Uri;\");\n\n // set URL in method\n jobject uri = env->CallStaticObjectMethod(uriClass, uriParse, uriString);\n\n // intent action\n jstring actionString =\n env->NewStringUTF((action != OpenURLAction::Tel) ? \"android.intent.action.VIEW\" : \"android.intent.action.DIAL\");\n\n // call the intent object constructor\n jmethodID newIntent = env->GetMethodID(intentClass, \"\", \"(Ljava/lang/String;Landroid/net/Uri;)V\");\n\n // create the intent instance\n jobject intent = env->AllocObject(intentClass);\n\n // set intent constructor\n env->CallVoidMethod(intent, newIntent, actionString, uri);\n\n jmethodID startActivity = env->GetMethodID(activityClass, \"startActivity\", \"(Landroid/content/Intent;)V\");\n env->CallVoidMethod(activity, startActivity, intent);\n\n env->DeleteLocalRef(activityClass);\n env->DeleteLocalRef(intentClass);\n env->DeleteLocalRef(uriClass);\n env->DeleteLocalRef(intent);\n env->DeleteLocalRef(activity);\n //vm->DetachCurrentThread();\n#elif defined(IS_ENGINE_HTML_5)\n std::vector vectorArray;\n vectorArray.push_back(urlStr);\n\n EM_ASM_ARGS\n ({\n var vectorArray = new Module.VectorString($0);\n window.open(vectorArray.get(0));\n }, &vectorArray);\n#else\n std::string op =\n #if !defined(SFML_SYSTEM_LINUX)\n std::string(\"start \")\n #else\n std::string(\"xdg-open \")\n #endif\n .append(urlStr);\n system(op.c_str());\n#endif\n}\n\n#if defined(__ANDROID__)\nstd::string jstring2string(JNIEnv *env, jstring jStr)\n{\n if (!jStr) return \"\";\n\n const jclass stringClass = env->GetObjectClass(jStr);\n const jmethodID getBytes = env->GetMethodID(stringClass, \"getBytes\", \"(Ljava/lang/String;)[B\");\n const jbyteArray stringJbytes = (jbyteArray) env->CallObjectMethod(jStr, getBytes, env->NewStringUTF(\"UTF-8\"));\n\n size_t length = (size_t) env->GetArrayLength(stringJbytes);\n jbyte* pBytes = env->GetByteArrayElements(stringJbytes, NULL);\n\n std::string ret = std::string((char *)pBytes, length);\n env->ReleaseByteArrayElements(stringJbytes, pBytes, JNI_ABORT);\n\n env->DeleteLocalRef(stringJbytes);\n env->DeleteLocalRef(stringClass);\n return ret;\n}\n\nstd::string getDeviceId(JNIEnv *env, ANativeActivity *activity)\n{\n jclass classActivity = env->FindClass(\"android/app/NativeActivity\");\n jclass context = env->FindClass(\"android/content/Context\");\n jclass telephony = env->FindClass(\"android/telephony/TelephonyManager\");\n\n jfieldID field = env->GetStaticFieldID(context, \"TELEPHONY_SERVICE\", \"Ljava/lang/String;\");\n jobject staticField = env->GetStaticObjectField(context, field);\n\n jmethodID getSS = env->GetMethodID(classActivity, \"getSystemService\", \"(Ljava/lang/String;)Ljava/lang/Object;\");\n jobject objTel = env->CallObjectMethod(activity->clazz, getSS, staticField);\n jmethodID getId = env->GetMethodID(telephony, \"getDeviceId\", \"()Ljava/lang/String;\");\n jstring strId = (jstring)env->CallObjectMethod(objTel, getId);\n\n env->DeleteLocalRef(classActivity);\n env->DeleteLocalRef(context);\n env->DeleteLocalRef(telephony);\n return jstring2string(env, strId);\n}\n\n#endif\n}\n"
},
{
"path": "app/src/main/cpp/GameKeyData.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/function/GameKeyData.h\"\n\nnamespace is\n{\nGameKeyData::GameKeyData(is::GameDisplay *scene) :\n MainObject(),\n m_keyPausePressed(false),\n m_keyLeftPressed(false),\n m_keyRightPressed(false),\n m_keyUpPressed(false),\n m_keyDownPressed(false),\n m_keyAPressed(false),\n m_keyBPressed(false),\n m_keyAUsed(false),\n m_keyBUsed(false),\n m_keyLeftUsed(false),\n m_keyRightUsed(false),\n m_keyUpUsed(false),\n m_keyDownUsed(false),\n m_disableAllKey(false),\n m_hideGamePad(false),\n#if defined(__ANDROID__)\n m_moveObj(0.f),\n#endif\n m_scene(scene)\n{\n m_strName = \"GameKeyData\";\n\n m_moveKeyPressed = V_KEY_NONE;\n m_actionKeyPressed = V_KEY_NONE;\n m_keyboardA = &is::GameConfig::KEY_A;\n m_keyboardB = &is::GameConfig::KEY_B;\n m_keyboardLeft = &is::GameConfig::KEY_LEFT;\n m_keyboardRight = &is::GameConfig::KEY_RIGHT;\n m_keyboardUp = &is::GameConfig::KEY_UP;\n m_keyboardDown = &is::GameConfig::KEY_DOWN;\n loadResources();\n}\n\nvoid GameKeyData::loadResources(bool usePadColorBlack)\n{\n auto &tex = m_scene->GRMaddTexture(\"game_pad\", is::GameConfig::GUI_DIR + \"game_pad.png\");\n is::createSprite(tex, m_sprJoystick[0], sf::IntRect(0, (!usePadColorBlack) ? 0 : 134, 134, 134), sf::Vector2f(0.f, 0.f), sf::Vector2f(67.f, 67.f));\n is::createSprite(tex, m_sprJoystick[1], sf::IntRect(134, ((!m_scene->getGameSystem().m_permutePadAB) ? 0 : 67) + ((!usePadColorBlack) ? 0 : 134), 144, 67),\n sf::Vector2f(0.f, 0.f), sf::Vector2f(72.f, 37.f));\n is::setSFMLObjSize(m_recJoystickMask[0], 134.f, 134.f);\n is::setSFMLObjSize(m_recJoystickMask[1], 144.f, 74.f);\n\n for (int i(0); i < 2; i++)\n {\n is::setSFMLObjFillColor(m_recJoystickMask[i], sf::Color::Blue);\n is::centerSFMLObj(m_recJoystickMask[i]);\n }\n\n const float OBJ_SIZE(40.f), _ADD_SIZE(24.f), _ADD_ACT_SIZE(24.f), _ADD_W(16.f);\n is::setSFMLObjSize(m_recKeyLeftMask, OBJ_SIZE + _ADD_W, OBJ_SIZE + _ADD_SIZE);\n is::setSFMLObjSize(m_recKeyRightMask, OBJ_SIZE + _ADD_W, OBJ_SIZE + _ADD_SIZE);\n is::setSFMLObjSize(m_recKeyUpMask, OBJ_SIZE + _ADD_SIZE, OBJ_SIZE + _ADD_W);\n is::setSFMLObjSize(m_recKeyDownMask, OBJ_SIZE + _ADD_SIZE, OBJ_SIZE + _ADD_W);\n\n is::setSFMLObjSize(m_recKeyAMask, OBJ_SIZE + _ADD_ACT_SIZE, OBJ_SIZE + _ADD_ACT_SIZE);\n is::setSFMLObjSize(m_recKeyBMask, OBJ_SIZE + _ADD_ACT_SIZE, OBJ_SIZE + _ADD_ACT_SIZE);\n\n is::centerSFMLObj(m_recKeyLeftMask);\n is::centerSFMLObj(m_recKeyRightMask);\n is::centerSFMLObj(m_recKeyUpMask);\n is::centerSFMLObj(m_recKeyDownMask);\n is::centerSFMLObj(m_recKeyAMask);\n is::centerSFMLObj(m_recKeyBMask);\n}\n\nvoid GameKeyData::step(const float &DELTA_TIME)\n{\n if (!keyAPressed()) m_keyAUsed = false;\n if (!keyBPressed()) m_keyBUsed = false;\n if (!keyLeftPressed()) m_keyLeftUsed = false;\n if (!keyRightPressed()) m_keyRightUsed = false;\n if (!keyUpPressed()) m_keyUpUsed = false;\n if (!keyDownPressed()) m_keyDownUsed = false;\n\n m_keyLeftPressed = keyLeftPressed();\n m_keyRightPressed = keyRightPressed();\n m_keyUpPressed = keyUpPressed();\n m_keyDownPressed = keyDownPressed();\n m_keyAPressed = keyAPressed();\n m_keyBPressed = keyBPressed();\n\n if (m_keyLeftPressed)\n {\n m_keyRightPressed = false;\n m_keyUpPressed = false;\n m_keyDownPressed = false;\n if (!IS_ENGINE_MOBILE_OS) m_moveKeyPressed = V_KEY_LEFT;\n }\n else if (m_keyRightPressed)\n {\n m_keyLeftPressed = false;\n m_keyUpPressed = false;\n m_keyDownPressed = false;\n if (!IS_ENGINE_MOBILE_OS) m_moveKeyPressed = V_KEY_RIGHT;\n }\n else if (m_keyUpPressed)\n {\n m_keyLeftPressed = false;\n m_keyRightPressed = false;\n m_keyDownPressed = false;\n if (!IS_ENGINE_MOBILE_OS) m_moveKeyPressed = V_KEY_UP;\n }\n else if (m_keyDownPressed)\n {\n m_keyLeftPressed = false;\n m_keyRightPressed = false;\n m_keyUpPressed = false;\n if (!IS_ENGINE_MOBILE_OS) m_moveKeyPressed = V_KEY_DOWN;\n }\n\nif (is::IS_ENGINE_MOBILE_OS)\n{\n if (m_hideGamePad)\n {\n if (m_moveObj < 320.f) m_moveObj += (10.f * is::VALUE_CONVERSION) * DELTA_TIME;\n }\n else\n {\n is::decreaseVar(DELTA_TIME, m_moveObj, 8.f, 0.f, 10.f);\n }\n float moveMaskOnX(0.f), _LIMIT(-19.f), _POS(37.f);\n const float _W_SIZE(48.f);\n if (m_moveKeyPressed == V_KEY_LEFT) moveMaskOnX = -6.f;\n if (m_moveKeyPressed == V_KEY_RIGHT) moveMaskOnX = 6.f;\n\n is::setSFMLObjX_Y(m_sprJoystick[0],\n m_scene->getViewX() + m_scene->getGameSystem().m_padDirXPos,\n m_scene->getViewY() + m_scene->getGameSystem().m_padDirYPos + m_moveObj);\n is::setSFMLObjX_Y(m_sprJoystick[1],\n m_scene->getViewX() + m_scene->getGameSystem().m_padActionXPos,\n m_scene->getViewY() + m_scene->getGameSystem().m_padActionYPos + m_moveObj);\n\n is::setSFMLObjX_Y(m_recKeyLeftMask, (is::getSFMLObjX(m_sprJoystick[0]) - _W_SIZE / 2.f) + _LIMIT,\n is::getSFMLObjY(m_sprJoystick[0]));\n is::setSFMLObjX_Y(m_recKeyRightMask, (is::getSFMLObjX(m_sprJoystick[0]) + _W_SIZE / 2.f) - _LIMIT,\n is::getSFMLObjY(m_sprJoystick[0]));\n is::setSFMLObjX_Y(m_recKeyUpMask, is::getSFMLObjX(m_sprJoystick[0]),\n (is::getSFMLObjY(m_sprJoystick[0]) - _W_SIZE / 2.f) + _LIMIT);\n is::setSFMLObjX_Y(m_recKeyDownMask, is::getSFMLObjX(m_sprJoystick[0]),\n (is::getSFMLObjY(m_sprJoystick[0]) + _W_SIZE / 2.f) - _LIMIT);\n\n is::setSFMLObjX_Y(m_recKeyAMask, is::getSFMLObjX(m_sprJoystick[1]) + (_POS * ((!m_scene->getGameSystem().m_permutePadAB) ? -1.f : 1.f)),\n is::getSFMLObjY(m_sprJoystick[1]));\n is::setSFMLObjX_Y(m_recKeyBMask, is::getSFMLObjX(m_sprJoystick[1]) + (_POS * ((!m_scene->getGameSystem().m_permutePadAB) ? 1.f : -1.f)),\n is::getSFMLObjY(m_sprJoystick[1]));\n\n for (int i(0); i < 2; i++)\n {\n is::setSFMLObjX_Y(m_recJoystickMask[i], is::getSFMLObjX(m_sprJoystick[i]) + ((i == 0) ? moveMaskOnX : 0.f), is::getSFMLObjY(m_sprJoystick[i]));\n is::setSFMLObjAlpha(m_sprJoystick[i], m_scene->getGameSystem().m_padAlpha);\n }\n}\nelse\n{\n if (m_keyAPressed) m_actionKeyPressed = V_KEY_A;\n else if (m_keyBPressed) m_actionKeyPressed = V_KEY_B;\n else m_actionKeyPressed = V_KEY_NONE;\n if (!m_keyLeftPressed && !m_keyRightPressed && !m_keyUpPressed && !m_keyDownPressed) m_moveKeyPressed = V_KEY_NONE;\n}\n}\n\nvoid GameKeyData::draw(is::Render &surface)\n{\nif (is::IS_ENGINE_MOBILE_OS)\n{\n if (m_moveObj < 320.f)\n {\n /*\n * This displays the virtual key mask on the screen\n *\n for (int i(0); i < 2; i++) surface.draw(m_recJoystickMask[i]);\n surface.draw(m_recKeyLeftMask);\n surface.draw(m_recKeyRightMask);\n surface.draw(m_recKeyUpMask);\n surface.draw(m_recKeyDownMask);\n surface.draw(m_recKeyAMask);\n surface.draw(m_recKeyBMask);\n */\n for (int i(0); i < 2; i++)\n {\n if (m_scene->getIsPlaying()) surface.draw(m_sprJoystick[i]);\n }\n }\n}\n}\n\nbool GameKeyData::checkKeyPressed(VirtualKeyIndex virtualKeyIndex, sf::Keyboard::Key *keyboardIndex)\n{\n if (m_disableAllKey) return false;\n\n //////////////////////////////////////////////////////////\n // Mobile version code\n//if (is::IS_ENGINE_MOBILE_OS)\n//{\n if (virtualKeyPressed(virtualKeyIndex)) return true;\n//}\nelse\n//{\n if (m_scene->getGameSystem().keyIsPressed(*keyboardIndex)) return true;\n//}\n //////////////////////////////////////////////////////////\n return false;\n}\n\nbool GameKeyData::keyLeftPressed()\n{\n return checkKeyPressed(V_KEY_LEFT, m_keyboardLeft);\n}\n\nbool GameKeyData::keyRightPressed()\n{\n return checkKeyPressed(V_KEY_RIGHT, m_keyboardRight);\n}\n\nbool GameKeyData::keyUpPressed()\n{\n return checkKeyPressed(V_KEY_UP, m_keyboardUp);\n}\n\nbool GameKeyData::keyDownPressed()\n{\n return checkKeyPressed(V_KEY_DOWN, m_keyboardDown);\n}\n\nbool GameKeyData::keyAPressed()\n{\n return checkKeyPressed(V_KEY_A, m_keyboardA);\n}\n\nbool GameKeyData::keyBPressed()\n{\n return checkKeyPressed(V_KEY_B, m_keyboardB);\n}\n\nbool GameKeyData::virtualKeyPressed(VirtualKeyIndex virtualKeyIndex)\n{\n // Joystick controller\n bool mouseOnLJoystick(false);\n bool mouseOnRJoystick(false);\n\n if (virtualKeyIndex == V_KEY_LEFT || virtualKeyIndex == V_KEY_RIGHT || virtualKeyIndex == V_KEY_UP || virtualKeyIndex == V_KEY_DOWN)\n {\n // Check collision with left joystick\n if (m_scene->mouseCollision(m_recJoystickMask[0]) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recJoystickMask[0], 1))) mouseOnLJoystick = true;\n\n if (mouseOnLJoystick)\n {\n if (m_moveKeyPressed != V_KEY_NONE && m_moveKeyPressed != virtualKeyIndex)\n {\n if (m_scene->mouseCollision(m_recKeyLeftMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyLeftMask, 1))) m_moveKeyPressed = V_KEY_LEFT;\n else if (m_scene->mouseCollision(m_recKeyRightMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyRightMask, 1))) m_moveKeyPressed = V_KEY_RIGHT;\n else if (m_scene->mouseCollision(m_recKeyUpMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyUpMask, 1))) m_moveKeyPressed = V_KEY_UP;\n else if (m_scene->mouseCollision(m_recKeyDownMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyDownMask, 1))) m_moveKeyPressed = V_KEY_DOWN;\n }\n\n switch (m_moveKeyPressed)\n {\n case V_KEY_LEFT:\n return (m_moveKeyPressed == virtualKeyIndex);\n break;\n case V_KEY_RIGHT:\n return (m_moveKeyPressed == virtualKeyIndex);\n break;\n case V_KEY_UP:\n return (m_moveKeyPressed == virtualKeyIndex);\n break;\n case V_KEY_DOWN:\n return (m_moveKeyPressed == virtualKeyIndex);\n break;\n\n default: break;\n }\n }\n\n // If left joystick pressed\n if ((m_scene->getGameSystem().isPressed() ||\n (IS_ENGINE_MOBILE_OS && m_scene->getGameSystem().isPressed(1))) && mouseOnLJoystick)\n {\n switch (virtualKeyIndex)\n {\n case V_KEY_LEFT:\n if (m_scene->mouseCollision(m_recKeyLeftMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyLeftMask, 1)))\n {\n m_moveKeyPressed = V_KEY_LEFT;\n // is::showLog(\"L Pressed !\");\n return true;\n }\n break;\n case V_KEY_RIGHT:\n if (m_scene->mouseCollision(m_recKeyRightMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyRightMask, 1)))\n {\n m_moveKeyPressed = V_KEY_RIGHT;\n // is::showLog(\"R Pressed !\");\n return true;\n }\n break;\n case V_KEY_UP:\n if (m_scene->mouseCollision(m_recKeyUpMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyUpMask, 1)))\n {\n m_moveKeyPressed = V_KEY_UP;\n // is::showLog(\"U Pressed !\");\n return true;\n }\n break;\n case V_KEY_DOWN:\n if (m_scene->mouseCollision(m_recKeyDownMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyDownMask, 1)))\n {\n m_moveKeyPressed = V_KEY_DOWN;\n // is::showLog(\"D Pressed !\");\n return true;\n }\n break;\n\n default: break;\n }\n\n }\n m_moveKeyPressed = V_KEY_NONE;\n }\n\n if (virtualKeyIndex == V_KEY_A || virtualKeyIndex == V_KEY_B)\n {\n // Check collision with right joystick\n if (m_scene->mouseCollision(m_recJoystickMask[1]) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recJoystickMask[1], 1))) mouseOnRJoystick = true;\n\n // If left joystick pressed\n if ((m_scene->getGameSystem().isPressed() ||\n (IS_ENGINE_MOBILE_OS && m_scene->getGameSystem().isPressed(1))) && mouseOnRJoystick)\n {\n switch (virtualKeyIndex)\n {\n case V_KEY_A:\n if (m_scene->mouseCollision(m_recKeyAMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyAMask, 1)))\n {\n m_actionKeyPressed = V_KEY_A;\n // is::showLog(\"A Pressed !\");\n return true;\n }\n break;\n\n case V_KEY_B:\n if (m_scene->mouseCollision(m_recKeyBMask) ||\n (IS_ENGINE_MOBILE_OS && m_scene->mouseCollision(m_recKeyBMask, 1)))\n {\n m_actionKeyPressed = V_KEY_B;\n // is::showLog(\"B Pressed !\");\n return true;\n }\n break;\n\n default: break;\n }\n }\n m_actionKeyPressed = V_KEY_NONE;\n }\n return false;\n}\n};\n"
},
{
"path": "app/src/main/cpp/GameSlider.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/function/GameSlider.h\"\n\nnamespace is\n{\nGameSlider::GameSlider(is::GameDisplay *scene):\n MainObject(),\n Type(SLIDE_NONE),\n m_scene(scene),\n m_slideDistance(64.f)\n{\n m_strName = \"GameSlider\";\n #if defined(IS_ENGINE_USE_SDM)\n m_depth = 999999999; // will update this object before all others\n #endif\n}\n\nvoid GameSlider::step(const float &DELTA_TIME)\n{\n if (m_scene->getGameSystem().isPressed(is::GameSystem::MOUSE))\n {\n sf::Vector2f cursor(m_scene->getCursor());\n if (static_cast(m_time) == 0)\n {\n m_xStart = cursor.x;\n m_yStart = cursor.y;\n }\n m_time = 5.f;\n m_x = cursor.x;\n m_y = cursor.y;\n if (m_type == SLIDE_NONE)\n {\n if (m_x > m_xStart + m_slideDistance) m_type = SLIDE_RIGHT;\n else if (m_x < m_xStart - m_slideDistance) m_type = SLIDE_LEFT;\n else if (m_y < m_yStart - m_slideDistance) m_type = SLIDE_UP;\n else if (m_y > m_yStart + m_slideDistance) m_type = SLIDE_DOWN;\n }\n }\n if (m_time > 0.f) m_time -= is::getMSecond(DELTA_TIME);\n else\n {\n m_type = SLIDE_NONE;\n m_time = 0.f;\n }\n}\n\nGameSlider::SlideDirection GameSlider::getSlideDirection() const\n{\n switch (m_type)\n {\n default: break;\n case 1: return SLIDE_UP; break;\n case 2: return SLIDE_DOWN; break;\n case 3: return SLIDE_RIGHT; break;\n case 4: return SLIDE_LEFT; break;\n }\n return SLIDE_NONE;\n}\n}\n"
},
{
"path": "app/src/main/cpp/GameSystem.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/function/GameSystem.h\"\n\nnamespace is\n{\nconst short MOUSE = 0;\nconst short KEYBOARD = -1;\nconst short ALL_BUTTONS = -2;\n\nGameSystem::GameSystem(sf::RenderWindow &window):\n m_window(window)\n{\n srand((unsigned int)time(0));\n m_gameLanguage = 0; // 0 = default language\n m_validationMouseKey = &GameConfig::KEY_VALIDATION_MOUSE;\n m_validationKeyboardKey = &GameConfig::KEY_VALIDATION_KEYBOARD;\n m_disableKey = false;\n m_enableSound = true;\n m_enableMusic = true;\n m_enableVibrate = true;\n m_loadParentResources = false;\n m_keyIsPressed = false;\n}\n\nbool GameSystem::isPressed(int finger) const\n{\n if (m_disableKey) return false;\n //////////////////////////////////////////////////////////\n // Android version code\nif (is::IS_ENGINE_MOBILE_OS)\n{\n // Exclude the keyboard test when we are on Android\n if (finger == -1) return false;\n\n // When testing the mouse validation buttons on PC then consider it as a touch\n if (finger == -2) finger = 0;\n if (sf::Touch::isDown(finger)) return true;\n}\nelse\n{\n //////////////////////////////////////////////////////////\n switch (finger)\n {\n case MOUSE:\n if (sf::Mouse::isButtonPressed(*m_validationMouseKey)) return true;\n break;\n case KEYBOARD:\n if (sf::Keyboard::isKeyPressed(*m_validationKeyboardKey)) return true;\n break;\n case ALL_BUTTONS:\n if (sf::Mouse::isButtonPressed(*m_validationMouseKey)) return true;\n else if (sf::Keyboard::isKeyPressed(*m_validationKeyboardKey)) return true;\n break;\n }\n}\n return false;\n}\n\nbool GameSystem::isPressed(ValidationButton validationButton) const\n{\n int value = validationButton;\n return isPressed(value);\n}\n\nbool GameSystem::keyIsPressed(sf::Keyboard::Key key) const\n{\n if (m_disableKey) return false;\n#ifdef __SWITCH__\n const Uint8 *state = getControllerButtonState(NULL);\n\n if (key == is::GameConfig::KEY_VALIDATION_KEYBOARD)\n {if (state[SDL_CONTROLLER_BUTTON_START]) return true;}\n if (key == is::GameConfig::KEY_CANCEL)\n {if (state[SDL_CONTROLLER_BUTTON_BACK]) return true;}\n if (key == is::GameConfig::KEY_A)\n {if (state[SDL_CONTROLLER_BUTTON_A]) return true;}\n if (key == is::GameConfig::KEY_B)\n {if (state[SDL_CONTROLLER_BUTTON_B]) return true;}\n if (key == is::GameConfig::KEY_X)\n {if (state[SDL_CONTROLLER_BUTTON_X]) return true;}\n if (key == is::GameConfig::KEY_Y)\n {if (state[SDL_CONTROLLER_BUTTON_Y]) return true;}\n if (key == is::GameConfig::KEY_LEFT)\n {if (state[SDL_CONTROLLER_BUTTON_DPAD_LEFT]) return true;}\n if (key == is::GameConfig::KEY_RIGHT)\n {if (state[SDL_CONTROLLER_BUTTON_DPAD_RIGHT]) return true;}\n if (key == is::GameConfig::KEY_UP)\n {if (state[SDL_CONTROLLER_BUTTON_DPAD_UP]) return true;}\n if (key == is::GameConfig::KEY_DOWN)\n {if (state[SDL_CONTROLLER_BUTTON_DPAD_DOWN]) return true;}\n return false;\n#endif\n if (sf::Keyboard::isKeyPressed(key)) return true;\n return false;\n}\n\nbool GameSystem::keyIsPressed(sf::Mouse::Button button) const\n{\n if (m_disableKey) return false;\n if (sf::Mouse::isButtonPressed(button)) return true;\n return false;\n}\n\nbool GameSystem::fileExist(const std::string &fileName)\n{\n return is::fileExist(fileName);\n}\n\nvoid GameSystem::removeFile(const std::string &fileName)\n{\n remove(fileName.c_str());\n#if defined(IS_ENGINE_HTML_5)\n EM_ASM(FS.syncfs(false, function(err){console.log(err)});, 0);\n#endif\n}\n\nvoid GameSystem::playSound(sf::Sound &obj)\n{\n if (m_enableSound) is::playSFMLSnd(obj);\n}\n\nvoid GameSystem::playSound(sf::Sound *obj)\n{\n if (m_enableSound) is::playSFMLSnd(obj);\n}\n\nvoid GameSystem::playMusic(sf::Music &obj)\n{\n if (m_enableMusic) is::playSFMLSnd(obj);\n}\n\nvoid GameSystem::playMusic(sf::Music *obj)\n{\n if (m_enableMusic) is::playSFMLSnd(obj);\n}\n\nvoid GameSystem::stopSound(sf::Sound &obj)\n{\n if (m_enableSound)\n {\n if (is::checkSFMLSndState(obj, SFMLSndStatus::Playing)) is::stopSFMLSnd(obj);\n }\n}\n\nvoid GameSystem::stopMusic(sf::Music &obj)\n{\n if (m_enableMusic)\n {\n if (is::checkSFMLSndState(obj, SFMLSndStatus::Playing)) is::stopSFMLSnd(obj);\n }\n}\n\nvoid GameSystem::useVibrate(short ms)\n{\n if (m_enableVibrate) is::vibrate(ms);\n}\n\nvoid GameSystem::saveConfig(const std::string &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"wb\");\n\n if (file != NULL)\n {\n fwrite(&m_enableSound, sizeof(bool), 1, file);\n fwrite(&m_enableMusic, sizeof(bool), 1, file);\n fwrite(&m_enableVibrate, sizeof(bool), 1, file);\n fwrite(&m_gameLanguage, sizeof(int), 1, file);\n fwrite(&m_firstLaunch, sizeof(bool), 1, file);\n fclose(file);\n#if defined(IS_ENGINE_HTML_5)\n EM_ASM(FS.syncfs(false, function(err){console.log(err)});, 0);\n#endif\n }\n}\n\nvoid GameSystem::loadConfig(const std::string &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"rb\");\n\n if (file != NULL)\n {\n fread(&m_enableSound, sizeof(bool), 1, file);\n fread(&m_enableMusic, sizeof(bool), 1, file);\n fread(&m_enableVibrate, sizeof(bool), 1, file);\n fread(&m_gameLanguage, sizeof(int), 1, file);\n fread(&m_firstLaunch, sizeof(bool), 1, file);\n fclose(file);\n }\n}\n\nvoid GameSystem::savePadConfig(const std::string &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"wb\");\n\n if (file != NULL)\n {\n fwrite(&m_padDirXPos, sizeof(float), 1, file);\n fwrite(&m_padDirYPos, sizeof(float), 1, file);\n fwrite(&m_padActionXPos, sizeof(float), 1, file);\n fwrite(&m_padActionYPos, sizeof(float), 1, file);\n fwrite(&m_padAlpha, sizeof(int), 1, file);\n fwrite(&m_permutePadAB, sizeof(bool), 1, file);\n fclose(file);\n#if defined(IS_ENGINE_HTML_5)\n EM_ASM(FS.syncfs(false, function(err){console.log(err)});, 0);\n#endif\n }\n}\n\nvoid GameSystem::loadPadConfig(const std::string &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"rb\");\n\n if (file != NULL)\n {\n fread(&m_padDirXPos, sizeof(float), 1, file);\n fread(&m_padDirYPos, sizeof(float), 1, file);\n fread(&m_padActionXPos, sizeof(float), 1, file);\n fread(&m_padActionYPos, sizeof(float), 1, file);\n fread(&m_padAlpha, sizeof(int), 1, file);\n fread(&m_permutePadAB, sizeof(bool), 1, file);\n fclose(file);\n }\n}\n\nvoid GSMplaySound(const std::string& name, std::vector> &GSMsound, GameSystem &gameSystem)\n{\n bool soundExist(false);\n WITH(GSMsound.size())\n {\n if (GSMsound[_I].get() != nullptr)\n {\n if (GSMsound[_I]->getName() == name)\n {\n soundExist = true;\n if (GSMsound[_I]->getFileIsLoaded()) gameSystem.playSound(GSMsound[_I]->getSound());\n else is::showLog(\"ERROR: Can't play <\" + name + \"> sound!\");\n break;\n }\n }\n }\n if (!soundExist) is::showLog(\"ERROR: Can't play <\" + name + \"> sound because sound does not exist!\");\n}\n\nvoid GSMplayMusic(const std::string& name, std::vector> &GSMmusic, GameSystem &gameSystem)\n{\n//#if defined(__ANDROID__)\n// GSMplaySound(name, GSMmusic, gameSystem);\n//#else\n bool musicExist(false);\n WITH(GSMmusic.size())\n {\n if (GSMmusic[_I].get() != nullptr)\n {\n if (GSMmusic[_I]->getName() == name)\n {\n musicExist = true;\n if (GSMmusic[_I]->getFileIsLoaded()) gameSystem.playMusic(GSMmusic[_I]->getMusic());\n else is::showLog(\"ERROR: Can't play <\" + name + \"> music!\");\n break;\n }\n }\n }\n if (!musicExist) is::showLog(\"ERROR: Can't play <\" + name + \"> music because music does not exist!\");\n//#endif\n}\n}\n"
},
{
"path": "app/src/main/cpp/GameSystemExtended.cpp",
"content": "#include \"app_src/gamesystem_ext/GameSystemExtended.h\"\n\nnamespace is\n{\nGameSystemExtended::GameSystemExtended(sf::RenderWindow &window) :\n GameSystem(window)\n{\n initProgress();\n\n // Default position of the Virtual Pad Game on the screen\n m_defaultPadDirXPos = -250.f;\n m_defaultPadDirYPos = 170.f;\n m_defaultPadActionXPos = 245.f;\n m_defaultPadActionYPos = 200.f;\n\n // Configurable position of the Virtual Pad Game on the screen\n m_padDirXPos = m_defaultPadDirXPos;\n m_padDirYPos = m_defaultPadDirYPos;\n m_padActionXPos = m_defaultPadActionXPos;\n m_padActionYPos = m_defaultPadActionYPos;\n m_permutePadAB = false;\n m_padAlpha = 255;\n}\n\nvoid GameSystemExtended::initProgress()\n{\n m_gameProgression = 0; // LEVEL 1\n m_currentLives = 3;\n m_currentBonus = 0;\n m_currentLevel = 0;\n m_currentScore = 0;\n m_currentHiScore = 0;\n}\n\nvoid GameSystemExtended::initSystemData()\n{\n // global variable\n m_gameLanguage = 0;\n m_firstLaunch = true;\n\n // Determine the number of levels\n // LEVEL_MAX - 1 because we count the number of levels from zero (0) as for the array)\n m_levelNumber = is::level::LevelId::LEVEL_MAX - 1;\n\n initProgress();\n}\n\nvoid GameSystemExtended::initData(bool clearCurrentLevel)\n{\n if (clearCurrentLevel) m_currentLevel = 0; // LEVEL 1\n m_currentLives = 3;\n m_currentBonus = 0;\n m_currentScore = 0;\n}\n\nvoid GameSystemExtended::saveData(std::string const &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"wb\");\n\n if (file != NULL)\n {\n fwrite(&m_gameProgression, sizeof(int), 1, file);\n fwrite(&m_currentLives, sizeof(int), 1, file);\n fwrite(&m_currentBonus, sizeof(int), 1, file);\n fwrite(&m_currentHiScore, sizeof(int), 1, file);\n fclose(file);\n#if defined(IS_ENGINE_HTML_5)\n EM_ASM(FS.syncfs(false, function(err){console.log(err)});, 0);\n#endif\n }\n}\n\nvoid GameSystemExtended::loadData(std::string const &fileName)\n{\n FILE *file = NULL;\n //file = fopen(fileName.c_str(), \"rb\");\n\n if (file != NULL)\n {\n fread(&m_gameProgression, sizeof(int), 1, file);\n fread(&m_currentLives, sizeof(int), 1, file);\n fread(&m_currentBonus, sizeof(int), 1, file);\n fread(&m_currentHiScore, sizeof(int), 1, file);\n fclose(file);\n }\n}\n}\n"
},
{
"path": "app/src/main/cpp/GameTime.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/function/GameFunction.h\"\n#include \"isEngine/system/function/GameTime.h\"\n\nnamespace is\n{\nGameTime::GameTime():\n m_minute(0),\n m_second(0),\n m_mSecond(0)\n{\n}\n\nGameTime::GameTime(unsigned int ms):\n m_minute(0),\n m_second(0),\n m_mSecond(0)\n{\n m_mSecond = ms;\n m_second += m_mSecond / 60;\n m_minute += m_second / 60;\n\n m_mSecond %= 60;\n m_second %= 60;\n}\n\nGameTime::GameTime(unsigned int m, unsigned int s, unsigned int ms):\n m_minute(m),\n m_second(s),\n m_mSecond(ms)\n{\n}\n\nGameTime::~GameTime()\n{\n}\n\nvoid GameTime::step(const float &DELTA_TIME)\n{\n if (m_mSecond > 0) m_mSecond -= static_cast((is::VALUE_CONVERSION * is::VALUE_TIME) * DELTA_TIME);\n else\n {\n if (m_second == 0)\n {\n if (m_minute > 0)\n {\n m_second = 59;\n m_mSecond = 59;\n m_minute--;\n }\n }\n else\n {\n m_second--;\n m_mSecond = 59;\n }\n }\n}\n\nvoid GameTime::addTimeValue(int m, int s, int ms)\n{\n m_minute += m;\n m_second += s;\n if (m_second > 59)\n {\n m_minute++;\n m_second = m_second - 59;\n }\n m_mSecond += ms;\n}\n\nvoid GameTime::setTimeValue(int m, int s, int ms)\n{\n m_minute = m;\n m_second = s;\n m_mSecond = ms;\n}\n\nvoid GameTime::setMSecond(int ms)\n{\n m_second = 0;\n m_minute = 0;\n m_mSecond = ms;\n m_second += m_mSecond / 60;\n m_minute += m_second / 60;\n\n m_mSecond %= 60;\n m_second %= 60;\n}\n\nGameTime& GameTime::operator=(GameTime const &t)\n{\n m_minute = t.m_minute;\n m_second = t.m_second;\n m_mSecond = t.m_mSecond;\n return *this;\n}\n\nunsigned int GameTime::getTimeValue() const\n{\n return ((m_minute * 3600) + (m_second * 60) + m_mSecond);\n}\n\nunsigned int GameTime::getMinute() const\n{\n return m_minute;\n}\n\nunsigned int GameTime::getSecond() const\n{\n return m_second;\n}\n\nunsigned int GameTime::getMSecond() const\n{\n return m_mSecond;\n}\n\nbool GameTime::compareTime(unsigned int m, unsigned int s, unsigned int ms) const\n{\n return (((m * 3600) + (s * 60) + ms) >= getTimeValue());\n}\n\nconst std::string GameTime::getTimeString() const noexcept\n{\n std::string str;\n str = writeZero(m_minute) + \":\" + writeZero(m_second) + \".\" + writeZero(m_mSecond);\n return str;\n}\n\nbool operator==(GameTime const &t1, GameTime const &t2)\n{\n return (t1.getTimeValue() == t2.getTimeValue());\n}\n\nbool operator>(GameTime const &t1, GameTime const &t2)\n{\n return (t1.getTimeValue() > t2.getTimeValue());\n}\n\nbool operator<(GameTime const &t1, GameTime const &t2)\n{\n return (t1.getTimeValue() < t2.getTimeValue());\n}\n\nstd::ostream& operator<<(std::ostream &flux, GameTime const &t)\n{\n flux <<\n t.m_minute << \"m \" <<\n t.m_second << \"s \" <<\n t.m_mSecond << \"ms\" <<\n std::endl;\n return flux;\n}\n}\n"
},
{
"path": "app/src/main/cpp/Main.hpp",
"content": "#ifndef MAIN_HPP\n#define MAIN_HPP\n\n#ifdef __APPLE__\n\t#include \"vscode/MacOS/MacHelper.hpp\"\n\tMacHelper macHelper;\n#endif // __APPLE__\n\n#ifdef __linux__\n\t#include \"vscode/Linux/LinuxHelper.hpp\"\n\tLinuxHelper linuxHelper;\n#endif // __linux__\n\n#ifdef _WIN32\n\t#include \"vscode/Win32/WindowsHelper.hpp\"\n\tWindowsHelper windowsHelper;\n#endif // _WIN32\n\n//\n\n#endif // MAIN_HPP\n"
},
{
"path": "app/src/main/cpp/MainObject.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/entity/MainObject.h\"\n\nnamespace is\n{\nint MainObject::instanceNumber = 0;\n\nMainObject::MainObject():\n Name(),\n#if defined(IS_ENGINE_USE_SDM)\n Destructible(),\n DepthObject(DepthObject::NORMAL_DEPTH),\n Visibility(),\n#endif\n m_x(0.f),\n m_y(0.f),\n m_xStart(0.f),\n m_yStart(0.f),\n m_xPrevious(m_x),\n m_yPrevious(m_y),\n m_speed(0.f),\n m_hsp(0.f),\n m_vsp(0.f),\n m_frameStart(0.f),\n m_frameEnd(0.f),\n m_frame(0.f),\n m_imageXscale(1.f),\n m_imageYscale(1.f),\n m_imageScale(1.f),\n m_imageAngle(0.f),\n m_xOffset(0.f),\n m_yOffset(0.f),\n m_time(0.f),\n m_w(32),\n m_h(32),\n m_imageAlpha(255),\n m_imageIndex(0),\n m_isActive(false),\n m_isSDMSprite(false),\n m_drawMask(false)\n{\n updateCollisionMask();\n instanceNumber++;\n m_instanceId = instanceNumber;\n}\n\nMainObject::MainObject(float x, float y):\n Name(),\n#if defined(IS_ENGINE_USE_SDM)\n Destructible(),\n DepthObject(DepthObject::NORMAL_DEPTH),\n Visibility(),\n#endif\n m_x(x),\n m_y(y),\n m_xStart(x),\n m_yStart(y),\n m_xPrevious(m_x),\n m_yPrevious(m_y),\n m_speed(0.f),\n m_hsp(0.f),\n m_vsp(0.f),\n m_frameStart(0.f),\n m_frameEnd(0.f),\n m_frame(0.f),\n m_imageXscale(1.f),\n m_imageYscale(1.f),\n m_imageScale(1.f),\n m_imageAngle(0.f),\n m_xOffset(0.f),\n m_yOffset(0.f),\n m_time(0.f),\n m_w(32),\n m_h(32),\n m_imageAlpha(255),\n m_imageIndex(0),\n m_isActive(false),\n m_isSDMSprite(false),\n m_drawMask(false)\n{\n updateCollisionMask();\n instanceNumber++;\n m_instanceId = instanceNumber;\n}\n\nMainObject::MainObject(sf::Sprite &spr, float x, float y):\n Name(),\n#if defined(IS_ENGINE_USE_SDM)\n Destructible(),\n DepthObject(DepthObject::NORMAL_DEPTH),\n Visibility(),\n#endif\n m_x((static_cast(x) == 0) ? x : spr.getPosition().x),\n m_y((static_cast(y) == 0) ? y : spr.getPosition().y),\n m_xStart(m_x),\n m_yStart(m_y),\n m_xPrevious(m_x),\n m_yPrevious(m_y),\n m_speed(0.f),\n m_hsp(0.f),\n m_vsp(0.f),\n m_frameStart(0.f),\n m_frameEnd(0.f),\n m_frame(0.f),\n m_imageXscale(1.f),\n m_imageYscale(1.f),\n m_imageScale(1.f),\n m_imageAngle(0.f),\n m_xOffset(0.f),\n m_yOffset(0.f),\n m_time(0.f),\n m_w(32),\n m_h(32),\n m_imageAlpha(255),\n m_imageIndex(0),\n m_isActive(false),\n m_isSDMSprite(true),\n m_drawMask(false),\n m_sprParent(spr)\n{\n#if defined(IS_ENGINE_USE_SDM)\n m_SDMcallStep = false;\n m_SDMcallEvent = false;\n#endif\n setRectangleMask(spr.getTexture()->getSize().x, spr.getTexture()->getSize().y);\n updateCollisionMask();\n updateSprite();\n instanceNumber++;\n m_instanceId = instanceNumber;\n}\n\nMainObject::MainObject(sf::Texture &tex, float x, float y, bool center):\n Name(),\n#if defined(IS_ENGINE_USE_SDM)\n Destructible(),\n DepthObject(DepthObject::NORMAL_DEPTH),\n#endif\n m_x(x),\n m_y(y),\n m_xStart(m_x),\n m_yStart(m_y),\n m_xPrevious(m_x),\n m_yPrevious(m_y),\n m_speed(0.f),\n m_hsp(0.f),\n m_vsp(0.f),\n m_frameStart(0.f),\n m_frameEnd(0.f),\n m_frame(0.f),\n m_imageXscale(1.f),\n m_imageYscale(1.f),\n m_imageScale(1.f),\n m_imageAngle(0.f),\n m_xOffset(0.f),\n m_yOffset(0.f),\n m_time(0.f),\n m_w(32),\n m_h(32),\n m_imageAlpha(255),\n m_imageIndex(0),\n m_isActive(false),\n m_isSDMSprite(true),\n m_drawMask(false)\n{\n m_centerSpr = center;\n#if defined(IS_ENGINE_USE_SDM)\n m_SDMcallStep = false;\n m_SDMcallEvent = false;\n#endif\n setRectangleMask(tex.getSize().x, tex.getSize().y);\n is::createSprite(tex, m_sprParent, sf::Vector2f(m_x, m_y), sf::Vector2f(0.f, 0.f));\n if (!m_centerSpr) updateCollisionMask();\n else\n {\n is::centerSFMLObj(m_sprParent);\n centerCollisionMask(m_x, m_y);\n }\n updateSprite();\n instanceNumber++;\n m_instanceId = instanceNumber;\n}\n\nMainObject::~MainObject()\n{\n instanceNumber--;\n}\n\nvoid MainObject::setPosition(float x, float y)\n{\n m_xPrevious = m_x;\n m_yPrevious = m_y;\n m_x = x;\n m_y = y;\n updateSDMsprite();\n}\n\nvoid MainObject::setSpriteScale(float x, float y)\n{\n is::setSFMLObjScaleX_Y(m_sprParent, x, y);\n}\n\nvoid MainObject::setXStart(float x)\n{\n m_xStart = x;\n}\n\nvoid MainObject::setYStart(float y)\n{\n m_yStart = y;\n}\n\nvoid MainObject::setXPrevious(float x)\n{\n m_xPrevious = x;\n}\n\nvoid MainObject::setYPrevious(float y)\n{\n m_yPrevious = y;\n}\n\nvoid MainObject::setStartPosition(float x, float y)\n{\n m_xStart = x;\n m_yStart = y;\n}\n\nvoid MainObject::setX(float x)\n{\n setPosition(x, m_y);\n}\n\nvoid MainObject::setY(float y)\n{\n setPosition(m_x, y);\n}\n\nvoid MainObject::moveX(float x)\n{\n setPosition(m_x + x, m_y);\n}\n\nvoid MainObject::moveY(float y)\n{\n setPosition(m_x, m_y + y);\n}\n\nvoid MainObject::setSpeed(float val)\n{\n m_speed = val;\n}\n\nvoid MainObject::setHsp(float val)\n{\n m_hsp = val;\n}\n\nvoid MainObject::setVsp(float val)\n{\n m_vsp = val;\n}\n\nvoid MainObject::setAngularMove(const float &DELTA_TIME, float speed, float angle)\n{\n m_x += (is::lengthDirX(speed, angle) * is::VALUE_CONVERSION) * DELTA_TIME;\n m_y -= (is::lengthDirY(speed, angle) * is::VALUE_CONVERSION) * DELTA_TIME;\n updateSDMsprite();\n}\n\nvoid MainObject::setFrame(float val)\n{\n m_frame = val;\n}\n\nvoid MainObject::setFrameStart(float val)\n{\n m_frameStart = val;\n}\n\nvoid MainObject::setFrameEnd(float val)\n{\n m_frameEnd = val;\n}\n\nvoid MainObject::setImageXscale(float val)\n{\n setImageScaleX_Y(val, m_imageYscale);\n}\n\nvoid MainObject::setImageYscale(float val)\n{\n setImageScaleX_Y(m_imageXscale, val);\n}\n\nvoid MainObject::setImageScale(float val, bool updateXYscale)\n{\n m_imageScale = val;\n if (updateXYscale) setImageScaleX_Y(m_imageScale, m_imageScale);\n}\n\nvoid MainObject::setImageAngle(float val)\n{\n m_imageAngle = val;\n updateSDMsprite();\n}\n\nvoid MainObject::setXOffset(float val)\n{\n setXYOffset(val, m_xOffset);\n}\n\nvoid MainObject::setYOffset(float val)\n{\n setXYOffset(m_xOffset, val);\n}\n\nvoid MainObject::setXYOffset(float x, float y)\n{\n m_xOffset = x;\n m_yOffset = y;\n updateSDMsprite();\n}\n\nvoid MainObject::setXYOffset()\n{\n setXYOffset(is::getSFMLObjOriginX(m_sprParent), is::getSFMLObjOriginY(m_sprParent));\n}\n\nvoid MainObject::setImageScaleX_Y(float x, float y)\n{\n m_imageXscale = x;\n m_imageYscale = y;\n updateSDMsprite();\n}\n\nvoid MainObject::setTime(float x)\n{\n m_time = x;\n}\n\nvoid MainObject::setImageAlpha(int val)\n{\n m_imageAlpha = val;\n updateSDMsprite();\n}\n\nvoid MainObject::setImageIndex(int val)\n{\n m_imageIndex = val;\n}\n\nvoid MainObject::setMaskW(int val)\n{\n m_w = val;\n}\n\nvoid MainObject::setMaskH(int val)\n{\n m_h = val;\n}\n\nvoid MainObject::setRectangleMask(int width, int height)\n{\n m_w = width;\n m_h = height;\n m_circle.m_raduis = 0.f;\n updateCollisionMask();\n}\n\nvoid MainObject::setCircleMask(float raduis)\n{\n m_circle.m_raduis = raduis;\n m_w = 0;\n m_h = 0;\n updateCollisionMask();\n}\n\nvoid MainObject::setIsActive(bool val)\n{\n m_isActive = val;\n}\n\nvoid MainObject::updateCollisionMask()\n{\n if (m_w > 0 && m_h > 0)\n {\n m_aabb.m_left = static_cast(m_x);\n m_aabb.m_top = static_cast(m_y);\n m_aabb.m_right = static_cast(m_x) + m_w;\n m_aabb.m_bottom = static_cast(m_y) + m_h;\n }\n else {m_circle.m_x = m_x; m_circle.m_y = m_y;}\n}\n\nvoid MainObject::updateCollisionMask(int x, int y)\n{\n if (m_w > 0 && m_h > 0)\n {\n m_aabb.m_left = static_cast(x);\n m_aabb.m_top = static_cast(y);\n m_aabb.m_right = static_cast(x) + m_w;\n m_aabb.m_bottom = static_cast(y) + m_h;\n }\n else {m_circle.m_x = x; m_circle.m_y = y;}\n}\n\nvoid MainObject::centerCollisionMask(int x, int y)\n{\n if (m_w > 0 && m_h > 0)\n {\n m_aabb.m_left = static_cast(x - m_w / 2.f);\n m_aabb.m_top = static_cast(y - m_h / 2.f);\n m_aabb.m_right = static_cast(x + m_w / 2.f);\n m_aabb.m_bottom = static_cast(y + m_h / 2.f);\n }\n else {m_circle.m_x = x; m_circle.m_y = y;}\n}\n\nvoid MainObject::updateSprite()\n{\n is::setSFMLObjAlpha(m_sprParent, m_imageAlpha);\n is::setSFMLObjAngle(m_sprParent, m_imageAngle);\n is::setSFMLObjScaleX_Y(m_sprParent, m_imageXscale, m_imageYscale);\n is::setSFMLObjX_Y(m_sprParent, m_x + m_xOffset, m_y + m_yOffset);\n}\n\nvoid MainObject::updateSprite(float x, float y, float angle, int alpha, float xScale, float yScale, float xOffset, float yOffset)\n{\n is::setSFMLObjAlpha(m_sprParent, alpha);\n is::setSFMLObjAngle(m_sprParent, angle);\n is::setSFMLObjScaleX_Y(m_sprParent, xScale, yScale);\n is::setSFMLObjX_Y(m_sprParent, x + xOffset, y + yOffset);\n}\n\nvoid MainObject::draw(is::Render &surface)\n{\n is::draw(surface, m_sprParent);\n if (m_drawMask) drawMask(surface);\n}\n\nvoid MainObject::drawMask(is::Render &surface, sf::Color color)\n{\n // We draw the AABB (rectangle, square) mask only if it has dimensions\n if (m_w > 0 && m_h > 0)\n {\n sf::RectangleShape rec(sf::Vector2f(static_cast(m_w), static_cast(m_h)));\n rec.setOutlineThickness(1.f);\n rec.setFillColor(sf::Color::Transparent);\n rec.setOutlineColor(color);\n is::setSFMLObjX_Y(rec, static_cast(m_aabb.m_left), static_cast(m_aabb.m_top));\n is::draw(surface, rec);\n }\n else if (m_circle.m_raduis > 0.f) // We draw the circle mask only if it has dimensions\n {\n sf::CircleShape circle(m_circle.m_raduis);\n circle.setOutlineThickness(1.f);\n circle.setFillColor(sf::Color::Transparent);\n circle.setOutlineColor(color);\n is::centerSFMLObj(circle);\n is::setSFMLObjX_Y(circle, m_circle.m_x, m_circle.m_y);\n is::draw(surface, circle);\n }\n}\n\nvoid MainObject::setFrameLimit(float frameStart, float frameEnd)\n{\n if (frameEnd > -1.f)\n {\n if (m_frame > frameEnd) m_frame = frameStart;\n if (m_frame < frameStart) m_frame = frameStart;\n }\n else m_frame = frameStart;\n}\n\nfloat MainObject::distantToPoint(float x, float y) const\n{\n float X = (getX() + getMaskW() / 2) - x;\n float Y = (getY() + getMaskH() / 2) - y;\n return sqrt(X * X + Y * Y);\n}\n\nfloat MainObject::distantToObject(MainObject const *other, bool useSpritePosition) const\n{\n float X = ((useSpritePosition) ? getSpriteX() - other->getSpriteX() : (getX() + (getMaskW() / 2)) - (other->getX() + (other->getMaskW() / 2)));\n float Y = ((useSpritePosition) ? getSpriteY() - other->getSpriteY() : (getY() + (getMaskH() / 2)) - (other->getY() + (other->getMaskH() / 2)));\n return sqrt(X * X + Y * Y);\n}\n\nfloat MainObject::distantToObject(std::shared_ptr const &other, bool useSpritePosition) const\n{\n float X = ((useSpritePosition) ? getSpriteX() - other->getSpriteX() : (getX() + (getMaskW() / 2)) - (other->getX() + (other->getMaskW() / 2)));\n float Y = ((useSpritePosition) ? getSpriteY() - other->getSpriteY() : (getY() + (getMaskH() / 2)) - (other->getY() + (other->getMaskH() / 2)));\n return sqrt(X * X + Y * Y);\n}\n\nfloat MainObject::pointDirection(float x, float y) const\n{\n return (is::pointDirection(m_x, m_y, x, y));\n}\n\nfloat MainObject::pointDirection(std::shared_ptr const &other) const\n{\n return (is::pointDirection(m_x, m_y, other->getX(), other->getY()));\n}\n\nfloat MainObject::pointDirectionSprite(float x, float y) const\n{\n return (is::pointDirection(getSpriteX(), getSpriteY(), x, y));\n}\n\nfloat MainObject::pointDirectionSprite(std::shared_ptr const &other) const\n{\n return (is::pointDirection(getSpriteX(), getSpriteY(), other->getSpriteX(), other->getSpriteY()));\n}\n\nfloat MainObject::getSpeed() const\n{\n return m_speed;\n}\n\nfloat MainObject::getHsp() const\n{\n return m_hsp;\n}\n\nfloat MainObject::getVsp() const\n{\n return m_vsp;\n}\n\nfloat MainObject::getFrame() const\n{\n return m_frame;\n}\n\nfloat MainObject::getFrameStart() const\n{\n return m_frameStart;\n}\n\nfloat MainObject::getFrameEnd() const\n{\n return m_frameEnd;\n}\n\nfloat MainObject::getImageXscale() const\n{\n return m_imageXscale;\n}\n\nfloat MainObject::getImageYscale() const\n{\n return m_imageYscale;\n}\n\nfloat MainObject::getImageScale() const\n{\n return m_imageScale;\n}\n\nfloat MainObject::getImageAngle() const\n{\n return m_imageAngle;\n}\n\nfloat MainObject::getXOffset() const\n{\n return m_xOffset;\n}\n\nfloat MainObject::getYOffset() const\n{\n return m_yOffset;\n}\n\nfloat MainObject::getX() const\n{\n return m_x;\n}\n\nfloat MainObject::getY() const\n{\n return m_y;\n}\n\nfloat MainObject::getXStart() const\n{\n return m_xStart;\n}\n\nfloat MainObject::getYStart() const\n{\n return m_yStart;\n}\n\nfloat MainObject::getXPrevious() const\n{\n return m_xPrevious;\n}\n\nfloat MainObject::getYPrevious() const\n{\n return m_yPrevious;\n}\n\nfloat MainObject::getTime() const\n{\n return m_time;\n}\n\nint MainObject::getInstanceId() const\n{\n return m_instanceId;\n}\n\nunsigned int MainObject::getMaskW() const\n{\n return m_w;\n}\n\nunsigned int MainObject::getMaskH() const\n{\n return m_h;\n}\n\nbool MainObject::getIsActive() const\n{\n return m_isActive;\n}\n\nint MainObject::getImageAlpha() const\n{\n return m_imageAlpha;\n}\n\nint MainObject::getImageIndex() const\n{\n return m_imageIndex;\n}\n\nint MainObject::getSpriteWidth() const\n{\n return m_sprParent.getTextureRect().width;\n}\n\nint MainObject::getSpriteHeight() const\n{\n return m_sprParent.getTextureRect().height;\n}\n\nfloat MainObject::getSpriteX() const\n{\n return m_sprParent.getPosition().x;\n}\n\nfloat MainObject::getSpriteY() const\n{\n return m_sprParent.getPosition().y;\n}\n\nint MainObject::getTextureWidth() const\n{\n return is::getSFMLTextureWidth(m_sprParent.getTexture());\n}\n\nint MainObject::getTextureHeight() const\n{\n return is::getSFMLTextureHeight(m_sprParent.getTexture());\n}\n\nint MainObject::getSpriteCenterX() const\n{\n return (m_sprParent.getTextureRect().width / 2);\n}\n\nint MainObject::getSpriteCenterY() const\n{\n return (m_sprParent.getTextureRect().height / 2);\n}\n\nint MainObject::getSpriteNumberSubImage(int subImageWidth) const\n{\n return (m_sprParent.getTexture()->getSize().x / subImageWidth);\n}\n\nbool MainObject::placeMettingSubFunction(float x, float y, MainObject const *other) const\n{\n is::Rectangle testRec = this->getMask();\n testRec.m_left += x;\n testRec.m_right += x;\n testRec.m_top += y;\n testRec.m_bottom += y;\n is::Circle testCircle = this->getCircleMask();\n testCircle.m_x += x;\n testCircle.m_y += y;\n\n is::Rectangle otherRectangle = other->getMask();\n is::Circle otherCircle = other->getCircleMask();\n\n if (m_w > 0 && m_h > 0 && other->getMaskW() > 0 && other->getMaskH() > 0)\n {\n return (is::collisionTest(testRec, otherRectangle));\n }\n else if ((m_w == 0 || m_h == 0) && other->getMaskW() > 0 && other->getMaskH() > 0)\n {\n return (is::collisionTest(testCircle, otherRectangle));\n }\n else if ((m_w > 0 && m_h > 0) && (other->getMaskW() == 0 || other->getMaskH() == 0))\n {\n return (is::collisionTest(testRec, otherCircle));\n }\n else if ((m_w == 0 || m_h == 0) && testCircle.m_raduis > 0.f &&\n (other->getMaskW() == 0 || other->getMaskH() == 0) && otherCircle.m_raduis > 0.f)\n {\n return (is::collisionTest(testCircle, otherCircle));\n }\n else\n {\n is::showLog(\"ERROR: Badly defined collision masks between these objects: <\" + m_strName +\n \"> & <\" + other->getName() + \">\", true);\n }\n return false;\n}\n\nvoid MainObject::updateSDMsprite()\n{\n if (m_isSDMSprite)\n {\n if (m_centerSpr) centerCollisionMask(m_x, m_y); else updateCollisionMask();\n updateSprite();\n }\n}\n\nbool MainObject::placeMetting(int x, int y, MainObject const *other)\n{\n return placeMettingSubFunction(x, y, other);\n}\n\nbool MainObject::placeMetting(int x, int y, std::shared_ptr const &other)\n{\n return placeMettingSubFunction(x, y, other.get());\n}\n\nbool MainObject::inViewRec(sf::View const &view, bool useTexRec)\n{\n is::Rectangle testRec;\n if (useTexRec)\n {\n testRec.m_left = m_x;\n testRec.m_top = m_y;\n testRec.m_right = m_x + ((m_sprParent.getGlobalBounds().width < 1) ? 32 : m_sprParent.getGlobalBounds().width);\n testRec.m_bottom = m_y + ((m_sprParent.getGlobalBounds().height < 1) ? 32 : m_sprParent.getGlobalBounds().height);\n }\n else testRec = this->getMask();\n\n is::Rectangle viewRec;\n viewRec.m_left = view.getCenter().x - (view.getSize().x / 2.f);\n viewRec.m_right = view.getCenter().x + (view.getSize().x / 2.f);\n viewRec.m_top = view.getCenter().y - (view.getSize().y / 2.f);\n viewRec.m_bottom = view.getCenter().y + (view.getSize().y / 2.f);\n\n if (is::collisionTest(testRec, viewRec)) return true;\n return false;\n}\n\nsf::Sprite& MainObject::getSprite()\n{\n return m_sprParent;\n}\n\nfloat COMPARE_DISTANCE(460.f);\n\nbool operator<(const MainObject *a, const MainObject &b)\n{\n if (is::instanceExist(a)) return a->getX() < (b.getX() - COMPARE_DISTANCE);\n else return false;\n}\n\nbool operator<(const MainObject &b, const MainObject *a)\n{\n if (is::instanceExist(a)) return (b.getX() + COMPARE_DISTANCE) < a->getX();\n else return false;\n}\n\nbool operator<(std::shared_ptr const &a, const MainObject &b)\n{\n if (is::instanceExist(a)) return a->getX() < (b.getX() - COMPARE_DISTANCE);\n else return false;\n}\n\nbool operator<(const MainObject &b, std::shared_ptr const &a)\n{\n if (is::instanceExist(a)) return (b.getX() + COMPARE_DISTANCE) < a->getX();\n else return false;\n}\n}\n"
},
{
"path": "app/src/main/cpp/PCH.hpp",
"content": "#ifndef PRECOMPILED_HEADER_HPP\n#define PRECOMPILED_HEADER_HPP\n\n// Allow to use icon for Windows OS applications\n#define IS_ENGINE_VS_CODE\n\n#ifndef _DEBUG\n\t#ifndef NDEBUG\n\t\t#define NDEBUG\n\t#endif\n#endif // _DEBUG\n\n// Raspberry Pi\n#ifdef SFML_SYSTEM_LINUX\n\t#ifdef __arm__\n\t\t#define SFML_SYSTEM_PI\n\t#endif\n#endif // SFML SYSTEM_LINUX\n\n// Typical stdafx.h\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// Additional C/C++ libs\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// Windows\n#ifdef _WIN32\n\t#ifndef UNICODE\n\t\t#define UNICODE\n\t#endif\n\n\t#ifndef _UNICODE\n\t\t#define _UNICODE\n\t#endif\n\n\t#define WIN32_LEAN_AND_MEAN\n\t#include \n#endif // _WIN32\n\n// Utils\n#include \"vscode/Utility/Types.hpp\"\n\n// Macros\n#define _UNUSED(x) (void)(x)\n\n#endif // PRECOMPILED_HEADER_HPP\n"
},
{
"path": "app/src/main/cpp/SDL_android_main.c",
"content": "#if !defined(IS_ENGINE_VS_CODE) && !defined(IS_ENGINE_SWITCH)\n#ifdef __ANDROID__\n/*\n SDL_android_main.c, placed in the public domain by Sam Lantinga 3/13/14\n*/\n#include \"SDL_internal.h\"\n\n/* Include the SDL main definition header */\n#include \"SDL_main.h\"\n\n/*******************************************************************************\n Functions called by JNI\n*******************************************************************************/\n#include \n\n/* Called before SDL_main() to initialize JNI bindings in SDL library */\nextern void SDL_Android_Init(JNIEnv* env, jclass cls);\n\n/* This prototype is needed to prevent a warning about the missing prototype for global function below */\nJNIEXPORT int JNICALL Java_com_author_isengine_SDLActivity_nativeInit(JNIEnv* env, jclass cls, jobject array);\n\n/* Start up the SDL app */\nJNIEXPORT int JNICALL Java_com_author_isengine_SDLActivity_nativeInit(JNIEnv* env, jclass cls, jobject array)\n{\n int i;\n int argc;\n int status;\n int len;\n char** argv;\n\n /* This interface could expand with ABI negotiation, callbacks, etc. */\n SDL_Android_Init(env, cls);\n\n SDL_SetMainReady();\n\n /* Prepare the arguments. */\n\n len = (*env)->GetArrayLength(env, array);\n argv = SDL_stack_alloc(char*, 1 + len + 1);\n argc = 0;\n /* Use the name \"app_process\" so PHYSFS_platformCalcBaseDir() works.\n https://bitbucket.org/MartinFelis/love-android-sdl2/issue/23/release-build-crash-on-start\n */\n argv[argc++] = SDL_strdup(\"app_process\");\n for (i = 0; i < len; ++i) {\n const char* utf;\n char* arg = NULL;\n jstring string = (*env)->GetObjectArrayElement(env, array, i);\n if (string) {\n utf = (*env)->GetStringUTFChars(env, string, 0);\n if (utf) {\n arg = SDL_strdup(utf);\n (*env)->ReleaseStringUTFChars(env, string, utf);\n }\n (*env)->DeleteLocalRef(env, string);\n }\n if (!arg) {\n arg = SDL_strdup(\"\");\n }\n argv[argc++] = arg;\n }\n argv[argc] = NULL;\n\n\n /* Run the application. */\n\n status = SDL_main(argc, argv);\n\n /* Release the arguments. */\n\n for (i = 0; i < argc; ++i) {\n SDL_free(argv[i]);\n }\n SDL_stack_free(argv);\n /* Do not issue an exit or the whole application will terminate instead of just the SDL thread */\n /* exit(status); */\n\n return status;\n}\n\n#endif /* __ANDROID__ */\n\n/* vi: set ts=4 sw=4 expandtab: */\n#endif /* IS_ENGINE_VS_CODE */\n"
},
{
"path": "app/src/main/cpp/TransitionEffect.cpp",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2024 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/system/graphic/TransitionEffect.h\"\n\nnamespace is\n{\nTransitionEffect::TransitionEffect(is::GameDisplay *scene):\n MainObject(),\n Type(FADE_OUT),\n m_scene(scene),\n m_transitionEnd(false)\n{\n m_strName = \"TransitionEffect\";\n m_imageAlpha = 255;\n #if defined(IS_ENGINE_USE_SDM)\n m_depth = -999999999;\n #endif\n\n // transition rectangle\n is::createRectangle(m_recTransition, sf::Vector2f(scene->getViewW() + 10.f, scene->getViewH() + 10.f),\n sf::Color(0, 0, 0, m_imageAlpha), scene->getViewW() / 2.f, scene->getViewH() / 2.f);\n}\n\nvoid TransitionEffect::step(const float &DELTA_TIME)\n{\n m_x = m_scene->getViewX();\n m_y = m_scene->getViewY();\n\n // transition fade out\n if (m_type == FADE_OUT)\n {\n if (m_imageAlpha > 5)\n {\n m_imageAlpha -= static_cast((5.f * is::VALUE_CONVERSION) * DELTA_TIME);\n m_transitionEnd = false;\n }\n else\n {\n m_imageAlpha = 0;\n m_transitionEnd = true;\n }\n }\n\n // transition fade in\n if (m_type == FADE_IN)\n {\n if (m_imageAlpha < 250)\n {\n m_imageAlpha += static_cast((5.f * is::VALUE_CONVERSION) * DELTA_TIME);\n m_transitionEnd = false;\n }\n else\n {\n m_imageAlpha = 255;\n m_transitionEnd = true;\n }\n }\n is::setSFMLObjFillColor(m_recTransition, sf::Color(0, 0, 0, m_imageAlpha));\n is::setSFMLObjX_Y(m_recTransition, m_x, m_y);\n}\n\nvoid TransitionEffect::draw(is::Render &render)\n{\n is::draw(render, m_recTransition);\n}\n}\n"
},
{
"path": "app/src/main/cpp/app_src/activity/GameActivity.h",
"content": "#ifndef GAMEACTIVITY_H_INCLUDED\n#define GAMEACTIVITY_H_INCLUDED\n\n#include \"../scenes/HelloScene/HelloScene.h\"\n\n// example\n// #include \"../scenes/YourScene/YourScene.h\"\n\n////////////////////////////////////////////////////////////\n/// Allows to manage the different scenes of the game\n////////////////////////////////////////////////////////////\nclass GameActivity\n{\nprivate:\n std::shared_ptr m_gameScene;\n\npublic:\n bool m_changeActivity = false;\n GameActivity(is::GameSystemExtended &gameSysExt)\n {\n m_gameScene = nullptr;\n////////////////////////////////////////////////////////////\n\n // Allows to choose the scene that will be launched\n switch (gameSysExt.m_launchOption)\n {\n case is::DisplayOption::HELLO_SCENE:\n m_gameScene = std::make_shared(gameSysExt);\n break;\n\n /*\n * \t\t\t\t\t/!\\ WARNING! /!\\\n * This constructor is no longer supported in this version of the engine. Use the one in the example.\n *\n * m_gameScene = std::make_shared(activityCtrl.getWindow(), getView(), m_surface, gameSysExt);\n */\n\n // example\n // case is::DisplayOption::YOUR_SCENE:\n // m_gameScene = std::make_shared(gameSysExt);\n // break;\n\n default:\n\t\t\tis::showLog(\"ERROR: Scene not found !\", true);\n\t\tbreak;\n }\n m_gameScene->loadResources();\n }\n\n virtual void onUpdate()\n {\n if (m_gameScene->getIsRunning()) m_gameScene->step();\n else\n {\n if (!m_changeActivity) m_changeActivity = true;\n }\n }\n\n virtual void onDraw() {m_gameScene->drawScreen();}\n\n virtual ~GameActivity() {}\n};\n\n#endif // GAMEACTIVITY_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/config/ExtraConfig.h",
"content": "#ifndef EXTRACONFIG_H_INCLUDED\n#define EXTRACONFIG_H_INCLUDED\n\n// Uncomment to enable this function\n// #define IS_ENGINE_USE_RENDER_TEXTURE ///< This feature coming soon !\n\n/*\n * 1) Uncomment this line (definition of the Preporcessor which is below) to use the engine's main render loop.\n * 2) But if you want to use a basic SFML render loop comment out this line.\n * It activates the \"basicSFMLmain()\" function which launches an SFML window.\n * Very useful if you already have an existing project and want to integrate it into the engine.\n * The \"basicSFMLmain()\" function is implemented in the \"basicSFMLmain.cpp\" file (found in the \"cpp\" directory).\n * It is in this file that you can associate your code with that of the engine.\n */\n#define IS_ENGINE_USE_MAIN_LOOP ///< Allows to use the engine's main render loop\n\n// Uncomment to enable SDM function\n#define IS_ENGINE_USE_SDM ///< Allows to use Step and Draw Manager\n\n#define SND_FILE_EXTENSION \".wav\"\n\n// Uncomment to enable this function\n#define IS_ENGINE_OPTIMIZE_PERF ///< Allows to activate the optimization in certain parts of the engine\n\n// Uncomment to enable SHOW LOG function\n#define IS_ENGINE_USE_SHOWLOG ///< Allows to show log in console\n\n#include \n#include \n#include \n#include \n#include \"../../isEngine/system/islibconnect/isLibConnect.h\"\n\nnamespace is\n{\ninline bool fileExist(std::string const &fileName)\n{\n std::ifstream file(fileName.c_str());\n return !file.fail();\n}\n}\n\n#endif // EXTRACONFIG_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/config/GameConfig.h",
"content": "#ifndef GAMECONFIG_H_INCLUDED\n#define GAMECONFIG_H_INCLUDED\n\n#include \"ExtraConfig.h\"\n\nnamespace is\n{\n////////////////////////////////////////////////////////////\n/// \\brief Allows to manipulate the different scenes and options\n///\n////////////////////////////////////////////////////////////\nenum DisplayOption\n{\n HELLO_SCENE, ///< Access the hello scene\n\n // example\n // YOUR_SCENE, ///< Access to your scene\n};\n\n////////////////////////////////////////////////////////////\n/// \\brief Allows to manipulate the window style\n///\n////////////////////////////////////////////////////////////\nenum WindowStyle\n{\n NONE, ///< No decoration at all\n TITLEBAR, ///< The window has a titlebar\n RESIZE, ///< The window can be resized and has a maximize button\n CLOSE, ///< The window has a close button\n FULLSCREEN, ///< The window is shown in fullscreen mode\n DEFAULT ///< The default style, which is a shortcut for Titlebar | Resize | Close\n};\n\n////////////////////////////////////////////////////////////\n/// Allows to define the general parameters of the game and\n/// that the ad manager (Admob)\n////////////////////////////////////////////////////////////\nnamespace GameConfig\n{\n static const unsigned int WINDOW_WIDTH = 640; ///< Window width work only for PC Platform\n static const unsigned int WINDOW_HEIGHT = 480; ///< Window height work only for PC Platform\n static const float VIEW_WIDTH = 640.f;\n static const float VIEW_HEIGHT = 480.f;\n static const float FPS = 60.f; ///< Game FPS\n static const is::WindowStyle WINDOW_SETTINGS = WindowStyle::DEFAULT; ///< Window style\n\n\tstatic const DisplayOption LAUNCH_OPTION = DisplayOption::HELLO_SCENE; ///< Represents the first scene to be launched\n\n\t/// Represent the key which validates the options with the Mouse\n static sf::Mouse::Button KEY_VALIDATION_MOUSE = sf::Mouse::Left;\n\n /// Represent the key which validates the options with the Keyboard\n static sf::Keyboard::Key KEY_VALIDATION_KEYBOARD = sf::Keyboard::Return;\n\n /// Represent the key which cancel the options with the Keyboard\n static sf::Keyboard::Key KEY_CANCEL = sf::Keyboard::Escape;\n\n /// Represents the button A key\n static sf::Keyboard::Key KEY_A = sf::Keyboard::W;\n\n /// Represents the button B key\n static sf::Keyboard::Key KEY_B = sf::Keyboard::X;\n\n /// Represents the button X key\n static sf::Keyboard::Key KEY_X = sf::Keyboard::Q;\n\n /// Represents the button Y key\n static sf::Keyboard::Key KEY_Y = sf::Keyboard::S;\n\n /// Represents the Left directional key\n static sf::Keyboard::Key KEY_LEFT = sf::Keyboard::Left;\n\n /// Represents the Right directional key\n static sf::Keyboard::Key KEY_RIGHT = sf::Keyboard::Right;\n\n /// Represents the Up directional key\n static sf::Keyboard::Key KEY_UP = sf::Keyboard::Up;\n\n /// Represents the Down directional key\n static sf::Keyboard::Key KEY_DOWN = sf::Keyboard::Down;\n\n ////////////////////////////////////////////////////////////\n /// Default values that SFML texts will take when they are created\n ////////////////////////////////////////////////////////////\n static const int DEFAULT_SFML_TEXT_SIZE = 20;\n static const sf::Color &DEFAULT_SFML_TEXT_COLOR = sf::Color::Blue;\n static const sf::Color &DEFAULT_SFML_SELECTED_TEXT_COLOR = sf::Color::White;\n static const int DEFAULT_MSG_BOX_TEXT_SIZE = 20;\n static const int DEFAULT_MSG_BOX_BUTTON_TEXT_SIZE = 18;\n static const sf::Color &DEFAULT_MSG_BOX_TEXT_COLOR = sf::Color::White;\n static const sf::Color &DEFAULT_MSG_BOX_SELECTED_TEXT_COLOR = sf::Color::Red;\n static const int DEFAULT_RPG_DIALOG_TEXT_SIZE = 16;\n static const int DEFAULT_RPG_DIALOG_BUTTON_TEXT_SIZE = 13;\n static const sf::Color &DEFAULT_RPG_DIALOG_TEXT_COLOR = sf::Color::White;\n static const sf::Color &DEFAULT_RPG_DIALOG_SELECTED_TEXT_COLOR = sf::Color::Blue;\n static const sf::Color &DEFAULT_BUTTON_TEXT_COLOR = sf::Color::White;\n\n static const std::string MAJOR = \"1\"; ///< Game major version\n static const std::string MINOR = \"0\"; ///< Game minor version\n inline std::string getGameVersion() {return MAJOR + \".\" + MINOR;} ///< return version of the game\n\n static std::string const GAME_NAME = \"Hello\"; ///< Windows title name\n static std::string const GAME_AUTHOR = \"Author\";\n\n // parent directory\n\tstatic std::string const ASSETS_DIR =\n\t#if !defined(__ANDROID__)\n #if defined(IS_ENGINE_QT)\n (fileExist(\"assets/assets.dat\") ? \"\" : \"../../\") +\n #endif\n std::string(\"assets/\");\n #elif defined(IS_ENGINE_HTML_5)\n \"/assets/\"\n #elif defined(IS_ENGINE_SWITCH)\n \"assets/\"\n\t#else\n \"\";\n\t#endif // defined\n static std::string const GUI_DIR = ASSETS_DIR + \"image/gui/\"; ///< Path to resource files that serve as GUI\n static std::string const FONT_DIR = ASSETS_DIR + \"font/\"; ///< Path to resource files that serve as Font\n static std::string const SPRITES_DIR = ASSETS_DIR + \"image/sprites/\"; ///< Path to resource files that serve as Sprite\n static std::string const TILES_DIR = ASSETS_DIR + \"image/tiles/\"; ///< Path to resource files that serve as tile and background\n static std::string const SFX_DIR = ASSETS_DIR + \"sound/sfx/\"; ///< Path to resource files that serve as SFX\n static std::string const MUSIC_DIR = ASSETS_DIR + \"sound/music/\"; ///< Path to resource files that serve as Music\n static std::string const TMX_RSC_DIR = ASSETS_DIR + \"maps/\"; ///< Path to TMX resource files\n\n #if defined(__ANDROID__)\n ////////////////////////////////////////////////////////////\n /// \\brief game package name\n /// Represents the place where your data will be saved on Android\n /// Replace this with your real package name (e.g. com.StudioName.GameName)\n /// You must apply this name for the applicationId in the build.gradle file\n ////////////////////////////////////////////////////////////\n static std::string const PACKAGE_NAME = \"com.author.isengine\";\n #endif // defined\n\n // parent directory\n static std::string DATA_PARENT_DIR =\n #if defined(__ANDROID__)\n \"/data/data/\" + PACKAGE_NAME + \"/\"\n #elif defined(IS_ENGINE_HTML_5)\n \"/save/\"\n #else\n \"save/\"\n #endif\n ;\n ///< Path to save game progress file\n static std::string const GAME_DATA_FILE = DATA_PARENT_DIR + \"game_data.bin\";\n\n ///< Path to save game menu configuration file\n static std::string const CONFIG_FILE = DATA_PARENT_DIR + \"game_config.dat\";\n\n ///< Path to save game pad configuration file\n static std::string const GAME_PAD_FILE = DATA_PARENT_DIR + \"game_pad_config.dat\";\n}\n}\n\n#endif // GAMECONFIG_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/gamesystem_ext/GameSystemExtended.h",
"content": "#ifndef GAMESYSTEMEXTENDED_H_INCLUDED\n#define GAMESYSTEMEXTENDED_H_INCLUDED\n\n#include \"../../isEngine/system/function/GameSystem.h\"\n#include \"../levels/Level.h\"\n\n////////////////////////////////////////////////////////////\n/// \\brief Class derived from GameSystem to manage the\n/// different engine components\n///\n/// Allows to manage the saving / loading of game and\n/// configuration data, manipulate the data of the virtual\n/// Game Pad and act on the different scenes of the game\n////////////////////////////////////////////////////////////\nnamespace is\n{\nclass GameSystemExtended : public GameSystem\n{\npublic:\n GameSystemExtended(sf::RenderWindow &window);\n\n /// Initialize the data link to the game engine\n void initSystemData();\n\n /// Initialize game progress data\n void initProgress();\n\n /// Initialize game play data (bonus, score, ...)\n void initData(bool clearCurrentLevel = true);\n\n /// Save game play data\n void saveData(std::string const &fileName);\n\n /// Load game play data\n void loadData(std::string const &fileName);\n\n /// Allows to choose the scene that will be launched\n is::DisplayOption m_launchOption = is::GameConfig::LAUNCH_OPTION; // Represents the first scene to be launched\n\n int m_gameProgression;\n int m_levelNumber;\n int m_currentLevel;\n int m_currentLives;\n int m_currentBonus;\n int m_currentScore;\n int m_currentHiScore;\n int m_levelTime;\n};\n}\n\n#endif // GAMESYSTEMEXTENDED_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/language/GameLanguage.h",
"content": "#ifndef GAMELANGUAGE_H_INCLUDED\n#define GAMELANGUAGE_H_INCLUDED\n\n#include \"../../isEngine/system/function/GameKeyName.h\"\n\n/*\n * This file allows you to define the languages you want to use in the game.\n * To use a language you must define a array. the first index represents the first language\n * (e.g lang_array[0] => eng) and the index following its translation (e.g lang_array[1] => fr).\n *\n * example to display several sentences in the dialog manager.\n * lang_array[] = {\"eng 1\", \"translation fr 1\", \"eng 2\", \"translation fr 2\", ...};\n * (Go to the GameDialog Class to see how we implement languages to make sentences in dialogs)\n */\n\nnamespace is\n{\n//////////////////////////////////////////////////////\n/// \\brief Access to content that allows internationalization of the game\n///\n//////////////////////////////////////////////////////\nnamespace lang\n{\n////////////////////////////////////////////////////////////\n/// \\brief Represent the index of each language\n///\n////////////////////////////////////////////////////////////\nenum GameLanguage\n{\n ENGLISH, ///< English language index\n FRANCAIS, ///< French language index\n\n // example\n // YOUR_LANGUAGE ///< Your language index\n};\n\n// ------------------------ message box answer ------------------------\nstatic std::string pad_answer_ok[] = {\"OK\" , \"OK\"};\nstatic std::string pad_answer_yes[] = {\"YES\", \"OUI\"};\nstatic std::string pad_answer_no[] = {\"NO\" , \"NON\"};\n\n// ------------------------ message box sentences ------------------------\nstatic std::string msg_quit_game[] = {\"Quit Game\", \"Quitter le Jeu\"};\n\n// example\n// static std::string msg_your_message[] = {\"Message in English\", \"Message in French\"};\n\n// ------------------------ RPG dialog ------------------------\nstatic std::string pad_dialog_skip[] = {\"Skip\", \"Passer\"};\n\nstatic std::string dialog_hello[] = {\"Hello !\",\n \"Salut !\",\n \"Ready to make the future best game in the world!\",\n \"En route pour invinter le futur meilleur jeu du monde !\"};\n\n// example\n// static std::wstring dialog_your_dialog[] = {L\"Represents the first message of the dialog in English\",\n// L\"Represents the first message of the dialog in French\",\n// L\"Represents the second message of the dialog in English\",\n// L\"Represents the second message of the dialog in French\"};\n}\n}\n\n#endif // GAMELANGUAGE_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/levels/Level.h",
"content": "#ifndef LEVEL_H_INCLUDED\n#define LEVEL_H_INCLUDED\n\n/*\n * This file allows to include the level header generated by the is::Engine\n * level editor to be able to use them with the engine components\n */\n\n// #include \"../levels/level_1.h\"\n// ...\n\nnamespace is\n{\n//////////////////////////////////////////////////////\n/// \\brief Access the content which allows to manage\n/// the integration of game levels\n///\n//////////////////////////////////////////////////////\nnamespace level\n{\n////////////////////////////////////////////////////////////\n/// \\brief Enum represents a array containing the level data\n///\n/// Allows to identify and load the corresponding level\n/// array in GameLevel\n////////////////////////////////////////////////////////////\nenum LevelId\n{\n LEVEL_1\n // ...\n\n ////////////////////////////////////////////////////////////\n // don't touch this. Add all level item before this one\n , LEVEL_MAX ///< Allows you to know the number of levels\n ////////////////////////////////////////////////////////////\n};\n\n////////////////////////////////////////////////////////////\n/// \\brief Returns the level array according to its index\n///\n/// It is used in @a GameLevelLoadResource() to determine the\n/// level array that will be loaded to create the game level\n////////////////////////////////////////////////////////////\ninline short const* getLevelMap(int CURRENT_LEVEL)\n{\n switch (CURRENT_LEVEL)\n {\n // case LEVEL_1 : return LEVEL_1_MAP; break;\n // ...\n default: return 0; break;\n }\n}\n}\n}\n\n#endif // LEVEL_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/objects/HelloWorld.h",
"content": "#pragma once\n#include \"../../isEngine/system/display/GameDisplay.h\"\n\n//////////////////////////////////////////////////////\n/// \\brief This class allows to scroll a \"Hello world!\"\n/// on the screen and perform touch / click detection tests\n//////////////////////////////////////////////////////\nclass HelloWorld : public is::MainObject\n{\npublic:\n HelloWorld(float x, float y, is::GameDisplay *scene):\n is::MainObject(x ,y),\n m_scene(scene)\n {\n // Create the sprite of object and center it\n m_xOffset = 80.f; // set offset x to center the image\n m_yOffset = 82.f; // set offset y to center the image\n is::createSprite(scene->GRMgetTexture(\"hello_world\"), m_sprParent, sf::Vector2f(m_x, m_y), sf::Vector2f(m_xOffset, m_yOffset));\n\n // Display depth of the object in the scene\n m_depth = -1;\n }\n\n void step(float const &DELTA_TIME)\n {\n // When you touch (on Android) or click on the sprite of the object it moves down (in pixel)\n if (m_scene->mouseCollision(m_sprParent) && m_scene->getGameSystem().isPressed())\n {\n // VALUE_CONVERSION : allows to avoid using large values to do operations\n // (basically it converts small values to large) and it also acts on the timing\n // of the program\n m_imageScale += (is::VALUE_CONVERSION * 0.05f) * DELTA_TIME; // scale the image\n if (m_imageScale > 2.f) m_imageScale = 1.f;\n m_imageXscale = m_imageScale;\n m_imageYscale = m_imageScale;\n\n m_y += (is::VALUE_CONVERSION * 1.f) * DELTA_TIME; // move (down) object on y axis\n }\n\n // moved the object to the right (in pixel)\n m_x += (is::VALUE_CONVERSION * 2.f) * DELTA_TIME;\n\n // If the object comes out to the right or at the top of the scene, bring it back\n // to its starting position\n // By default the size of the scene is equal to that of the window\n if (m_x > m_scene->getSceneWidth()) m_x = m_xStart - (m_xOffset * 2.f);\n if (m_y > m_scene->getSceneHeight() - 32.f) m_y = m_yStart - m_yOffset;\n\n updateSprite(); // update the sprite with all object variables (x, y, angle, scale, ...)\n }\n\nprivate:\n is::GameDisplay *m_scene;\n};\n"
},
{
"path": "app/src/main/cpp/app_src/objects/widgets/GameDialog.h",
"content": "#ifndef GAMEDIALOG_H_INCLUDED\n#define GAMEDIALOG_H_INCLUDED\n\n#include \n#include \"../../../isEngine/system/display/GameDisplay.h\"\n#include \"../../language/GameLanguage.h\"\n\n////////////////////////////////////////////////////////////\n/// \\brief Displays and manages game dialogs\n///\n////////////////////////////////////////////////////////////\nnamespace is\n{\nclass GameDialog : public is::MainObject\n{\npublic:\n GameDialog(sf::Texture &tex, sf::Font &fnt, is::GameDisplay *scene);\n\n ////////////////////////////////////////////////////////////\n /// \\brief Represents the different dialogs\n ///\n /// Each enum is linked to an array of string representing\n /// a dialogs found in GameLanguage.h\n ////////////////////////////////////////////////////////////\n enum DialogIndex\n {\n DIALOG_NONE = -1,\n DIALOG_HELLO,\n\n // example\n // DIALOG_YOUR_DIALOG\n };\n\n ////////////////////////////////////////////////////////////\n /// \\brief Link enum to an array of string representing the\n /// dialog in GameLanguage.h\n ///\n /// Each time an array of string representing a dialog is added\n /// it must be linked to its enum to be able to launch it later\n /// with the setDialog() method.\n ////////////////////////////////////////////////////////////\n void linkArrayToEnum()\n {\n auto setMsg = [this](std::string txt)\n {\n m_strDialog = txt;\n };\n auto checkMsg =[this, &setMsg](std::string txt[])\n {\n if (m_msgIndex < m_msgIndexMax) setMsg(txt[m_msgIndex + m_scene->getGameSystem().m_gameLanguage]);\n };\n\n // each enum with its array of string\n switch (m_dialogIndex)\n {\n case DIALOG_HELLO:\n m_msgIndexMax = is::arraySize(is::lang::dialog_hello);\n checkMsg(is::lang::dialog_hello);\n break;\n\n // example\n // case DIALOG_YOUR_DIALOG:\n // m_msgIndexMax = is::arraySize(is::lang::dialog_your_dialog);\n // checkMsg(is::lang::dialog_your_dialog);\n // break;\n\n default:\n break;\n }\n }\n\n void step(const float &DELTA_TIME);\n\n /// launch a dialog based on the enumeration index\n void setDialog(DialogIndex dialogIndex);\n void setMouseInCollison(bool val);\n void draw(is::Render &surface);\n\n DialogIndex getDialogIndex() const\n {\n return m_dialogIndex;\n }\n\n bool getMouseInCollison() const\n {\n return m_mouseInCollison;\n }\n\n bool showDialog() const\n {\n return m_showDialog;\n }\n\nprivate:\n is::GameDisplay *m_scene;\n sf::Text m_txtDialog, m_txtSkip;\n std::string m_strDialog;\n sf::Sprite m_sprNext, m_sprSkip;\n\n bool m_showDialog, m_mouseInCollison, m_dialogEnd, m_newLine;\n int m_msgIndex, m_msgIndexMax, m_size;\n float m_blindTime;\n DialogIndex m_dialogIndex;\n};\n}\n\n#endif // GAMEDIALOG_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/app_src/scenes/HelloScene/HelloScene.h",
"content": "#pragma once\n#include \"../../../isEngine/system/entity/Background.h\"\n#include \"../../objects/widgets/GameDialog.h\"\n#include \"../../objects/HelloWorld.h\"\n\nclass HelloScene : public is::GameDisplay\n{\npublic:\n\n /* \t\t\t\t\t/!\\ WARNING! /!\\\n * This constructor is no longer supported in this version of the engine. Use the one below.\n *\n * HelloScene(sf::RenderWindow &window, sf::View &view, is::Render &surface, is::GameSystemExtended &gameSysExt):\n * GameDisplay(window, view, surface, gameSysExt, sf::Color::White) {}\n */\n\n HelloScene(is::GameSystemExtended &gameSysExt):\n GameDisplay(gameSysExt, sf::Color::White /* => scene color*/) {}\n\n void loadResources() {\n m_gameSysExt.m_gameLanguage = is::lang::ENGLISH; // set default game language\n\n // uncomment to change English language in French\n // m_gameSysExt.m_gameLanguage = is::lang::FRANCAIS;\n\n // load font and texture\n GameDisplay::loadParentResources(); // allows to load system resource (very important never forgot to call him)\n GRMaddTexture(\"is_engine_logo\", is::GameConfig::SPRITES_DIR + \"is_engine_logo.png\");\n GRMaddTexture(\"hello_world\", is::GameConfig::SPRITES_DIR + \"hello_world.png\");\n auto &texBg = GRMaddTexture(\"background\", is::GameConfig::TILES_DIR + \"background.png\");\n auto &texDialog = GRMaddTexture(\"dialog_box\", is::GameConfig::GUI_DIR + \"dialog_box.png\");\n\n // add a background to the position x = 0, y = 0 which will fill the scene and which will be scrolled (scrolling speed = 0.5)\n SDMaddSceneObject(std::make_shared(texBg, 0.f, 0.f, this, 0.5f, -0.5f, false, false));\n\n // add an SFML sprite which will be above the background and which will have the name \"Logo\" (by default x = 0 and y = 0)\n SDMaddSprite(GRMgetTexture(\"is_engine_logo\"), \"Logo\", 0.f, 62.f, false, -1);\n\n // add an object at position x = 0, y = 0 which will be updated and displayed in the scene\n SDMaddSceneObject(std::make_shared(0.f, 0.f, this));\n\n // add RPG style game dialog\n auto gameDialog = std::make_shared(texDialog, GRMgetFont(\"font_msg\"), this);\n gameDialog->setDepth(-2); // the display depth (make it appear on all objects. The object with the smallest value appears on the others)\n gameDialog->setDialog(is::GameDialog::DialogIndex::DIALOG_HELLO); // set the corresponding dialog (See GameDialog.h and GameLanguage.h for more details on creating a message for dialogue)\n SDMaddSceneObject(gameDialog);\n\n // add and play music\n GSMaddSound(\"game_music\", is::GameConfig::MUSIC_DIR + \"game_music.wav\");\n GSMplaySound(\"game_music\");\n GSMsetSoundLoop(\"game_music\", true);\n }\n};\n"
},
{
"path": "app/src/main/cpp/b2BlockAllocator.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \n#include \n#include \n#include \n\nint32 b2BlockAllocator::s_blockSizes[b2_blockSizes] =\n{\n\t16,\t\t// 0\n\t32,\t\t// 1\n\t64,\t\t// 2\n\t96,\t\t// 3\n\t128,\t// 4\n\t160,\t// 5\n\t192,\t// 6\n\t224,\t// 7\n\t256,\t// 8\n\t320,\t// 9\n\t384,\t// 10\n\t448,\t// 11\n\t512,\t// 12\n\t640,\t// 13\n};\nuint8 b2BlockAllocator::s_blockSizeLookup[b2_maxBlockSize + 1];\nbool b2BlockAllocator::s_blockSizeLookupInitialized;\n\nstruct b2Chunk\n{\n\tint32 blockSize;\n\tb2Block* blocks;\n};\n\nstruct b2Block\n{\n\tb2Block* next;\n};\n\nb2BlockAllocator::b2BlockAllocator()\n{\n\tb2Assert(b2_blockSizes < UCHAR_MAX);\n\n\tm_chunkSpace = b2_chunkArrayIncrement;\n\tm_chunkCount = 0;\n\tm_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));\n\n\tmemset(m_chunks, 0, m_chunkSpace * sizeof(b2Chunk));\n\tmemset(m_freeLists, 0, sizeof(m_freeLists));\n\n\tif (s_blockSizeLookupInitialized == false)\n\t{\n\t\tint32 j = 0;\n\t\tfor (int32 i = 1; i <= b2_maxBlockSize; ++i)\n\t\t{\n\t\t\tb2Assert(j < b2_blockSizes);\n\t\t\tif (i <= s_blockSizes[j])\n\t\t\t{\n\t\t\t\ts_blockSizeLookup[i] = (uint8)j;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++j;\n\t\t\t\ts_blockSizeLookup[i] = (uint8)j;\n\t\t\t}\n\t\t}\n\n\t\ts_blockSizeLookupInitialized = true;\n\t}\n}\n\nb2BlockAllocator::~b2BlockAllocator()\n{\n\tfor (int32 i = 0; i < m_chunkCount; ++i)\n\t{\n\t\tb2Free(m_chunks[i].blocks);\n\t}\n\n\tb2Free(m_chunks);\n}\n\nvoid* b2BlockAllocator::Allocate(int32 size)\n{\n\tif (size == 0)\n\t\treturn NULL;\n\n\tb2Assert(0 < size);\n\n\tif (size > b2_maxBlockSize)\n\t{\n\t\treturn b2Alloc(size);\n\t}\n\n\tint32 index = s_blockSizeLookup[size];\n\tb2Assert(0 <= index && index < b2_blockSizes);\n\n\tif (m_freeLists[index])\n\t{\n\t\tb2Block* block = m_freeLists[index];\n\t\tm_freeLists[index] = block->next;\n\t\treturn block;\n\t}\n\telse\n\t{\n\t\tif (m_chunkCount == m_chunkSpace)\n\t\t{\n\t\t\tb2Chunk* oldChunks = m_chunks;\n\t\t\tm_chunkSpace += b2_chunkArrayIncrement;\n\t\t\tm_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));\n\t\t\tmemcpy(m_chunks, oldChunks, m_chunkCount * sizeof(b2Chunk));\n\t\t\tmemset(m_chunks + m_chunkCount, 0, b2_chunkArrayIncrement * sizeof(b2Chunk));\n\t\t\tb2Free(oldChunks);\n\t\t}\n\n\t\tb2Chunk* chunk = m_chunks + m_chunkCount;\n\t\tchunk->blocks = (b2Block*)b2Alloc(b2_chunkSize);\n#if defined(_DEBUG)\n\t\tmemset(chunk->blocks, 0xcd, b2_chunkSize);\n#endif\n\t\tint32 blockSize = s_blockSizes[index];\n\t\tchunk->blockSize = blockSize;\n\t\tint32 blockCount = b2_chunkSize / blockSize;\n\t\tb2Assert(blockCount * blockSize <= b2_chunkSize);\n\t\tfor (int32 i = 0; i < blockCount - 1; ++i)\n\t\t{\n\t\t\tb2Block* block = (b2Block*)((int8*)chunk->blocks + blockSize * i);\n\t\t\tb2Block* next = (b2Block*)((int8*)chunk->blocks + blockSize * (i + 1));\n\t\t\tblock->next = next;\n\t\t}\n\t\tb2Block* last = (b2Block*)((int8*)chunk->blocks + blockSize * (blockCount - 1));\n\t\tlast->next = NULL;\n\n\t\tm_freeLists[index] = chunk->blocks->next;\n\t\t++m_chunkCount;\n\n\t\treturn chunk->blocks;\n\t}\n}\n\nvoid b2BlockAllocator::Free(void* p, int32 size)\n{\n\tif (size == 0)\n\t{\n\t\treturn;\n\t}\n\n\tb2Assert(0 < size);\n\n\tif (size > b2_maxBlockSize)\n\t{\n\t\tb2Free(p);\n\t\treturn;\n\t}\n\n\tint32 index = s_blockSizeLookup[size];\n\tb2Assert(0 <= index && index < b2_blockSizes);\n\n#ifdef _DEBUG\n\t// Verify the memory address and size is valid.\n\tint32 blockSize = s_blockSizes[index];\n\tbool found = false;\n\tfor (int32 i = 0; i < m_chunkCount; ++i)\n\t{\n\t\tb2Chunk* chunk = m_chunks + i;\n\t\tif (chunk->blockSize != blockSize)\n\t\t{\n\t\t\tb2Assert(\t(int8*)p + blockSize <= (int8*)chunk->blocks ||\n\t\t\t\t\t\t(int8*)chunk->blocks + b2_chunkSize <= (int8*)p);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif ((int8*)chunk->blocks <= (int8*)p && (int8*)p + blockSize <= (int8*)chunk->blocks + b2_chunkSize)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tb2Assert(found);\n\n\tmemset(p, 0xfd, blockSize);\n#endif\n\n\tb2Block* block = (b2Block*)p;\n\tblock->next = m_freeLists[index];\n\tm_freeLists[index] = block;\n}\n\nvoid b2BlockAllocator::Clear()\n{\n\tfor (int32 i = 0; i < m_chunkCount; ++i)\n\t{\n\t\tb2Free(m_chunks[i].blocks);\n\t}\n\n\tm_chunkCount = 0;\n\tmemset(m_chunks, 0, m_chunkSpace * sizeof(b2Chunk));\n\n\tmemset(m_freeLists, 0, sizeof(m_freeLists));\n}\n"
},
{
"path": "app/src/main/cpp/b2Body.cpp",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2Joint.h\"\n\nb2Body::b2Body(const b2BodyDef* bd, b2World* world)\n{\n\tb2Assert(bd->position.IsValid());\n\tb2Assert(bd->linearVelocity.IsValid());\n\tb2Assert(b2IsValid(bd->angle));\n\tb2Assert(b2IsValid(bd->angularVelocity));\n\tb2Assert(b2IsValid(bd->angularDamping) && bd->angularDamping >= 0.0f);\n\tb2Assert(b2IsValid(bd->linearDamping) && bd->linearDamping >= 0.0f);\n\n\tm_flags = 0;\n\n\tif (bd->bullet)\n\t{\n\t\tm_flags |= e_bulletFlag;\n\t}\n\tif (bd->fixedRotation)\n\t{\n\t\tm_flags |= e_fixedRotationFlag;\n\t}\n\tif (bd->allowSleep)\n\t{\n\t\tm_flags |= e_autoSleepFlag;\n\t}\n\tif (bd->awake)\n\t{\n\t\tm_flags |= e_awakeFlag;\n\t}\n\tif (bd->active)\n\t{\n\t\tm_flags |= e_activeFlag;\n\t}\n\n\tm_world = world;\n\n\tm_xf.p = bd->position;\n\tm_xf.q.Set(bd->angle);\n\n\tm_sweep.localCenter.SetZero();\n\tm_sweep.c0 = m_xf.p;\n\tm_sweep.c = m_xf.p;\n\tm_sweep.a0 = bd->angle;\n\tm_sweep.a = bd->angle;\n\tm_sweep.alpha0 = 0.0f;\n\n\tm_jointList = NULL;\n\tm_contactList = NULL;\n\tm_prev = NULL;\n\tm_next = NULL;\n\n\tm_linearVelocity = bd->linearVelocity;\n\tm_angularVelocity = bd->angularVelocity;\n\n\tm_linearDamping = bd->linearDamping;\n\tm_angularDamping = bd->angularDamping;\n\tm_gravityScale = bd->gravityScale;\n\n\tm_force.SetZero();\n\tm_torque = 0.0f;\n\n\tm_sleepTime = 0.0f;\n\n\tm_type = bd->type;\n\n\tif (m_type == b2_dynamicBody)\n\t{\n\t\tm_mass = 1.0f;\n\t\tm_invMass = 1.0f;\n\t}\n\telse\n\t{\n\t\tm_mass = 0.0f;\n\t\tm_invMass = 0.0f;\n\t}\n\n\tm_I = 0.0f;\n\tm_invI = 0.0f;\n\n\tm_userData = bd->userData;\n\n\tm_fixtureList = NULL;\n\tm_fixtureCount = 0;\n}\n\nb2Body::~b2Body()\n{\n\t// shapes and joints are destroyed in b2World::Destroy\n}\n\nvoid b2Body::SetType(b2BodyType type)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\tif (m_world->IsLocked() == true)\n\t{\n\t\treturn;\n\t}\n\n\tif (m_type == type)\n\t{\n\t\treturn;\n\t}\n\n\tm_type = type;\n\n\tResetMassData();\n\n\tif (m_type == b2_staticBody)\n\t{\n\t\tm_linearVelocity.SetZero();\n\t\tm_angularVelocity = 0.0f;\n\t\tm_sweep.a0 = m_sweep.a;\n\t\tm_sweep.c0 = m_sweep.c;\n\t\tSynchronizeFixtures();\n\t}\n\n\tSetAwake(true);\n\n\tm_force.SetZero();\n\tm_torque = 0.0f;\n\n\t// Delete the attached contacts.\n\tb2ContactEdge* ce = m_contactList;\n\twhile (ce)\n\t{\n\t\tb2ContactEdge* ce0 = ce;\n\t\tce = ce->next;\n\t\tm_world->m_contactManager.Destroy(ce0->contact);\n\t}\n\tm_contactList = NULL;\n\n\t// Touch the proxies so that new contacts will be created (when appropriate)\n\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t{\n\t\tint32 proxyCount = f->m_proxyCount;\n\t\tfor (int32 i = 0; i < proxyCount; ++i)\n\t\t{\n\t\t\tbroadPhase->TouchProxy(f->m_proxies[i].proxyId);\n\t\t}\n\t}\n}\n\nb2Fixture* b2Body::CreateFixture(const b2FixtureDef* def)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\tif (m_world->IsLocked() == true)\n\t{\n\t\treturn NULL;\n\t}\n\n\tb2BlockAllocator* allocator = &m_world->m_blockAllocator;\n\n\tvoid* memory = allocator->Allocate(sizeof(b2Fixture));\n\tb2Fixture* fixture = new (memory) b2Fixture;\n\tfixture->Create(allocator, this, def);\n\n\tif (m_flags & e_activeFlag)\n\t{\n\t\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\t\tfixture->CreateProxies(broadPhase, m_xf);\n\t}\n\n\tfixture->m_next = m_fixtureList;\n\tm_fixtureList = fixture;\n\t++m_fixtureCount;\n\n\tfixture->m_body = this;\n\n\t// Adjust mass properties if needed.\n\tif (fixture->m_density > 0.0f)\n\t{\n\t\tResetMassData();\n\t}\n\n\t// Let the world know we have a new fixture. This will cause new contacts\n\t// to be created at the beginning of the next time step.\n\tm_world->m_flags |= b2World::e_newFixture;\n\n\treturn fixture;\n}\n\nb2Fixture* b2Body::CreateFixture(const b2Shape* shape, float32 density)\n{\n\tb2FixtureDef def;\n\tdef.shape = shape;\n\tdef.density = density;\n\n\treturn CreateFixture(&def);\n}\n\nvoid b2Body::DestroyFixture(b2Fixture* fixture)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\tif (m_world->IsLocked() == true)\n\t{\n\t\treturn;\n\t}\n\n\tb2Assert(fixture->m_body == this);\n\n\t// Remove the fixture from this body's singly linked list.\n\tb2Assert(m_fixtureCount > 0);\n\tb2Fixture** node = &m_fixtureList;\n\tbool found = false;\n\twhile (*node != NULL)\n\t{\n\t\tif (*node == fixture)\n\t\t{\n\t\t\t*node = fixture->m_next;\n\t\t\tfound = true;\n\t\t\tbreak;\n\t\t}\n\n\t\tnode = &(*node)->m_next;\n\t}\n\n\t// You tried to remove a shape that is not attached to this body.\n\tb2Assert(found);\n\n\t// Destroy any contacts associated with the fixture.\n\tb2ContactEdge* edge = m_contactList;\n\twhile (edge)\n\t{\n\t\tb2Contact* c = edge->contact;\n\t\tedge = edge->next;\n\n\t\tb2Fixture* fixtureA = c->GetFixtureA();\n\t\tb2Fixture* fixtureB = c->GetFixtureB();\n\n\t\tif (fixture == fixtureA || fixture == fixtureB)\n\t\t{\n\t\t\t// This destroys the contact and removes it from\n\t\t\t// this body's contact list.\n\t\t\tm_world->m_contactManager.Destroy(c);\n\t\t}\n\t}\n\n\tb2BlockAllocator* allocator = &m_world->m_blockAllocator;\n\n\tif (m_flags & e_activeFlag)\n\t{\n\t\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\t\tfixture->DestroyProxies(broadPhase);\n\t}\n\n\tfixture->Destroy(allocator);\n\tfixture->m_body = NULL;\n\tfixture->m_next = NULL;\n\tfixture->~b2Fixture();\n\tallocator->Free(fixture, sizeof(b2Fixture));\n\n\t--m_fixtureCount;\n\n\t// Reset the mass data.\n\tResetMassData();\n}\n\nvoid b2Body::ResetMassData()\n{\n\t// Compute mass data from shapes. Each shape has its own density.\n\tm_mass = 0.0f;\n\tm_invMass = 0.0f;\n\tm_I = 0.0f;\n\tm_invI = 0.0f;\n\tm_sweep.localCenter.SetZero();\n\n\t// Static and kinematic bodies have zero mass.\n\tif (m_type == b2_staticBody || m_type == b2_kinematicBody)\n\t{\n\t\tm_sweep.c0 = m_xf.p;\n\t\tm_sweep.c = m_xf.p;\n\t\tm_sweep.a0 = m_sweep.a;\n\t\treturn;\n\t}\n\n\tb2Assert(m_type == b2_dynamicBody);\n\n\t// Accumulate mass over all fixtures.\n\tb2Vec2 localCenter = b2Vec2_zero;\n\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t{\n\t\tif (f->m_density == 0.0f)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tb2MassData massData;\n\t\tf->GetMassData(&massData);\n\t\tm_mass += massData.mass;\n\t\tlocalCenter += massData.mass * massData.center;\n\t\tm_I += massData.I;\n\t}\n\n\t// Compute center of mass.\n\tif (m_mass > 0.0f)\n\t{\n\t\tm_invMass = 1.0f / m_mass;\n\t\tlocalCenter *= m_invMass;\n\t}\n\telse\n\t{\n\t\t// Force all dynamic bodies to have a positive mass.\n\t\tm_mass = 1.0f;\n\t\tm_invMass = 1.0f;\n\t}\n\n\tif (m_I > 0.0f && (m_flags & e_fixedRotationFlag) == 0)\n\t{\n\t\t// Center the inertia about the center of mass.\n\t\tm_I -= m_mass * b2Dot(localCenter, localCenter);\n\t\tb2Assert(m_I > 0.0f);\n\t\tm_invI = 1.0f / m_I;\n\n\t}\n\telse\n\t{\n\t\tm_I = 0.0f;\n\t\tm_invI = 0.0f;\n\t}\n\n\t// Move center of mass.\n\tb2Vec2 oldCenter = m_sweep.c;\n\tm_sweep.localCenter = localCenter;\n\tm_sweep.c0 = m_sweep.c = b2Mul(m_xf, m_sweep.localCenter);\n\n\t// Update center of mass velocity.\n\tm_linearVelocity += b2Cross(m_angularVelocity, m_sweep.c - oldCenter);\n}\n\nvoid b2Body::SetMassData(const b2MassData* massData)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\tif (m_world->IsLocked() == true)\n\t{\n\t\treturn;\n\t}\n\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tm_invMass = 0.0f;\n\tm_I = 0.0f;\n\tm_invI = 0.0f;\n\n\tm_mass = massData->mass;\n\tif (m_mass <= 0.0f)\n\t{\n\t\tm_mass = 1.0f;\n\t}\n\n\tm_invMass = 1.0f / m_mass;\n\n\tif (massData->I > 0.0f && (m_flags & b2Body::e_fixedRotationFlag) == 0)\n\t{\n\t\tm_I = massData->I - m_mass * b2Dot(massData->center, massData->center);\n\t\tb2Assert(m_I > 0.0f);\n\t\tm_invI = 1.0f / m_I;\n\t}\n\n\t// Move center of mass.\n\tb2Vec2 oldCenter = m_sweep.c;\n\tm_sweep.localCenter = massData->center;\n\tm_sweep.c0 = m_sweep.c = b2Mul(m_xf, m_sweep.localCenter);\n\n\t// Update center of mass velocity.\n\tm_linearVelocity += b2Cross(m_angularVelocity, m_sweep.c - oldCenter);\n}\n\nbool b2Body::ShouldCollide(const b2Body* other) const\n{\n\t// At least one body should be dynamic.\n\tif (m_type != b2_dynamicBody && other->m_type != b2_dynamicBody)\n\t{\n\t\treturn false;\n\t}\n\n\t// Does a joint prevent collision?\n\tfor (b2JointEdge* jn = m_jointList; jn; jn = jn->next)\n\t{\n\t\tif (jn->other == other)\n\t\t{\n\t\t\tif (jn->joint->m_collideConnected == false)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid b2Body::SetTransform(const b2Vec2& position, float32 angle)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\tif (m_world->IsLocked() == true)\n\t{\n\t\treturn;\n\t}\n\n\tm_xf.q.Set(angle);\n\tm_xf.p = position;\n\n\tm_sweep.c = b2Mul(m_xf, m_sweep.localCenter);\n\tm_sweep.a = angle;\n\n\tm_sweep.c0 = m_sweep.c;\n\tm_sweep.a0 = angle;\n\n\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t{\n\t\tf->Synchronize(broadPhase, m_xf, m_xf);\n\t}\n}\n\nvoid b2Body::SynchronizeFixtures()\n{\n\tb2Transform xf1;\n\txf1.q.Set(m_sweep.a0);\n\txf1.p = m_sweep.c0 - b2Mul(xf1.q, m_sweep.localCenter);\n\n\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t{\n\t\tf->Synchronize(broadPhase, xf1, m_xf);\n\t}\n}\n\nvoid b2Body::SetActive(bool flag)\n{\n\tb2Assert(m_world->IsLocked() == false);\n\n\tif (flag == IsActive())\n\t{\n\t\treturn;\n\t}\n\n\tif (flag)\n\t{\n\t\tm_flags |= e_activeFlag;\n\n\t\t// Create all proxies.\n\t\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\t\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t\t{\n\t\t\tf->CreateProxies(broadPhase, m_xf);\n\t\t}\n\n\t\t// Contacts are created the next time step.\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_activeFlag;\n\n\t\t// Destroy all proxies.\n\t\tb2BroadPhase* broadPhase = &m_world->m_contactManager.m_broadPhase;\n\t\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t\t{\n\t\t\tf->DestroyProxies(broadPhase);\n\t\t}\n\n\t\t// Destroy the attached contacts.\n\t\tb2ContactEdge* ce = m_contactList;\n\t\twhile (ce)\n\t\t{\n\t\t\tb2ContactEdge* ce0 = ce;\n\t\t\tce = ce->next;\n\t\t\tm_world->m_contactManager.Destroy(ce0->contact);\n\t\t}\n\t\tm_contactList = NULL;\n\t}\n}\n\nvoid b2Body::SetFixedRotation(bool flag)\n{\n\tbool status = (m_flags & e_fixedRotationFlag) == e_fixedRotationFlag;\n\tif (status == flag)\n\t{\n\t\treturn;\n\t}\n\n\tif (flag)\n\t{\n\t\tm_flags |= e_fixedRotationFlag;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_fixedRotationFlag;\n\t}\n\n\tm_angularVelocity = 0.0f;\n\n\tResetMassData();\n}\n\nvoid b2Body::Dump()\n{\n\tint32 bodyIndex = m_islandIndex;\n\n\tb2Log(\"{\\n\");\n\tb2Log(\" b2BodyDef bd;\\n\");\n\tb2Log(\" bd.type = b2BodyType(%d);\\n\", m_type);\n\tb2Log(\" bd.position.Set(%.15lef, %.15lef);\\n\", m_xf.p.x, m_xf.p.y);\n\tb2Log(\" bd.angle = %.15lef;\\n\", m_sweep.a);\n\tb2Log(\" bd.linearVelocity.Set(%.15lef, %.15lef);\\n\", m_linearVelocity.x, m_linearVelocity.y);\n\tb2Log(\" bd.angularVelocity = %.15lef;\\n\", m_angularVelocity);\n\tb2Log(\" bd.linearDamping = %.15lef;\\n\", m_linearDamping);\n\tb2Log(\" bd.angularDamping = %.15lef;\\n\", m_angularDamping);\n\tb2Log(\" bd.allowSleep = bool(%d);\\n\", m_flags & e_autoSleepFlag);\n\tb2Log(\" bd.awake = bool(%d);\\n\", m_flags & e_awakeFlag);\n\tb2Log(\" bd.fixedRotation = bool(%d);\\n\", m_flags & e_fixedRotationFlag);\n\tb2Log(\" bd.bullet = bool(%d);\\n\", m_flags & e_bulletFlag);\n\tb2Log(\" bd.active = bool(%d);\\n\", m_flags & e_activeFlag);\n\tb2Log(\" bd.gravityScale = %.15lef;\\n\", m_gravityScale);\n\tb2Log(\" bodies[%d] = m_world->CreateBody(&bd);\\n\", m_islandIndex);\n\tb2Log(\"\\n\");\n\tfor (b2Fixture* f = m_fixtureList; f; f = f->m_next)\n\t{\n\t\tb2Log(\" {\\n\");\n\t\tf->Dump(bodyIndex);\n\t\tb2Log(\" }\\n\");\n\t}\n\tb2Log(\"}\\n\");\n}\n"
},
{
"path": "app/src/main/cpp/b2BroadPhase.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2BroadPhase.h\"\n\nb2BroadPhase::b2BroadPhase()\n{\n\tm_proxyCount = 0;\n\n\tm_pairCapacity = 16;\n\tm_pairCount = 0;\n\tm_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));\n\n\tm_moveCapacity = 16;\n\tm_moveCount = 0;\n\tm_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));\n}\n\nb2BroadPhase::~b2BroadPhase()\n{\n\tb2Free(m_moveBuffer);\n\tb2Free(m_pairBuffer);\n}\n\nint32 b2BroadPhase::CreateProxy(const b2AABB& aabb, void* userData)\n{\n\tint32 proxyId = m_tree.CreateProxy(aabb, userData);\n\t++m_proxyCount;\n\tBufferMove(proxyId);\n\treturn proxyId;\n}\n\nvoid b2BroadPhase::DestroyProxy(int32 proxyId)\n{\n\tUnBufferMove(proxyId);\n\t--m_proxyCount;\n\tm_tree.DestroyProxy(proxyId);\n}\n\nvoid b2BroadPhase::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement)\n{\n\tbool buffer = m_tree.MoveProxy(proxyId, aabb, displacement);\n\tif (buffer)\n\t{\n\t\tBufferMove(proxyId);\n\t}\n}\n\nvoid b2BroadPhase::TouchProxy(int32 proxyId)\n{\n\tBufferMove(proxyId);\n}\n\nvoid b2BroadPhase::BufferMove(int32 proxyId)\n{\n\tif (m_moveCount == m_moveCapacity)\n\t{\n\t\tint32* oldBuffer = m_moveBuffer;\n\t\tm_moveCapacity *= 2;\n\t\tm_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));\n\t\tmemcpy(m_moveBuffer, oldBuffer, m_moveCount * sizeof(int32));\n\t\tb2Free(oldBuffer);\n\t}\n\n\tm_moveBuffer[m_moveCount] = proxyId;\n\t++m_moveCount;\n}\n\nvoid b2BroadPhase::UnBufferMove(int32 proxyId)\n{\n\tfor (int32 i = 0; i < m_moveCount; ++i)\n\t{\n\t\tif (m_moveBuffer[i] == proxyId)\n\t\t{\n\t\t\tm_moveBuffer[i] = e_nullProxy;\n\t\t}\n\t}\n}\n\n// This is called from b2DynamicTree::Query when we are gathering pairs.\nbool b2BroadPhase::QueryCallback(int32 proxyId)\n{\n\t// A proxy cannot form a pair with itself.\n\tif (proxyId == m_queryProxyId)\n\t{\n\t\treturn true;\n\t}\n\n\t// Grow the pair buffer as needed.\n\tif (m_pairCount == m_pairCapacity)\n\t{\n\t\tb2Pair* oldBuffer = m_pairBuffer;\n\t\tm_pairCapacity *= 2;\n\t\tm_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));\n\t\tmemcpy(m_pairBuffer, oldBuffer, m_pairCount * sizeof(b2Pair));\n\t\tb2Free(oldBuffer);\n\t}\n\n\tm_pairBuffer[m_pairCount].proxyIdA = b2Min(proxyId, m_queryProxyId);\n\tm_pairBuffer[m_pairCount].proxyIdB = b2Max(proxyId, m_queryProxyId);\n\t++m_pairCount;\n\n\treturn true;\n}\n"
},
{
"path": "app/src/main/cpp/b2ChainAndCircleContact.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n\n#include \n\nb2Contact* b2ChainAndCircleContact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2ChainAndCircleContact));\n\treturn new (mem) b2ChainAndCircleContact(fixtureA, indexA, fixtureB, indexB);\n}\n\nvoid b2ChainAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2ChainAndCircleContact*)contact)->~b2ChainAndCircleContact();\n\tallocator->Free(contact, sizeof(b2ChainAndCircleContact));\n}\n\nb2ChainAndCircleContact::b2ChainAndCircleContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB)\n: b2Contact(fixtureA, indexA, fixtureB, indexB)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_chain);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_circle);\n}\n\nvoid b2ChainAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2ChainShape* chain = (b2ChainShape*)m_fixtureA->GetShape();\n\tb2EdgeShape edge;\n\tchain->GetChildEdge(&edge, m_indexA);\n\tb2CollideEdgeAndCircle(\tmanifold, &edge, xfA,\n\t\t\t\t\t\t\t(b2CircleShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2ChainAndPolygonContact.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n\n#include \n\nb2Contact* b2ChainAndPolygonContact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2ChainAndPolygonContact));\n\treturn new (mem) b2ChainAndPolygonContact(fixtureA, indexA, fixtureB, indexB);\n}\n\nvoid b2ChainAndPolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2ChainAndPolygonContact*)contact)->~b2ChainAndPolygonContact();\n\tallocator->Free(contact, sizeof(b2ChainAndPolygonContact));\n}\n\nb2ChainAndPolygonContact::b2ChainAndPolygonContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB)\n: b2Contact(fixtureA, indexA, fixtureB, indexB)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_chain);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);\n}\n\nvoid b2ChainAndPolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2ChainShape* chain = (b2ChainShape*)m_fixtureA->GetShape();\n\tb2EdgeShape edge;\n\tchain->GetChildEdge(&edge, m_indexA);\n\tb2CollideEdgeAndPolygon(\tmanifold, &edge, xfA,\n\t\t\t\t\t\t\t\t(b2PolygonShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2ChainShape.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \n#include \n#include \n\nb2ChainShape::~b2ChainShape()\n{\n\tb2Free(m_vertices);\n\tm_vertices = NULL;\n\tm_count = 0;\n}\n\nvoid b2ChainShape::CreateLoop(const b2Vec2* vertices, int32 count)\n{\n\tb2Assert(m_vertices == NULL && m_count == 0);\n\tb2Assert(count >= 3);\n\tfor (int32 i = 1; i < count; ++i)\n\t{\n\t\tb2Vec2 v1 = vertices[i-1];\n\t\tb2Vec2 v2 = vertices[i];\n\t\t// If the code crashes here, it means your vertices are too close together.\n\t\tb2Assert(b2DistanceSquared(v1, v2) > b2_linearSlop * b2_linearSlop);\n\t}\n\n\tm_count = count + 1;\n\tm_vertices = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));\n\tmemcpy(m_vertices, vertices, count * sizeof(b2Vec2));\n\tm_vertices[count] = m_vertices[0];\n\tm_prevVertex = m_vertices[m_count - 2];\n\tm_nextVertex = m_vertices[1];\n\tm_hasPrevVertex = true;\n\tm_hasNextVertex = true;\n}\n\nvoid b2ChainShape::CreateChain(const b2Vec2* vertices, int32 count)\n{\n\tb2Assert(m_vertices == NULL && m_count == 0);\n\tb2Assert(count >= 2);\n\tfor (int32 i = 1; i < count; ++i)\n\t{\n\t\tb2Vec2 v1 = vertices[i-1];\n\t\tb2Vec2 v2 = vertices[i];\n\t\t// If the code crashes here, it means your vertices are too close together.\n\t\tb2Assert(b2DistanceSquared(v1, v2) > b2_linearSlop * b2_linearSlop);\n\t}\n\n\tm_count = count;\n\tm_vertices = (b2Vec2*)b2Alloc(count * sizeof(b2Vec2));\n\tmemcpy(m_vertices, vertices, m_count * sizeof(b2Vec2));\n\n\tm_hasPrevVertex = false;\n\tm_hasNextVertex = false;\n\n\tm_prevVertex.SetZero();\n\tm_nextVertex.SetZero();\n}\n\nvoid b2ChainShape::SetPrevVertex(const b2Vec2& prevVertex)\n{\n\tm_prevVertex = prevVertex;\n\tm_hasPrevVertex = true;\n}\n\nvoid b2ChainShape::SetNextVertex(const b2Vec2& nextVertex)\n{\n\tm_nextVertex = nextVertex;\n\tm_hasNextVertex = true;\n}\n\nb2Shape* b2ChainShape::Clone(b2BlockAllocator* allocator) const\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2ChainShape));\n\tb2ChainShape* clone = new (mem) b2ChainShape;\n\tclone->CreateChain(m_vertices, m_count);\n\tclone->m_prevVertex = m_prevVertex;\n\tclone->m_nextVertex = m_nextVertex;\n\tclone->m_hasPrevVertex = m_hasPrevVertex;\n\tclone->m_hasNextVertex = m_hasNextVertex;\n\treturn clone;\n}\n\nint32 b2ChainShape::GetChildCount() const\n{\n\t// edge count = vertex count - 1\n\treturn m_count - 1;\n}\n\nvoid b2ChainShape::GetChildEdge(b2EdgeShape* edge, int32 index) const\n{\n\tb2Assert(0 <= index && index < m_count - 1);\n\tedge->m_type = b2Shape::e_edge;\n\tedge->m_radius = m_radius;\n\n\tedge->m_vertex1 = m_vertices[index + 0];\n\tedge->m_vertex2 = m_vertices[index + 1];\n\n\tif (index > 0)\n\t{\n\t\tedge->m_vertex0 = m_vertices[index - 1];\n\t\tedge->m_hasVertex0 = true;\n\t}\n\telse\n\t{\n\t\tedge->m_vertex0 = m_prevVertex;\n\t\tedge->m_hasVertex0 = m_hasPrevVertex;\n\t}\n\n\tif (index < m_count - 2)\n\t{\n\t\tedge->m_vertex3 = m_vertices[index + 2];\n\t\tedge->m_hasVertex3 = true;\n\t}\n\telse\n\t{\n\t\tedge->m_vertex3 = m_nextVertex;\n\t\tedge->m_hasVertex3 = m_hasNextVertex;\n\t}\n}\n\nbool b2ChainShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const\n{\n\tB2_NOT_USED(xf);\n\tB2_NOT_USED(p);\n\treturn false;\n}\n\nbool b2ChainShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\t\t\tconst b2Transform& xf, int32 childIndex) const\n{\n\tb2Assert(childIndex < m_count);\n\n\tb2EdgeShape edgeShape;\n\n\tint32 i1 = childIndex;\n\tint32 i2 = childIndex + 1;\n\tif (i2 == m_count)\n\t{\n\t\ti2 = 0;\n\t}\n\n\tedgeShape.m_vertex1 = m_vertices[i1];\n\tedgeShape.m_vertex2 = m_vertices[i2];\n\n\treturn edgeShape.RayCast(output, input, xf, 0);\n}\n\nvoid b2ChainShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const\n{\n\tb2Assert(childIndex < m_count);\n\n\tint32 i1 = childIndex;\n\tint32 i2 = childIndex + 1;\n\tif (i2 == m_count)\n\t{\n\t\ti2 = 0;\n\t}\n\n\tb2Vec2 v1 = b2Mul(xf, m_vertices[i1]);\n\tb2Vec2 v2 = b2Mul(xf, m_vertices[i2]);\n\n\taabb->lowerBound = b2Min(v1, v2);\n\taabb->upperBound = b2Max(v1, v2);\n}\n\nvoid b2ChainShape::ComputeMass(b2MassData* massData, float32 density) const\n{\n\tB2_NOT_USED(density);\n\n\tmassData->mass = 0.0f;\n\tmassData->center.SetZero();\n\tmassData->I = 0.0f;\n}\n"
},
{
"path": "app/src/main/cpp/b2CircleContact.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2CircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2WorldCallbacks.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h\"\n\n#include \n\nb2Contact* b2CircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2CircleContact));\n\treturn new (mem) b2CircleContact(fixtureA, fixtureB);\n}\n\nvoid b2CircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2CircleContact*)contact)->~b2CircleContact();\n\tallocator->Free(contact, sizeof(b2CircleContact));\n}\n\nb2CircleContact::b2CircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)\n\t: b2Contact(fixtureA, 0, fixtureB, 0)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_circle);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_circle);\n}\n\nvoid b2CircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2CollideCircles(manifold,\n\t\t\t\t\t(b2CircleShape*)m_fixtureA->GetShape(), xfA,\n\t\t\t\t\t(b2CircleShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2CircleShape.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \n\nb2Shape* b2CircleShape::Clone(b2BlockAllocator* allocator) const\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2CircleShape));\n\tb2CircleShape* clone = new (mem) b2CircleShape;\n\t*clone = *this;\n\treturn clone;\n}\n\nint32 b2CircleShape::GetChildCount() const\n{\n\treturn 1;\n}\n\nbool b2CircleShape::TestPoint(const b2Transform& transform, const b2Vec2& p) const\n{\n\tb2Vec2 center = transform.p + b2Mul(transform.q, m_p);\n\tb2Vec2 d = p - center;\n\treturn b2Dot(d, d) <= m_radius * m_radius;\n}\n\n// Collision Detection in Interactive 3D Environments by Gino van den Bergen\n// From Section 3.1.2\n// x = s + a * r\n// norm(x) = radius\nbool b2CircleShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\t\t\tconst b2Transform& transform, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\tb2Vec2 position = transform.p + b2Mul(transform.q, m_p);\n\tb2Vec2 s = input.p1 - position;\n\tfloat32 b = b2Dot(s, s) - m_radius * m_radius;\n\n\t// Solve quadratic equation.\n\tb2Vec2 r = input.p2 - input.p1;\n\tfloat32 c = b2Dot(s, r);\n\tfloat32 rr = b2Dot(r, r);\n\tfloat32 sigma = c * c - rr * b;\n\n\t// Check for negative discriminant and short segment.\n\tif (sigma < 0.0f || rr < b2_epsilon)\n\t{\n\t\treturn false;\n\t}\n\n\t// Find the point of intersection of the line with the circle.\n\tfloat32 a = -(c + b2Sqrt(sigma));\n\n\t// Is the intersection point on the segment?\n\tif (0.0f <= a && a <= input.maxFraction * rr)\n\t{\n\t\ta /= rr;\n\t\toutput->fraction = a;\n\t\toutput->normal = s + a * r;\n\t\toutput->normal.Normalize();\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid b2CircleShape::ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\tb2Vec2 p = transform.p + b2Mul(transform.q, m_p);\n\taabb->lowerBound.Set(p.x - m_radius, p.y - m_radius);\n\taabb->upperBound.Set(p.x + m_radius, p.y + m_radius);\n}\n\nvoid b2CircleShape::ComputeMass(b2MassData* massData, float32 density) const\n{\n\tmassData->mass = density * b2_pi * m_radius * m_radius;\n\tmassData->center = m_p;\n\n\t// inertia about the local origin\n\tmassData->I = massData->mass * (0.5f * m_radius * m_radius + b2Dot(m_p, m_p));\n}\n"
},
{
"path": "app/src/main/cpp/b2CollideCircle.cpp",
"content": "/*\n* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n\nvoid b2CollideCircles(\n\tb2Manifold* manifold,\n\tconst b2CircleShape* circleA, const b2Transform& xfA,\n\tconst b2CircleShape* circleB, const b2Transform& xfB)\n{\n\tmanifold->pointCount = 0;\n\n\tb2Vec2 pA = b2Mul(xfA, circleA->m_p);\n\tb2Vec2 pB = b2Mul(xfB, circleB->m_p);\n\n\tb2Vec2 d = pB - pA;\n\tfloat32 distSqr = b2Dot(d, d);\n\tfloat32 rA = circleA->m_radius, rB = circleB->m_radius;\n\tfloat32 radius = rA + rB;\n\tif (distSqr > radius * radius)\n\t{\n\t\treturn;\n\t}\n\n\tmanifold->type = b2Manifold::e_circles;\n\tmanifold->localPoint = circleA->m_p;\n\tmanifold->localNormal.SetZero();\n\tmanifold->pointCount = 1;\n\n\tmanifold->points[0].localPoint = circleB->m_p;\n\tmanifold->points[0].id.key = 0;\n}\n\nvoid b2CollidePolygonAndCircle(\n\tb2Manifold* manifold,\n\tconst b2PolygonShape* polygonA, const b2Transform& xfA,\n\tconst b2CircleShape* circleB, const b2Transform& xfB)\n{\n\tmanifold->pointCount = 0;\n\n\t// Compute circle position in the frame of the polygon.\n\tb2Vec2 c = b2Mul(xfB, circleB->m_p);\n\tb2Vec2 cLocal = b2MulT(xfA, c);\n\n\t// Find the min separating edge.\n\tint32 normalIndex = 0;\n\tfloat32 separation = -b2_maxFloat;\n\tfloat32 radius = polygonA->m_radius + circleB->m_radius;\n\tint32 vertexCount = polygonA->m_count;\n\tconst b2Vec2* vertices = polygonA->m_vertices;\n\tconst b2Vec2* normals = polygonA->m_normals;\n\n\tfor (int32 i = 0; i < vertexCount; ++i)\n\t{\n\t\tfloat32 s = b2Dot(normals[i], cLocal - vertices[i]);\n\n\t\tif (s > radius)\n\t\t{\n\t\t\t// Early out.\n\t\t\treturn;\n\t\t}\n\n\t\tif (s > separation)\n\t\t{\n\t\t\tseparation = s;\n\t\t\tnormalIndex = i;\n\t\t}\n\t}\n\n\t// Vertices that subtend the incident face.\n\tint32 vertIndex1 = normalIndex;\n\tint32 vertIndex2 = vertIndex1 + 1 < vertexCount ? vertIndex1 + 1 : 0;\n\tb2Vec2 v1 = vertices[vertIndex1];\n\tb2Vec2 v2 = vertices[vertIndex2];\n\n\t// If the center is inside the polygon ...\n\tif (separation < b2_epsilon)\n\t{\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_faceA;\n\t\tmanifold->localNormal = normals[normalIndex];\n\t\tmanifold->localPoint = 0.5f * (v1 + v2);\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\tmanifold->points[0].id.key = 0;\n\t\treturn;\n\t}\n\n\t// Compute barycentric coordinates\n\tfloat32 u1 = b2Dot(cLocal - v1, v2 - v1);\n\tfloat32 u2 = b2Dot(cLocal - v2, v1 - v2);\n\tif (u1 <= 0.0f)\n\t{\n\t\tif (b2DistanceSquared(cLocal, v1) > radius * radius)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_faceA;\n\t\tmanifold->localNormal = cLocal - v1;\n\t\tmanifold->localNormal.Normalize();\n\t\tmanifold->localPoint = v1;\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\tmanifold->points[0].id.key = 0;\n\t}\n\telse if (u2 <= 0.0f)\n\t{\n\t\tif (b2DistanceSquared(cLocal, v2) > radius * radius)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_faceA;\n\t\tmanifold->localNormal = cLocal - v2;\n\t\tmanifold->localNormal.Normalize();\n\t\tmanifold->localPoint = v2;\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\tmanifold->points[0].id.key = 0;\n\t}\n\telse\n\t{\n\t\tb2Vec2 faceCenter = 0.5f * (v1 + v2);\n\t\tfloat32 separation = b2Dot(cLocal - faceCenter, normals[vertIndex1]);\n\t\tif (separation > radius)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_faceA;\n\t\tmanifold->localNormal = normals[vertIndex1];\n\t\tmanifold->localPoint = faceCenter;\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\tmanifold->points[0].id.key = 0;\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2CollideEdge.cpp",
"content": "/*\n * Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n *\n * This software is provided 'as-is', without any express or implied\n * warranty. In no event will the authors be held liable for any damages\n * arising from the use of this software.\n * Permission is granted to anyone to use this software for any purpose,\n * including commercial applications, and to alter it and redistribute it\n * freely, subject to the following restrictions:\n * 1. The origin of this software must not be misrepresented; you must not\n * claim that you wrote the original software. If you use this software\n * in a product, an acknowledgment in the product documentation would be\n * appreciated but is not required.\n * 2. Altered source versions must be plainly marked as such, and must not be\n * misrepresented as being the original software.\n * 3. This notice may not be removed or altered from any source distribution.\n */\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n\n// Compute contact points for edge versus circle.\n// This accounts for edge connectivity.\nvoid b2CollideEdgeAndCircle(b2Manifold* manifold,\n\t\t\t\t\t\t\tconst b2EdgeShape* edgeA, const b2Transform& xfA,\n\t\t\t\t\t\t\tconst b2CircleShape* circleB, const b2Transform& xfB)\n{\n\tmanifold->pointCount = 0;\n\n\t// Compute circle in frame of edge\n\tb2Vec2 Q = b2MulT(xfA, b2Mul(xfB, circleB->m_p));\n\n\tb2Vec2 A = edgeA->m_vertex1, B = edgeA->m_vertex2;\n\tb2Vec2 e = B - A;\n\n\t// Barycentric coordinates\n\tfloat32 u = b2Dot(e, B - Q);\n\tfloat32 v = b2Dot(e, Q - A);\n\n\tfloat32 radius = edgeA->m_radius + circleB->m_radius;\n\n\tb2ContactFeature cf;\n\tcf.indexB = 0;\n\tcf.typeB = b2ContactFeature::e_vertex;\n\n\t// Region A\n\tif (v <= 0.0f)\n\t{\n\t\tb2Vec2 P = A;\n\t\tb2Vec2 d = Q - P;\n\t\tfloat32 dd = b2Dot(d, d);\n\t\tif (dd > radius * radius)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\t// Is there an edge connected to A?\n\t\tif (edgeA->m_hasVertex0)\n\t\t{\n\t\t\tb2Vec2 A1 = edgeA->m_vertex0;\n\t\t\tb2Vec2 B1 = A;\n\t\t\tb2Vec2 e1 = B1 - A1;\n\t\t\tfloat32 u1 = b2Dot(e1, B1 - Q);\n\n\t\t\t// Is the circle in Region AB of the previous edge?\n\t\t\tif (u1 > 0.0f)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tcf.indexA = 0;\n\t\tcf.typeA = b2ContactFeature::e_vertex;\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_circles;\n\t\tmanifold->localNormal.SetZero();\n\t\tmanifold->localPoint = P;\n\t\tmanifold->points[0].id.key = 0;\n\t\tmanifold->points[0].id.cf = cf;\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\treturn;\n\t}\n\n\t// Region B\n\tif (u <= 0.0f)\n\t{\n\t\tb2Vec2 P = B;\n\t\tb2Vec2 d = Q - P;\n\t\tfloat32 dd = b2Dot(d, d);\n\t\tif (dd > radius * radius)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\t// Is there an edge connected to B?\n\t\tif (edgeA->m_hasVertex3)\n\t\t{\n\t\t\tb2Vec2 B2 = edgeA->m_vertex3;\n\t\t\tb2Vec2 A2 = B;\n\t\t\tb2Vec2 e2 = B2 - A2;\n\t\t\tfloat32 v2 = b2Dot(e2, Q - A2);\n\n\t\t\t// Is the circle in Region AB of the next edge?\n\t\t\tif (v2 > 0.0f)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tcf.indexA = 1;\n\t\tcf.typeA = b2ContactFeature::e_vertex;\n\t\tmanifold->pointCount = 1;\n\t\tmanifold->type = b2Manifold::e_circles;\n\t\tmanifold->localNormal.SetZero();\n\t\tmanifold->localPoint = P;\n\t\tmanifold->points[0].id.key = 0;\n\t\tmanifold->points[0].id.cf = cf;\n\t\tmanifold->points[0].localPoint = circleB->m_p;\n\t\treturn;\n\t}\n\n\t// Region AB\n\tfloat32 den = b2Dot(e, e);\n\tb2Assert(den > 0.0f);\n\tb2Vec2 P = (1.0f / den) * (u * A + v * B);\n\tb2Vec2 d = Q - P;\n\tfloat32 dd = b2Dot(d, d);\n\tif (dd > radius * radius)\n\t{\n\t\treturn;\n\t}\n\n\tb2Vec2 n(-e.y, e.x);\n\tif (b2Dot(n, Q - A) < 0.0f)\n\t{\n\t\tn.Set(-n.x, -n.y);\n\t}\n\tn.Normalize();\n\n\tcf.indexA = 0;\n\tcf.typeA = b2ContactFeature::e_face;\n\tmanifold->pointCount = 1;\n\tmanifold->type = b2Manifold::e_faceA;\n\tmanifold->localNormal = n;\n\tmanifold->localPoint = A;\n\tmanifold->points[0].id.key = 0;\n\tmanifold->points[0].id.cf = cf;\n\tmanifold->points[0].localPoint = circleB->m_p;\n}\n\n// This structure is used to keep track of the best separating axis.\nstruct b2EPAxis\n{\n\tenum Type\n\t{\n\t\te_unknown,\n\t\te_edgeA,\n\t\te_edgeB\n\t};\n\n\tType type;\n\tint32 index;\n\tfloat32 separation;\n};\n\n// This holds polygon B expressed in frame A.\nstruct b2TempPolygon\n{\n\tb2Vec2 vertices[b2_maxPolygonVertices];\n\tb2Vec2 normals[b2_maxPolygonVertices];\n\tint32 count;\n};\n\n// Reference face used for clipping\nstruct b2ReferenceFace\n{\n\tint32 i1, i2;\n\n\tb2Vec2 v1, v2;\n\n\tb2Vec2 normal;\n\n\tb2Vec2 sideNormal1;\n\tfloat32 sideOffset1;\n\n\tb2Vec2 sideNormal2;\n\tfloat32 sideOffset2;\n};\n\n// This class collides and edge and a polygon, taking into account edge adjacency.\nstruct b2EPCollider\n{\n\tvoid Collide(b2Manifold* manifold, const b2EdgeShape* edgeA, const b2Transform& xfA,\n\t\t\t\t const b2PolygonShape* polygonB, const b2Transform& xfB);\n\tb2EPAxis ComputeEdgeSeparation();\n\tb2EPAxis ComputePolygonSeparation();\n\n\tenum VertexType\n\t{\n\t\te_isolated,\n\t\te_concave,\n\t\te_convex\n\t};\n\n\tb2TempPolygon m_polygonB;\n\n\tb2Transform m_xf;\n\tb2Vec2 m_centroidB;\n\tb2Vec2 m_v0, m_v1, m_v2, m_v3;\n\tb2Vec2 m_normal0, m_normal1, m_normal2;\n\tb2Vec2 m_normal;\n\tVertexType m_type1, m_type2;\n\tb2Vec2 m_lowerLimit, m_upperLimit;\n\tfloat32 m_radius;\n\tbool m_front;\n};\n\n// Algorithm:\n// 1. Classify v1 and v2\n// 2. Classify polygon centroid as front or back\n// 3. Flip normal if necessary\n// 4. Initialize normal range to [-pi, pi] about face normal\n// 5. Adjust normal range according to adjacent edges\n// 6. Visit each separating axes, only accept axes within the range\n// 7. Return if _any_ axis indicates separation\n// 8. Clip\nvoid b2EPCollider::Collide(b2Manifold* manifold, const b2EdgeShape* edgeA, const b2Transform& xfA,\n\t\t\t\t\t\t const b2PolygonShape* polygonB, const b2Transform& xfB)\n{\n\tm_xf = b2MulT(xfA, xfB);\n\n\tm_centroidB = b2Mul(m_xf, polygonB->m_centroid);\n\n\tm_v0 = edgeA->m_vertex0;\n\tm_v1 = edgeA->m_vertex1;\n\tm_v2 = edgeA->m_vertex2;\n\tm_v3 = edgeA->m_vertex3;\n\n\tbool hasVertex0 = edgeA->m_hasVertex0;\n\tbool hasVertex3 = edgeA->m_hasVertex3;\n\n\tb2Vec2 edge1 = m_v2 - m_v1;\n\tedge1.Normalize();\n\tm_normal1.Set(edge1.y, -edge1.x);\n\tfloat32 offset1 = b2Dot(m_normal1, m_centroidB - m_v1);\n\tfloat32 offset0 = 0.0f, offset2 = 0.0f;\n\tbool convex1 = false, convex2 = false;\n\n\t// Is there a preceding edge?\n\tif (hasVertex0)\n\t{\n\t\tb2Vec2 edge0 = m_v1 - m_v0;\n\t\tedge0.Normalize();\n\t\tm_normal0.Set(edge0.y, -edge0.x);\n\t\tconvex1 = b2Cross(edge0, edge1) >= 0.0f;\n\t\toffset0 = b2Dot(m_normal0, m_centroidB - m_v0);\n\t}\n\n\t// Is there a following edge?\n\tif (hasVertex3)\n\t{\n\t\tb2Vec2 edge2 = m_v3 - m_v2;\n\t\tedge2.Normalize();\n\t\tm_normal2.Set(edge2.y, -edge2.x);\n\t\tconvex2 = b2Cross(edge1, edge2) > 0.0f;\n\t\toffset2 = b2Dot(m_normal2, m_centroidB - m_v2);\n\t}\n\n\t// Determine front or back collision. Determine collision normal limits.\n\tif (hasVertex0 && hasVertex3)\n\t{\n\t\tif (convex1 && convex2)\n\t\t{\n\t\t\tm_front = offset0 >= 0.0f || offset1 >= 0.0f || offset2 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal0;\n\t\t\t\tm_upperLimit = m_normal2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal1;\n\t\t\t\tm_upperLimit = -m_normal1;\n\t\t\t}\n\t\t}\n\t\telse if (convex1)\n\t\t{\n\t\t\tm_front = offset0 >= 0.0f || (offset1 >= 0.0f && offset2 >= 0.0f);\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal0;\n\t\t\t\tm_upperLimit = m_normal1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal2;\n\t\t\t\tm_upperLimit = -m_normal1;\n\t\t\t}\n\t\t}\n\t\telse if (convex2)\n\t\t{\n\t\t\tm_front = offset2 >= 0.0f || (offset0 >= 0.0f && offset1 >= 0.0f);\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal1;\n\t\t\t\tm_upperLimit = m_normal2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal1;\n\t\t\t\tm_upperLimit = -m_normal0;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_front = offset0 >= 0.0f && offset1 >= 0.0f && offset2 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal1;\n\t\t\t\tm_upperLimit = m_normal1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal2;\n\t\t\t\tm_upperLimit = -m_normal0;\n\t\t\t}\n\t\t}\n\t}\n\telse if (hasVertex0)\n\t{\n\t\tif (convex1)\n\t\t{\n\t\t\tm_front = offset0 >= 0.0f || offset1 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal0;\n\t\t\t\tm_upperLimit = -m_normal1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = m_normal1;\n\t\t\t\tm_upperLimit = -m_normal1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_front = offset0 >= 0.0f && offset1 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = m_normal1;\n\t\t\t\tm_upperLimit = -m_normal1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = m_normal1;\n\t\t\t\tm_upperLimit = -m_normal0;\n\t\t\t}\n\t\t}\n\t}\n\telse if (hasVertex3)\n\t{\n\t\tif (convex2)\n\t\t{\n\t\t\tm_front = offset1 >= 0.0f || offset2 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal1;\n\t\t\t\tm_upperLimit = m_normal2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal1;\n\t\t\t\tm_upperLimit = m_normal1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_front = offset1 >= 0.0f && offset2 >= 0.0f;\n\t\t\tif (m_front)\n\t\t\t{\n\t\t\t\tm_normal = m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal1;\n\t\t\t\tm_upperLimit = m_normal1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_normal = -m_normal1;\n\t\t\t\tm_lowerLimit = -m_normal2;\n\t\t\t\tm_upperLimit = m_normal1;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_front = offset1 >= 0.0f;\n\t\tif (m_front)\n\t\t{\n\t\t\tm_normal = m_normal1;\n\t\t\tm_lowerLimit = -m_normal1;\n\t\t\tm_upperLimit = -m_normal1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_normal = -m_normal1;\n\t\t\tm_lowerLimit = m_normal1;\n\t\t\tm_upperLimit = m_normal1;\n\t\t}\n\t}\n\n\t// Get polygonB in frameA\n\tm_polygonB.count = polygonB->m_count;\n\tfor (int32 i = 0; i < polygonB->m_count; ++i)\n\t{\n\t\tm_polygonB.vertices[i] = b2Mul(m_xf, polygonB->m_vertices[i]);\n\t\tm_polygonB.normals[i] = b2Mul(m_xf.q, polygonB->m_normals[i]);\n\t}\n\n\tm_radius = 2.0f * b2_polygonRadius;\n\n\tmanifold->pointCount = 0;\n\n\tb2EPAxis edgeAxis = ComputeEdgeSeparation();\n\n\t// If no valid normal can be found than this edge should not collide.\n\tif (edgeAxis.type == b2EPAxis::e_unknown)\n\t{\n\t\treturn;\n\t}\n\n\tif (edgeAxis.separation > m_radius)\n\t{\n\t\treturn;\n\t}\n\n\tb2EPAxis polygonAxis = ComputePolygonSeparation();\n\tif (polygonAxis.type != b2EPAxis::e_unknown && polygonAxis.separation > m_radius)\n\t{\n\t\treturn;\n\t}\n\n\t// Use hysteresis for jitter reduction.\n\tconst float32 k_relativeTol = 0.98f;\n\tconst float32 k_absoluteTol = 0.001f;\n\n\tb2EPAxis primaryAxis;\n\tif (polygonAxis.type == b2EPAxis::e_unknown)\n\t{\n\t\tprimaryAxis = edgeAxis;\n\t}\n\telse if (polygonAxis.separation > k_relativeTol * edgeAxis.separation + k_absoluteTol)\n\t{\n\t\tprimaryAxis = polygonAxis;\n\t}\n\telse\n\t{\n\t\tprimaryAxis = edgeAxis;\n\t}\n\n\tb2ClipVertex ie[2];\n\tb2ReferenceFace rf;\n\tif (primaryAxis.type == b2EPAxis::e_edgeA)\n\t{\n\t\tmanifold->type = b2Manifold::e_faceA;\n\n\t\t// Search for the polygon normal that is most anti-parallel to the edge normal.\n\t\tint32 bestIndex = 0;\n\t\tfloat32 bestValue = b2Dot(m_normal, m_polygonB.normals[0]);\n\t\tfor (int32 i = 1; i < m_polygonB.count; ++i)\n\t\t{\n\t\t\tfloat32 value = b2Dot(m_normal, m_polygonB.normals[i]);\n\t\t\tif (value < bestValue)\n\t\t\t{\n\t\t\t\tbestValue = value;\n\t\t\t\tbestIndex = i;\n\t\t\t}\n\t\t}\n\n\t\tint32 i1 = bestIndex;\n\t\tint32 i2 = i1 + 1 < m_polygonB.count ? i1 + 1 : 0;\n\n\t\tie[0].v = m_polygonB.vertices[i1];\n\t\tie[0].id.cf.indexA = 0;\n\t\tie[0].id.cf.indexB = static_cast(i1);\n\t\tie[0].id.cf.typeA = b2ContactFeature::e_face;\n\t\tie[0].id.cf.typeB = b2ContactFeature::e_vertex;\n\n\t\tie[1].v = m_polygonB.vertices[i2];\n\t\tie[1].id.cf.indexA = 0;\n\t\tie[1].id.cf.indexB = static_cast(i2);\n\t\tie[1].id.cf.typeA = b2ContactFeature::e_face;\n\t\tie[1].id.cf.typeB = b2ContactFeature::e_vertex;\n\n\t\tif (m_front)\n\t\t{\n\t\t\trf.i1 = 0;\n\t\t\trf.i2 = 1;\n\t\t\trf.v1 = m_v1;\n\t\t\trf.v2 = m_v2;\n\t\t\trf.normal = m_normal1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\trf.i1 = 1;\n\t\t\trf.i2 = 0;\n\t\t\trf.v1 = m_v2;\n\t\t\trf.v2 = m_v1;\n\t\t\trf.normal = -m_normal1;\n\t\t}\n\t}\n\telse\n\t{\n\t\tmanifold->type = b2Manifold::e_faceB;\n\n\t\tie[0].v = m_v1;\n\t\tie[0].id.cf.indexA = 0;\n\t\tie[0].id.cf.indexB = static_cast(primaryAxis.index);\n\t\tie[0].id.cf.typeA = b2ContactFeature::e_vertex;\n\t\tie[0].id.cf.typeB = b2ContactFeature::e_face;\n\n\t\tie[1].v = m_v2;\n\t\tie[1].id.cf.indexA = 0;\n\t\tie[1].id.cf.indexB = static_cast(primaryAxis.index);\n\t\tie[1].id.cf.typeA = b2ContactFeature::e_vertex;\n\t\tie[1].id.cf.typeB = b2ContactFeature::e_face;\n\n\t\trf.i1 = primaryAxis.index;\n\t\trf.i2 = rf.i1 + 1 < m_polygonB.count ? rf.i1 + 1 : 0;\n\t\trf.v1 = m_polygonB.vertices[rf.i1];\n\t\trf.v2 = m_polygonB.vertices[rf.i2];\n\t\trf.normal = m_polygonB.normals[rf.i1];\n\t}\n\n\trf.sideNormal1.Set(rf.normal.y, -rf.normal.x);\n\trf.sideNormal2 = -rf.sideNormal1;\n\trf.sideOffset1 = b2Dot(rf.sideNormal1, rf.v1);\n\trf.sideOffset2 = b2Dot(rf.sideNormal2, rf.v2);\n\n\t// Clip incident edge against extruded edge1 side edges.\n\tb2ClipVertex clipPoints1[2];\n\tb2ClipVertex clipPoints2[2];\n\tint32 np;\n\n\t// Clip to box side 1\n\tnp = b2ClipSegmentToLine(clipPoints1, ie, rf.sideNormal1, rf.sideOffset1, rf.i1);\n\n\tif (np < b2_maxManifoldPoints)\n\t{\n\t\treturn;\n\t}\n\n\t// Clip to negative box side 1\n\tnp = b2ClipSegmentToLine(clipPoints2, clipPoints1, rf.sideNormal2, rf.sideOffset2, rf.i2);\n\n\tif (np < b2_maxManifoldPoints)\n\t{\n\t\treturn;\n\t}\n\n\t// Now clipPoints2 contains the clipped points.\n\tif (primaryAxis.type == b2EPAxis::e_edgeA)\n\t{\n\t\tmanifold->localNormal = rf.normal;\n\t\tmanifold->localPoint = rf.v1;\n\t}\n\telse\n\t{\n\t\tmanifold->localNormal = polygonB->m_normals[rf.i1];\n\t\tmanifold->localPoint = polygonB->m_vertices[rf.i1];\n\t}\n\n\tint32 pointCount = 0;\n\tfor (int32 i = 0; i < b2_maxManifoldPoints; ++i)\n\t{\n\t\tfloat32 separation;\n\n\t\tseparation = b2Dot(rf.normal, clipPoints2[i].v - rf.v1);\n\n\t\tif (separation <= m_radius)\n\t\t{\n\t\t\tb2ManifoldPoint* cp = manifold->points + pointCount;\n\n\t\t\tif (primaryAxis.type == b2EPAxis::e_edgeA)\n\t\t\t{\n\t\t\t\tcp->localPoint = b2MulT(m_xf, clipPoints2[i].v);\n\t\t\t\tcp->id = clipPoints2[i].id;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcp->localPoint = clipPoints2[i].v;\n\t\t\t\tcp->id.cf.typeA = clipPoints2[i].id.cf.typeB;\n\t\t\t\tcp->id.cf.typeB = clipPoints2[i].id.cf.typeA;\n\t\t\t\tcp->id.cf.indexA = clipPoints2[i].id.cf.indexB;\n\t\t\t\tcp->id.cf.indexB = clipPoints2[i].id.cf.indexA;\n\t\t\t}\n\n\t\t\t++pointCount;\n\t\t}\n\t}\n\n\tmanifold->pointCount = pointCount;\n}\n\nb2EPAxis b2EPCollider::ComputeEdgeSeparation()\n{\n\tb2EPAxis axis;\n\taxis.type = b2EPAxis::e_edgeA;\n\taxis.index = m_front ? 0 : 1;\n\taxis.separation = FLT_MAX;\n\n\tfor (int32 i = 0; i < m_polygonB.count; ++i)\n\t{\n\t\tfloat32 s = b2Dot(m_normal, m_polygonB.vertices[i] - m_v1);\n\t\tif (s < axis.separation)\n\t\t{\n\t\t\taxis.separation = s;\n\t\t}\n\t}\n\n\treturn axis;\n}\n\nb2EPAxis b2EPCollider::ComputePolygonSeparation()\n{\n\tb2EPAxis axis;\n\taxis.type = b2EPAxis::e_unknown;\n\taxis.index = -1;\n\taxis.separation = -FLT_MAX;\n\n\tb2Vec2 perp(-m_normal.y, m_normal.x);\n\n\tfor (int32 i = 0; i < m_polygonB.count; ++i)\n\t{\n\t\tb2Vec2 n = -m_polygonB.normals[i];\n\n\t\tfloat32 s1 = b2Dot(n, m_polygonB.vertices[i] - m_v1);\n\t\tfloat32 s2 = b2Dot(n, m_polygonB.vertices[i] - m_v2);\n\t\tfloat32 s = b2Min(s1, s2);\n\n\t\tif (s > m_radius)\n\t\t{\n\t\t\t// No collision\n\t\t\taxis.type = b2EPAxis::e_edgeB;\n\t\t\taxis.index = i;\n\t\t\taxis.separation = s;\n\t\t\treturn axis;\n\t\t}\n\n\t\t// Adjacency\n\t\tif (b2Dot(n, perp) >= 0.0f)\n\t\t{\n\t\t\tif (b2Dot(n - m_upperLimit, m_normal) < -b2_angularSlop)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (b2Dot(n - m_lowerLimit, m_normal) < -b2_angularSlop)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (s > axis.separation)\n\t\t{\n\t\t\taxis.type = b2EPAxis::e_edgeB;\n\t\t\taxis.index = i;\n\t\t\taxis.separation = s;\n\t\t}\n\t}\n\n\treturn axis;\n}\n\nvoid b2CollideEdgeAndPolygon(\tb2Manifold* manifold,\n\t\t\t\t\t\t\t const b2EdgeShape* edgeA, const b2Transform& xfA,\n\t\t\t\t\t\t\t const b2PolygonShape* polygonB, const b2Transform& xfB)\n{\n\tb2EPCollider collider;\n\tcollider.Collide(manifold, edgeA, xfA, polygonB, xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2CollidePolygon.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n\n// Find the max separation between poly1 and poly2 using edge normals from poly1.\nstatic float32 b2FindMaxSeparation(int32* edgeIndex,\n\t\t\t\t\t\t\t\t const b2PolygonShape* poly1, const b2Transform& xf1,\n\t\t\t\t\t\t\t\t const b2PolygonShape* poly2, const b2Transform& xf2)\n{\n\tint32 count1 = poly1->m_count;\n\tint32 count2 = poly2->m_count;\n\tconst b2Vec2* n1s = poly1->m_normals;\n\tconst b2Vec2* v1s = poly1->m_vertices;\n\tconst b2Vec2* v2s = poly2->m_vertices;\n\tb2Transform xf = b2MulT(xf2, xf1);\n\n\tint32 bestIndex = 0;\n\tfloat32 maxSeparation = -b2_maxFloat;\n\tfor (int32 i = 0; i < count1; ++i)\n\t{\n\t\t// Get poly1 normal in frame2.\n\t\tb2Vec2 n = b2Mul(xf.q, n1s[i]);\n\t\tb2Vec2 v1 = b2Mul(xf, v1s[i]);\n\n\t\t// Find deepest point for normal i.\n\t\tfloat32 si = b2_maxFloat;\n\t\tfor (int32 j = 0; j < count2; ++j)\n\t\t{\n\t\t\tfloat32 sij = b2Dot(n, v2s[j] - v1);\n\t\t\tif (sij < si)\n\t\t\t{\n\t\t\t\tsi = sij;\n\t\t\t}\n\t\t}\n\n\t\tif (si > maxSeparation)\n\t\t{\n\t\t\tmaxSeparation = si;\n\t\t\tbestIndex = i;\n\t\t}\n\t}\n\n\t*edgeIndex = bestIndex;\n\treturn maxSeparation;\n}\n\nstatic void b2FindIncidentEdge(b2ClipVertex c[2],\n\t\t\t\t\t\t\t const b2PolygonShape* poly1, const b2Transform& xf1, int32 edge1,\n\t\t\t\t\t\t\t const b2PolygonShape* poly2, const b2Transform& xf2)\n{\n\tconst b2Vec2* normals1 = poly1->m_normals;\n\n\tint32 count2 = poly2->m_count;\n\tconst b2Vec2* vertices2 = poly2->m_vertices;\n\tconst b2Vec2* normals2 = poly2->m_normals;\n\n\tb2Assert(0 <= edge1 && edge1 < poly1->m_count);\n\n\t// Get the normal of the reference edge in poly2's frame.\n\tb2Vec2 normal1 = b2MulT(xf2.q, b2Mul(xf1.q, normals1[edge1]));\n\n\t// Find the incident edge on poly2.\n\tint32 index = 0;\n\tfloat32 minDot = b2_maxFloat;\n\tfor (int32 i = 0; i < count2; ++i)\n\t{\n\t\tfloat32 dot = b2Dot(normal1, normals2[i]);\n\t\tif (dot < minDot)\n\t\t{\n\t\t\tminDot = dot;\n\t\t\tindex = i;\n\t\t}\n\t}\n\n\t// Build the clip vertices for the incident edge.\n\tint32 i1 = index;\n\tint32 i2 = i1 + 1 < count2 ? i1 + 1 : 0;\n\n\tc[0].v = b2Mul(xf2, vertices2[i1]);\n\tc[0].id.cf.indexA = (uint8)edge1;\n\tc[0].id.cf.indexB = (uint8)i1;\n\tc[0].id.cf.typeA = b2ContactFeature::e_face;\n\tc[0].id.cf.typeB = b2ContactFeature::e_vertex;\n\n\tc[1].v = b2Mul(xf2, vertices2[i2]);\n\tc[1].id.cf.indexA = (uint8)edge1;\n\tc[1].id.cf.indexB = (uint8)i2;\n\tc[1].id.cf.typeA = b2ContactFeature::e_face;\n\tc[1].id.cf.typeB = b2ContactFeature::e_vertex;\n}\n\n// Find edge normal of max separation on A - return if separating axis is found\n// Find edge normal of max separation on B - return if separation axis is found\n// Choose reference edge as min(minA, minB)\n// Find incident edge\n// Clip\n\n// The normal points from 1 to 2\nvoid b2CollidePolygons(b2Manifold* manifold,\n\t\t\t\t\t const b2PolygonShape* polyA, const b2Transform& xfA,\n\t\t\t\t\t const b2PolygonShape* polyB, const b2Transform& xfB)\n{\n\tmanifold->pointCount = 0;\n\tfloat32 totalRadius = polyA->m_radius + polyB->m_radius;\n\n\tint32 edgeA = 0;\n\tfloat32 separationA = b2FindMaxSeparation(&edgeA, polyA, xfA, polyB, xfB);\n\tif (separationA > totalRadius)\n\t\treturn;\n\n\tint32 edgeB = 0;\n\tfloat32 separationB = b2FindMaxSeparation(&edgeB, polyB, xfB, polyA, xfA);\n\tif (separationB > totalRadius)\n\t\treturn;\n\n\tconst b2PolygonShape* poly1;\t// reference polygon\n\tconst b2PolygonShape* poly2;\t// incident polygon\n\tb2Transform xf1, xf2;\n\tint32 edge1;\t\t\t\t\t// reference edge\n\tuint8 flip;\n\tconst float32 k_tol = 0.1f * b2_linearSlop;\n\n\tif (separationB > separationA + k_tol)\n\t{\n\t\tpoly1 = polyB;\n\t\tpoly2 = polyA;\n\t\txf1 = xfB;\n\t\txf2 = xfA;\n\t\tedge1 = edgeB;\n\t\tmanifold->type = b2Manifold::e_faceB;\n\t\tflip = 1;\n\t}\n\telse\n\t{\n\t\tpoly1 = polyA;\n\t\tpoly2 = polyB;\n\t\txf1 = xfA;\n\t\txf2 = xfB;\n\t\tedge1 = edgeA;\n\t\tmanifold->type = b2Manifold::e_faceA;\n\t\tflip = 0;\n\t}\n\n\tb2ClipVertex incidentEdge[2];\n\tb2FindIncidentEdge(incidentEdge, poly1, xf1, edge1, poly2, xf2);\n\n\tint32 count1 = poly1->m_count;\n\tconst b2Vec2* vertices1 = poly1->m_vertices;\n\n\tint32 iv1 = edge1;\n\tint32 iv2 = edge1 + 1 < count1 ? edge1 + 1 : 0;\n\n\tb2Vec2 v11 = vertices1[iv1];\n\tb2Vec2 v12 = vertices1[iv2];\n\n\tb2Vec2 localTangent = v12 - v11;\n\tlocalTangent.Normalize();\n\n\tb2Vec2 localNormal = b2Cross(localTangent, 1.0f);\n\tb2Vec2 planePoint = 0.5f * (v11 + v12);\n\n\tb2Vec2 tangent = b2Mul(xf1.q, localTangent);\n\tb2Vec2 normal = b2Cross(tangent, 1.0f);\n\n\tv11 = b2Mul(xf1, v11);\n\tv12 = b2Mul(xf1, v12);\n\n\t// Face offset.\n\tfloat32 frontOffset = b2Dot(normal, v11);\n\n\t// Side offsets, extended by polytope skin thickness.\n\tfloat32 sideOffset1 = -b2Dot(tangent, v11) + totalRadius;\n\tfloat32 sideOffset2 = b2Dot(tangent, v12) + totalRadius;\n\n\t// Clip incident edge against extruded edge1 side edges.\n\tb2ClipVertex clipPoints1[2];\n\tb2ClipVertex clipPoints2[2];\n\tint np;\n\n\t// Clip to box side 1\n\tnp = b2ClipSegmentToLine(clipPoints1, incidentEdge, -tangent, sideOffset1, iv1);\n\n\tif (np < 2)\n\t\treturn;\n\n\t// Clip to negative box side 1\n\tnp = b2ClipSegmentToLine(clipPoints2, clipPoints1, tangent, sideOffset2, iv2);\n\n\tif (np < 2)\n\t{\n\t\treturn;\n\t}\n\n\t// Now clipPoints2 contains the clipped points.\n\tmanifold->localNormal = localNormal;\n\tmanifold->localPoint = planePoint;\n\n\tint32 pointCount = 0;\n\tfor (int32 i = 0; i < b2_maxManifoldPoints; ++i)\n\t{\n\t\tfloat32 separation = b2Dot(normal, clipPoints2[i].v) - frontOffset;\n\n\t\tif (separation <= totalRadius)\n\t\t{\n\t\t\tb2ManifoldPoint* cp = manifold->points + pointCount;\n\t\t\tcp->localPoint = b2MulT(xf2, clipPoints2[i].v);\n\t\t\tcp->id = clipPoints2[i].id;\n\t\t\tif (flip)\n\t\t\t{\n\t\t\t\t// Swap features\n\t\t\t\tb2ContactFeature cf = cp->id.cf;\n\t\t\t\tcp->id.cf.indexA = cf.indexB;\n\t\t\t\tcp->id.cf.indexB = cf.indexA;\n\t\t\t\tcp->id.cf.typeA = cf.typeB;\n\t\t\t\tcp->id.cf.typeB = cf.typeA;\n\t\t\t}\n\t\t\t++pointCount;\n\t\t}\n\t}\n\n\tmanifold->pointCount = pointCount;\n}\n"
},
{
"path": "app/src/main/cpp/b2Collision.cpp",
"content": "/*\n* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2Distance.h\"\n\nvoid b2WorldManifold::Initialize(const b2Manifold* manifold,\n\t\t\t\t\t\t const b2Transform& xfA, float32 radiusA,\n\t\t\t\t\t\t const b2Transform& xfB, float32 radiusB)\n{\n\tif (manifold->pointCount == 0)\n\t{\n\t\treturn;\n\t}\n\n\tswitch (manifold->type)\n\t{\n\tcase b2Manifold::e_circles:\n\t\t{\n\t\t\tnormal.Set(1.0f, 0.0f);\n\t\t\tb2Vec2 pointA = b2Mul(xfA, manifold->localPoint);\n\t\t\tb2Vec2 pointB = b2Mul(xfB, manifold->points[0].localPoint);\n\t\t\tif (b2DistanceSquared(pointA, pointB) > b2_epsilon * b2_epsilon)\n\t\t\t{\n\t\t\t\tnormal = pointB - pointA;\n\t\t\t\tnormal.Normalize();\n\t\t\t}\n\n\t\t\tb2Vec2 cA = pointA + radiusA * normal;\n\t\t\tb2Vec2 cB = pointB - radiusB * normal;\n\t\t\tpoints[0] = 0.5f * (cA + cB);\n\t\t\tseparations[0] = b2Dot(cB - cA, normal);\n\t\t}\n\t\tbreak;\n\n\tcase b2Manifold::e_faceA:\n\t\t{\n\t\t\tnormal = b2Mul(xfA.q, manifold->localNormal);\n\t\t\tb2Vec2 planePoint = b2Mul(xfA, manifold->localPoint);\n\n\t\t\tfor (int32 i = 0; i < manifold->pointCount; ++i)\n\t\t\t{\n\t\t\t\tb2Vec2 clipPoint = b2Mul(xfB, manifold->points[i].localPoint);\n\t\t\t\tb2Vec2 cA = clipPoint + (radiusA - b2Dot(clipPoint - planePoint, normal)) * normal;\n\t\t\t\tb2Vec2 cB = clipPoint - radiusB * normal;\n\t\t\t\tpoints[i] = 0.5f * (cA + cB);\n\t\t\t\tseparations[i] = b2Dot(cB - cA, normal);\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\tcase b2Manifold::e_faceB:\n\t\t{\n\t\t\tnormal = b2Mul(xfB.q, manifold->localNormal);\n\t\t\tb2Vec2 planePoint = b2Mul(xfB, manifold->localPoint);\n\n\t\t\tfor (int32 i = 0; i < manifold->pointCount; ++i)\n\t\t\t{\n\t\t\t\tb2Vec2 clipPoint = b2Mul(xfA, manifold->points[i].localPoint);\n\t\t\t\tb2Vec2 cB = clipPoint + (radiusB - b2Dot(clipPoint - planePoint, normal)) * normal;\n\t\t\t\tb2Vec2 cA = clipPoint - radiusA * normal;\n\t\t\t\tpoints[i] = 0.5f * (cA + cB);\n\t\t\t\tseparations[i] = b2Dot(cA - cB, normal);\n\t\t\t}\n\n\t\t\t// Ensure normal points from A to B.\n\t\t\tnormal = -normal;\n\t\t}\n\t\tbreak;\n\t}\n}\n\nvoid b2GetPointStates(b2PointState state1[b2_maxManifoldPoints], b2PointState state2[b2_maxManifoldPoints],\n\t\t\t\t\t const b2Manifold* manifold1, const b2Manifold* manifold2)\n{\n\tfor (int32 i = 0; i < b2_maxManifoldPoints; ++i)\n\t{\n\t\tstate1[i] = b2_nullState;\n\t\tstate2[i] = b2_nullState;\n\t}\n\n\t// Detect persists and removes.\n\tfor (int32 i = 0; i < manifold1->pointCount; ++i)\n\t{\n\t\tb2ContactID id = manifold1->points[i].id;\n\n\t\tstate1[i] = b2_removeState;\n\n\t\tfor (int32 j = 0; j < manifold2->pointCount; ++j)\n\t\t{\n\t\t\tif (manifold2->points[j].id.key == id.key)\n\t\t\t{\n\t\t\t\tstate1[i] = b2_persistState;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Detect persists and adds.\n\tfor (int32 i = 0; i < manifold2->pointCount; ++i)\n\t{\n\t\tb2ContactID id = manifold2->points[i].id;\n\n\t\tstate2[i] = b2_addState;\n\n\t\tfor (int32 j = 0; j < manifold1->pointCount; ++j)\n\t\t{\n\t\t\tif (manifold1->points[j].id.key == id.key)\n\t\t\t{\n\t\t\t\tstate2[i] = b2_persistState;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n// From Real-time Collision Detection, p179.\nbool b2AABB::RayCast(b2RayCastOutput* output, const b2RayCastInput& input) const\n{\n\tfloat32 tmin = -b2_maxFloat;\n\tfloat32 tmax = b2_maxFloat;\n\n\tb2Vec2 p = input.p1;\n\tb2Vec2 d = input.p2 - input.p1;\n\tb2Vec2 absD = b2Abs(d);\n\n\tb2Vec2 normal;\n\n\tfor (int32 i = 0; i < 2; ++i)\n\t{\n\t\tif (absD(i) < b2_epsilon)\n\t\t{\n\t\t\t// Parallel.\n\t\t\tif (p(i) < lowerBound(i) || upperBound(i) < p(i))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat32 inv_d = 1.0f / d(i);\n\t\t\tfloat32 t1 = (lowerBound(i) - p(i)) * inv_d;\n\t\t\tfloat32 t2 = (upperBound(i) - p(i)) * inv_d;\n\n\t\t\t// Sign of the normal vector.\n\t\t\tfloat32 s = -1.0f;\n\n\t\t\tif (t1 > t2)\n\t\t\t{\n\t\t\t\tb2Swap(t1, t2);\n\t\t\t\ts = 1.0f;\n\t\t\t}\n\n\t\t\t// Push the min up\n\t\t\tif (t1 > tmin)\n\t\t\t{\n\t\t\t\tnormal.SetZero();\n\t\t\t\tnormal(i) = s;\n\t\t\t\ttmin = t1;\n\t\t\t}\n\n\t\t\t// Pull the max down\n\t\t\ttmax = b2Min(tmax, t2);\n\n\t\t\tif (tmin > tmax)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Does the ray start inside the box?\n\t// Does the ray intersect beyond the max fraction?\n\tif (tmin < 0.0f || input.maxFraction < tmin)\n\t{\n\t\treturn false;\n\t}\n\n\t// Intersection.\n\toutput->fraction = tmin;\n\toutput->normal = normal;\n\treturn true;\n}\n\n// Sutherland-Hodgman clipping.\nint32 b2ClipSegmentToLine(b2ClipVertex vOut[2], const b2ClipVertex vIn[2],\n\t\t\t\t\t\tconst b2Vec2& normal, float32 offset, int32 vertexIndexA)\n{\n\t// Start with no output points\n\tint32 numOut = 0;\n\n\t// Calculate the distance of end points to the line\n\tfloat32 distance0 = b2Dot(normal, vIn[0].v) - offset;\n\tfloat32 distance1 = b2Dot(normal, vIn[1].v) - offset;\n\n\t// If the points are behind the plane\n\tif (distance0 <= 0.0f) vOut[numOut++] = vIn[0];\n\tif (distance1 <= 0.0f) vOut[numOut++] = vIn[1];\n\n\t// If the points are on different sides of the plane\n\tif (distance0 * distance1 < 0.0f)\n\t{\n\t\t// Find intersection point of edge and plane\n\t\tfloat32 interp = distance0 / (distance0 - distance1);\n\t\tvOut[numOut].v = vIn[0].v + interp * (vIn[1].v - vIn[0].v);\n\n\t\t// VertexA is hitting edgeB.\n\t\tvOut[numOut].id.cf.indexA = static_cast(vertexIndexA);\n\t\tvOut[numOut].id.cf.indexB = vIn[0].id.cf.indexB;\n\t\tvOut[numOut].id.cf.typeA = b2ContactFeature::e_vertex;\n\t\tvOut[numOut].id.cf.typeB = b2ContactFeature::e_face;\n\t\t++numOut;\n\t}\n\n\treturn numOut;\n}\n\nbool b2TestOverlap(\tconst b2Shape* shapeA, int32 indexA,\n\t\t\t\t\tconst b2Shape* shapeB, int32 indexB,\n\t\t\t\t\tconst b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2DistanceInput input;\n\tinput.proxyA.Set(shapeA, indexA);\n\tinput.proxyB.Set(shapeB, indexB);\n\tinput.transformA = xfA;\n\tinput.transformB = xfB;\n\tinput.useRadii = true;\n\n\tb2SimplexCache cache;\n\tcache.count = 0;\n\n\tb2DistanceOutput output;\n\n\tb2Distance(&output, &cache, &input);\n\n\treturn output.distance < 10.0f * b2_epsilon;\n}\n"
},
{
"path": "app/src/main/cpp/b2Contact.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2CircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2CircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ContactSolver.h\"\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2Shape.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n\nb2ContactRegister b2Contact::s_registers[b2Shape::e_typeCount][b2Shape::e_typeCount];\nbool b2Contact::s_initialized = false;\n\nvoid b2Contact::InitializeRegisters()\n{\n\tAddType(b2CircleContact::Create, b2CircleContact::Destroy, b2Shape::e_circle, b2Shape::e_circle);\n\tAddType(b2PolygonAndCircleContact::Create, b2PolygonAndCircleContact::Destroy, b2Shape::e_polygon, b2Shape::e_circle);\n\tAddType(b2PolygonContact::Create, b2PolygonContact::Destroy, b2Shape::e_polygon, b2Shape::e_polygon);\n\tAddType(b2EdgeAndCircleContact::Create, b2EdgeAndCircleContact::Destroy, b2Shape::e_edge, b2Shape::e_circle);\n\tAddType(b2EdgeAndPolygonContact::Create, b2EdgeAndPolygonContact::Destroy, b2Shape::e_edge, b2Shape::e_polygon);\n\tAddType(b2ChainAndCircleContact::Create, b2ChainAndCircleContact::Destroy, b2Shape::e_chain, b2Shape::e_circle);\n\tAddType(b2ChainAndPolygonContact::Create, b2ChainAndPolygonContact::Destroy, b2Shape::e_chain, b2Shape::e_polygon);\n}\n\nvoid b2Contact::AddType(b2ContactCreateFcn* createFcn, b2ContactDestroyFcn* destoryFcn,\n\t\t\t\t\t\tb2Shape::Type type1, b2Shape::Type type2)\n{\n\tb2Assert(0 <= type1 && type1 < b2Shape::e_typeCount);\n\tb2Assert(0 <= type2 && type2 < b2Shape::e_typeCount);\n\n\ts_registers[type1][type2].createFcn = createFcn;\n\ts_registers[type1][type2].destroyFcn = destoryFcn;\n\ts_registers[type1][type2].primary = true;\n\n\tif (type1 != type2)\n\t{\n\t\ts_registers[type2][type1].createFcn = createFcn;\n\t\ts_registers[type2][type1].destroyFcn = destoryFcn;\n\t\ts_registers[type2][type1].primary = false;\n\t}\n}\n\nb2Contact* b2Contact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)\n{\n\tif (s_initialized == false)\n\t{\n\t\tInitializeRegisters();\n\t\ts_initialized = true;\n\t}\n\n\tb2Shape::Type type1 = fixtureA->GetType();\n\tb2Shape::Type type2 = fixtureB->GetType();\n\n\tb2Assert(0 <= type1 && type1 < b2Shape::e_typeCount);\n\tb2Assert(0 <= type2 && type2 < b2Shape::e_typeCount);\n\n\tb2ContactCreateFcn* createFcn = s_registers[type1][type2].createFcn;\n\tif (createFcn)\n\t{\n\t\tif (s_registers[type1][type2].primary)\n\t\t{\n\t\t\treturn createFcn(fixtureA, indexA, fixtureB, indexB, allocator);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn createFcn(fixtureB, indexB, fixtureA, indexA, allocator);\n\t\t}\n\t}\n\telse\n\t{\n\t\treturn NULL;\n\t}\n}\n\nvoid b2Contact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\tb2Assert(s_initialized == true);\n\n\tb2Fixture* fixtureA = contact->m_fixtureA;\n\tb2Fixture* fixtureB = contact->m_fixtureB;\n\n\tif (contact->m_manifold.pointCount > 0 &&\n\t\tfixtureA->IsSensor() == false &&\n\t\tfixtureB->IsSensor() == false)\n\t{\n\t\tfixtureA->GetBody()->SetAwake(true);\n\t\tfixtureB->GetBody()->SetAwake(true);\n\t}\n\n\tb2Shape::Type typeA = fixtureA->GetType();\n\tb2Shape::Type typeB = fixtureB->GetType();\n\n\tb2Assert(0 <= typeA && typeB < b2Shape::e_typeCount);\n\tb2Assert(0 <= typeA && typeB < b2Shape::e_typeCount);\n\n\tb2ContactDestroyFcn* destroyFcn = s_registers[typeA][typeB].destroyFcn;\n\tdestroyFcn(contact, allocator);\n}\n\nb2Contact::b2Contact(b2Fixture* fA, int32 indexA, b2Fixture* fB, int32 indexB)\n{\n\tm_flags = e_enabledFlag;\n\n\tm_fixtureA = fA;\n\tm_fixtureB = fB;\n\n\tm_indexA = indexA;\n\tm_indexB = indexB;\n\n\tm_manifold.pointCount = 0;\n\n\tm_prev = NULL;\n\tm_next = NULL;\n\n\tm_nodeA.contact = NULL;\n\tm_nodeA.prev = NULL;\n\tm_nodeA.next = NULL;\n\tm_nodeA.other = NULL;\n\n\tm_nodeB.contact = NULL;\n\tm_nodeB.prev = NULL;\n\tm_nodeB.next = NULL;\n\tm_nodeB.other = NULL;\n\n\tm_toiCount = 0;\n\n\tm_friction = b2MixFriction(m_fixtureA->m_friction, m_fixtureB->m_friction);\n\tm_restitution = b2MixRestitution(m_fixtureA->m_restitution, m_fixtureB->m_restitution);\n\n\tm_tangentSpeed = 0.0f;\n}\n\n// Update the contact manifold and touching status.\n// Note: do not assume the fixture AABBs are overlapping or are valid.\nvoid b2Contact::Update(b2ContactListener* listener)\n{\n\tb2Manifold oldManifold = m_manifold;\n\n\t// Re-enable this contact.\n\tm_flags |= e_enabledFlag;\n\n\tbool touching = false;\n\tbool wasTouching = (m_flags & e_touchingFlag) == e_touchingFlag;\n\n\tbool sensorA = m_fixtureA->IsSensor();\n\tbool sensorB = m_fixtureB->IsSensor();\n\tbool sensor = sensorA || sensorB;\n\n\tb2Body* bodyA = m_fixtureA->GetBody();\n\tb2Body* bodyB = m_fixtureB->GetBody();\n\tconst b2Transform& xfA = bodyA->GetTransform();\n\tconst b2Transform& xfB = bodyB->GetTransform();\n\n\t// Is this contact a sensor?\n\tif (sensor)\n\t{\n\t\tconst b2Shape* shapeA = m_fixtureA->GetShape();\n\t\tconst b2Shape* shapeB = m_fixtureB->GetShape();\n\t\ttouching = b2TestOverlap(shapeA, m_indexA, shapeB, m_indexB, xfA, xfB);\n\n\t\t// Sensors don't generate manifolds.\n\t\tm_manifold.pointCount = 0;\n\t}\n\telse\n\t{\n\t\tEvaluate(&m_manifold, xfA, xfB);\n\t\ttouching = m_manifold.pointCount > 0;\n\n\t\t// Match old contact ids to new contact ids and copy the\n\t\t// stored impulses to warm start the solver.\n\t\tfor (int32 i = 0; i < m_manifold.pointCount; ++i)\n\t\t{\n\t\t\tb2ManifoldPoint* mp2 = m_manifold.points + i;\n\t\t\tmp2->normalImpulse = 0.0f;\n\t\t\tmp2->tangentImpulse = 0.0f;\n\t\t\tb2ContactID id2 = mp2->id;\n\n\t\t\tfor (int32 j = 0; j < oldManifold.pointCount; ++j)\n\t\t\t{\n\t\t\t\tb2ManifoldPoint* mp1 = oldManifold.points + j;\n\n\t\t\t\tif (mp1->id.key == id2.key)\n\t\t\t\t{\n\t\t\t\t\tmp2->normalImpulse = mp1->normalImpulse;\n\t\t\t\t\tmp2->tangentImpulse = mp1->tangentImpulse;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (touching != wasTouching)\n\t\t{\n\t\t\tbodyA->SetAwake(true);\n\t\t\tbodyB->SetAwake(true);\n\t\t}\n\t}\n\n\tif (touching)\n\t{\n\t\tm_flags |= e_touchingFlag;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_touchingFlag;\n\t}\n\n\tif (wasTouching == false && touching == true && listener)\n\t{\n\t\tlistener->BeginContact(this);\n\t}\n\n\tif (wasTouching == true && touching == false && listener)\n\t{\n\t\tlistener->EndContact(this);\n\t}\n\n\tif (sensor == false && touching && listener)\n\t{\n\t\tlistener->PreSolve(this, &oldManifold);\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2ContactManager.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2ContactManager.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2WorldCallbacks.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n\nb2ContactFilter b2_defaultFilter;\nb2ContactListener b2_defaultListener;\n\nb2ContactManager::b2ContactManager()\n{\n\tm_contactList = NULL;\n\tm_contactCount = 0;\n\tm_contactFilter = &b2_defaultFilter;\n\tm_contactListener = &b2_defaultListener;\n\tm_allocator = NULL;\n}\n\nvoid b2ContactManager::Destroy(b2Contact* c)\n{\n\tb2Fixture* fixtureA = c->GetFixtureA();\n\tb2Fixture* fixtureB = c->GetFixtureB();\n\tb2Body* bodyA = fixtureA->GetBody();\n\tb2Body* bodyB = fixtureB->GetBody();\n\n\tif (m_contactListener && c->IsTouching())\n\t{\n\t\tm_contactListener->EndContact(c);\n\t}\n\n\t// Remove from the world.\n\tif (c->m_prev)\n\t{\n\t\tc->m_prev->m_next = c->m_next;\n\t}\n\n\tif (c->m_next)\n\t{\n\t\tc->m_next->m_prev = c->m_prev;\n\t}\n\n\tif (c == m_contactList)\n\t{\n\t\tm_contactList = c->m_next;\n\t}\n\n\t// Remove from body 1\n\tif (c->m_nodeA.prev)\n\t{\n\t\tc->m_nodeA.prev->next = c->m_nodeA.next;\n\t}\n\n\tif (c->m_nodeA.next)\n\t{\n\t\tc->m_nodeA.next->prev = c->m_nodeA.prev;\n\t}\n\n\tif (&c->m_nodeA == bodyA->m_contactList)\n\t{\n\t\tbodyA->m_contactList = c->m_nodeA.next;\n\t}\n\n\t// Remove from body 2\n\tif (c->m_nodeB.prev)\n\t{\n\t\tc->m_nodeB.prev->next = c->m_nodeB.next;\n\t}\n\n\tif (c->m_nodeB.next)\n\t{\n\t\tc->m_nodeB.next->prev = c->m_nodeB.prev;\n\t}\n\n\tif (&c->m_nodeB == bodyB->m_contactList)\n\t{\n\t\tbodyB->m_contactList = c->m_nodeB.next;\n\t}\n\n\t// Call the factory.\n\tb2Contact::Destroy(c, m_allocator);\n\t--m_contactCount;\n}\n\n// This is the top level collision call for the time step. Here\n// all the narrow phase collision is processed for the world\n// contact list.\nvoid b2ContactManager::Collide()\n{\n\t// Update awake contacts.\n\tb2Contact* c = m_contactList;\n\twhile (c)\n\t{\n\t\tb2Fixture* fixtureA = c->GetFixtureA();\n\t\tb2Fixture* fixtureB = c->GetFixtureB();\n\t\tint32 indexA = c->GetChildIndexA();\n\t\tint32 indexB = c->GetChildIndexB();\n\t\tb2Body* bodyA = fixtureA->GetBody();\n\t\tb2Body* bodyB = fixtureB->GetBody();\n\n\t\t// Is this contact flagged for filtering?\n\t\tif (c->m_flags & b2Contact::e_filterFlag)\n\t\t{\n\t\t\t// Should these bodies collide?\n\t\t\tif (bodyB->ShouldCollide(bodyA) == false)\n\t\t\t{\n\t\t\t\tb2Contact* cNuke = c;\n\t\t\t\tc = cNuke->GetNext();\n\t\t\t\tDestroy(cNuke);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Check user filtering.\n\t\t\tif (m_contactFilter && m_contactFilter->ShouldCollide(fixtureA, fixtureB) == false)\n\t\t\t{\n\t\t\t\tb2Contact* cNuke = c;\n\t\t\t\tc = cNuke->GetNext();\n\t\t\t\tDestroy(cNuke);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Clear the filtering flag.\n\t\t\tc->m_flags &= ~b2Contact::e_filterFlag;\n\t\t}\n\n\t\tbool activeA = bodyA->IsAwake() && bodyA->m_type != b2_staticBody;\n\t\tbool activeB = bodyB->IsAwake() && bodyB->m_type != b2_staticBody;\n\n\t\t// At least one body must be awake and it must be dynamic or kinematic.\n\t\tif (activeA == false && activeB == false)\n\t\t{\n\t\t\tc = c->GetNext();\n\t\t\tcontinue;\n\t\t}\n\n\t\tint32 proxyIdA = fixtureA->m_proxies[indexA].proxyId;\n\t\tint32 proxyIdB = fixtureB->m_proxies[indexB].proxyId;\n\t\tbool overlap = m_broadPhase.TestOverlap(proxyIdA, proxyIdB);\n\n\t\t// Here we destroy contacts that cease to overlap in the broad-phase.\n\t\tif (overlap == false)\n\t\t{\n\t\t\tb2Contact* cNuke = c;\n\t\t\tc = cNuke->GetNext();\n\t\t\tDestroy(cNuke);\n\t\t\tcontinue;\n\t\t}\n\n\t\t// The contact persists.\n\t\tc->Update(m_contactListener);\n\t\tc = c->GetNext();\n\t}\n}\n\nvoid b2ContactManager::FindNewContacts()\n{\n\tm_broadPhase.UpdatePairs(this);\n}\n\nvoid b2ContactManager::AddPair(void* proxyUserDataA, void* proxyUserDataB)\n{\n\tb2FixtureProxy* proxyA = (b2FixtureProxy*)proxyUserDataA;\n\tb2FixtureProxy* proxyB = (b2FixtureProxy*)proxyUserDataB;\n\n\tb2Fixture* fixtureA = proxyA->fixture;\n\tb2Fixture* fixtureB = proxyB->fixture;\n\n\tint32 indexA = proxyA->childIndex;\n\tint32 indexB = proxyB->childIndex;\n\n\tb2Body* bodyA = fixtureA->GetBody();\n\tb2Body* bodyB = fixtureB->GetBody();\n\n\t// Are the fixtures on the same body?\n\tif (bodyA == bodyB)\n\t{\n\t\treturn;\n\t}\n\n\t// TODO_ERIN use a hash table to remove a potential bottleneck when both\n\t// bodies have a lot of contacts.\n\t// Does a contact already exist?\n\tb2ContactEdge* edge = bodyB->GetContactList();\n\twhile (edge)\n\t{\n\t\tif (edge->other == bodyA)\n\t\t{\n\t\t\tb2Fixture* fA = edge->contact->GetFixtureA();\n\t\t\tb2Fixture* fB = edge->contact->GetFixtureB();\n\t\t\tint32 iA = edge->contact->GetChildIndexA();\n\t\t\tint32 iB = edge->contact->GetChildIndexB();\n\n\t\t\tif (fA == fixtureA && fB == fixtureB && iA == indexA && iB == indexB)\n\t\t\t{\n\t\t\t\t// A contact already exists.\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (fA == fixtureB && fB == fixtureA && iA == indexB && iB == indexA)\n\t\t\t{\n\t\t\t\t// A contact already exists.\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tedge = edge->next;\n\t}\n\n\t// Does a joint override collision? Is at least one body dynamic?\n\tif (bodyB->ShouldCollide(bodyA) == false)\n\t{\n\t\treturn;\n\t}\n\n\t// Check user filtering.\n\tif (m_contactFilter && m_contactFilter->ShouldCollide(fixtureA, fixtureB) == false)\n\t{\n\t\treturn;\n\t}\n\n\t// Call the factory.\n\tb2Contact* c = b2Contact::Create(fixtureA, indexA, fixtureB, indexB, m_allocator);\n\tif (c == NULL)\n\t{\n\t\treturn;\n\t}\n\n\t// Contact creation may swap fixtures.\n\tfixtureA = c->GetFixtureA();\n\tfixtureB = c->GetFixtureB();\n\tindexA = c->GetChildIndexA();\n\tindexB = c->GetChildIndexB();\n\tbodyA = fixtureA->GetBody();\n\tbodyB = fixtureB->GetBody();\n\n\t// Insert into the world.\n\tc->m_prev = NULL;\n\tc->m_next = m_contactList;\n\tif (m_contactList != NULL)\n\t{\n\t\tm_contactList->m_prev = c;\n\t}\n\tm_contactList = c;\n\n\t// Connect to island graph.\n\n\t// Connect to body A\n\tc->m_nodeA.contact = c;\n\tc->m_nodeA.other = bodyB;\n\n\tc->m_nodeA.prev = NULL;\n\tc->m_nodeA.next = bodyA->m_contactList;\n\tif (bodyA->m_contactList != NULL)\n\t{\n\t\tbodyA->m_contactList->prev = &c->m_nodeA;\n\t}\n\tbodyA->m_contactList = &c->m_nodeA;\n\n\t// Connect to body B\n\tc->m_nodeB.contact = c;\n\tc->m_nodeB.other = bodyA;\n\n\tc->m_nodeB.prev = NULL;\n\tc->m_nodeB.next = bodyB->m_contactList;\n\tif (bodyB->m_contactList != NULL)\n\t{\n\t\tbodyB->m_contactList->prev = &c->m_nodeB;\n\t}\n\tbodyB->m_contactList = &c->m_nodeB;\n\n\t// Wake up the bodies\n\tif (fixtureA->IsSensor() == false && fixtureB->IsSensor() == false)\n\t{\n\t\tbodyA->SetAwake(true);\n\t\tbodyB->SetAwake(true);\n\t}\n\n\t++m_contactCount;\n}\n"
},
{
"path": "app/src/main/cpp/b2ContactSolver.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ContactSolver.h\"\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2StackAllocator.h\"\n\n#define B2_DEBUG_SOLVER 0\n\nstruct b2ContactPositionConstraint\n{\n\tb2Vec2 localPoints[b2_maxManifoldPoints];\n\tb2Vec2 localNormal;\n\tb2Vec2 localPoint;\n\tint32 indexA;\n\tint32 indexB;\n\tfloat32 invMassA, invMassB;\n\tb2Vec2 localCenterA, localCenterB;\n\tfloat32 invIA, invIB;\n\tb2Manifold::Type type;\n\tfloat32 radiusA, radiusB;\n\tint32 pointCount;\n};\n\nb2ContactSolver::b2ContactSolver(b2ContactSolverDef* def)\n{\n\tm_step = def->step;\n\tm_allocator = def->allocator;\n\tm_count = def->count;\n\tm_positionConstraints = (b2ContactPositionConstraint*)m_allocator->Allocate(m_count * sizeof(b2ContactPositionConstraint));\n\tm_velocityConstraints = (b2ContactVelocityConstraint*)m_allocator->Allocate(m_count * sizeof(b2ContactVelocityConstraint));\n\tm_positions = def->positions;\n\tm_velocities = def->velocities;\n\tm_contacts = def->contacts;\n\n\t// Initialize position independent portions of the constraints.\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2Contact* contact = m_contacts[i];\n\n\t\tb2Fixture* fixtureA = contact->m_fixtureA;\n\t\tb2Fixture* fixtureB = contact->m_fixtureB;\n\t\tb2Shape* shapeA = fixtureA->GetShape();\n\t\tb2Shape* shapeB = fixtureB->GetShape();\n\t\tfloat32 radiusA = shapeA->m_radius;\n\t\tfloat32 radiusB = shapeB->m_radius;\n\t\tb2Body* bodyA = fixtureA->GetBody();\n\t\tb2Body* bodyB = fixtureB->GetBody();\n\t\tb2Manifold* manifold = contact->GetManifold();\n\n\t\tint32 pointCount = manifold->pointCount;\n\t\tb2Assert(pointCount > 0);\n\n\t\tb2ContactVelocityConstraint* vc = m_velocityConstraints + i;\n\t\tvc->friction = contact->m_friction;\n\t\tvc->restitution = contact->m_restitution;\n\t\tvc->tangentSpeed = contact->m_tangentSpeed;\n\t\tvc->indexA = bodyA->m_islandIndex;\n\t\tvc->indexB = bodyB->m_islandIndex;\n\t\tvc->invMassA = bodyA->m_invMass;\n\t\tvc->invMassB = bodyB->m_invMass;\n\t\tvc->invIA = bodyA->m_invI;\n\t\tvc->invIB = bodyB->m_invI;\n\t\tvc->contactIndex = i;\n\t\tvc->pointCount = pointCount;\n\t\tvc->K.SetZero();\n\t\tvc->normalMass.SetZero();\n\n\t\tb2ContactPositionConstraint* pc = m_positionConstraints + i;\n\t\tpc->indexA = bodyA->m_islandIndex;\n\t\tpc->indexB = bodyB->m_islandIndex;\n\t\tpc->invMassA = bodyA->m_invMass;\n\t\tpc->invMassB = bodyB->m_invMass;\n\t\tpc->localCenterA = bodyA->m_sweep.localCenter;\n\t\tpc->localCenterB = bodyB->m_sweep.localCenter;\n\t\tpc->invIA = bodyA->m_invI;\n\t\tpc->invIB = bodyB->m_invI;\n\t\tpc->localNormal = manifold->localNormal;\n\t\tpc->localPoint = manifold->localPoint;\n\t\tpc->pointCount = pointCount;\n\t\tpc->radiusA = radiusA;\n\t\tpc->radiusB = radiusB;\n\t\tpc->type = manifold->type;\n\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2ManifoldPoint* cp = manifold->points + j;\n\t\t\tb2VelocityConstraintPoint* vcp = vc->points + j;\n\n\t\t\tif (m_step.warmStarting)\n\t\t\t{\n\t\t\t\tvcp->normalImpulse = m_step.dtRatio * cp->normalImpulse;\n\t\t\t\tvcp->tangentImpulse = m_step.dtRatio * cp->tangentImpulse;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tvcp->normalImpulse = 0.0f;\n\t\t\t\tvcp->tangentImpulse = 0.0f;\n\t\t\t}\n\n\t\t\tvcp->rA.SetZero();\n\t\t\tvcp->rB.SetZero();\n\t\t\tvcp->normalMass = 0.0f;\n\t\t\tvcp->tangentMass = 0.0f;\n\t\t\tvcp->velocityBias = 0.0f;\n\n\t\t\tpc->localPoints[j] = cp->localPoint;\n\t\t}\n\t}\n}\n\nb2ContactSolver::~b2ContactSolver()\n{\n\tm_allocator->Free(m_velocityConstraints);\n\tm_allocator->Free(m_positionConstraints);\n}\n\n// Initialize position dependent portions of the velocity constraints.\nvoid b2ContactSolver::InitializeVelocityConstraints()\n{\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactVelocityConstraint* vc = m_velocityConstraints + i;\n\t\tb2ContactPositionConstraint* pc = m_positionConstraints + i;\n\n\t\tfloat32 radiusA = pc->radiusA;\n\t\tfloat32 radiusB = pc->radiusB;\n\t\tb2Manifold* manifold = m_contacts[vc->contactIndex]->GetManifold();\n\n\t\tint32 indexA = vc->indexA;\n\t\tint32 indexB = vc->indexB;\n\n\t\tfloat32 mA = vc->invMassA;\n\t\tfloat32 mB = vc->invMassB;\n\t\tfloat32 iA = vc->invIA;\n\t\tfloat32 iB = vc->invIB;\n\t\tb2Vec2 localCenterA = pc->localCenterA;\n\t\tb2Vec2 localCenterB = pc->localCenterB;\n\n\t\tb2Vec2 cA = m_positions[indexA].c;\n\t\tfloat32 aA = m_positions[indexA].a;\n\t\tb2Vec2 vA = m_velocities[indexA].v;\n\t\tfloat32 wA = m_velocities[indexA].w;\n\n\t\tb2Vec2 cB = m_positions[indexB].c;\n\t\tfloat32 aB = m_positions[indexB].a;\n\t\tb2Vec2 vB = m_velocities[indexB].v;\n\t\tfloat32 wB = m_velocities[indexB].w;\n\n\t\tb2Assert(manifold->pointCount > 0);\n\n\t\tb2Transform xfA, xfB;\n\t\txfA.q.Set(aA);\n\t\txfB.q.Set(aB);\n\t\txfA.p = cA - b2Mul(xfA.q, localCenterA);\n\t\txfB.p = cB - b2Mul(xfB.q, localCenterB);\n\n\t\tb2WorldManifold worldManifold;\n\t\tworldManifold.Initialize(manifold, xfA, radiusA, xfB, radiusB);\n\n\t\tvc->normal = worldManifold.normal;\n\n\t\tint32 pointCount = vc->pointCount;\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2VelocityConstraintPoint* vcp = vc->points + j;\n\n\t\t\tvcp->rA = worldManifold.points[j] - cA;\n\t\t\tvcp->rB = worldManifold.points[j] - cB;\n\n\t\t\tfloat32 rnA = b2Cross(vcp->rA, vc->normal);\n\t\t\tfloat32 rnB = b2Cross(vcp->rB, vc->normal);\n\n\t\t\tfloat32 kNormal = mA + mB + iA * rnA * rnA + iB * rnB * rnB;\n\n\t\t\tvcp->normalMass = kNormal > 0.0f ? 1.0f / kNormal : 0.0f;\n\n\t\t\tb2Vec2 tangent = b2Cross(vc->normal, 1.0f);\n\n\t\t\tfloat32 rtA = b2Cross(vcp->rA, tangent);\n\t\t\tfloat32 rtB = b2Cross(vcp->rB, tangent);\n\n\t\t\tfloat32 kTangent = mA + mB + iA * rtA * rtA + iB * rtB * rtB;\n\n\t\t\tvcp->tangentMass = kTangent > 0.0f ? 1.0f / kTangent : 0.0f;\n\n\t\t\t// Setup a velocity bias for restitution.\n\t\t\tvcp->velocityBias = 0.0f;\n\t\t\tfloat32 vRel = b2Dot(vc->normal, vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA));\n\t\t\tif (vRel < -b2_velocityThreshold)\n\t\t\t{\n\t\t\t\tvcp->velocityBias = -vc->restitution * vRel;\n\t\t\t}\n\t\t}\n\n\t\t// If we have two points, then prepare the block solver.\n\t\tif (vc->pointCount == 2)\n\t\t{\n\t\t\tb2VelocityConstraintPoint* vcp1 = vc->points + 0;\n\t\t\tb2VelocityConstraintPoint* vcp2 = vc->points + 1;\n\n\t\t\tfloat32 rn1A = b2Cross(vcp1->rA, vc->normal);\n\t\t\tfloat32 rn1B = b2Cross(vcp1->rB, vc->normal);\n\t\t\tfloat32 rn2A = b2Cross(vcp2->rA, vc->normal);\n\t\t\tfloat32 rn2B = b2Cross(vcp2->rB, vc->normal);\n\n\t\t\tfloat32 k11 = mA + mB + iA * rn1A * rn1A + iB * rn1B * rn1B;\n\t\t\tfloat32 k22 = mA + mB + iA * rn2A * rn2A + iB * rn2B * rn2B;\n\t\t\tfloat32 k12 = mA + mB + iA * rn1A * rn2A + iB * rn1B * rn2B;\n\n\t\t\t// Ensure a reasonable condition number.\n\t\t\tconst float32 k_maxConditionNumber = 1000.0f;\n\t\t\tif (k11 * k11 < k_maxConditionNumber * (k11 * k22 - k12 * k12))\n\t\t\t{\n\t\t\t\t// K is safe to invert.\n\t\t\t\tvc->K.ex.Set(k11, k12);\n\t\t\t\tvc->K.ey.Set(k12, k22);\n\t\t\t\tvc->normalMass = vc->K.GetInverse();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// The constraints are redundant, just use one.\n\t\t\t\t// TODO_ERIN use deepest?\n\t\t\t\tvc->pointCount = 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid b2ContactSolver::WarmStart()\n{\n\t// Warm start.\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactVelocityConstraint* vc = m_velocityConstraints + i;\n\n\t\tint32 indexA = vc->indexA;\n\t\tint32 indexB = vc->indexB;\n\t\tfloat32 mA = vc->invMassA;\n\t\tfloat32 iA = vc->invIA;\n\t\tfloat32 mB = vc->invMassB;\n\t\tfloat32 iB = vc->invIB;\n\t\tint32 pointCount = vc->pointCount;\n\n\t\tb2Vec2 vA = m_velocities[indexA].v;\n\t\tfloat32 wA = m_velocities[indexA].w;\n\t\tb2Vec2 vB = m_velocities[indexB].v;\n\t\tfloat32 wB = m_velocities[indexB].w;\n\n\t\tb2Vec2 normal = vc->normal;\n\t\tb2Vec2 tangent = b2Cross(normal, 1.0f);\n\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2VelocityConstraintPoint* vcp = vc->points + j;\n\t\t\tb2Vec2 P = vcp->normalImpulse * normal + vcp->tangentImpulse * tangent;\n\t\t\twA -= iA * b2Cross(vcp->rA, P);\n\t\t\tvA -= mA * P;\n\t\t\twB += iB * b2Cross(vcp->rB, P);\n\t\t\tvB += mB * P;\n\t\t}\n\n\t\tm_velocities[indexA].v = vA;\n\t\tm_velocities[indexA].w = wA;\n\t\tm_velocities[indexB].v = vB;\n\t\tm_velocities[indexB].w = wB;\n\t}\n}\n\nvoid b2ContactSolver::SolveVelocityConstraints()\n{\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactVelocityConstraint* vc = m_velocityConstraints + i;\n\n\t\tint32 indexA = vc->indexA;\n\t\tint32 indexB = vc->indexB;\n\t\tfloat32 mA = vc->invMassA;\n\t\tfloat32 iA = vc->invIA;\n\t\tfloat32 mB = vc->invMassB;\n\t\tfloat32 iB = vc->invIB;\n\t\tint32 pointCount = vc->pointCount;\n\n\t\tb2Vec2 vA = m_velocities[indexA].v;\n\t\tfloat32 wA = m_velocities[indexA].w;\n\t\tb2Vec2 vB = m_velocities[indexB].v;\n\t\tfloat32 wB = m_velocities[indexB].w;\n\n\t\tb2Vec2 normal = vc->normal;\n\t\tb2Vec2 tangent = b2Cross(normal, 1.0f);\n\t\tfloat32 friction = vc->friction;\n\n\t\tb2Assert(pointCount == 1 || pointCount == 2);\n\n\t\t// Solve tangent constraints first because non-penetration is more important\n\t\t// than friction.\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2VelocityConstraintPoint* vcp = vc->points + j;\n\n\t\t\t// Relative velocity at contact\n\t\t\tb2Vec2 dv = vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA);\n\n\t\t\t// Compute tangent force\n\t\t\tfloat32 vt = b2Dot(dv, tangent) - vc->tangentSpeed;\n\t\t\tfloat32 lambda = vcp->tangentMass * (-vt);\n\n\t\t\t// b2Clamp the accumulated force\n\t\t\tfloat32 maxFriction = friction * vcp->normalImpulse;\n\t\t\tfloat32 newImpulse = b2Clamp(vcp->tangentImpulse + lambda, -maxFriction, maxFriction);\n\t\t\tlambda = newImpulse - vcp->tangentImpulse;\n\t\t\tvcp->tangentImpulse = newImpulse;\n\n\t\t\t// Apply contact impulse\n\t\t\tb2Vec2 P = lambda * tangent;\n\n\t\t\tvA -= mA * P;\n\t\t\twA -= iA * b2Cross(vcp->rA, P);\n\n\t\t\tvB += mB * P;\n\t\t\twB += iB * b2Cross(vcp->rB, P);\n\t\t}\n\n\t\t// Solve normal constraints\n\t\tif (vc->pointCount == 1)\n\t\t{\n\t\t\tb2VelocityConstraintPoint* vcp = vc->points + 0;\n\n\t\t\t// Relative velocity at contact\n\t\t\tb2Vec2 dv = vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA);\n\n\t\t\t// Compute normal impulse\n\t\t\tfloat32 vn = b2Dot(dv, normal);\n\t\t\tfloat32 lambda = -vcp->normalMass * (vn - vcp->velocityBias);\n\n\t\t\t// b2Clamp the accumulated impulse\n\t\t\tfloat32 newImpulse = b2Max(vcp->normalImpulse + lambda, 0.0f);\n\t\t\tlambda = newImpulse - vcp->normalImpulse;\n\t\t\tvcp->normalImpulse = newImpulse;\n\n\t\t\t// Apply contact impulse\n\t\t\tb2Vec2 P = lambda * normal;\n\t\t\tvA -= mA * P;\n\t\t\twA -= iA * b2Cross(vcp->rA, P);\n\n\t\t\tvB += mB * P;\n\t\t\twB += iB * b2Cross(vcp->rB, P);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Block solver developed in collaboration with Dirk Gregorius (back in 01/07 on Box2D_Lite).\n\t\t\t// Build the mini LCP for this contact patch\n\t\t\t//\n\t\t\t// vn = A * x + b, vn >= 0, , vn >= 0, x >= 0 and vn_i * x_i = 0 with i = 1..2\n\t\t\t//\n\t\t\t// A = J * W * JT and J = ( -n, -r1 x n, n, r2 x n )\n\t\t\t// b = vn0 - velocityBias\n\t\t\t//\n\t\t\t// The system is solved using the \"Total enumeration method\" (s. Murty). The complementary constraint vn_i * x_i\n\t\t\t// implies that we must have in any solution either vn_i = 0 or x_i = 0. So for the 2D contact problem the cases\n\t\t\t// vn1 = 0 and vn2 = 0, x1 = 0 and x2 = 0, x1 = 0 and vn2 = 0, x2 = 0 and vn1 = 0 need to be tested. The first valid\n\t\t\t// solution that satisfies the problem is chosen.\n\t\t\t//\n\t\t\t// In order to account of the accumulated impulse 'a' (because of the iterative nature of the solver which only requires\n\t\t\t// that the accumulated impulse is clamped and not the incremental impulse) we change the impulse variable (x_i).\n\t\t\t//\n\t\t\t// Substitute:\n\t\t\t//\n\t\t\t// x = a + d\n\t\t\t//\n\t\t\t// a := old total impulse\n\t\t\t// x := new total impulse\n\t\t\t// d := incremental impulse\n\t\t\t//\n\t\t\t// For the current iteration we extend the formula for the incremental impulse\n\t\t\t// to compute the new total impulse:\n\t\t\t//\n\t\t\t// vn = A * d + b\n\t\t\t// = A * (x - a) + b\n\t\t\t// = A * x + b - A * a\n\t\t\t// = A * x + b'\n\t\t\t// b' = b - A * a;\n\n\t\t\tb2VelocityConstraintPoint* cp1 = vc->points + 0;\n\t\t\tb2VelocityConstraintPoint* cp2 = vc->points + 1;\n\n\t\t\tb2Vec2 a(cp1->normalImpulse, cp2->normalImpulse);\n\t\t\tb2Assert(a.x >= 0.0f && a.y >= 0.0f);\n\n\t\t\t// Relative velocity at contact\n\t\t\tb2Vec2 dv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);\n\t\t\tb2Vec2 dv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);\n\n\t\t\t// Compute normal velocity\n\t\t\tfloat32 vn1 = b2Dot(dv1, normal);\n\t\t\tfloat32 vn2 = b2Dot(dv2, normal);\n\n\t\t\tb2Vec2 b;\n\t\t\tb.x = vn1 - cp1->velocityBias;\n\t\t\tb.y = vn2 - cp2->velocityBias;\n\n\t\t\t// Compute b'\n\t\t\tb -= b2Mul(vc->K, a);\n\n\t\t\tconst float32 k_errorTol = 1e-3f;\n\t\t\tB2_NOT_USED(k_errorTol);\n\n\t\t\tfor (;;)\n\t\t\t{\n\t\t\t\t//\n\t\t\t\t// Case 1: vn = 0\n\t\t\t\t//\n\t\t\t\t// 0 = A * x + b'\n\t\t\t\t//\n\t\t\t\t// Solve for x:\n\t\t\t\t//\n\t\t\t\t// x = - inv(A) * b'\n\t\t\t\t//\n\t\t\t\tb2Vec2 x = - b2Mul(vc->normalMass, b);\n\n\t\t\t\tif (x.x >= 0.0f && x.y >= 0.0f)\n\t\t\t\t{\n\t\t\t\t\t// Get the incremental impulse\n\t\t\t\t\tb2Vec2 d = x - a;\n\n\t\t\t\t\t// Apply incremental impulse\n\t\t\t\t\tb2Vec2 P1 = d.x * normal;\n\t\t\t\t\tb2Vec2 P2 = d.y * normal;\n\t\t\t\t\tvA -= mA * (P1 + P2);\n\t\t\t\t\twA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));\n\n\t\t\t\t\tvB += mB * (P1 + P2);\n\t\t\t\t\twB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));\n\n\t\t\t\t\t// Accumulate\n\t\t\t\t\tcp1->normalImpulse = x.x;\n\t\t\t\t\tcp2->normalImpulse = x.y;\n\n#if B2_DEBUG_SOLVER == 1\n\t\t\t\t\t// Postconditions\n\t\t\t\t\tdv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);\n\t\t\t\t\tdv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);\n\n\t\t\t\t\t// Compute normal velocity\n\t\t\t\t\tvn1 = b2Dot(dv1, normal);\n\t\t\t\t\tvn2 = b2Dot(dv2, normal);\n\n\t\t\t\t\tb2Assert(b2Abs(vn1 - cp1->velocityBias) < k_errorTol);\n\t\t\t\t\tb2Assert(b2Abs(vn2 - cp2->velocityBias) < k_errorTol);\n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t//\n\t\t\t\t// Case 2: vn1 = 0 and x2 = 0\n\t\t\t\t//\n\t\t\t\t// 0 = a11 * x1 + a12 * 0 + b1'\n\t\t\t\t// vn2 = a21 * x1 + a22 * 0 + b2'\n\t\t\t\t//\n\t\t\t\tx.x = - cp1->normalMass * b.x;\n\t\t\t\tx.y = 0.0f;\n\t\t\t\tvn1 = 0.0f;\n\t\t\t\tvn2 = vc->K.ex.y * x.x + b.y;\n\n\t\t\t\tif (x.x >= 0.0f && vn2 >= 0.0f)\n\t\t\t\t{\n\t\t\t\t\t// Get the incremental impulse\n\t\t\t\t\tb2Vec2 d = x - a;\n\n\t\t\t\t\t// Apply incremental impulse\n\t\t\t\t\tb2Vec2 P1 = d.x * normal;\n\t\t\t\t\tb2Vec2 P2 = d.y * normal;\n\t\t\t\t\tvA -= mA * (P1 + P2);\n\t\t\t\t\twA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));\n\n\t\t\t\t\tvB += mB * (P1 + P2);\n\t\t\t\t\twB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));\n\n\t\t\t\t\t// Accumulate\n\t\t\t\t\tcp1->normalImpulse = x.x;\n\t\t\t\t\tcp2->normalImpulse = x.y;\n\n#if B2_DEBUG_SOLVER == 1\n\t\t\t\t\t// Postconditions\n\t\t\t\t\tdv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);\n\n\t\t\t\t\t// Compute normal velocity\n\t\t\t\t\tvn1 = b2Dot(dv1, normal);\n\n\t\t\t\t\tb2Assert(b2Abs(vn1 - cp1->velocityBias) < k_errorTol);\n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\n\t\t\t\t//\n\t\t\t\t// Case 3: vn2 = 0 and x1 = 0\n\t\t\t\t//\n\t\t\t\t// vn1 = a11 * 0 + a12 * x2 + b1'\n\t\t\t\t// 0 = a21 * 0 + a22 * x2 + b2'\n\t\t\t\t//\n\t\t\t\tx.x = 0.0f;\n\t\t\t\tx.y = - cp2->normalMass * b.y;\n\t\t\t\tvn1 = vc->K.ey.x * x.y + b.x;\n\t\t\t\tvn2 = 0.0f;\n\n\t\t\t\tif (x.y >= 0.0f && vn1 >= 0.0f)\n\t\t\t\t{\n\t\t\t\t\t// Resubstitute for the incremental impulse\n\t\t\t\t\tb2Vec2 d = x - a;\n\n\t\t\t\t\t// Apply incremental impulse\n\t\t\t\t\tb2Vec2 P1 = d.x * normal;\n\t\t\t\t\tb2Vec2 P2 = d.y * normal;\n\t\t\t\t\tvA -= mA * (P1 + P2);\n\t\t\t\t\twA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));\n\n\t\t\t\t\tvB += mB * (P1 + P2);\n\t\t\t\t\twB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));\n\n\t\t\t\t\t// Accumulate\n\t\t\t\t\tcp1->normalImpulse = x.x;\n\t\t\t\t\tcp2->normalImpulse = x.y;\n\n#if B2_DEBUG_SOLVER == 1\n\t\t\t\t\t// Postconditions\n\t\t\t\t\tdv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);\n\n\t\t\t\t\t// Compute normal velocity\n\t\t\t\t\tvn2 = b2Dot(dv2, normal);\n\n\t\t\t\t\tb2Assert(b2Abs(vn2 - cp2->velocityBias) < k_errorTol);\n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t//\n\t\t\t\t// Case 4: x1 = 0 and x2 = 0\n\t\t\t\t//\n\t\t\t\t// vn1 = b1\n\t\t\t\t// vn2 = b2;\n\t\t\t\tx.x = 0.0f;\n\t\t\t\tx.y = 0.0f;\n\t\t\t\tvn1 = b.x;\n\t\t\t\tvn2 = b.y;\n\n\t\t\t\tif (vn1 >= 0.0f && vn2 >= 0.0f )\n\t\t\t\t{\n\t\t\t\t\t// Resubstitute for the incremental impulse\n\t\t\t\t\tb2Vec2 d = x - a;\n\n\t\t\t\t\t// Apply incremental impulse\n\t\t\t\t\tb2Vec2 P1 = d.x * normal;\n\t\t\t\t\tb2Vec2 P2 = d.y * normal;\n\t\t\t\t\tvA -= mA * (P1 + P2);\n\t\t\t\t\twA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));\n\n\t\t\t\t\tvB += mB * (P1 + P2);\n\t\t\t\t\twB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));\n\n\t\t\t\t\t// Accumulate\n\t\t\t\t\tcp1->normalImpulse = x.x;\n\t\t\t\t\tcp2->normalImpulse = x.y;\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t// No solution, give up. This is hit sometimes, but it doesn't seem to matter.\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tm_velocities[indexA].v = vA;\n\t\tm_velocities[indexA].w = wA;\n\t\tm_velocities[indexB].v = vB;\n\t\tm_velocities[indexB].w = wB;\n\t}\n}\n\nvoid b2ContactSolver::StoreImpulses()\n{\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactVelocityConstraint* vc = m_velocityConstraints + i;\n\t\tb2Manifold* manifold = m_contacts[vc->contactIndex]->GetManifold();\n\n\t\tfor (int32 j = 0; j < vc->pointCount; ++j)\n\t\t{\n\t\t\tmanifold->points[j].normalImpulse = vc->points[j].normalImpulse;\n\t\t\tmanifold->points[j].tangentImpulse = vc->points[j].tangentImpulse;\n\t\t}\n\t}\n}\n\nstruct b2PositionSolverManifold\n{\n\tvoid Initialize(b2ContactPositionConstraint* pc, const b2Transform& xfA, const b2Transform& xfB, int32 index)\n\t{\n\t\tb2Assert(pc->pointCount > 0);\n\n\t\tswitch (pc->type)\n\t\t{\n\t\tcase b2Manifold::e_circles:\n\t\t\t{\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, pc->localPoint);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, pc->localPoints[0]);\n\t\t\t\tnormal = pointB - pointA;\n\t\t\t\tnormal.Normalize();\n\t\t\t\tpoint = 0.5f * (pointA + pointB);\n\t\t\t\tseparation = b2Dot(pointB - pointA, normal) - pc->radiusA - pc->radiusB;\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase b2Manifold::e_faceA:\n\t\t\t{\n\t\t\t\tnormal = b2Mul(xfA.q, pc->localNormal);\n\t\t\t\tb2Vec2 planePoint = b2Mul(xfA, pc->localPoint);\n\n\t\t\t\tb2Vec2 clipPoint = b2Mul(xfB, pc->localPoints[index]);\n\t\t\t\tseparation = b2Dot(clipPoint - planePoint, normal) - pc->radiusA - pc->radiusB;\n\t\t\t\tpoint = clipPoint;\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase b2Manifold::e_faceB:\n\t\t\t{\n\t\t\t\tnormal = b2Mul(xfB.q, pc->localNormal);\n\t\t\t\tb2Vec2 planePoint = b2Mul(xfB, pc->localPoint);\n\n\t\t\t\tb2Vec2 clipPoint = b2Mul(xfA, pc->localPoints[index]);\n\t\t\t\tseparation = b2Dot(clipPoint - planePoint, normal) - pc->radiusA - pc->radiusB;\n\t\t\t\tpoint = clipPoint;\n\n\t\t\t\t// Ensure normal points from A to B\n\t\t\t\tnormal = -normal;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tb2Vec2 normal;\n\tb2Vec2 point;\n\tfloat32 separation;\n};\n\n// Sequential solver.\nbool b2ContactSolver::SolvePositionConstraints()\n{\n\tfloat32 minSeparation = 0.0f;\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactPositionConstraint* pc = m_positionConstraints + i;\n\n\t\tint32 indexA = pc->indexA;\n\t\tint32 indexB = pc->indexB;\n\t\tb2Vec2 localCenterA = pc->localCenterA;\n\t\tfloat32 mA = pc->invMassA;\n\t\tfloat32 iA = pc->invIA;\n\t\tb2Vec2 localCenterB = pc->localCenterB;\n\t\tfloat32 mB = pc->invMassB;\n\t\tfloat32 iB = pc->invIB;\n\t\tint32 pointCount = pc->pointCount;\n\n\t\tb2Vec2 cA = m_positions[indexA].c;\n\t\tfloat32 aA = m_positions[indexA].a;\n\n\t\tb2Vec2 cB = m_positions[indexB].c;\n\t\tfloat32 aB = m_positions[indexB].a;\n\n\t\t// Solve normal constraints\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2Transform xfA, xfB;\n\t\t\txfA.q.Set(aA);\n\t\t\txfB.q.Set(aB);\n\t\t\txfA.p = cA - b2Mul(xfA.q, localCenterA);\n\t\t\txfB.p = cB - b2Mul(xfB.q, localCenterB);\n\n\t\t\tb2PositionSolverManifold psm;\n\t\t\tpsm.Initialize(pc, xfA, xfB, j);\n\t\t\tb2Vec2 normal = psm.normal;\n\n\t\t\tb2Vec2 point = psm.point;\n\t\t\tfloat32 separation = psm.separation;\n\n\t\t\tb2Vec2 rA = point - cA;\n\t\t\tb2Vec2 rB = point - cB;\n\n\t\t\t// Track max constraint error.\n\t\t\tminSeparation = b2Min(minSeparation, separation);\n\n\t\t\t// Prevent large corrections and allow slop.\n\t\t\tfloat32 C = b2Clamp(b2_baumgarte * (separation + b2_linearSlop), -b2_maxLinearCorrection, 0.0f);\n\n\t\t\t// Compute the effective mass.\n\t\t\tfloat32 rnA = b2Cross(rA, normal);\n\t\t\tfloat32 rnB = b2Cross(rB, normal);\n\t\t\tfloat32 K = mA + mB + iA * rnA * rnA + iB * rnB * rnB;\n\n\t\t\t// Compute normal impulse\n\t\t\tfloat32 impulse = K > 0.0f ? - C / K : 0.0f;\n\n\t\t\tb2Vec2 P = impulse * normal;\n\n\t\t\tcA -= mA * P;\n\t\t\taA -= iA * b2Cross(rA, P);\n\n\t\t\tcB += mB * P;\n\t\t\taB += iB * b2Cross(rB, P);\n\t\t}\n\n\t\tm_positions[indexA].c = cA;\n\t\tm_positions[indexA].a = aA;\n\n\t\tm_positions[indexB].c = cB;\n\t\tm_positions[indexB].a = aB;\n\t}\n\n\t// We can't expect minSpeparation >= -b2_linearSlop because we don't\n\t// push the separation above -b2_linearSlop.\n\treturn minSeparation >= -3.0f * b2_linearSlop;\n}\n\n// Sequential position solver for position constraints.\nbool b2ContactSolver::SolveTOIPositionConstraints(int32 toiIndexA, int32 toiIndexB)\n{\n\tfloat32 minSeparation = 0.0f;\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tb2ContactPositionConstraint* pc = m_positionConstraints + i;\n\n\t\tint32 indexA = pc->indexA;\n\t\tint32 indexB = pc->indexB;\n\t\tb2Vec2 localCenterA = pc->localCenterA;\n\t\tb2Vec2 localCenterB = pc->localCenterB;\n\t\tint32 pointCount = pc->pointCount;\n\n\t\tfloat32 mA = 0.0f;\n\t\tfloat32 iA = 0.0f;\n\t\tif (indexA == toiIndexA || indexA == toiIndexB)\n\t\t{\n\t\t\tmA = pc->invMassA;\n\t\t\tiA = pc->invIA;\n\t\t}\n\n\t\tfloat32 mB = 0.0f;\n\t\tfloat32 iB = 0.;\n\t\tif (indexB == toiIndexA || indexB == toiIndexB)\n\t\t{\n\t\t\tmB = pc->invMassB;\n\t\t\tiB = pc->invIB;\n\t\t}\n\n\t\tb2Vec2 cA = m_positions[indexA].c;\n\t\tfloat32 aA = m_positions[indexA].a;\n\n\t\tb2Vec2 cB = m_positions[indexB].c;\n\t\tfloat32 aB = m_positions[indexB].a;\n\n\t\t// Solve normal constraints\n\t\tfor (int32 j = 0; j < pointCount; ++j)\n\t\t{\n\t\t\tb2Transform xfA, xfB;\n\t\t\txfA.q.Set(aA);\n\t\t\txfB.q.Set(aB);\n\t\t\txfA.p = cA - b2Mul(xfA.q, localCenterA);\n\t\t\txfB.p = cB - b2Mul(xfB.q, localCenterB);\n\n\t\t\tb2PositionSolverManifold psm;\n\t\t\tpsm.Initialize(pc, xfA, xfB, j);\n\t\t\tb2Vec2 normal = psm.normal;\n\n\t\t\tb2Vec2 point = psm.point;\n\t\t\tfloat32 separation = psm.separation;\n\n\t\t\tb2Vec2 rA = point - cA;\n\t\t\tb2Vec2 rB = point - cB;\n\n\t\t\t// Track max constraint error.\n\t\t\tminSeparation = b2Min(minSeparation, separation);\n\n\t\t\t// Prevent large corrections and allow slop.\n\t\t\tfloat32 C = b2Clamp(b2_toiBaugarte * (separation + b2_linearSlop), -b2_maxLinearCorrection, 0.0f);\n\n\t\t\t// Compute the effective mass.\n\t\t\tfloat32 rnA = b2Cross(rA, normal);\n\t\t\tfloat32 rnB = b2Cross(rB, normal);\n\t\t\tfloat32 K = mA + mB + iA * rnA * rnA + iB * rnB * rnB;\n\n\t\t\t// Compute normal impulse\n\t\t\tfloat32 impulse = K > 0.0f ? - C / K : 0.0f;\n\n\t\t\tb2Vec2 P = impulse * normal;\n\n\t\t\tcA -= mA * P;\n\t\t\taA -= iA * b2Cross(rA, P);\n\n\t\t\tcB += mB * P;\n\t\t\taB += iB * b2Cross(rB, P);\n\t\t}\n\n\t\tm_positions[indexA].c = cA;\n\t\tm_positions[indexA].a = aA;\n\n\t\tm_positions[indexB].c = cB;\n\t\tm_positions[indexB].a = aB;\n\t}\n\n\t// We can't expect minSpeparation >= -b2_linearSlop because we don't\n\t// push the separation above -b2_linearSlop.\n\treturn minSeparation >= -1.5f * b2_linearSlop;\n}\n"
},
{
"path": "app/src/main/cpp/b2Distance.cpp",
"content": "/*\n* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Distance.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n\n// GJK using Voronoi regions (Christer Ericson) and Barycentric coordinates.\nint32 b2_gjkCalls, b2_gjkIters, b2_gjkMaxIters;\n\nvoid b2DistanceProxy::Set(const b2Shape* shape, int32 index)\n{\n\tswitch (shape->GetType())\n\t{\n\tcase b2Shape::e_circle:\n\t\t{\n\t\t\tconst b2CircleShape* circle = static_cast(shape);\n\t\t\tm_vertices = &circle->m_p;\n\t\t\tm_count = 1;\n\t\t\tm_radius = circle->m_radius;\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_polygon:\n\t\t{\n\t\t\tconst b2PolygonShape* polygon = static_cast(shape);\n\t\t\tm_vertices = polygon->m_vertices;\n\t\t\tm_count = polygon->m_count;\n\t\t\tm_radius = polygon->m_radius;\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_chain:\n\t\t{\n\t\t\tconst b2ChainShape* chain = static_cast(shape);\n\t\t\tb2Assert(0 <= index && index < chain->m_count);\n\n\t\t\tm_buffer[0] = chain->m_vertices[index];\n\t\t\tif (index + 1 < chain->m_count)\n\t\t\t{\n\t\t\t\tm_buffer[1] = chain->m_vertices[index + 1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_buffer[1] = chain->m_vertices[0];\n\t\t\t}\n\n\t\t\tm_vertices = m_buffer;\n\t\t\tm_count = 2;\n\t\t\tm_radius = chain->m_radius;\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_edge:\n\t\t{\n\t\t\tconst b2EdgeShape* edge = static_cast(shape);\n\t\t\tm_vertices = &edge->m_vertex1;\n\t\t\tm_count = 2;\n\t\t\tm_radius = edge->m_radius;\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\tb2Assert(false);\n\t}\n}\n\n\nstruct b2SimplexVertex\n{\n\tb2Vec2 wA;\t\t// support point in proxyA\n\tb2Vec2 wB;\t\t// support point in proxyB\n\tb2Vec2 w;\t\t// wB - wA\n\tfloat32 a;\t\t// barycentric coordinate for closest point\n\tint32 indexA;\t// wA index\n\tint32 indexB;\t// wB index\n};\n\nstruct b2Simplex\n{\n\tvoid ReadCache(\tconst b2SimplexCache* cache,\n\t\t\t\t\tconst b2DistanceProxy* proxyA, const b2Transform& transformA,\n\t\t\t\t\tconst b2DistanceProxy* proxyB, const b2Transform& transformB)\n\t{\n\t\tb2Assert(cache->count <= 3);\n\n\t\t// Copy data from cache.\n\t\tm_count = cache->count;\n\t\tb2SimplexVertex* vertices = &m_v1;\n\t\tfor (int32 i = 0; i < m_count; ++i)\n\t\t{\n\t\t\tb2SimplexVertex* v = vertices + i;\n\t\t\tv->indexA = cache->indexA[i];\n\t\t\tv->indexB = cache->indexB[i];\n\t\t\tb2Vec2 wALocal = proxyA->GetVertex(v->indexA);\n\t\t\tb2Vec2 wBLocal = proxyB->GetVertex(v->indexB);\n\t\t\tv->wA = b2Mul(transformA, wALocal);\n\t\t\tv->wB = b2Mul(transformB, wBLocal);\n\t\t\tv->w = v->wB - v->wA;\n\t\t\tv->a = 0.0f;\n\t\t}\n\n\t\t// Compute the new simplex metric, if it is substantially different than\n\t\t// old metric then flush the simplex.\n\t\tif (m_count > 1)\n\t\t{\n\t\t\tfloat32 metric1 = cache->metric;\n\t\t\tfloat32 metric2 = GetMetric();\n\t\t\tif (metric2 < 0.5f * metric1 || 2.0f * metric1 < metric2 || metric2 < b2_epsilon)\n\t\t\t{\n\t\t\t\t// Reset the simplex.\n\t\t\t\tm_count = 0;\n\t\t\t}\n\t\t}\n\n\t\t// If the cache is empty or invalid ...\n\t\tif (m_count == 0)\n\t\t{\n\t\t\tb2SimplexVertex* v = vertices + 0;\n\t\t\tv->indexA = 0;\n\t\t\tv->indexB = 0;\n\t\t\tb2Vec2 wALocal = proxyA->GetVertex(0);\n\t\t\tb2Vec2 wBLocal = proxyB->GetVertex(0);\n\t\t\tv->wA = b2Mul(transformA, wALocal);\n\t\t\tv->wB = b2Mul(transformB, wBLocal);\n\t\t\tv->w = v->wB - v->wA;\n\t\t\tv->a = 1.0f;\n\t\t\tm_count = 1;\n\t\t}\n\t}\n\n\tvoid WriteCache(b2SimplexCache* cache) const\n\t{\n\t\tcache->metric = GetMetric();\n\t\tcache->count = uint16(m_count);\n\t\tconst b2SimplexVertex* vertices = &m_v1;\n\t\tfor (int32 i = 0; i < m_count; ++i)\n\t\t{\n\t\t\tcache->indexA[i] = uint8(vertices[i].indexA);\n\t\t\tcache->indexB[i] = uint8(vertices[i].indexB);\n\t\t}\n\t}\n\n\tb2Vec2 GetSearchDirection() const\n\t{\n\t\tswitch (m_count)\n\t\t{\n\t\tcase 1:\n\t\t\treturn -m_v1.w;\n\n\t\tcase 2:\n\t\t\t{\n\t\t\t\tb2Vec2 e12 = m_v2.w - m_v1.w;\n\t\t\t\tfloat32 sgn = b2Cross(e12, -m_v1.w);\n\t\t\t\tif (sgn > 0.0f)\n\t\t\t\t{\n\t\t\t\t\t// Origin is left of e12.\n\t\t\t\t\treturn b2Cross(1.0f, e12);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Origin is right of e12.\n\t\t\t\t\treturn b2Cross(e12, 1.0f);\n\t\t\t\t}\n\t\t\t}\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\treturn b2Vec2_zero;\n\t\t}\n\t}\n\n\tb2Vec2 GetClosestPoint() const\n\t{\n\t\tswitch (m_count)\n\t\t{\n\t\tcase 0:\n\t\t\tb2Assert(false);\n\t\t\treturn b2Vec2_zero;\n\n\t\tcase 1:\n\t\t\treturn m_v1.w;\n\n\t\tcase 2:\n\t\t\treturn m_v1.a * m_v1.w + m_v2.a * m_v2.w;\n\n\t\tcase 3:\n\t\t\treturn b2Vec2_zero;\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\treturn b2Vec2_zero;\n\t\t}\n\t}\n\n\tvoid GetWitnessPoints(b2Vec2* pA, b2Vec2* pB) const\n\t{\n\t\tswitch (m_count)\n\t\t{\n\t\tcase 0:\n\t\t\tb2Assert(false);\n\t\t\tbreak;\n\n\t\tcase 1:\n\t\t\t*pA = m_v1.wA;\n\t\t\t*pB = m_v1.wB;\n\t\t\tbreak;\n\n\t\tcase 2:\n\t\t\t*pA = m_v1.a * m_v1.wA + m_v2.a * m_v2.wA;\n\t\t\t*pB = m_v1.a * m_v1.wB + m_v2.a * m_v2.wB;\n\t\t\tbreak;\n\n\t\tcase 3:\n\t\t\t*pA = m_v1.a * m_v1.wA + m_v2.a * m_v2.wA + m_v3.a * m_v3.wA;\n\t\t\t*pB = *pA;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfloat32 GetMetric() const\n\t{\n\t\tswitch (m_count)\n\t\t{\n\t\tcase 0:\n\t\t\tb2Assert(false);\n\t\t\treturn 0.0f;\n\n\t\tcase 1:\n\t\t\treturn 0.0f;\n\n\t\tcase 2:\n\t\t\treturn b2Distance(m_v1.w, m_v2.w);\n\n\t\tcase 3:\n\t\t\treturn b2Cross(m_v2.w - m_v1.w, m_v3.w - m_v1.w);\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\treturn 0.0f;\n\t\t}\n\t}\n\n\tvoid Solve2();\n\tvoid Solve3();\n\n\tb2SimplexVertex m_v1, m_v2, m_v3;\n\tint32 m_count;\n};\n\n\n// Solve a line segment using barycentric coordinates.\n//\n// p = a1 * w1 + a2 * w2\n// a1 + a2 = 1\n//\n// The vector from the origin to the closest point on the line is\n// perpendicular to the line.\n// e12 = w2 - w1\n// dot(p, e) = 0\n// a1 * dot(w1, e) + a2 * dot(w2, e) = 0\n//\n// 2-by-2 linear system\n// [1 1 ][a1] = [1]\n// [w1.e12 w2.e12][a2] = [0]\n//\n// Define\n// d12_1 = dot(w2, e12)\n// d12_2 = -dot(w1, e12)\n// d12 = d12_1 + d12_2\n//\n// Solution\n// a1 = d12_1 / d12\n// a2 = d12_2 / d12\nvoid b2Simplex::Solve2()\n{\n\tb2Vec2 w1 = m_v1.w;\n\tb2Vec2 w2 = m_v2.w;\n\tb2Vec2 e12 = w2 - w1;\n\n\t// w1 region\n\tfloat32 d12_2 = -b2Dot(w1, e12);\n\tif (d12_2 <= 0.0f)\n\t{\n\t\t// a2 <= 0, so we clamp it to 0\n\t\tm_v1.a = 1.0f;\n\t\tm_count = 1;\n\t\treturn;\n\t}\n\n\t// w2 region\n\tfloat32 d12_1 = b2Dot(w2, e12);\n\tif (d12_1 <= 0.0f)\n\t{\n\t\t// a1 <= 0, so we clamp it to 0\n\t\tm_v2.a = 1.0f;\n\t\tm_count = 1;\n\t\tm_v1 = m_v2;\n\t\treturn;\n\t}\n\n\t// Must be in e12 region.\n\tfloat32 inv_d12 = 1.0f / (d12_1 + d12_2);\n\tm_v1.a = d12_1 * inv_d12;\n\tm_v2.a = d12_2 * inv_d12;\n\tm_count = 2;\n}\n\n// Possible regions:\n// - points[2]\n// - edge points[0]-points[2]\n// - edge points[1]-points[2]\n// - inside the triangle\nvoid b2Simplex::Solve3()\n{\n\tb2Vec2 w1 = m_v1.w;\n\tb2Vec2 w2 = m_v2.w;\n\tb2Vec2 w3 = m_v3.w;\n\n\t// Edge12\n\t// [1 1 ][a1] = [1]\n\t// [w1.e12 w2.e12][a2] = [0]\n\t// a3 = 0\n\tb2Vec2 e12 = w2 - w1;\n\tfloat32 w1e12 = b2Dot(w1, e12);\n\tfloat32 w2e12 = b2Dot(w2, e12);\n\tfloat32 d12_1 = w2e12;\n\tfloat32 d12_2 = -w1e12;\n\n\t// Edge13\n\t// [1 1 ][a1] = [1]\n\t// [w1.e13 w3.e13][a3] = [0]\n\t// a2 = 0\n\tb2Vec2 e13 = w3 - w1;\n\tfloat32 w1e13 = b2Dot(w1, e13);\n\tfloat32 w3e13 = b2Dot(w3, e13);\n\tfloat32 d13_1 = w3e13;\n\tfloat32 d13_2 = -w1e13;\n\n\t// Edge23\n\t// [1 1 ][a2] = [1]\n\t// [w2.e23 w3.e23][a3] = [0]\n\t// a1 = 0\n\tb2Vec2 e23 = w3 - w2;\n\tfloat32 w2e23 = b2Dot(w2, e23);\n\tfloat32 w3e23 = b2Dot(w3, e23);\n\tfloat32 d23_1 = w3e23;\n\tfloat32 d23_2 = -w2e23;\n\n\t// Triangle123\n\tfloat32 n123 = b2Cross(e12, e13);\n\n\tfloat32 d123_1 = n123 * b2Cross(w2, w3);\n\tfloat32 d123_2 = n123 * b2Cross(w3, w1);\n\tfloat32 d123_3 = n123 * b2Cross(w1, w2);\n\n\t// w1 region\n\tif (d12_2 <= 0.0f && d13_2 <= 0.0f)\n\t{\n\t\tm_v1.a = 1.0f;\n\t\tm_count = 1;\n\t\treturn;\n\t}\n\n\t// e12\n\tif (d12_1 > 0.0f && d12_2 > 0.0f && d123_3 <= 0.0f)\n\t{\n\t\tfloat32 inv_d12 = 1.0f / (d12_1 + d12_2);\n\t\tm_v1.a = d12_1 * inv_d12;\n\t\tm_v2.a = d12_2 * inv_d12;\n\t\tm_count = 2;\n\t\treturn;\n\t}\n\n\t// e13\n\tif (d13_1 > 0.0f && d13_2 > 0.0f && d123_2 <= 0.0f)\n\t{\n\t\tfloat32 inv_d13 = 1.0f / (d13_1 + d13_2);\n\t\tm_v1.a = d13_1 * inv_d13;\n\t\tm_v3.a = d13_2 * inv_d13;\n\t\tm_count = 2;\n\t\tm_v2 = m_v3;\n\t\treturn;\n\t}\n\n\t// w2 region\n\tif (d12_1 <= 0.0f && d23_2 <= 0.0f)\n\t{\n\t\tm_v2.a = 1.0f;\n\t\tm_count = 1;\n\t\tm_v1 = m_v2;\n\t\treturn;\n\t}\n\n\t// w3 region\n\tif (d13_1 <= 0.0f && d23_1 <= 0.0f)\n\t{\n\t\tm_v3.a = 1.0f;\n\t\tm_count = 1;\n\t\tm_v1 = m_v3;\n\t\treturn;\n\t}\n\n\t// e23\n\tif (d23_1 > 0.0f && d23_2 > 0.0f && d123_1 <= 0.0f)\n\t{\n\t\tfloat32 inv_d23 = 1.0f / (d23_1 + d23_2);\n\t\tm_v2.a = d23_1 * inv_d23;\n\t\tm_v3.a = d23_2 * inv_d23;\n\t\tm_count = 2;\n\t\tm_v1 = m_v3;\n\t\treturn;\n\t}\n\n\t// Must be in triangle123\n\tfloat32 inv_d123 = 1.0f / (d123_1 + d123_2 + d123_3);\n\tm_v1.a = d123_1 * inv_d123;\n\tm_v2.a = d123_2 * inv_d123;\n\tm_v3.a = d123_3 * inv_d123;\n\tm_count = 3;\n}\n\nvoid b2Distance(b2DistanceOutput* output,\n\t\t\t\tb2SimplexCache* cache,\n\t\t\t\tconst b2DistanceInput* input)\n{\n\t++b2_gjkCalls;\n\n\tconst b2DistanceProxy* proxyA = &input->proxyA;\n\tconst b2DistanceProxy* proxyB = &input->proxyB;\n\n\tb2Transform transformA = input->transformA;\n\tb2Transform transformB = input->transformB;\n\n\t// Initialize the simplex.\n\tb2Simplex simplex;\n\tsimplex.ReadCache(cache, proxyA, transformA, proxyB, transformB);\n\n\t// Get simplex vertices as an array.\n\tb2SimplexVertex* vertices = &simplex.m_v1;\n\tconst int32 k_maxIters = 20;\n\n\t// These store the vertices of the last simplex so that we\n\t// can check for duplicates and prevent cycling.\n\tint32 saveA[3], saveB[3];\n\tint32 saveCount = 0;\n\n\tfloat32 distanceSqr1 = b2_maxFloat;\n\tfloat32 distanceSqr2 = distanceSqr1;\n\n\t// Main iteration loop.\n\tint32 iter = 0;\n\twhile (iter < k_maxIters)\n\t{\n\t\t// Copy simplex so we can identify duplicates.\n\t\tsaveCount = simplex.m_count;\n\t\tfor (int32 i = 0; i < saveCount; ++i)\n\t\t{\n\t\t\tsaveA[i] = vertices[i].indexA;\n\t\t\tsaveB[i] = vertices[i].indexB;\n\t\t}\n\n\t\tswitch (simplex.m_count)\n\t\t{\n\t\tcase 1:\n\t\t\tbreak;\n\n\t\tcase 2:\n\t\t\tsimplex.Solve2();\n\t\t\tbreak;\n\n\t\tcase 3:\n\t\t\tsimplex.Solve3();\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t}\n\n\t\t// If we have 3 points, then the origin is in the corresponding triangle.\n\t\tif (simplex.m_count == 3)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\t// Compute closest point.\n\t\tb2Vec2 p = simplex.GetClosestPoint();\n\t\tdistanceSqr2 = p.LengthSquared();\n\n\t\t// Ensure progress\n\t\tif (distanceSqr2 >= distanceSqr1)\n\t\t{\n\t\t\t//break;\n\t\t}\n\t\tdistanceSqr1 = distanceSqr2;\n\n\t\t// Get search direction.\n\t\tb2Vec2 d = simplex.GetSearchDirection();\n\n\t\t// Ensure the search direction is numerically fit.\n\t\tif (d.LengthSquared() < b2_epsilon * b2_epsilon)\n\t\t{\n\t\t\t// The origin is probably contained by a line segment\n\t\t\t// or triangle. Thus the shapes are overlapped.\n\n\t\t\t// We can't return zero here even though there may be overlap.\n\t\t\t// In case the simplex is a point, segment, or triangle it is difficult\n\t\t\t// to determine if the origin is contained in the CSO or very close to it.\n\t\t\tbreak;\n\t\t}\n\n\t\t// Compute a tentative new simplex vertex using support points.\n\t\tb2SimplexVertex* vertex = vertices + simplex.m_count;\n\t\tvertex->indexA = proxyA->GetSupport(b2MulT(transformA.q, -d));\n\t\tvertex->wA = b2Mul(transformA, proxyA->GetVertex(vertex->indexA));\n\t\tb2Vec2 wBLocal;\n\t\tvertex->indexB = proxyB->GetSupport(b2MulT(transformB.q, d));\n\t\tvertex->wB = b2Mul(transformB, proxyB->GetVertex(vertex->indexB));\n\t\tvertex->w = vertex->wB - vertex->wA;\n\n\t\t// Iteration count is equated to the number of support point calls.\n\t\t++iter;\n\t\t++b2_gjkIters;\n\n\t\t// Check for duplicate support points. This is the main termination criteria.\n\t\tbool duplicate = false;\n\t\tfor (int32 i = 0; i < saveCount; ++i)\n\t\t{\n\t\t\tif (vertex->indexA == saveA[i] && vertex->indexB == saveB[i])\n\t\t\t{\n\t\t\t\tduplicate = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// If we found a duplicate support point we must exit to avoid cycling.\n\t\tif (duplicate)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\t// New vertex is ok and needed.\n\t\t++simplex.m_count;\n\t}\n\n\tb2_gjkMaxIters = b2Max(b2_gjkMaxIters, iter);\n\n\t// Prepare output.\n\tsimplex.GetWitnessPoints(&output->pointA, &output->pointB);\n\toutput->distance = b2Distance(output->pointA, output->pointB);\n\toutput->iterations = iter;\n\n\t// Cache the simplex.\n\tsimplex.WriteCache(cache);\n\n\t// Apply radii if requested.\n\tif (input->useRadii)\n\t{\n\t\tfloat32 rA = proxyA->m_radius;\n\t\tfloat32 rB = proxyB->m_radius;\n\n\t\tif (output->distance > rA + rB && output->distance > b2_epsilon)\n\t\t{\n\t\t\t// Shapes are still no overlapped.\n\t\t\t// Move the witness points to the outer surface.\n\t\t\toutput->distance -= rA + rB;\n\t\t\tb2Vec2 normal = output->pointB - output->pointA;\n\t\t\tnormal.Normalize();\n\t\t\toutput->pointA += rA * normal;\n\t\t\toutput->pointB -= rB * normal;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Shapes are overlapped when radii are considered.\n\t\t\t// Move the witness points to the middle.\n\t\t\tb2Vec2 p = 0.5f * (output->pointA + output->pointB);\n\t\t\toutput->pointA = p;\n\t\t\toutput->pointB = p;\n\t\t\toutput->distance = 0.0f;\n\t\t}\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2DistanceJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2DistanceJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// 1-D constrained system\n// m (v2 - v1) = lambda\n// v2 + (beta/h) * x1 + gamma * lambda = 0, gamma has units of inverse mass.\n// x2 = x1 + h * v2\n\n// 1-D mass-damper-spring system\n// m (v2 - v1) + h * d * v2 + h * k *\n\n// C = norm(p2 - p1) - L\n// u = (p2 - p1) / norm(p2 - p1)\n// Cdot = dot(u, v2 + cross(w2, r2) - v1 - cross(w1, r1))\n// J = [-u -cross(r1, u) u cross(r2, u)]\n// K = J * invM * JT\n// = invMass1 + invI1 * cross(r1, u)^2 + invMass2 + invI2 * cross(r2, u)^2\n\nvoid b2DistanceJointDef::Initialize(b2Body* b1, b2Body* b2,\n\t\t\t\t\t\t\t\t\tconst b2Vec2& anchor1, const b2Vec2& anchor2)\n{\n\tbodyA = b1;\n\tbodyB = b2;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor1);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor2);\n\tb2Vec2 d = anchor2 - anchor1;\n\tlength = d.Length();\n}\n\nb2DistanceJoint::b2DistanceJoint(const b2DistanceJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\tm_length = def->length;\n\tm_frequencyHz = def->frequencyHz;\n\tm_dampingRatio = def->dampingRatio;\n\tm_impulse = 0.0f;\n\tm_gamma = 0.0f;\n\tm_bias = 0.0f;\n}\n\nvoid b2DistanceJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tm_u = cB + m_rB - cA - m_rA;\n\n\t// Handle singularity.\n\tfloat32 length = m_u.Length();\n\tif (length > b2_linearSlop)\n\t{\n\t\tm_u *= 1.0f / length;\n\t}\n\telse\n\t{\n\t\tm_u.Set(0.0f, 0.0f);\n\t}\n\n\tfloat32 crAu = b2Cross(m_rA, m_u);\n\tfloat32 crBu = b2Cross(m_rB, m_u);\n\tfloat32 invMass = m_invMassA + m_invIA * crAu * crAu + m_invMassB + m_invIB * crBu * crBu;\n\n\t// Compute the effective mass matrix.\n\tm_mass = invMass != 0.0f ? 1.0f / invMass : 0.0f;\n\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\tfloat32 C = length - m_length;\n\n\t\t// Frequency\n\t\tfloat32 omega = 2.0f * b2_pi * m_frequencyHz;\n\n\t\t// Damping coefficient\n\t\tfloat32 d = 2.0f * m_mass * m_dampingRatio * omega;\n\n\t\t// Spring stiffness\n\t\tfloat32 k = m_mass * omega * omega;\n\n\t\t// magic formulas\n\t\tfloat32 h = data.step.dt;\n\t\tm_gamma = h * (d + h * k);\n\t\tm_gamma = m_gamma != 0.0f ? 1.0f / m_gamma : 0.0f;\n\t\tm_bias = C * h * k * m_gamma;\n\n\t\tinvMass += m_gamma;\n\t\tm_mass = invMass != 0.0f ? 1.0f / invMass : 0.0f;\n\t}\n\telse\n\t{\n\t\tm_gamma = 0.0f;\n\t\tm_bias = 0.0f;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale the impulse to support a variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P = m_impulse * m_u;\n\t\tvA -= m_invMassA * P;\n\t\twA -= m_invIA * b2Cross(m_rA, P);\n\t\tvB += m_invMassB * P;\n\t\twB += m_invIB * b2Cross(m_rB, P);\n\t}\n\telse\n\t{\n\t\tm_impulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2DistanceJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\t// Cdot = dot(u, v + cross(w, r))\n\tb2Vec2 vpA = vA + b2Cross(wA, m_rA);\n\tb2Vec2 vpB = vB + b2Cross(wB, m_rB);\n\tfloat32 Cdot = b2Dot(m_u, vpB - vpA);\n\n\tfloat32 impulse = -m_mass * (Cdot + m_bias + m_gamma * m_impulse);\n\tm_impulse += impulse;\n\n\tb2Vec2 P = impulse * m_u;\n\tvA -= m_invMassA * P;\n\twA -= m_invIA * b2Cross(m_rA, P);\n\tvB += m_invMassB * P;\n\twB += m_invIB * b2Cross(m_rB, P);\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2DistanceJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\t// There is no position correction for soft distance constraints.\n\t\treturn true;\n\t}\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 u = cB + rB - cA - rA;\n\n\tfloat32 length = u.Normalize();\n\tfloat32 C = length - m_length;\n\tC = b2Clamp(C, -b2_maxLinearCorrection, b2_maxLinearCorrection);\n\n\tfloat32 impulse = -m_mass * C;\n\tb2Vec2 P = impulse * u;\n\n\tcA -= m_invMassA * P;\n\taA -= m_invIA * b2Cross(rA, P);\n\tcB += m_invMassB * P;\n\taB += m_invIB * b2Cross(rB, P);\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn b2Abs(C) < b2_linearSlop;\n}\n\nb2Vec2 b2DistanceJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2DistanceJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2DistanceJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 F = (inv_dt * m_impulse) * m_u;\n\treturn F;\n}\n\nfloat32 b2DistanceJoint::GetReactionTorque(float32 inv_dt) const\n{\n\tB2_NOT_USED(inv_dt);\n\treturn 0.0f;\n}\n\nvoid b2DistanceJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2DistanceJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.length = %.15lef;\\n\", m_length);\n\tb2Log(\" jd.frequencyHz = %.15lef;\\n\", m_frequencyHz);\n\tb2Log(\" jd.dampingRatio = %.15lef;\\n\", m_dampingRatio);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2Draw.cpp",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2Draw.h\"\n\nb2Draw::b2Draw()\n{\n\tm_drawFlags = 0;\n}\n\nvoid b2Draw::SetFlags(uint32 flags)\n{\n\tm_drawFlags = flags;\n}\n\nuint32 b2Draw::GetFlags() const\n{\n\treturn m_drawFlags;\n}\n\nvoid b2Draw::AppendFlags(uint32 flags)\n{\n\tm_drawFlags |= flags;\n}\n\nvoid b2Draw::ClearFlags(uint32 flags)\n{\n\tm_drawFlags &= ~flags;\n}\n"
},
{
"path": "app/src/main/cpp/b2DynamicTree.cpp",
"content": "/*\n* Copyright (c) 2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2DynamicTree.h\"\n#include \n#include \n\nb2DynamicTree::b2DynamicTree()\n{\n\tm_root = b2_nullNode;\n\n\tm_nodeCapacity = 16;\n\tm_nodeCount = 0;\n\tm_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));\n\tmemset(m_nodes, 0, m_nodeCapacity * sizeof(b2TreeNode));\n\n\t// Build a linked list for the free list.\n\tfor (int32 i = 0; i < m_nodeCapacity - 1; ++i)\n\t{\n\t\tm_nodes[i].next = i + 1;\n\t\tm_nodes[i].height = -1;\n\t}\n\tm_nodes[m_nodeCapacity-1].next = b2_nullNode;\n\tm_nodes[m_nodeCapacity-1].height = -1;\n\tm_freeList = 0;\n\n\tm_path = 0;\n\n\tm_insertionCount = 0;\n}\n\nb2DynamicTree::~b2DynamicTree()\n{\n\t// This frees the entire tree in one shot.\n\tb2Free(m_nodes);\n}\n\n// Allocate a node from the pool. Grow the pool if necessary.\nint32 b2DynamicTree::AllocateNode()\n{\n\t// Expand the node pool as needed.\n\tif (m_freeList == b2_nullNode)\n\t{\n\t\tb2Assert(m_nodeCount == m_nodeCapacity);\n\n\t\t// The free list is empty. Rebuild a bigger pool.\n\t\tb2TreeNode* oldNodes = m_nodes;\n\t\tm_nodeCapacity *= 2;\n\t\tm_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));\n\t\tmemcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2TreeNode));\n\t\tb2Free(oldNodes);\n\n\t\t// Build a linked list for the free list. The parent\n\t\t// pointer becomes the \"next\" pointer.\n\t\tfor (int32 i = m_nodeCount; i < m_nodeCapacity - 1; ++i)\n\t\t{\n\t\t\tm_nodes[i].next = i + 1;\n\t\t\tm_nodes[i].height = -1;\n\t\t}\n\t\tm_nodes[m_nodeCapacity-1].next = b2_nullNode;\n\t\tm_nodes[m_nodeCapacity-1].height = -1;\n\t\tm_freeList = m_nodeCount;\n\t}\n\n\t// Peel a node off the free list.\n\tint32 nodeId = m_freeList;\n\tm_freeList = m_nodes[nodeId].next;\n\tm_nodes[nodeId].parent = b2_nullNode;\n\tm_nodes[nodeId].child1 = b2_nullNode;\n\tm_nodes[nodeId].child2 = b2_nullNode;\n\tm_nodes[nodeId].height = 0;\n\tm_nodes[nodeId].userData = NULL;\n\t++m_nodeCount;\n\treturn nodeId;\n}\n\n// Return a node to the pool.\nvoid b2DynamicTree::FreeNode(int32 nodeId)\n{\n\tb2Assert(0 <= nodeId && nodeId < m_nodeCapacity);\n\tb2Assert(0 < m_nodeCount);\n\tm_nodes[nodeId].next = m_freeList;\n\tm_nodes[nodeId].height = -1;\n\tm_freeList = nodeId;\n\t--m_nodeCount;\n}\n\n// Create a proxy in the tree as a leaf node. We return the index\n// of the node instead of a pointer so that we can grow\n// the node pool.\nint32 b2DynamicTree::CreateProxy(const b2AABB& aabb, void* userData)\n{\n\tint32 proxyId = AllocateNode();\n\n\t// Fatten the aabb.\n\tb2Vec2 r(b2_aabbExtension, b2_aabbExtension);\n\tm_nodes[proxyId].aabb.lowerBound = aabb.lowerBound - r;\n\tm_nodes[proxyId].aabb.upperBound = aabb.upperBound + r;\n\tm_nodes[proxyId].userData = userData;\n\tm_nodes[proxyId].height = 0;\n\n\tInsertLeaf(proxyId);\n\n\treturn proxyId;\n}\n\nvoid b2DynamicTree::DestroyProxy(int32 proxyId)\n{\n\tb2Assert(0 <= proxyId && proxyId < m_nodeCapacity);\n\tb2Assert(m_nodes[proxyId].IsLeaf());\n\n\tRemoveLeaf(proxyId);\n\tFreeNode(proxyId);\n}\n\nbool b2DynamicTree::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement)\n{\n\tb2Assert(0 <= proxyId && proxyId < m_nodeCapacity);\n\n\tb2Assert(m_nodes[proxyId].IsLeaf());\n\n\tif (m_nodes[proxyId].aabb.Contains(aabb))\n\t{\n\t\treturn false;\n\t}\n\n\tRemoveLeaf(proxyId);\n\n\t// Extend AABB.\n\tb2AABB b = aabb;\n\tb2Vec2 r(b2_aabbExtension, b2_aabbExtension);\n\tb.lowerBound = b.lowerBound - r;\n\tb.upperBound = b.upperBound + r;\n\n\t// Predict AABB displacement.\n\tb2Vec2 d = b2_aabbMultiplier * displacement;\n\n\tif (d.x < 0.0f)\n\t{\n\t\tb.lowerBound.x += d.x;\n\t}\n\telse\n\t{\n\t\tb.upperBound.x += d.x;\n\t}\n\n\tif (d.y < 0.0f)\n\t{\n\t\tb.lowerBound.y += d.y;\n\t}\n\telse\n\t{\n\t\tb.upperBound.y += d.y;\n\t}\n\n\tm_nodes[proxyId].aabb = b;\n\n\tInsertLeaf(proxyId);\n\treturn true;\n}\n\nvoid b2DynamicTree::InsertLeaf(int32 leaf)\n{\n\t++m_insertionCount;\n\n\tif (m_root == b2_nullNode)\n\t{\n\t\tm_root = leaf;\n\t\tm_nodes[m_root].parent = b2_nullNode;\n\t\treturn;\n\t}\n\n\t// Find the best sibling for this node\n\tb2AABB leafAABB = m_nodes[leaf].aabb;\n\tint32 index = m_root;\n\twhile (m_nodes[index].IsLeaf() == false)\n\t{\n\t\tint32 child1 = m_nodes[index].child1;\n\t\tint32 child2 = m_nodes[index].child2;\n\n\t\tfloat32 area = m_nodes[index].aabb.GetPerimeter();\n\n\t\tb2AABB combinedAABB;\n\t\tcombinedAABB.Combine(m_nodes[index].aabb, leafAABB);\n\t\tfloat32 combinedArea = combinedAABB.GetPerimeter();\n\n\t\t// Cost of creating a new parent for this node and the new leaf\n\t\tfloat32 cost = 2.0f * combinedArea;\n\n\t\t// Minimum cost of pushing the leaf further down the tree\n\t\tfloat32 inheritanceCost = 2.0f * (combinedArea - area);\n\n\t\t// Cost of descending into child1\n\t\tfloat32 cost1;\n\t\tif (m_nodes[child1].IsLeaf())\n\t\t{\n\t\t\tb2AABB aabb;\n\t\t\taabb.Combine(leafAABB, m_nodes[child1].aabb);\n\t\t\tcost1 = aabb.GetPerimeter() + inheritanceCost;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tb2AABB aabb;\n\t\t\taabb.Combine(leafAABB, m_nodes[child1].aabb);\n\t\t\tfloat32 oldArea = m_nodes[child1].aabb.GetPerimeter();\n\t\t\tfloat32 newArea = aabb.GetPerimeter();\n\t\t\tcost1 = (newArea - oldArea) + inheritanceCost;\n\t\t}\n\n\t\t// Cost of descending into child2\n\t\tfloat32 cost2;\n\t\tif (m_nodes[child2].IsLeaf())\n\t\t{\n\t\t\tb2AABB aabb;\n\t\t\taabb.Combine(leafAABB, m_nodes[child2].aabb);\n\t\t\tcost2 = aabb.GetPerimeter() + inheritanceCost;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tb2AABB aabb;\n\t\t\taabb.Combine(leafAABB, m_nodes[child2].aabb);\n\t\t\tfloat32 oldArea = m_nodes[child2].aabb.GetPerimeter();\n\t\t\tfloat32 newArea = aabb.GetPerimeter();\n\t\t\tcost2 = newArea - oldArea + inheritanceCost;\n\t\t}\n\n\t\t// Descend according to the minimum cost.\n\t\tif (cost < cost1 && cost < cost2)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\t// Descend\n\t\tif (cost1 < cost2)\n\t\t{\n\t\t\tindex = child1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tindex = child2;\n\t\t}\n\t}\n\n\tint32 sibling = index;\n\n\t// Create a new parent.\n\tint32 oldParent = m_nodes[sibling].parent;\n\tint32 newParent = AllocateNode();\n\tm_nodes[newParent].parent = oldParent;\n\tm_nodes[newParent].userData = NULL;\n\tm_nodes[newParent].aabb.Combine(leafAABB, m_nodes[sibling].aabb);\n\tm_nodes[newParent].height = m_nodes[sibling].height + 1;\n\n\tif (oldParent != b2_nullNode)\n\t{\n\t\t// The sibling was not the root.\n\t\tif (m_nodes[oldParent].child1 == sibling)\n\t\t{\n\t\t\tm_nodes[oldParent].child1 = newParent;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_nodes[oldParent].child2 = newParent;\n\t\t}\n\n\t\tm_nodes[newParent].child1 = sibling;\n\t\tm_nodes[newParent].child2 = leaf;\n\t\tm_nodes[sibling].parent = newParent;\n\t\tm_nodes[leaf].parent = newParent;\n\t}\n\telse\n\t{\n\t\t// The sibling was the root.\n\t\tm_nodes[newParent].child1 = sibling;\n\t\tm_nodes[newParent].child2 = leaf;\n\t\tm_nodes[sibling].parent = newParent;\n\t\tm_nodes[leaf].parent = newParent;\n\t\tm_root = newParent;\n\t}\n\n\t// Walk back up the tree fixing heights and AABBs\n\tindex = m_nodes[leaf].parent;\n\twhile (index != b2_nullNode)\n\t{\n\t\tindex = Balance(index);\n\n\t\tint32 child1 = m_nodes[index].child1;\n\t\tint32 child2 = m_nodes[index].child2;\n\n\t\tb2Assert(child1 != b2_nullNode);\n\t\tb2Assert(child2 != b2_nullNode);\n\n\t\tm_nodes[index].height = 1 + b2Max(m_nodes[child1].height, m_nodes[child2].height);\n\t\tm_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);\n\n\t\tindex = m_nodes[index].parent;\n\t}\n\n\t//Validate();\n}\n\nvoid b2DynamicTree::RemoveLeaf(int32 leaf)\n{\n\tif (leaf == m_root)\n\t{\n\t\tm_root = b2_nullNode;\n\t\treturn;\n\t}\n\n\tint32 parent = m_nodes[leaf].parent;\n\tint32 grandParent = m_nodes[parent].parent;\n\tint32 sibling;\n\tif (m_nodes[parent].child1 == leaf)\n\t{\n\t\tsibling = m_nodes[parent].child2;\n\t}\n\telse\n\t{\n\t\tsibling = m_nodes[parent].child1;\n\t}\n\n\tif (grandParent != b2_nullNode)\n\t{\n\t\t// Destroy parent and connect sibling to grandParent.\n\t\tif (m_nodes[grandParent].child1 == parent)\n\t\t{\n\t\t\tm_nodes[grandParent].child1 = sibling;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_nodes[grandParent].child2 = sibling;\n\t\t}\n\t\tm_nodes[sibling].parent = grandParent;\n\t\tFreeNode(parent);\n\n\t\t// Adjust ancestor bounds.\n\t\tint32 index = grandParent;\n\t\twhile (index != b2_nullNode)\n\t\t{\n\t\t\tindex = Balance(index);\n\n\t\t\tint32 child1 = m_nodes[index].child1;\n\t\t\tint32 child2 = m_nodes[index].child2;\n\n\t\t\tm_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);\n\t\t\tm_nodes[index].height = 1 + b2Max(m_nodes[child1].height, m_nodes[child2].height);\n\n\t\t\tindex = m_nodes[index].parent;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_root = sibling;\n\t\tm_nodes[sibling].parent = b2_nullNode;\n\t\tFreeNode(parent);\n\t}\n\n\t//Validate();\n}\n\n// Perform a left or right rotation if node A is imbalanced.\n// Returns the new root index.\nint32 b2DynamicTree::Balance(int32 iA)\n{\n\tb2Assert(iA != b2_nullNode);\n\n\tb2TreeNode* A = m_nodes + iA;\n\tif (A->IsLeaf() || A->height < 2)\n\t{\n\t\treturn iA;\n\t}\n\n\tint32 iB = A->child1;\n\tint32 iC = A->child2;\n\tb2Assert(0 <= iB && iB < m_nodeCapacity);\n\tb2Assert(0 <= iC && iC < m_nodeCapacity);\n\n\tb2TreeNode* B = m_nodes + iB;\n\tb2TreeNode* C = m_nodes + iC;\n\n\tint32 balance = C->height - B->height;\n\n\t// Rotate C up\n\tif (balance > 1)\n\t{\n\t\tint32 iF = C->child1;\n\t\tint32 iG = C->child2;\n\t\tb2TreeNode* F = m_nodes + iF;\n\t\tb2TreeNode* G = m_nodes + iG;\n\t\tb2Assert(0 <= iF && iF < m_nodeCapacity);\n\t\tb2Assert(0 <= iG && iG < m_nodeCapacity);\n\n\t\t// Swap A and C\n\t\tC->child1 = iA;\n\t\tC->parent = A->parent;\n\t\tA->parent = iC;\n\n\t\t// A's old parent should point to C\n\t\tif (C->parent != b2_nullNode)\n\t\t{\n\t\t\tif (m_nodes[C->parent].child1 == iA)\n\t\t\t{\n\t\t\t\tm_nodes[C->parent].child1 = iC;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb2Assert(m_nodes[C->parent].child2 == iA);\n\t\t\t\tm_nodes[C->parent].child2 = iC;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_root = iC;\n\t\t}\n\n\t\t// Rotate\n\t\tif (F->height > G->height)\n\t\t{\n\t\t\tC->child2 = iF;\n\t\t\tA->child2 = iG;\n\t\t\tG->parent = iA;\n\t\t\tA->aabb.Combine(B->aabb, G->aabb);\n\t\t\tC->aabb.Combine(A->aabb, F->aabb);\n\n\t\t\tA->height = 1 + b2Max(B->height, G->height);\n\t\t\tC->height = 1 + b2Max(A->height, F->height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tC->child2 = iG;\n\t\t\tA->child2 = iF;\n\t\t\tF->parent = iA;\n\t\t\tA->aabb.Combine(B->aabb, F->aabb);\n\t\t\tC->aabb.Combine(A->aabb, G->aabb);\n\n\t\t\tA->height = 1 + b2Max(B->height, F->height);\n\t\t\tC->height = 1 + b2Max(A->height, G->height);\n\t\t}\n\n\t\treturn iC;\n\t}\n\n\t// Rotate B up\n\tif (balance < -1)\n\t{\n\t\tint32 iD = B->child1;\n\t\tint32 iE = B->child2;\n\t\tb2TreeNode* D = m_nodes + iD;\n\t\tb2TreeNode* E = m_nodes + iE;\n\t\tb2Assert(0 <= iD && iD < m_nodeCapacity);\n\t\tb2Assert(0 <= iE && iE < m_nodeCapacity);\n\n\t\t// Swap A and B\n\t\tB->child1 = iA;\n\t\tB->parent = A->parent;\n\t\tA->parent = iB;\n\n\t\t// A's old parent should point to B\n\t\tif (B->parent != b2_nullNode)\n\t\t{\n\t\t\tif (m_nodes[B->parent].child1 == iA)\n\t\t\t{\n\t\t\t\tm_nodes[B->parent].child1 = iB;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb2Assert(m_nodes[B->parent].child2 == iA);\n\t\t\t\tm_nodes[B->parent].child2 = iB;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_root = iB;\n\t\t}\n\n\t\t// Rotate\n\t\tif (D->height > E->height)\n\t\t{\n\t\t\tB->child2 = iD;\n\t\t\tA->child1 = iE;\n\t\t\tE->parent = iA;\n\t\t\tA->aabb.Combine(C->aabb, E->aabb);\n\t\t\tB->aabb.Combine(A->aabb, D->aabb);\n\n\t\t\tA->height = 1 + b2Max(C->height, E->height);\n\t\t\tB->height = 1 + b2Max(A->height, D->height);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tB->child2 = iE;\n\t\t\tA->child1 = iD;\n\t\t\tD->parent = iA;\n\t\t\tA->aabb.Combine(C->aabb, D->aabb);\n\t\t\tB->aabb.Combine(A->aabb, E->aabb);\n\n\t\t\tA->height = 1 + b2Max(C->height, D->height);\n\t\t\tB->height = 1 + b2Max(A->height, E->height);\n\t\t}\n\n\t\treturn iB;\n\t}\n\n\treturn iA;\n}\n\nint32 b2DynamicTree::GetHeight() const\n{\n\tif (m_root == b2_nullNode)\n\t{\n\t\treturn 0;\n\t}\n\n\treturn m_nodes[m_root].height;\n}\n\n//\nfloat32 b2DynamicTree::GetAreaRatio() const\n{\n\tif (m_root == b2_nullNode)\n\t{\n\t\treturn 0.0f;\n\t}\n\n\tconst b2TreeNode* root = m_nodes + m_root;\n\tfloat32 rootArea = root->aabb.GetPerimeter();\n\n\tfloat32 totalArea = 0.0f;\n\tfor (int32 i = 0; i < m_nodeCapacity; ++i)\n\t{\n\t\tconst b2TreeNode* node = m_nodes + i;\n\t\tif (node->height < 0)\n\t\t{\n\t\t\t// Free node in pool\n\t\t\tcontinue;\n\t\t}\n\n\t\ttotalArea += node->aabb.GetPerimeter();\n\t}\n\n\treturn totalArea / rootArea;\n}\n\n// Compute the height of a sub-tree.\nint32 b2DynamicTree::ComputeHeight(int32 nodeId) const\n{\n\tb2Assert(0 <= nodeId && nodeId < m_nodeCapacity);\n\tb2TreeNode* node = m_nodes + nodeId;\n\n\tif (node->IsLeaf())\n\t{\n\t\treturn 0;\n\t}\n\n\tint32 height1 = ComputeHeight(node->child1);\n\tint32 height2 = ComputeHeight(node->child2);\n\treturn 1 + b2Max(height1, height2);\n}\n\nint32 b2DynamicTree::ComputeHeight() const\n{\n\tint32 height = ComputeHeight(m_root);\n\treturn height;\n}\n\nvoid b2DynamicTree::ValidateStructure(int32 index) const\n{\n\tif (index == b2_nullNode)\n\t{\n\t\treturn;\n\t}\n\n\tif (index == m_root)\n\t{\n\t\tb2Assert(m_nodes[index].parent == b2_nullNode);\n\t}\n\n\tconst b2TreeNode* node = m_nodes + index;\n\n\tint32 child1 = node->child1;\n\tint32 child2 = node->child2;\n\n\tif (node->IsLeaf())\n\t{\n\t\tb2Assert(child1 == b2_nullNode);\n\t\tb2Assert(child2 == b2_nullNode);\n\t\tb2Assert(node->height == 0);\n\t\treturn;\n\t}\n\n\tb2Assert(0 <= child1 && child1 < m_nodeCapacity);\n\tb2Assert(0 <= child2 && child2 < m_nodeCapacity);\n\n\tb2Assert(m_nodes[child1].parent == index);\n\tb2Assert(m_nodes[child2].parent == index);\n\n\tValidateStructure(child1);\n\tValidateStructure(child2);\n}\n\nvoid b2DynamicTree::ValidateMetrics(int32 index) const\n{\n\tif (index == b2_nullNode)\n\t{\n\t\treturn;\n\t}\n\n\tconst b2TreeNode* node = m_nodes + index;\n\n\tint32 child1 = node->child1;\n\tint32 child2 = node->child2;\n\n\tif (node->IsLeaf())\n\t{\n\t\tb2Assert(child1 == b2_nullNode);\n\t\tb2Assert(child2 == b2_nullNode);\n\t\tb2Assert(node->height == 0);\n\t\treturn;\n\t}\n\n\tb2Assert(0 <= child1 && child1 < m_nodeCapacity);\n\tb2Assert(0 <= child2 && child2 < m_nodeCapacity);\n\n\tint32 height1 = m_nodes[child1].height;\n\tint32 height2 = m_nodes[child2].height;\n\tint32 height;\n\theight = 1 + b2Max(height1, height2);\n\tb2Assert(node->height == height);\n\n\tb2AABB aabb;\n\taabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);\n\n\tb2Assert(aabb.lowerBound == node->aabb.lowerBound);\n\tb2Assert(aabb.upperBound == node->aabb.upperBound);\n\n\tValidateMetrics(child1);\n\tValidateMetrics(child2);\n}\n\nvoid b2DynamicTree::Validate() const\n{\n\tValidateStructure(m_root);\n\tValidateMetrics(m_root);\n\n\tint32 freeCount = 0;\n\tint32 freeIndex = m_freeList;\n\twhile (freeIndex != b2_nullNode)\n\t{\n\t\tb2Assert(0 <= freeIndex && freeIndex < m_nodeCapacity);\n\t\tfreeIndex = m_nodes[freeIndex].next;\n\t\t++freeCount;\n\t}\n\n\tb2Assert(GetHeight() == ComputeHeight());\n\n\tb2Assert(m_nodeCount + freeCount == m_nodeCapacity);\n}\n\nint32 b2DynamicTree::GetMaxBalance() const\n{\n\tint32 maxBalance = 0;\n\tfor (int32 i = 0; i < m_nodeCapacity; ++i)\n\t{\n\t\tconst b2TreeNode* node = m_nodes + i;\n\t\tif (node->height <= 1)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tb2Assert(node->IsLeaf() == false);\n\n\t\tint32 child1 = node->child1;\n\t\tint32 child2 = node->child2;\n\t\tint32 balance = b2Abs(m_nodes[child2].height - m_nodes[child1].height);\n\t\tmaxBalance = b2Max(maxBalance, balance);\n\t}\n\n\treturn maxBalance;\n}\n\nvoid b2DynamicTree::RebuildBottomUp()\n{\n\tint32* nodes = (int32*)b2Alloc(m_nodeCount * sizeof(int32));\n\tint32 count = 0;\n\n\t// Build array of leaves. Free the rest.\n\tfor (int32 i = 0; i < m_nodeCapacity; ++i)\n\t{\n\t\tif (m_nodes[i].height < 0)\n\t\t{\n\t\t\t// free node in pool\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (m_nodes[i].IsLeaf())\n\t\t{\n\t\t\tm_nodes[i].parent = b2_nullNode;\n\t\t\tnodes[count] = i;\n\t\t\t++count;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tFreeNode(i);\n\t\t}\n\t}\n\n\twhile (count > 1)\n\t{\n\t\tfloat32 minCost = b2_maxFloat;\n\t\tint32 iMin = -1, jMin = -1;\n\t\tfor (int32 i = 0; i < count; ++i)\n\t\t{\n\t\t\tb2AABB aabbi = m_nodes[nodes[i]].aabb;\n\n\t\t\tfor (int32 j = i + 1; j < count; ++j)\n\t\t\t{\n\t\t\t\tb2AABB aabbj = m_nodes[nodes[j]].aabb;\n\t\t\t\tb2AABB b;\n\t\t\t\tb.Combine(aabbi, aabbj);\n\t\t\t\tfloat32 cost = b.GetPerimeter();\n\t\t\t\tif (cost < minCost)\n\t\t\t\t{\n\t\t\t\t\tiMin = i;\n\t\t\t\t\tjMin = j;\n\t\t\t\t\tminCost = cost;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint32 index1 = nodes[iMin];\n\t\tint32 index2 = nodes[jMin];\n\t\tb2TreeNode* child1 = m_nodes + index1;\n\t\tb2TreeNode* child2 = m_nodes + index2;\n\n\t\tint32 parentIndex = AllocateNode();\n\t\tb2TreeNode* parent = m_nodes + parentIndex;\n\t\tparent->child1 = index1;\n\t\tparent->child2 = index2;\n\t\tparent->height = 1 + b2Max(child1->height, child2->height);\n\t\tparent->aabb.Combine(child1->aabb, child2->aabb);\n\t\tparent->parent = b2_nullNode;\n\n\t\tchild1->parent = parentIndex;\n\t\tchild2->parent = parentIndex;\n\n\t\tnodes[jMin] = nodes[count-1];\n\t\tnodes[iMin] = parentIndex;\n\t\t--count;\n\t}\n\n\tm_root = nodes[0];\n\tb2Free(nodes);\n\n\tValidate();\n}\n\nvoid b2DynamicTree::ShiftOrigin(const b2Vec2& newOrigin)\n{\n\t// Build array of leaves. Free the rest.\n\tfor (int32 i = 0; i < m_nodeCapacity; ++i)\n\t{\n\t\tm_nodes[i].aabb.lowerBound -= newOrigin;\n\t\tm_nodes[i].aabb.upperBound -= newOrigin;\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2EdgeAndCircleContact.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n\n#include \n\nb2Contact* b2EdgeAndCircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2EdgeAndCircleContact));\n\treturn new (mem) b2EdgeAndCircleContact(fixtureA, fixtureB);\n}\n\nvoid b2EdgeAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2EdgeAndCircleContact*)contact)->~b2EdgeAndCircleContact();\n\tallocator->Free(contact, sizeof(b2EdgeAndCircleContact));\n}\n\nb2EdgeAndCircleContact::b2EdgeAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)\n: b2Contact(fixtureA, 0, fixtureB, 0)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_edge);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_circle);\n}\n\nvoid b2EdgeAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2CollideEdgeAndCircle(\tmanifold,\n\t\t\t\t\t\t\t\t(b2EdgeShape*)m_fixtureA->GetShape(), xfA,\n\t\t\t\t\t\t\t\t(b2CircleShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2EdgeAndPolygonContact.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n\n#include \n\nb2Contact* b2EdgeAndPolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2EdgeAndPolygonContact));\n\treturn new (mem) b2EdgeAndPolygonContact(fixtureA, fixtureB);\n}\n\nvoid b2EdgeAndPolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2EdgeAndPolygonContact*)contact)->~b2EdgeAndPolygonContact();\n\tallocator->Free(contact, sizeof(b2EdgeAndPolygonContact));\n}\n\nb2EdgeAndPolygonContact::b2EdgeAndPolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB)\n: b2Contact(fixtureA, 0, fixtureB, 0)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_edge);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);\n}\n\nvoid b2EdgeAndPolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2CollideEdgeAndPolygon(\tmanifold,\n\t\t\t\t\t\t\t\t(b2EdgeShape*)m_fixtureA->GetShape(), xfA,\n\t\t\t\t\t\t\t\t(b2PolygonShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2EdgeShape.cpp",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \n\nvoid b2EdgeShape::Set(const b2Vec2& v1, const b2Vec2& v2)\n{\n\tm_vertex1 = v1;\n\tm_vertex2 = v2;\n\tm_hasVertex0 = false;\n\tm_hasVertex3 = false;\n}\n\nb2Shape* b2EdgeShape::Clone(b2BlockAllocator* allocator) const\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2EdgeShape));\n\tb2EdgeShape* clone = new (mem) b2EdgeShape;\n\t*clone = *this;\n\treturn clone;\n}\n\nint32 b2EdgeShape::GetChildCount() const\n{\n\treturn 1;\n}\n\nbool b2EdgeShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const\n{\n\tB2_NOT_USED(xf);\n\tB2_NOT_USED(p);\n\treturn false;\n}\n\n// p = p1 + t * d\n// v = v1 + s * e\n// p1 + t * d = v1 + s * e\n// s * e - t * d = p1 - v1\nbool b2EdgeShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\t\t\tconst b2Transform& xf, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\t// Put the ray into the edge's frame of reference.\n\tb2Vec2 p1 = b2MulT(xf.q, input.p1 - xf.p);\n\tb2Vec2 p2 = b2MulT(xf.q, input.p2 - xf.p);\n\tb2Vec2 d = p2 - p1;\n\n\tb2Vec2 v1 = m_vertex1;\n\tb2Vec2 v2 = m_vertex2;\n\tb2Vec2 e = v2 - v1;\n\tb2Vec2 normal(e.y, -e.x);\n\tnormal.Normalize();\n\n\t// q = p1 + t * d\n\t// dot(normal, q - v1) = 0\n\t// dot(normal, p1 - v1) + t * dot(normal, d) = 0\n\tfloat32 numerator = b2Dot(normal, v1 - p1);\n\tfloat32 denominator = b2Dot(normal, d);\n\n\tif (denominator == 0.0f)\n\t{\n\t\treturn false;\n\t}\n\n\tfloat32 t = numerator / denominator;\n\tif (t < 0.0f || input.maxFraction < t)\n\t{\n\t\treturn false;\n\t}\n\n\tb2Vec2 q = p1 + t * d;\n\n\t// q = v1 + s * r\n\t// s = dot(q - v1, r) / dot(r, r)\n\tb2Vec2 r = v2 - v1;\n\tfloat32 rr = b2Dot(r, r);\n\tif (rr == 0.0f)\n\t{\n\t\treturn false;\n\t}\n\n\tfloat32 s = b2Dot(q - v1, r) / rr;\n\tif (s < 0.0f || 1.0f < s)\n\t{\n\t\treturn false;\n\t}\n\n\toutput->fraction = t;\n\tif (numerator > 0.0f)\n\t{\n\t\toutput->normal = -b2Mul(xf.q, normal);\n\t}\n\telse\n\t{\n\t\toutput->normal = b2Mul(xf.q, normal);\n\t}\n\treturn true;\n}\n\nvoid b2EdgeShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\tb2Vec2 v1 = b2Mul(xf, m_vertex1);\n\tb2Vec2 v2 = b2Mul(xf, m_vertex2);\n\n\tb2Vec2 lower = b2Min(v1, v2);\n\tb2Vec2 upper = b2Max(v1, v2);\n\n\tb2Vec2 r(m_radius, m_radius);\n\taabb->lowerBound = lower - r;\n\taabb->upperBound = upper + r;\n}\n\nvoid b2EdgeShape::ComputeMass(b2MassData* massData, float32 density) const\n{\n\tB2_NOT_USED(density);\n\n\tmassData->mass = 0.0f;\n\tmassData->center = 0.5f * (m_vertex1 + m_vertex2);\n\tmassData->I = 0.0f;\n}\n"
},
{
"path": "app/src/main/cpp/b2Fixture.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2BroadPhase.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n\nb2Fixture::b2Fixture()\n{\n\tm_userData = NULL;\n\tm_body = NULL;\n\tm_next = NULL;\n\tm_proxies = NULL;\n\tm_proxyCount = 0;\n\tm_shape = NULL;\n\tm_density = 0.0f;\n}\n\nvoid b2Fixture::Create(b2BlockAllocator* allocator, b2Body* body, const b2FixtureDef* def)\n{\n\tm_userData = def->userData;\n\tm_friction = def->friction;\n\tm_restitution = def->restitution;\n\n\tm_body = body;\n\tm_next = NULL;\n\n\tm_filter = def->filter;\n\n\tm_isSensor = def->isSensor;\n\n\tm_shape = def->shape->Clone(allocator);\n\n\t// Reserve proxy space\n\tint32 childCount = m_shape->GetChildCount();\n\tm_proxies = (b2FixtureProxy*)allocator->Allocate(childCount * sizeof(b2FixtureProxy));\n\tfor (int32 i = 0; i < childCount; ++i)\n\t{\n\t\tm_proxies[i].fixture = NULL;\n\t\tm_proxies[i].proxyId = b2BroadPhase::e_nullProxy;\n\t}\n\tm_proxyCount = 0;\n\n\tm_density = def->density;\n}\n\nvoid b2Fixture::Destroy(b2BlockAllocator* allocator)\n{\n\t// The proxies must be destroyed before calling this.\n\tb2Assert(m_proxyCount == 0);\n\n\t// Free the proxy array.\n\tint32 childCount = m_shape->GetChildCount();\n\tallocator->Free(m_proxies, childCount * sizeof(b2FixtureProxy));\n\tm_proxies = NULL;\n\n\t// Free the child shape.\n\tswitch (m_shape->m_type)\n\t{\n\tcase b2Shape::e_circle:\n\t\t{\n\t\t\tb2CircleShape* s = (b2CircleShape*)m_shape;\n\t\t\ts->~b2CircleShape();\n\t\t\tallocator->Free(s, sizeof(b2CircleShape));\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_edge:\n\t\t{\n\t\t\tb2EdgeShape* s = (b2EdgeShape*)m_shape;\n\t\t\ts->~b2EdgeShape();\n\t\t\tallocator->Free(s, sizeof(b2EdgeShape));\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_polygon:\n\t\t{\n\t\t\tb2PolygonShape* s = (b2PolygonShape*)m_shape;\n\t\t\ts->~b2PolygonShape();\n\t\t\tallocator->Free(s, sizeof(b2PolygonShape));\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_chain:\n\t\t{\n\t\t\tb2ChainShape* s = (b2ChainShape*)m_shape;\n\t\t\ts->~b2ChainShape();\n\t\t\tallocator->Free(s, sizeof(b2ChainShape));\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\tb2Assert(false);\n\t\tbreak;\n\t}\n\n\tm_shape = NULL;\n}\n\nvoid b2Fixture::CreateProxies(b2BroadPhase* broadPhase, const b2Transform& xf)\n{\n\tb2Assert(m_proxyCount == 0);\n\n\t// Create proxies in the broad-phase.\n\tm_proxyCount = m_shape->GetChildCount();\n\n\tfor (int32 i = 0; i < m_proxyCount; ++i)\n\t{\n\t\tb2FixtureProxy* proxy = m_proxies + i;\n\t\tm_shape->ComputeAABB(&proxy->aabb, xf, i);\n\t\tproxy->proxyId = broadPhase->CreateProxy(proxy->aabb, proxy);\n\t\tproxy->fixture = this;\n\t\tproxy->childIndex = i;\n\t}\n}\n\nvoid b2Fixture::DestroyProxies(b2BroadPhase* broadPhase)\n{\n\t// Destroy proxies in the broad-phase.\n\tfor (int32 i = 0; i < m_proxyCount; ++i)\n\t{\n\t\tb2FixtureProxy* proxy = m_proxies + i;\n\t\tbroadPhase->DestroyProxy(proxy->proxyId);\n\t\tproxy->proxyId = b2BroadPhase::e_nullProxy;\n\t}\n\n\tm_proxyCount = 0;\n}\n\nvoid b2Fixture::Synchronize(b2BroadPhase* broadPhase, const b2Transform& transform1, const b2Transform& transform2)\n{\n\tif (m_proxyCount == 0)\n\t{\n\t\treturn;\n\t}\n\n\tfor (int32 i = 0; i < m_proxyCount; ++i)\n\t{\n\t\tb2FixtureProxy* proxy = m_proxies + i;\n\n\t\t// Compute an AABB that covers the swept shape (may miss some rotation effect).\n\t\tb2AABB aabb1, aabb2;\n\t\tm_shape->ComputeAABB(&aabb1, transform1, proxy->childIndex);\n\t\tm_shape->ComputeAABB(&aabb2, transform2, proxy->childIndex);\n\n\t\tproxy->aabb.Combine(aabb1, aabb2);\n\n\t\tb2Vec2 displacement = transform2.p - transform1.p;\n\n\t\tbroadPhase->MoveProxy(proxy->proxyId, proxy->aabb, displacement);\n\t}\n}\n\nvoid b2Fixture::SetFilterData(const b2Filter& filter)\n{\n\tm_filter = filter;\n\n\tRefilter();\n}\n\nvoid b2Fixture::Refilter()\n{\n\tif (m_body == NULL)\n\t{\n\t\treturn;\n\t}\n\n\t// Flag associated contacts for filtering.\n\tb2ContactEdge* edge = m_body->GetContactList();\n\twhile (edge)\n\t{\n\t\tb2Contact* contact = edge->contact;\n\t\tb2Fixture* fixtureA = contact->GetFixtureA();\n\t\tb2Fixture* fixtureB = contact->GetFixtureB();\n\t\tif (fixtureA == this || fixtureB == this)\n\t\t{\n\t\t\tcontact->FlagForFiltering();\n\t\t}\n\n\t\tedge = edge->next;\n\t}\n\n\tb2World* world = m_body->GetWorld();\n\n\tif (world == NULL)\n\t{\n\t\treturn;\n\t}\n\n\t// Touch each proxy so that new pairs may be created\n\tb2BroadPhase* broadPhase = &world->m_contactManager.m_broadPhase;\n\tfor (int32 i = 0; i < m_proxyCount; ++i)\n\t{\n\t\tbroadPhase->TouchProxy(m_proxies[i].proxyId);\n\t}\n}\n\nvoid b2Fixture::SetSensor(bool sensor)\n{\n\tif (sensor != m_isSensor)\n\t{\n\t\tm_body->SetAwake(true);\n\t\tm_isSensor = sensor;\n\t}\n}\n\nvoid b2Fixture::Dump(int32 bodyIndex)\n{\n\tb2Log(\" b2FixtureDef fd;\\n\");\n\tb2Log(\" fd.friction = %.15lef;\\n\", m_friction);\n\tb2Log(\" fd.restitution = %.15lef;\\n\", m_restitution);\n\tb2Log(\" fd.density = %.15lef;\\n\", m_density);\n\tb2Log(\" fd.isSensor = bool(%d);\\n\", m_isSensor);\n\tb2Log(\" fd.filter.categoryBits = uint16(%d);\\n\", m_filter.categoryBits);\n\tb2Log(\" fd.filter.maskBits = uint16(%d);\\n\", m_filter.maskBits);\n\tb2Log(\" fd.filter.groupIndex = int16(%d);\\n\", m_filter.groupIndex);\n\n\tswitch (m_shape->m_type)\n\t{\n\tcase b2Shape::e_circle:\n\t\t{\n\t\t\tb2CircleShape* s = (b2CircleShape*)m_shape;\n\t\t\tb2Log(\" b2CircleShape shape;\\n\");\n\t\t\tb2Log(\" shape.m_radius = %.15lef;\\n\", s->m_radius);\n\t\t\tb2Log(\" shape.m_p.Set(%.15lef, %.15lef);\\n\", s->m_p.x, s->m_p.y);\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_edge:\n\t\t{\n\t\t\tb2EdgeShape* s = (b2EdgeShape*)m_shape;\n\t\t\tb2Log(\" b2EdgeShape shape;\\n\");\n\t\t\tb2Log(\" shape.m_radius = %.15lef;\\n\", s->m_radius);\n\t\t\tb2Log(\" shape.m_vertex0.Set(%.15lef, %.15lef);\\n\", s->m_vertex0.x, s->m_vertex0.y);\n\t\t\tb2Log(\" shape.m_vertex1.Set(%.15lef, %.15lef);\\n\", s->m_vertex1.x, s->m_vertex1.y);\n\t\t\tb2Log(\" shape.m_vertex2.Set(%.15lef, %.15lef);\\n\", s->m_vertex2.x, s->m_vertex2.y);\n\t\t\tb2Log(\" shape.m_vertex3.Set(%.15lef, %.15lef);\\n\", s->m_vertex3.x, s->m_vertex3.y);\n\t\t\tb2Log(\" shape.m_hasVertex0 = bool(%d);\\n\", s->m_hasVertex0);\n\t\t\tb2Log(\" shape.m_hasVertex3 = bool(%d);\\n\", s->m_hasVertex3);\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_polygon:\n\t\t{\n\t\t\tb2PolygonShape* s = (b2PolygonShape*)m_shape;\n\t\t\tb2Log(\" b2PolygonShape shape;\\n\");\n\t\t\tb2Log(\" b2Vec2 vs[%d];\\n\", b2_maxPolygonVertices);\n\t\t\tfor (int32 i = 0; i < s->m_count; ++i)\n\t\t\t{\n\t\t\t\tb2Log(\" vs[%d].Set(%.15lef, %.15lef);\\n\", i, s->m_vertices[i].x, s->m_vertices[i].y);\n\t\t\t}\n\t\t\tb2Log(\" shape.Set(vs, %d);\\n\", s->m_count);\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_chain:\n\t\t{\n\t\t\tb2ChainShape* s = (b2ChainShape*)m_shape;\n\t\t\tb2Log(\" b2ChainShape shape;\\n\");\n\t\t\tb2Log(\" b2Vec2 vs[%d];\\n\", s->m_count);\n\t\t\tfor (int32 i = 0; i < s->m_count; ++i)\n\t\t\t{\n\t\t\t\tb2Log(\" vs[%d].Set(%.15lef, %.15lef);\\n\", i, s->m_vertices[i].x, s->m_vertices[i].y);\n\t\t\t}\n\t\t\tb2Log(\" shape.CreateChain(vs, %d);\\n\", s->m_count);\n\t\t\tb2Log(\" shape.m_prevVertex.Set(%.15lef, %.15lef);\\n\", s->m_prevVertex.x, s->m_prevVertex.y);\n\t\t\tb2Log(\" shape.m_nextVertex.Set(%.15lef, %.15lef);\\n\", s->m_nextVertex.x, s->m_nextVertex.y);\n\t\t\tb2Log(\" shape.m_hasPrevVertex = bool(%d);\\n\", s->m_hasPrevVertex);\n\t\t\tb2Log(\" shape.m_hasNextVertex = bool(%d);\\n\", s->m_hasNextVertex);\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\treturn;\n\t}\n\n\tb2Log(\"\\n\");\n\tb2Log(\" fd.shape = &shape;\\n\");\n\tb2Log(\"\\n\");\n\tb2Log(\" bodies[%d]->CreateFixture(&fd);\\n\", bodyIndex);\n}\n"
},
{
"path": "app/src/main/cpp/b2FrictionJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2FrictionJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Point-to-point constraint\n// Cdot = v2 - v1\n// = v2 + cross(w2, r2) - v1 - cross(w1, r1)\n// J = [-I -r1_skew I r2_skew ]\n// Identity used:\n// w k % (rx i + ry j) = w * (-ry i + rx j)\n\n// Angle constraint\n// Cdot = w2 - w1\n// J = [0 0 -1 0 0 1]\n// K = invI1 + invI2\n\nvoid b2FrictionJointDef::Initialize(b2Body* bA, b2Body* bB, const b2Vec2& anchor)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor);\n}\n\nb2FrictionJoint::b2FrictionJoint(const b2FrictionJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\n\tm_linearImpulse.SetZero();\n\tm_angularImpulse = 0.0f;\n\n\tm_maxForce = def->maxForce;\n\tm_maxTorque = def->maxTorque;\n}\n\nvoid b2FrictionJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\t// Compute the effective mass matrix.\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// J = [-I -r1_skew I r2_skew]\n\t// [ 0 -1 0 1]\n\t// r_skew = [-ry; rx]\n\n\t// Matlab\n\t// K = [ mA+r1y^2*iA+mB+r2y^2*iB, -r1y*iA*r1x-r2y*iB*r2x, -r1y*iA-r2y*iB]\n\t// [ -r1y*iA*r1x-r2y*iB*r2x, mA+r1x^2*iA+mB+r2x^2*iB, r1x*iA+r2x*iB]\n\t// [ -r1y*iA-r2y*iB, r1x*iA+r2x*iB, iA+iB]\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Mat22 K;\n\tK.ex.x = mA + mB + iA * m_rA.y * m_rA.y + iB * m_rB.y * m_rB.y;\n\tK.ex.y = -iA * m_rA.x * m_rA.y - iB * m_rB.x * m_rB.y;\n\tK.ey.x = K.ex.y;\n\tK.ey.y = mA + mB + iA * m_rA.x * m_rA.x + iB * m_rB.x * m_rB.x;\n\n\tm_linearMass = K.GetInverse();\n\n\tm_angularMass = iA + iB;\n\tif (m_angularMass > 0.0f)\n\t{\n\t\tm_angularMass = 1.0f / m_angularMass;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale impulses to support a variable time step.\n\t\tm_linearImpulse *= data.step.dtRatio;\n\t\tm_angularImpulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P(m_linearImpulse.x, m_linearImpulse.y);\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + m_angularImpulse);\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + m_angularImpulse);\n\t}\n\telse\n\t{\n\t\tm_linearImpulse.SetZero();\n\t\tm_angularImpulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2FrictionJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tfloat32 h = data.step.dt;\n\n\t// Solve angular friction\n\t{\n\t\tfloat32 Cdot = wB - wA;\n\t\tfloat32 impulse = -m_angularMass * Cdot;\n\n\t\tfloat32 oldImpulse = m_angularImpulse;\n\t\tfloat32 maxImpulse = h * m_maxTorque;\n\t\tm_angularImpulse = b2Clamp(m_angularImpulse + impulse, -maxImpulse, maxImpulse);\n\t\timpulse = m_angularImpulse - oldImpulse;\n\n\t\twA -= iA * impulse;\n\t\twB += iB * impulse;\n\t}\n\n\t// Solve linear friction\n\t{\n\t\tb2Vec2 Cdot = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA);\n\n\t\tb2Vec2 impulse = -b2Mul(m_linearMass, Cdot);\n\t\tb2Vec2 oldImpulse = m_linearImpulse;\n\t\tm_linearImpulse += impulse;\n\n\t\tfloat32 maxImpulse = h * m_maxForce;\n\n\t\tif (m_linearImpulse.LengthSquared() > maxImpulse * maxImpulse)\n\t\t{\n\t\t\tm_linearImpulse.Normalize();\n\t\t\tm_linearImpulse *= maxImpulse;\n\t\t}\n\n\t\timpulse = m_linearImpulse - oldImpulse;\n\n\t\tvA -= mA * impulse;\n\t\twA -= iA * b2Cross(m_rA, impulse);\n\n\t\tvB += mB * impulse;\n\t\twB += iB * b2Cross(m_rB, impulse);\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2FrictionJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tB2_NOT_USED(data);\n\n\treturn true;\n}\n\nb2Vec2 b2FrictionJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2FrictionJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2FrictionJoint::GetReactionForce(float32 inv_dt) const\n{\n\treturn inv_dt * m_linearImpulse;\n}\n\nfloat32 b2FrictionJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_angularImpulse;\n}\n\nvoid b2FrictionJoint::SetMaxForce(float32 force)\n{\n\tb2Assert(b2IsValid(force) && force >= 0.0f);\n\tm_maxForce = force;\n}\n\nfloat32 b2FrictionJoint::GetMaxForce() const\n{\n\treturn m_maxForce;\n}\n\nvoid b2FrictionJoint::SetMaxTorque(float32 torque)\n{\n\tb2Assert(b2IsValid(torque) && torque >= 0.0f);\n\tm_maxTorque = torque;\n}\n\nfloat32 b2FrictionJoint::GetMaxTorque() const\n{\n\treturn m_maxTorque;\n}\n\nvoid b2FrictionJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2FrictionJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.maxForce = %.15lef;\\n\", m_maxForce);\n\tb2Log(\" jd.maxTorque = %.15lef;\\n\", m_maxTorque);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2GearJoint.cpp",
"content": "/*\n* Copyright (c) 2007-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2GearJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2RevoluteJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PrismaticJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Gear Joint:\n// C0 = (coordinate1 + ratio * coordinate2)_initial\n// C = (coordinate1 + ratio * coordinate2) - C0 = 0\n// J = [J1 ratio * J2]\n// K = J * invM * JT\n// = J1 * invM1 * J1T + ratio * ratio * J2 * invM2 * J2T\n//\n// Revolute:\n// coordinate = rotation\n// Cdot = angularVelocity\n// J = [0 0 1]\n// K = J * invM * JT = invI\n//\n// Prismatic:\n// coordinate = dot(p - pg, ug)\n// Cdot = dot(v + cross(w, r), ug)\n// J = [ug cross(r, ug)]\n// K = J * invM * JT = invMass + invI * cross(r, ug)^2\n\nb2GearJoint::b2GearJoint(const b2GearJointDef* def)\n: b2Joint(def)\n{\n\tm_joint1 = def->joint1;\n\tm_joint2 = def->joint2;\n\n\tm_typeA = m_joint1->GetType();\n\tm_typeB = m_joint2->GetType();\n\n\tb2Assert(m_typeA == e_revoluteJoint || m_typeA == e_prismaticJoint);\n\tb2Assert(m_typeB == e_revoluteJoint || m_typeB == e_prismaticJoint);\n\n\tfloat32 coordinateA, coordinateB;\n\n\t// TODO_ERIN there might be some problem with the joint edges in b2Joint.\n\n\tm_bodyC = m_joint1->GetBodyA();\n\tm_bodyA = m_joint1->GetBodyB();\n\n\t// Get geometry of joint1\n\tb2Transform xfA = m_bodyA->m_xf;\n\tfloat32 aA = m_bodyA->m_sweep.a;\n\tb2Transform xfC = m_bodyC->m_xf;\n\tfloat32 aC = m_bodyC->m_sweep.a;\n\n\tif (m_typeA == e_revoluteJoint)\n\t{\n\t\tb2RevoluteJoint* revolute = (b2RevoluteJoint*)def->joint1;\n\t\tm_localAnchorC = revolute->m_localAnchorA;\n\t\tm_localAnchorA = revolute->m_localAnchorB;\n\t\tm_referenceAngleA = revolute->m_referenceAngle;\n\t\tm_localAxisC.SetZero();\n\n\t\tcoordinateA = aA - aC - m_referenceAngleA;\n\t}\n\telse\n\t{\n\t\tb2PrismaticJoint* prismatic = (b2PrismaticJoint*)def->joint1;\n\t\tm_localAnchorC = prismatic->m_localAnchorA;\n\t\tm_localAnchorA = prismatic->m_localAnchorB;\n\t\tm_referenceAngleA = prismatic->m_referenceAngle;\n\t\tm_localAxisC = prismatic->m_localXAxisA;\n\n\t\tb2Vec2 pC = m_localAnchorC;\n\t\tb2Vec2 pA = b2MulT(xfC.q, b2Mul(xfA.q, m_localAnchorA) + (xfA.p - xfC.p));\n\t\tcoordinateA = b2Dot(pA - pC, m_localAxisC);\n\t}\n\n\tm_bodyD = m_joint2->GetBodyA();\n\tm_bodyB = m_joint2->GetBodyB();\n\n\t// Get geometry of joint2\n\tb2Transform xfB = m_bodyB->m_xf;\n\tfloat32 aB = m_bodyB->m_sweep.a;\n\tb2Transform xfD = m_bodyD->m_xf;\n\tfloat32 aD = m_bodyD->m_sweep.a;\n\n\tif (m_typeB == e_revoluteJoint)\n\t{\n\t\tb2RevoluteJoint* revolute = (b2RevoluteJoint*)def->joint2;\n\t\tm_localAnchorD = revolute->m_localAnchorA;\n\t\tm_localAnchorB = revolute->m_localAnchorB;\n\t\tm_referenceAngleB = revolute->m_referenceAngle;\n\t\tm_localAxisD.SetZero();\n\n\t\tcoordinateB = aB - aD - m_referenceAngleB;\n\t}\n\telse\n\t{\n\t\tb2PrismaticJoint* prismatic = (b2PrismaticJoint*)def->joint2;\n\t\tm_localAnchorD = prismatic->m_localAnchorA;\n\t\tm_localAnchorB = prismatic->m_localAnchorB;\n\t\tm_referenceAngleB = prismatic->m_referenceAngle;\n\t\tm_localAxisD = prismatic->m_localXAxisA;\n\n\t\tb2Vec2 pD = m_localAnchorD;\n\t\tb2Vec2 pB = b2MulT(xfD.q, b2Mul(xfB.q, m_localAnchorB) + (xfB.p - xfD.p));\n\t\tcoordinateB = b2Dot(pB - pD, m_localAxisD);\n\t}\n\n\tm_ratio = def->ratio;\n\n\tm_constant = coordinateA + m_ratio * coordinateB;\n\n\tm_impulse = 0.0f;\n}\n\nvoid b2GearJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_indexC = m_bodyC->m_islandIndex;\n\tm_indexD = m_bodyD->m_islandIndex;\n\tm_lcA = m_bodyA->m_sweep.localCenter;\n\tm_lcB = m_bodyB->m_sweep.localCenter;\n\tm_lcC = m_bodyC->m_sweep.localCenter;\n\tm_lcD = m_bodyD->m_sweep.localCenter;\n\tm_mA = m_bodyA->m_invMass;\n\tm_mB = m_bodyB->m_invMass;\n\tm_mC = m_bodyC->m_invMass;\n\tm_mD = m_bodyD->m_invMass;\n\tm_iA = m_bodyA->m_invI;\n\tm_iB = m_bodyB->m_invI;\n\tm_iC = m_bodyC->m_invI;\n\tm_iD = m_bodyD->m_invI;\n\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 aC = data.positions[m_indexC].a;\n\tb2Vec2 vC = data.velocities[m_indexC].v;\n\tfloat32 wC = data.velocities[m_indexC].w;\n\n\tfloat32 aD = data.positions[m_indexD].a;\n\tb2Vec2 vD = data.velocities[m_indexD].v;\n\tfloat32 wD = data.velocities[m_indexD].w;\n\n\tb2Rot qA(aA), qB(aB), qC(aC), qD(aD);\n\n\tm_mass = 0.0f;\n\n\tif (m_typeA == e_revoluteJoint)\n\t{\n\t\tm_JvAC.SetZero();\n\t\tm_JwA = 1.0f;\n\t\tm_JwC = 1.0f;\n\t\tm_mass += m_iA + m_iC;\n\t}\n\telse\n\t{\n\t\tb2Vec2 u = b2Mul(qC, m_localAxisC);\n\t\tb2Vec2 rC = b2Mul(qC, m_localAnchorC - m_lcC);\n\t\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_lcA);\n\t\tm_JvAC = u;\n\t\tm_JwC = b2Cross(rC, u);\n\t\tm_JwA = b2Cross(rA, u);\n\t\tm_mass += m_mC + m_mA + m_iC * m_JwC * m_JwC + m_iA * m_JwA * m_JwA;\n\t}\n\n\tif (m_typeB == e_revoluteJoint)\n\t{\n\t\tm_JvBD.SetZero();\n\t\tm_JwB = m_ratio;\n\t\tm_JwD = m_ratio;\n\t\tm_mass += m_ratio * m_ratio * (m_iB + m_iD);\n\t}\n\telse\n\t{\n\t\tb2Vec2 u = b2Mul(qD, m_localAxisD);\n\t\tb2Vec2 rD = b2Mul(qD, m_localAnchorD - m_lcD);\n\t\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_lcB);\n\t\tm_JvBD = m_ratio * u;\n\t\tm_JwD = m_ratio * b2Cross(rD, u);\n\t\tm_JwB = m_ratio * b2Cross(rB, u);\n\t\tm_mass += m_ratio * m_ratio * (m_mD + m_mB) + m_iD * m_JwD * m_JwD + m_iB * m_JwB * m_JwB;\n\t}\n\n\t// Compute effective mass.\n\tm_mass = m_mass > 0.0f ? 1.0f / m_mass : 0.0f;\n\n\tif (data.step.warmStarting)\n\t{\n\t\tvA += (m_mA * m_impulse) * m_JvAC;\n\t\twA += m_iA * m_impulse * m_JwA;\n\t\tvB += (m_mB * m_impulse) * m_JvBD;\n\t\twB += m_iB * m_impulse * m_JwB;\n\t\tvC -= (m_mC * m_impulse) * m_JvAC;\n\t\twC -= m_iC * m_impulse * m_JwC;\n\t\tvD -= (m_mD * m_impulse) * m_JvBD;\n\t\twD -= m_iD * m_impulse * m_JwD;\n\t}\n\telse\n\t{\n\t\tm_impulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n\tdata.velocities[m_indexC].v = vC;\n\tdata.velocities[m_indexC].w = wC;\n\tdata.velocities[m_indexD].v = vD;\n\tdata.velocities[m_indexD].w = wD;\n}\n\nvoid b2GearJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\tb2Vec2 vC = data.velocities[m_indexC].v;\n\tfloat32 wC = data.velocities[m_indexC].w;\n\tb2Vec2 vD = data.velocities[m_indexD].v;\n\tfloat32 wD = data.velocities[m_indexD].w;\n\n\tfloat32 Cdot = b2Dot(m_JvAC, vA - vC) + b2Dot(m_JvBD, vB - vD);\n\tCdot += (m_JwA * wA - m_JwC * wC) + (m_JwB * wB - m_JwD * wD);\n\n\tfloat32 impulse = -m_mass * Cdot;\n\tm_impulse += impulse;\n\n\tvA += (m_mA * impulse) * m_JvAC;\n\twA += m_iA * impulse * m_JwA;\n\tvB += (m_mB * impulse) * m_JvBD;\n\twB += m_iB * impulse * m_JwB;\n\tvC -= (m_mC * impulse) * m_JvAC;\n\twC -= m_iC * impulse * m_JwC;\n\tvD -= (m_mD * impulse) * m_JvBD;\n\twD -= m_iD * impulse * m_JwD;\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n\tdata.velocities[m_indexC].v = vC;\n\tdata.velocities[m_indexC].w = wC;\n\tdata.velocities[m_indexD].v = vD;\n\tdata.velocities[m_indexD].w = wD;\n}\n\nbool b2GearJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 cC = data.positions[m_indexC].c;\n\tfloat32 aC = data.positions[m_indexC].a;\n\tb2Vec2 cD = data.positions[m_indexD].c;\n\tfloat32 aD = data.positions[m_indexD].a;\n\n\tb2Rot qA(aA), qB(aB), qC(aC), qD(aD);\n\n\tfloat32 linearError = 0.0f;\n\n\tfloat32 coordinateA, coordinateB;\n\n\tb2Vec2 JvAC, JvBD;\n\tfloat32 JwA, JwB, JwC, JwD;\n\tfloat32 mass = 0.0f;\n\n\tif (m_typeA == e_revoluteJoint)\n\t{\n\t\tJvAC.SetZero();\n\t\tJwA = 1.0f;\n\t\tJwC = 1.0f;\n\t\tmass += m_iA + m_iC;\n\n\t\tcoordinateA = aA - aC - m_referenceAngleA;\n\t}\n\telse\n\t{\n\t\tb2Vec2 u = b2Mul(qC, m_localAxisC);\n\t\tb2Vec2 rC = b2Mul(qC, m_localAnchorC - m_lcC);\n\t\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_lcA);\n\t\tJvAC = u;\n\t\tJwC = b2Cross(rC, u);\n\t\tJwA = b2Cross(rA, u);\n\t\tmass += m_mC + m_mA + m_iC * JwC * JwC + m_iA * JwA * JwA;\n\n\t\tb2Vec2 pC = m_localAnchorC - m_lcC;\n\t\tb2Vec2 pA = b2MulT(qC, rA + (cA - cC));\n\t\tcoordinateA = b2Dot(pA - pC, m_localAxisC);\n\t}\n\n\tif (m_typeB == e_revoluteJoint)\n\t{\n\t\tJvBD.SetZero();\n\t\tJwB = m_ratio;\n\t\tJwD = m_ratio;\n\t\tmass += m_ratio * m_ratio * (m_iB + m_iD);\n\n\t\tcoordinateB = aB - aD - m_referenceAngleB;\n\t}\n\telse\n\t{\n\t\tb2Vec2 u = b2Mul(qD, m_localAxisD);\n\t\tb2Vec2 rD = b2Mul(qD, m_localAnchorD - m_lcD);\n\t\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_lcB);\n\t\tJvBD = m_ratio * u;\n\t\tJwD = m_ratio * b2Cross(rD, u);\n\t\tJwB = m_ratio * b2Cross(rB, u);\n\t\tmass += m_ratio * m_ratio * (m_mD + m_mB) + m_iD * JwD * JwD + m_iB * JwB * JwB;\n\n\t\tb2Vec2 pD = m_localAnchorD - m_lcD;\n\t\tb2Vec2 pB = b2MulT(qD, rB + (cB - cD));\n\t\tcoordinateB = b2Dot(pB - pD, m_localAxisD);\n\t}\n\n\tfloat32 C = (coordinateA + m_ratio * coordinateB) - m_constant;\n\n\tfloat32 impulse = 0.0f;\n\tif (mass > 0.0f)\n\t{\n\t\timpulse = -C / mass;\n\t}\n\n\tcA += m_mA * impulse * JvAC;\n\taA += m_iA * impulse * JwA;\n\tcB += m_mB * impulse * JvBD;\n\taB += m_iB * impulse * JwB;\n\tcC -= m_mC * impulse * JvAC;\n\taC -= m_iC * impulse * JwC;\n\tcD -= m_mD * impulse * JvBD;\n\taD -= m_iD * impulse * JwD;\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\tdata.positions[m_indexC].c = cC;\n\tdata.positions[m_indexC].a = aC;\n\tdata.positions[m_indexD].c = cD;\n\tdata.positions[m_indexD].a = aD;\n\n\t// TODO_ERIN not implemented\n\treturn linearError < b2_linearSlop;\n}\n\nb2Vec2 b2GearJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2GearJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2GearJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 P = m_impulse * m_JvAC;\n\treturn inv_dt * P;\n}\n\nfloat32 b2GearJoint::GetReactionTorque(float32 inv_dt) const\n{\n\tfloat32 L = m_impulse * m_JwA;\n\treturn inv_dt * L;\n}\n\nvoid b2GearJoint::SetRatio(float32 ratio)\n{\n\tb2Assert(b2IsValid(ratio));\n\tm_ratio = ratio;\n}\n\nfloat32 b2GearJoint::GetRatio() const\n{\n\treturn m_ratio;\n}\n\nvoid b2GearJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tint32 index1 = m_joint1->m_index;\n\tint32 index2 = m_joint2->m_index;\n\n\tb2Log(\" b2GearJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.joint1 = joints[%d];\\n\", index1);\n\tb2Log(\" jd.joint2 = joints[%d];\\n\", index2);\n\tb2Log(\" jd.ratio = %.15lef;\\n\", m_ratio);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2Island.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Distance.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Island.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ContactSolver.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2Joint.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2StackAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Timer.h\"\n\n/*\nPosition Correction Notes\n=========================\nI tried the several algorithms for position correction of the 2D revolute joint.\nI looked at these systems:\n- simple pendulum (1m diameter sphere on massless 5m stick) with initial angular velocity of 100 rad/s.\n- suspension bridge with 30 1m long planks of length 1m.\n- multi-link chain with 30 1m long links.\n\nHere are the algorithms:\n\nBaumgarte - A fraction of the position error is added to the velocity error. There is no\nseparate position solver.\n\nPseudo Velocities - After the velocity solver and position integration,\nthe position error, Jacobian, and effective mass are recomputed. Then\nthe velocity constraints are solved with pseudo velocities and a fraction\nof the position error is added to the pseudo velocity error. The pseudo\nvelocities are initialized to zero and there is no warm-starting. After\nthe position solver, the pseudo velocities are added to the positions.\nThis is also called the First Order World method or the Position LCP method.\n\nModified Nonlinear Gauss-Seidel (NGS) - Like Pseudo Velocities except the\nposition error is re-computed for each constraint and the positions are updated\nafter the constraint is solved. The radius vectors (aka Jacobians) are\nre-computed too (otherwise the algorithm has horrible instability). The pseudo\nvelocity states are not needed because they are effectively zero at the beginning\nof each iteration. Since we have the current position error, we allow the\niterations to terminate early if the error becomes smaller than b2_linearSlop.\n\nFull NGS or just NGS - Like Modified NGS except the effective mass are re-computed\neach time a constraint is solved.\n\nHere are the results:\nBaumgarte - this is the cheapest algorithm but it has some stability problems,\nespecially with the bridge. The chain links separate easily close to the root\nand they jitter as they struggle to pull together. This is one of the most common\nmethods in the field. The big drawback is that the position correction artificially\naffects the momentum, thus leading to instabilities and false bounce. I used a\nbias factor of 0.2. A larger bias factor makes the bridge less stable, a smaller\nfactor makes joints and contacts more spongy.\n\nPseudo Velocities - the is more stable than the Baumgarte method. The bridge is\nstable. However, joints still separate with large angular velocities. Drag the\nsimple pendulum in a circle quickly and the joint will separate. The chain separates\neasily and does not recover. I used a bias factor of 0.2. A larger value lead to\nthe bridge collapsing when a heavy cube drops on it.\n\nModified NGS - this algorithm is better in some ways than Baumgarte and Pseudo\nVelocities, but in other ways it is worse. The bridge and chain are much more\nstable, but the simple pendulum goes unstable at high angular velocities.\n\nFull NGS - stable in all tests. The joints display good stiffness. The bridge\nstill sags, but this is better than infinite forces.\n\nRecommendations\nPseudo Velocities are not really worthwhile because the bridge and chain cannot\nrecover from joint separation. In other cases the benefit over Baumgarte is small.\n\nModified NGS is not a robust method for the revolute joint due to the violent\ninstability seen in the simple pendulum. Perhaps it is viable with other constraint\ntypes, especially scalar constraints where the effective mass is a scalar.\n\nThis leaves Baumgarte and Full NGS. Baumgarte has small, but manageable instabilities\nand is very fast. I don't think we can escape Baumgarte, especially in highly\ndemanding cases where high constraint fidelity is not needed.\n\nFull NGS is robust and easy on the eyes. I recommend this as an option for\nhigher fidelity simulation and certainly for suspension bridges and long chains.\nFull NGS might be a good choice for ragdolls, especially motorized ragdolls where\njoint separation can be problematic. The number of NGS iterations can be reduced\nfor better performance without harming robustness much.\n\nEach joint in a can be handled differently in the position solver. So I recommend\na system where the user can select the algorithm on a per joint basis. I would\nprobably default to the slower Full NGS and let the user select the faster\nBaumgarte method in performance critical scenarios.\n*/\n\n/*\nCache Performance\n\nThe Box2D solvers are dominated by cache misses. Data structures are designed\nto increase the number of cache hits. Much of misses are due to random access\nto body data. The constraint structures are iterated over linearly, which leads\nto few cache misses.\n\nThe bodies are not accessed during iteration. Instead read only data, such as\nthe mass values are stored with the constraints. The mutable data are the constraint\nimpulses and the bodies velocities/positions. The impulses are held inside the\nconstraint structures. The body velocities/positions are held in compact, temporary\narrays to increase the number of cache hits. Linear and angular velocity are\nstored in a single array since multiple arrays lead to multiple misses.\n*/\n\n/*\n2D Rotation\n\nR = [cos(theta) -sin(theta)]\n [sin(theta) cos(theta) ]\n\nthetaDot = omega\n\nLet q1 = cos(theta), q2 = sin(theta).\nR = [q1 -q2]\n [q2 q1]\n\nq1Dot = -thetaDot * q2\nq2Dot = thetaDot * q1\n\nq1_new = q1_old - dt * w * q2\nq2_new = q2_old + dt * w * q1\nthen normalize.\n\nThis might be faster than computing sin+cos.\nHowever, we can compute sin+cos of the same angle fast.\n*/\n\nb2Island::b2Island(\n\tint32 bodyCapacity,\n\tint32 contactCapacity,\n\tint32 jointCapacity,\n\tb2StackAllocator* allocator,\n\tb2ContactListener* listener)\n{\n\tm_bodyCapacity = bodyCapacity;\n\tm_contactCapacity = contactCapacity;\n\tm_jointCapacity\t = jointCapacity;\n\tm_bodyCount = 0;\n\tm_contactCount = 0;\n\tm_jointCount = 0;\n\n\tm_allocator = allocator;\n\tm_listener = listener;\n\n\tm_bodies = (b2Body**)m_allocator->Allocate(bodyCapacity * sizeof(b2Body*));\n\tm_contacts = (b2Contact**)m_allocator->Allocate(contactCapacity\t * sizeof(b2Contact*));\n\tm_joints = (b2Joint**)m_allocator->Allocate(jointCapacity * sizeof(b2Joint*));\n\n\tm_velocities = (b2Velocity*)m_allocator->Allocate(m_bodyCapacity * sizeof(b2Velocity));\n\tm_positions = (b2Position*)m_allocator->Allocate(m_bodyCapacity * sizeof(b2Position));\n}\n\nb2Island::~b2Island()\n{\n\t// Warning: the order should reverse the constructor order.\n\tm_allocator->Free(m_positions);\n\tm_allocator->Free(m_velocities);\n\tm_allocator->Free(m_joints);\n\tm_allocator->Free(m_contacts);\n\tm_allocator->Free(m_bodies);\n}\n\nvoid b2Island::Solve(b2Profile* profile, const b2TimeStep& step, const b2Vec2& gravity, bool allowSleep)\n{\n\tb2Timer timer;\n\n\tfloat32 h = step.dt;\n\n\t// Integrate velocities and apply damping. Initialize the body state.\n\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t{\n\t\tb2Body* b = m_bodies[i];\n\n\t\tb2Vec2 c = b->m_sweep.c;\n\t\tfloat32 a = b->m_sweep.a;\n\t\tb2Vec2 v = b->m_linearVelocity;\n\t\tfloat32 w = b->m_angularVelocity;\n\n\t\t// Store positions for continuous collision.\n\t\tb->m_sweep.c0 = b->m_sweep.c;\n\t\tb->m_sweep.a0 = b->m_sweep.a;\n\n\t\tif (b->m_type == b2_dynamicBody)\n\t\t{\n\t\t\t// Integrate velocities.\n\t\t\tv += h * (b->m_gravityScale * gravity + b->m_invMass * b->m_force);\n\t\t\tw += h * b->m_invI * b->m_torque;\n\n\t\t\t// Apply damping.\n\t\t\t// ODE: dv/dt + c * v = 0\n\t\t\t// Solution: v(t) = v0 * exp(-c * t)\n\t\t\t// Time step: v(t + dt) = v0 * exp(-c * (t + dt)) = v0 * exp(-c * t) * exp(-c * dt) = v * exp(-c * dt)\n\t\t\t// v2 = exp(-c * dt) * v1\n\t\t\t// Pade approximation:\n\t\t\t// v2 = v1 * 1 / (1 + c * dt)\n\t\t\tv *= 1.0f / (1.0f + h * b->m_linearDamping);\n\t\t\tw *= 1.0f / (1.0f + h * b->m_angularDamping);\n\t\t}\n\n\t\tm_positions[i].c = c;\n\t\tm_positions[i].a = a;\n\t\tm_velocities[i].v = v;\n\t\tm_velocities[i].w = w;\n\t}\n\n\ttimer.Reset();\n\n\t// Solver data\n\tb2SolverData solverData;\n\tsolverData.step = step;\n\tsolverData.positions = m_positions;\n\tsolverData.velocities = m_velocities;\n\n\t// Initialize velocity constraints.\n\tb2ContactSolverDef contactSolverDef;\n\tcontactSolverDef.step = step;\n\tcontactSolverDef.contacts = m_contacts;\n\tcontactSolverDef.count = m_contactCount;\n\tcontactSolverDef.positions = m_positions;\n\tcontactSolverDef.velocities = m_velocities;\n\tcontactSolverDef.allocator = m_allocator;\n\n\tb2ContactSolver contactSolver(&contactSolverDef);\n\tcontactSolver.InitializeVelocityConstraints();\n\n\tif (step.warmStarting)\n\t{\n\t\tcontactSolver.WarmStart();\n\t}\n\n\tfor (int32 i = 0; i < m_jointCount; ++i)\n\t{\n\t\tm_joints[i]->InitVelocityConstraints(solverData);\n\t}\n\n\tprofile->solveInit = timer.GetMilliseconds();\n\n\t// Solve velocity constraints\n\ttimer.Reset();\n\tfor (int32 i = 0; i < step.velocityIterations; ++i)\n\t{\n\t\tfor (int32 j = 0; j < m_jointCount; ++j)\n\t\t{\n\t\t\tm_joints[j]->SolveVelocityConstraints(solverData);\n\t\t}\n\n\t\tcontactSolver.SolveVelocityConstraints();\n\t}\n\n\t// Store impulses for warm starting\n\tcontactSolver.StoreImpulses();\n\tprofile->solveVelocity = timer.GetMilliseconds();\n\n\t// Integrate positions\n\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t{\n\t\tb2Vec2 c = m_positions[i].c;\n\t\tfloat32 a = m_positions[i].a;\n\t\tb2Vec2 v = m_velocities[i].v;\n\t\tfloat32 w = m_velocities[i].w;\n\n\t\t// Check for large velocities\n\t\tb2Vec2 translation = h * v;\n\t\tif (b2Dot(translation, translation) > b2_maxTranslationSquared)\n\t\t{\n\t\t\tfloat32 ratio = b2_maxTranslation / translation.Length();\n\t\t\tv *= ratio;\n\t\t}\n\n\t\tfloat32 rotation = h * w;\n\t\tif (rotation * rotation > b2_maxRotationSquared)\n\t\t{\n\t\t\tfloat32 ratio = b2_maxRotation / b2Abs(rotation);\n\t\t\tw *= ratio;\n\t\t}\n\n\t\t// Integrate\n\t\tc += h * v;\n\t\ta += h * w;\n\n\t\tm_positions[i].c = c;\n\t\tm_positions[i].a = a;\n\t\tm_velocities[i].v = v;\n\t\tm_velocities[i].w = w;\n\t}\n\n\t// Solve position constraints\n\ttimer.Reset();\n\tbool positionSolved = false;\n\tfor (int32 i = 0; i < step.positionIterations; ++i)\n\t{\n\t\tbool contactsOkay = contactSolver.SolvePositionConstraints();\n\n\t\tbool jointsOkay = true;\n\t\tfor (int32 i = 0; i < m_jointCount; ++i)\n\t\t{\n\t\t\tbool jointOkay = m_joints[i]->SolvePositionConstraints(solverData);\n\t\t\tjointsOkay = jointsOkay && jointOkay;\n\t\t}\n\n\t\tif (contactsOkay && jointsOkay)\n\t\t{\n\t\t\t// Exit early if the position errors are small.\n\t\t\tpositionSolved = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t// Copy state buffers back to the bodies\n\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t{\n\t\tb2Body* body = m_bodies[i];\n\t\tbody->m_sweep.c = m_positions[i].c;\n\t\tbody->m_sweep.a = m_positions[i].a;\n\t\tbody->m_linearVelocity = m_velocities[i].v;\n\t\tbody->m_angularVelocity = m_velocities[i].w;\n\t\tbody->SynchronizeTransform();\n\t}\n\n\tprofile->solvePosition = timer.GetMilliseconds();\n\n\tReport(contactSolver.m_velocityConstraints);\n\n\tif (allowSleep)\n\t{\n\t\tfloat32 minSleepTime = b2_maxFloat;\n\n\t\tconst float32 linTolSqr = b2_linearSleepTolerance * b2_linearSleepTolerance;\n\t\tconst float32 angTolSqr = b2_angularSleepTolerance * b2_angularSleepTolerance;\n\n\t\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t\t{\n\t\t\tb2Body* b = m_bodies[i];\n\t\t\tif (b->GetType() == b2_staticBody)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((b->m_flags & b2Body::e_autoSleepFlag) == 0 ||\n\t\t\t\tb->m_angularVelocity * b->m_angularVelocity > angTolSqr ||\n\t\t\t\tb2Dot(b->m_linearVelocity, b->m_linearVelocity) > linTolSqr)\n\t\t\t{\n\t\t\t\tb->m_sleepTime = 0.0f;\n\t\t\t\tminSleepTime = 0.0f;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb->m_sleepTime += h;\n\t\t\t\tminSleepTime = b2Min(minSleepTime, b->m_sleepTime);\n\t\t\t}\n\t\t}\n\n\t\tif (minSleepTime >= b2_timeToSleep && positionSolved)\n\t\t{\n\t\t\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t\t\t{\n\t\t\t\tb2Body* b = m_bodies[i];\n\t\t\t\tb->SetAwake(false);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid b2Island::SolveTOI(const b2TimeStep& subStep, int32 toiIndexA, int32 toiIndexB)\n{\n\tb2Assert(toiIndexA < m_bodyCount);\n\tb2Assert(toiIndexB < m_bodyCount);\n\n\t// Initialize the body state.\n\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t{\n\t\tb2Body* b = m_bodies[i];\n\t\tm_positions[i].c = b->m_sweep.c;\n\t\tm_positions[i].a = b->m_sweep.a;\n\t\tm_velocities[i].v = b->m_linearVelocity;\n\t\tm_velocities[i].w = b->m_angularVelocity;\n\t}\n\n\tb2ContactSolverDef contactSolverDef;\n\tcontactSolverDef.contacts = m_contacts;\n\tcontactSolverDef.count = m_contactCount;\n\tcontactSolverDef.allocator = m_allocator;\n\tcontactSolverDef.step = subStep;\n\tcontactSolverDef.positions = m_positions;\n\tcontactSolverDef.velocities = m_velocities;\n\tb2ContactSolver contactSolver(&contactSolverDef);\n\n\t// Solve position constraints.\n\tfor (int32 i = 0; i < subStep.positionIterations; ++i)\n\t{\n\t\tbool contactsOkay = contactSolver.SolveTOIPositionConstraints(toiIndexA, toiIndexB);\n\t\tif (contactsOkay)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\n#if 0\n\t// Is the new position really safe?\n\tfor (int32 i = 0; i < m_contactCount; ++i)\n\t{\n\t\tb2Contact* c = m_contacts[i];\n\t\tb2Fixture* fA = c->GetFixtureA();\n\t\tb2Fixture* fB = c->GetFixtureB();\n\n\t\tb2Body* bA = fA->GetBody();\n\t\tb2Body* bB = fB->GetBody();\n\n\t\tint32 indexA = c->GetChildIndexA();\n\t\tint32 indexB = c->GetChildIndexB();\n\n\t\tb2DistanceInput input;\n\t\tinput.proxyA.Set(fA->GetShape(), indexA);\n\t\tinput.proxyB.Set(fB->GetShape(), indexB);\n\t\tinput.transformA = bA->GetTransform();\n\t\tinput.transformB = bB->GetTransform();\n\t\tinput.useRadii = false;\n\n\t\tb2DistanceOutput output;\n\t\tb2SimplexCache cache;\n\t\tcache.count = 0;\n\t\tb2Distance(&output, &cache, &input);\n\n\t\tif (output.distance == 0 || cache.count == 3)\n\t\t{\n\t\t\tcache.count += 0;\n\t\t}\n\t}\n#endif\n\n\t// Leap of faith to new safe state.\n\tm_bodies[toiIndexA]->m_sweep.c0 = m_positions[toiIndexA].c;\n\tm_bodies[toiIndexA]->m_sweep.a0 = m_positions[toiIndexA].a;\n\tm_bodies[toiIndexB]->m_sweep.c0 = m_positions[toiIndexB].c;\n\tm_bodies[toiIndexB]->m_sweep.a0 = m_positions[toiIndexB].a;\n\n\t// No warm starting is needed for TOI events because warm\n\t// starting impulses were applied in the discrete solver.\n\tcontactSolver.InitializeVelocityConstraints();\n\n\t// Solve velocity constraints.\n\tfor (int32 i = 0; i < subStep.velocityIterations; ++i)\n\t{\n\t\tcontactSolver.SolveVelocityConstraints();\n\t}\n\n\t// Don't store the TOI contact forces for warm starting\n\t// because they can be quite large.\n\n\tfloat32 h = subStep.dt;\n\n\t// Integrate positions\n\tfor (int32 i = 0; i < m_bodyCount; ++i)\n\t{\n\t\tb2Vec2 c = m_positions[i].c;\n\t\tfloat32 a = m_positions[i].a;\n\t\tb2Vec2 v = m_velocities[i].v;\n\t\tfloat32 w = m_velocities[i].w;\n\n\t\t// Check for large velocities\n\t\tb2Vec2 translation = h * v;\n\t\tif (b2Dot(translation, translation) > b2_maxTranslationSquared)\n\t\t{\n\t\t\tfloat32 ratio = b2_maxTranslation / translation.Length();\n\t\t\tv *= ratio;\n\t\t}\n\n\t\tfloat32 rotation = h * w;\n\t\tif (rotation * rotation > b2_maxRotationSquared)\n\t\t{\n\t\t\tfloat32 ratio = b2_maxRotation / b2Abs(rotation);\n\t\t\tw *= ratio;\n\t\t}\n\n\t\t// Integrate\n\t\tc += h * v;\n\t\ta += h * w;\n\n\t\tm_positions[i].c = c;\n\t\tm_positions[i].a = a;\n\t\tm_velocities[i].v = v;\n\t\tm_velocities[i].w = w;\n\n\t\t// Sync bodies\n\t\tb2Body* body = m_bodies[i];\n\t\tbody->m_sweep.c = c;\n\t\tbody->m_sweep.a = a;\n\t\tbody->m_linearVelocity = v;\n\t\tbody->m_angularVelocity = w;\n\t\tbody->SynchronizeTransform();\n\t}\n\n\tReport(contactSolver.m_velocityConstraints);\n}\n\nvoid b2Island::Report(const b2ContactVelocityConstraint* constraints)\n{\n\tif (m_listener == NULL)\n\t{\n\t\treturn;\n\t}\n\n\tfor (int32 i = 0; i < m_contactCount; ++i)\n\t{\n\t\tb2Contact* c = m_contacts[i];\n\n\t\tconst b2ContactVelocityConstraint* vc = constraints + i;\n\n\t\tb2ContactImpulse impulse;\n\t\timpulse.count = vc->pointCount;\n\t\tfor (int32 j = 0; j < vc->pointCount; ++j)\n\t\t{\n\t\t\timpulse.normalImpulses[j] = vc->points[j].normalImpulse;\n\t\t\timpulse.tangentImpulses[j] = vc->points[j].tangentImpulse;\n\t\t}\n\n\t\tm_listener->PostSolve(c, &impulse);\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2Joint.cpp",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2Joint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2DistanceJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2WheelJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2MouseJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2RevoluteJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PrismaticJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PulleyJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2GearJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2WeldJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2FrictionJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2RopeJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2MotorJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n\n#include \n\nb2Joint* b2Joint::Create(const b2JointDef* def, b2BlockAllocator* allocator)\n{\n\tb2Joint* joint = NULL;\n\n\tswitch (def->type)\n\t{\n\tcase e_distanceJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2DistanceJoint));\n\t\t\tjoint = new (mem) b2DistanceJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_mouseJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2MouseJoint));\n\t\t\tjoint = new (mem) b2MouseJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_prismaticJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2PrismaticJoint));\n\t\t\tjoint = new (mem) b2PrismaticJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_revoluteJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2RevoluteJoint));\n\t\t\tjoint = new (mem) b2RevoluteJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_pulleyJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2PulleyJoint));\n\t\t\tjoint = new (mem) b2PulleyJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_gearJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2GearJoint));\n\t\t\tjoint = new (mem) b2GearJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_wheelJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2WheelJoint));\n\t\t\tjoint = new (mem) b2WheelJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_weldJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2WeldJoint));\n\t\t\tjoint = new (mem) b2WeldJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_frictionJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2FrictionJoint));\n\t\t\tjoint = new (mem) b2FrictionJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_ropeJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2RopeJoint));\n\t\t\tjoint = new (mem) b2RopeJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tcase e_motorJoint:\n\t\t{\n\t\t\tvoid* mem = allocator->Allocate(sizeof(b2MotorJoint));\n\t\t\tjoint = new (mem) b2MotorJoint(static_cast(def));\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\tb2Assert(false);\n\t\tbreak;\n\t}\n\n\treturn joint;\n}\n\nvoid b2Joint::Destroy(b2Joint* joint, b2BlockAllocator* allocator)\n{\n\tjoint->~b2Joint();\n\tswitch (joint->m_type)\n\t{\n\tcase e_distanceJoint:\n\t\tallocator->Free(joint, sizeof(b2DistanceJoint));\n\t\tbreak;\n\n\tcase e_mouseJoint:\n\t\tallocator->Free(joint, sizeof(b2MouseJoint));\n\t\tbreak;\n\n\tcase e_prismaticJoint:\n\t\tallocator->Free(joint, sizeof(b2PrismaticJoint));\n\t\tbreak;\n\n\tcase e_revoluteJoint:\n\t\tallocator->Free(joint, sizeof(b2RevoluteJoint));\n\t\tbreak;\n\n\tcase e_pulleyJoint:\n\t\tallocator->Free(joint, sizeof(b2PulleyJoint));\n\t\tbreak;\n\n\tcase e_gearJoint:\n\t\tallocator->Free(joint, sizeof(b2GearJoint));\n\t\tbreak;\n\n\tcase e_wheelJoint:\n\t\tallocator->Free(joint, sizeof(b2WheelJoint));\n\t\tbreak;\n\n\tcase e_weldJoint:\n\t\tallocator->Free(joint, sizeof(b2WeldJoint));\n\t\tbreak;\n\n\tcase e_frictionJoint:\n\t\tallocator->Free(joint, sizeof(b2FrictionJoint));\n\t\tbreak;\n\n\tcase e_ropeJoint:\n\t\tallocator->Free(joint, sizeof(b2RopeJoint));\n\t\tbreak;\n\n\tcase e_motorJoint:\n\t\tallocator->Free(joint, sizeof(b2MotorJoint));\n\t\tbreak;\n\n\tdefault:\n\t\tb2Assert(false);\n\t\tbreak;\n\t}\n}\n\nb2Joint::b2Joint(const b2JointDef* def)\n{\n\tb2Assert(def->bodyA != def->bodyB);\n\n\tm_type = def->type;\n\tm_prev = NULL;\n\tm_next = NULL;\n\tm_bodyA = def->bodyA;\n\tm_bodyB = def->bodyB;\n\tm_index = 0;\n\tm_collideConnected = def->collideConnected;\n\tm_islandFlag = false;\n\tm_userData = def->userData;\n\n\tm_edgeA.joint = NULL;\n\tm_edgeA.other = NULL;\n\tm_edgeA.prev = NULL;\n\tm_edgeA.next = NULL;\n\n\tm_edgeB.joint = NULL;\n\tm_edgeB.other = NULL;\n\tm_edgeB.prev = NULL;\n\tm_edgeB.next = NULL;\n}\n\nbool b2Joint::IsActive() const\n{\n\treturn m_bodyA->IsActive() && m_bodyB->IsActive();\n}\n"
},
{
"path": "app/src/main/cpp/b2Math.cpp",
"content": "/*\n* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2Math.h\"\n\nconst b2Vec2 b2Vec2_zero(0.0f, 0.0f);\n\n/// Solve A * x = b, where b is a column vector. This is more efficient\n/// than computing the inverse in one-shot cases.\nb2Vec3 b2Mat33::Solve33(const b2Vec3& b) const\n{\n\tfloat32 det = b2Dot(ex, b2Cross(ey, ez));\n\tif (det != 0.0f)\n\t{\n\t\tdet = 1.0f / det;\n\t}\n\tb2Vec3 x;\n\tx.x = det * b2Dot(b, b2Cross(ey, ez));\n\tx.y = det * b2Dot(ex, b2Cross(b, ez));\n\tx.z = det * b2Dot(ex, b2Cross(ey, b));\n\treturn x;\n}\n\n/// Solve A * x = b, where b is a column vector. This is more efficient\n/// than computing the inverse in one-shot cases.\nb2Vec2 b2Mat33::Solve22(const b2Vec2& b) const\n{\n\tfloat32 a11 = ex.x, a12 = ey.x, a21 = ex.y, a22 = ey.y;\n\tfloat32 det = a11 * a22 - a12 * a21;\n\tif (det != 0.0f)\n\t{\n\t\tdet = 1.0f / det;\n\t}\n\tb2Vec2 x;\n\tx.x = det * (a22 * b.x - a12 * b.y);\n\tx.y = det * (a11 * b.y - a21 * b.x);\n\treturn x;\n}\n\n///\nvoid b2Mat33::GetInverse22(b2Mat33* M) const\n{\n\tfloat32 a = ex.x, b = ey.x, c = ex.y, d = ey.y;\n\tfloat32 det = a * d - b * c;\n\tif (det != 0.0f)\n\t{\n\t\tdet = 1.0f / det;\n\t}\n\n\tM->ex.x = det * d;\tM->ey.x = -det * b; M->ex.z = 0.0f;\n\tM->ex.y = -det * c;\tM->ey.y = det * a; M->ey.z = 0.0f;\n\tM->ez.x = 0.0f; M->ez.y = 0.0f; M->ez.z = 0.0f;\n}\n\n/// Returns the zero matrix if singular.\nvoid b2Mat33::GetSymInverse33(b2Mat33* M) const\n{\n\tfloat32 det = b2Dot(ex, b2Cross(ey, ez));\n\tif (det != 0.0f)\n\t{\n\t\tdet = 1.0f / det;\n\t}\n\n\tfloat32 a11 = ex.x, a12 = ey.x, a13 = ez.x;\n\tfloat32 a22 = ey.y, a23 = ez.y;\n\tfloat32 a33 = ez.z;\n\n\tM->ex.x = det * (a22 * a33 - a23 * a23);\n\tM->ex.y = det * (a13 * a23 - a12 * a33);\n\tM->ex.z = det * (a12 * a23 - a13 * a22);\n\n\tM->ey.x = M->ex.y;\n\tM->ey.y = det * (a11 * a33 - a13 * a13);\n\tM->ey.z = det * (a13 * a12 - a11 * a23);\n\n\tM->ez.x = M->ex.z;\n\tM->ez.y = M->ey.z;\n\tM->ez.z = det * (a11 * a22 - a12 * a12);\n}\n"
},
{
"path": "app/src/main/cpp/b2MotorJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2012 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2MotorJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Point-to-point constraint\n// Cdot = v2 - v1\n// = v2 + cross(w2, r2) - v1 - cross(w1, r1)\n// J = [-I -r1_skew I r2_skew ]\n// Identity used:\n// w k % (rx i + ry j) = w * (-ry i + rx j)\n\n// Angle constraint\n// Cdot = w2 - w1\n// J = [0 0 -1 0 0 1]\n// K = invI1 + invI2\n\nvoid b2MotorJointDef::Initialize(b2Body* bA, b2Body* bB)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tb2Vec2 xB = bodyB->GetPosition();\n\tlinearOffset = bodyA->GetLocalPoint(xB);\n\n\tfloat32 angleA = bodyA->GetAngle();\n\tfloat32 angleB = bodyB->GetAngle();\n\tangularOffset = angleB - angleA;\n}\n\nb2MotorJoint::b2MotorJoint(const b2MotorJointDef* def)\n: b2Joint(def)\n{\n\tm_linearOffset = def->linearOffset;\n\tm_angularOffset = def->angularOffset;\n\n\tm_linearImpulse.SetZero();\n\tm_angularImpulse = 0.0f;\n\n\tm_maxForce = def->maxForce;\n\tm_maxTorque = def->maxTorque;\n\tm_correctionFactor = def->correctionFactor;\n}\n\nvoid b2MotorJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\t// Compute the effective mass matrix.\n\tm_rA = b2Mul(qA, -m_localCenterA);\n\tm_rB = b2Mul(qB, -m_localCenterB);\n\n\t// J = [-I -r1_skew I r2_skew]\n\t// [ 0 -1 0 1]\n\t// r_skew = [-ry; rx]\n\n\t// Matlab\n\t// K = [ mA+r1y^2*iA+mB+r2y^2*iB, -r1y*iA*r1x-r2y*iB*r2x, -r1y*iA-r2y*iB]\n\t// [ -r1y*iA*r1x-r2y*iB*r2x, mA+r1x^2*iA+mB+r2x^2*iB, r1x*iA+r2x*iB]\n\t// [ -r1y*iA-r2y*iB, r1x*iA+r2x*iB, iA+iB]\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Mat22 K;\n\tK.ex.x = mA + mB + iA * m_rA.y * m_rA.y + iB * m_rB.y * m_rB.y;\n\tK.ex.y = -iA * m_rA.x * m_rA.y - iB * m_rB.x * m_rB.y;\n\tK.ey.x = K.ex.y;\n\tK.ey.y = mA + mB + iA * m_rA.x * m_rA.x + iB * m_rB.x * m_rB.x;\n\n\tm_linearMass = K.GetInverse();\n\n\tm_angularMass = iA + iB;\n\tif (m_angularMass > 0.0f)\n\t{\n\t\tm_angularMass = 1.0f / m_angularMass;\n\t}\n\n\tm_linearError = cB + m_rB - cA - m_rA - b2Mul(qA, m_linearOffset);\n\tm_angularError = aB - aA - m_angularOffset;\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale impulses to support a variable time step.\n\t\tm_linearImpulse *= data.step.dtRatio;\n\t\tm_angularImpulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P(m_linearImpulse.x, m_linearImpulse.y);\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + m_angularImpulse);\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + m_angularImpulse);\n\t}\n\telse\n\t{\n\t\tm_linearImpulse.SetZero();\n\t\tm_angularImpulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2MotorJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tfloat32 h = data.step.dt;\n\tfloat32 inv_h = data.step.inv_dt;\n\n\t// Solve angular friction\n\t{\n\t\tfloat32 Cdot = wB - wA + inv_h * m_correctionFactor * m_angularError;\n\t\tfloat32 impulse = -m_angularMass * Cdot;\n\n\t\tfloat32 oldImpulse = m_angularImpulse;\n\t\tfloat32 maxImpulse = h * m_maxTorque;\n\t\tm_angularImpulse = b2Clamp(m_angularImpulse + impulse, -maxImpulse, maxImpulse);\n\t\timpulse = m_angularImpulse - oldImpulse;\n\n\t\twA -= iA * impulse;\n\t\twB += iB * impulse;\n\t}\n\n\t// Solve linear friction\n\t{\n\t\tb2Vec2 Cdot = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA) + inv_h * m_correctionFactor * m_linearError;\n\n\t\tb2Vec2 impulse = -b2Mul(m_linearMass, Cdot);\n\t\tb2Vec2 oldImpulse = m_linearImpulse;\n\t\tm_linearImpulse += impulse;\n\n\t\tfloat32 maxImpulse = h * m_maxForce;\n\n\t\tif (m_linearImpulse.LengthSquared() > maxImpulse * maxImpulse)\n\t\t{\n\t\t\tm_linearImpulse.Normalize();\n\t\t\tm_linearImpulse *= maxImpulse;\n\t\t}\n\n\t\timpulse = m_linearImpulse - oldImpulse;\n\n\t\tvA -= mA * impulse;\n\t\twA -= iA * b2Cross(m_rA, impulse);\n\n\t\tvB += mB * impulse;\n\t\twB += iB * b2Cross(m_rB, impulse);\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2MotorJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tB2_NOT_USED(data);\n\n\treturn true;\n}\n\nb2Vec2 b2MotorJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetPosition();\n}\n\nb2Vec2 b2MotorJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetPosition();\n}\n\nb2Vec2 b2MotorJoint::GetReactionForce(float32 inv_dt) const\n{\n\treturn inv_dt * m_linearImpulse;\n}\n\nfloat32 b2MotorJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_angularImpulse;\n}\n\nvoid b2MotorJoint::SetMaxForce(float32 force)\n{\n\tb2Assert(b2IsValid(force) && force >= 0.0f);\n\tm_maxForce = force;\n}\n\nfloat32 b2MotorJoint::GetMaxForce() const\n{\n\treturn m_maxForce;\n}\n\nvoid b2MotorJoint::SetMaxTorque(float32 torque)\n{\n\tb2Assert(b2IsValid(torque) && torque >= 0.0f);\n\tm_maxTorque = torque;\n}\n\nfloat32 b2MotorJoint::GetMaxTorque() const\n{\n\treturn m_maxTorque;\n}\n\nvoid b2MotorJoint::SetCorrectionFactor(float32 factor)\n{\n\tb2Assert(b2IsValid(factor) && 0.0f <= factor && factor <= 1.0f);\n\tm_correctionFactor = factor;\n}\n\nfloat32 b2MotorJoint::GetCorrectionFactor() const\n{\n\treturn m_correctionFactor;\n}\n\nvoid b2MotorJoint::SetLinearOffset(const b2Vec2& linearOffset)\n{\n\tif (linearOffset.x != m_linearOffset.x || linearOffset.y != m_linearOffset.y)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_linearOffset = linearOffset;\n\t}\n}\n\nconst b2Vec2& b2MotorJoint::GetLinearOffset() const\n{\n\treturn m_linearOffset;\n}\n\nvoid b2MotorJoint::SetAngularOffset(float32 angularOffset)\n{\n\tif (angularOffset != m_angularOffset)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_angularOffset = angularOffset;\n\t}\n}\n\nfloat32 b2MotorJoint::GetAngularOffset() const\n{\n\treturn m_angularOffset;\n}\n\nvoid b2MotorJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2MotorJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.linearOffset.Set(%.15lef, %.15lef);\\n\", m_linearOffset.x, m_linearOffset.y);\n\tb2Log(\" jd.angularOffset = %.15lef;\\n\", m_angularOffset);\n\tb2Log(\" jd.maxForce = %.15lef;\\n\", m_maxForce);\n\tb2Log(\" jd.maxTorque = %.15lef;\\n\", m_maxTorque);\n\tb2Log(\" jd.correctionFactor = %.15lef;\\n\", m_correctionFactor);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2MouseJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2MouseJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// p = attached point, m = mouse point\n// C = p - m\n// Cdot = v\n// = v + cross(w, r)\n// J = [I r_skew]\n// Identity used:\n// w k % (rx i + ry j) = w * (-ry i + rx j)\n\nb2MouseJoint::b2MouseJoint(const b2MouseJointDef* def)\n: b2Joint(def)\n{\n\tb2Assert(def->target.IsValid());\n\tb2Assert(b2IsValid(def->maxForce) && def->maxForce >= 0.0f);\n\tb2Assert(b2IsValid(def->frequencyHz) && def->frequencyHz >= 0.0f);\n\tb2Assert(b2IsValid(def->dampingRatio) && def->dampingRatio >= 0.0f);\n\n\tm_targetA = def->target;\n\tm_localAnchorB = b2MulT(m_bodyB->GetTransform(), m_targetA);\n\n\tm_maxForce = def->maxForce;\n\tm_impulse.SetZero();\n\n\tm_frequencyHz = def->frequencyHz;\n\tm_dampingRatio = def->dampingRatio;\n\n\tm_beta = 0.0f;\n\tm_gamma = 0.0f;\n}\n\nvoid b2MouseJoint::SetTarget(const b2Vec2& target)\n{\n\tif (m_bodyB->IsAwake() == false)\n\t{\n\t\tm_bodyB->SetAwake(true);\n\t}\n\tm_targetA = target;\n}\n\nconst b2Vec2& b2MouseJoint::GetTarget() const\n{\n\treturn m_targetA;\n}\n\nvoid b2MouseJoint::SetMaxForce(float32 force)\n{\n\tm_maxForce = force;\n}\n\nfloat32 b2MouseJoint::GetMaxForce() const\n{\n\treturn m_maxForce;\n}\n\nvoid b2MouseJoint::SetFrequency(float32 hz)\n{\n\tm_frequencyHz = hz;\n}\n\nfloat32 b2MouseJoint::GetFrequency() const\n{\n\treturn m_frequencyHz;\n}\n\nvoid b2MouseJoint::SetDampingRatio(float32 ratio)\n{\n\tm_dampingRatio = ratio;\n}\n\nfloat32 b2MouseJoint::GetDampingRatio() const\n{\n\treturn m_dampingRatio;\n}\n\nvoid b2MouseJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qB(aB);\n\n\tfloat32 mass = m_bodyB->GetMass();\n\n\t// Frequency\n\tfloat32 omega = 2.0f * b2_pi * m_frequencyHz;\n\n\t// Damping coefficient\n\tfloat32 d = 2.0f * mass * m_dampingRatio * omega;\n\n\t// Spring stiffness\n\tfloat32 k = mass * (omega * omega);\n\n\t// magic formulas\n\t// gamma has units of inverse mass.\n\t// beta has units of inverse time.\n\tfloat32 h = data.step.dt;\n\tb2Assert(d + h * k > b2_epsilon);\n\tm_gamma = h * (d + h * k);\n\tif (m_gamma != 0.0f)\n\t{\n\t\tm_gamma = 1.0f / m_gamma;\n\t}\n\tm_beta = h * k * m_gamma;\n\n\t// Compute the effective mass matrix.\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// K = [(1/m1 + 1/m2) * eye(2) - skew(r1) * invI1 * skew(r1) - skew(r2) * invI2 * skew(r2)]\n\t// = [1/m1+1/m2 0 ] + invI1 * [r1.y*r1.y -r1.x*r1.y] + invI2 * [r1.y*r1.y -r1.x*r1.y]\n\t// [ 0 1/m1+1/m2] [-r1.x*r1.y r1.x*r1.x] [-r1.x*r1.y r1.x*r1.x]\n\tb2Mat22 K;\n\tK.ex.x = m_invMassB + m_invIB * m_rB.y * m_rB.y + m_gamma;\n\tK.ex.y = -m_invIB * m_rB.x * m_rB.y;\n\tK.ey.x = K.ex.y;\n\tK.ey.y = m_invMassB + m_invIB * m_rB.x * m_rB.x + m_gamma;\n\n\tm_mass = K.GetInverse();\n\n\tm_C = cB + m_rB - m_targetA;\n\tm_C *= m_beta;\n\n\t// Cheat with some damping\n\twB *= 0.98f;\n\n\tif (data.step.warmStarting)\n\t{\n\t\tm_impulse *= data.step.dtRatio;\n\t\tvB += m_invMassB * m_impulse;\n\t\twB += m_invIB * b2Cross(m_rB, m_impulse);\n\t}\n\telse\n\t{\n\t\tm_impulse.SetZero();\n\t}\n\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2MouseJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\t// Cdot = v + cross(w, r)\n\tb2Vec2 Cdot = vB + b2Cross(wB, m_rB);\n\tb2Vec2 impulse = b2Mul(m_mass, -(Cdot + m_C + m_gamma * m_impulse));\n\n\tb2Vec2 oldImpulse = m_impulse;\n\tm_impulse += impulse;\n\tfloat32 maxImpulse = data.step.dt * m_maxForce;\n\tif (m_impulse.LengthSquared() > maxImpulse * maxImpulse)\n\t{\n\t\tm_impulse *= maxImpulse / m_impulse.Length();\n\t}\n\timpulse = m_impulse - oldImpulse;\n\n\tvB += m_invMassB * impulse;\n\twB += m_invIB * b2Cross(m_rB, impulse);\n\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2MouseJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tB2_NOT_USED(data);\n\treturn true;\n}\n\nb2Vec2 b2MouseJoint::GetAnchorA() const\n{\n\treturn m_targetA;\n}\n\nb2Vec2 b2MouseJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2MouseJoint::GetReactionForce(float32 inv_dt) const\n{\n\treturn inv_dt * m_impulse;\n}\n\nfloat32 b2MouseJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * 0.0f;\n}\n\nvoid b2MouseJoint::ShiftOrigin(const b2Vec2& newOrigin)\n{\n\tm_targetA -= newOrigin;\n}\n"
},
{
"path": "app/src/main/cpp/b2PolygonAndCircleContact.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n\n#include \n\nb2Contact* b2PolygonAndCircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2PolygonAndCircleContact));\n\treturn new (mem) b2PolygonAndCircleContact(fixtureA, fixtureB);\n}\n\nvoid b2PolygonAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2PolygonAndCircleContact*)contact)->~b2PolygonAndCircleContact();\n\tallocator->Free(contact, sizeof(b2PolygonAndCircleContact));\n}\n\nb2PolygonAndCircleContact::b2PolygonAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)\n: b2Contact(fixtureA, 0, fixtureB, 0)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_polygon);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_circle);\n}\n\nvoid b2PolygonAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2CollidePolygonAndCircle(\tmanifold,\n\t\t\t\t\t\t\t\t(b2PolygonShape*)m_fixtureA->GetShape(), xfA,\n\t\t\t\t\t\t\t\t(b2CircleShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2PolygonContact.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonContact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2WorldCallbacks.h\"\n\n#include \n\nb2Contact* b2PolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2PolygonContact));\n\treturn new (mem) b2PolygonContact(fixtureA, fixtureB);\n}\n\nvoid b2PolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)\n{\n\t((b2PolygonContact*)contact)->~b2PolygonContact();\n\tallocator->Free(contact, sizeof(b2PolygonContact));\n}\n\nb2PolygonContact::b2PolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB)\n\t: b2Contact(fixtureA, 0, fixtureB, 0)\n{\n\tb2Assert(m_fixtureA->GetType() == b2Shape::e_polygon);\n\tb2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);\n}\n\nvoid b2PolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)\n{\n\tb2CollidePolygons(\tmanifold,\n\t\t\t\t\t\t(b2PolygonShape*)m_fixtureA->GetShape(), xfA,\n\t\t\t\t\t\t(b2PolygonShape*)m_fixtureB->GetShape(), xfB);\n}\n"
},
{
"path": "app/src/main/cpp/b2PolygonShape.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n#include \n\nb2Shape* b2PolygonShape::Clone(b2BlockAllocator* allocator) const\n{\n\tvoid* mem = allocator->Allocate(sizeof(b2PolygonShape));\n\tb2PolygonShape* clone = new (mem) b2PolygonShape;\n\t*clone = *this;\n\treturn clone;\n}\n\nvoid b2PolygonShape::SetAsBox(float32 hx, float32 hy)\n{\n\tm_count = 4;\n\tm_vertices[0].Set(-hx, -hy);\n\tm_vertices[1].Set( hx, -hy);\n\tm_vertices[2].Set( hx, hy);\n\tm_vertices[3].Set(-hx, hy);\n\tm_normals[0].Set(0.0f, -1.0f);\n\tm_normals[1].Set(1.0f, 0.0f);\n\tm_normals[2].Set(0.0f, 1.0f);\n\tm_normals[3].Set(-1.0f, 0.0f);\n\tm_centroid.SetZero();\n}\n\nvoid b2PolygonShape::SetAsBox(float32 hx, float32 hy, const b2Vec2& center, float32 angle)\n{\n\tm_count = 4;\n\tm_vertices[0].Set(-hx, -hy);\n\tm_vertices[1].Set( hx, -hy);\n\tm_vertices[2].Set( hx, hy);\n\tm_vertices[3].Set(-hx, hy);\n\tm_normals[0].Set(0.0f, -1.0f);\n\tm_normals[1].Set(1.0f, 0.0f);\n\tm_normals[2].Set(0.0f, 1.0f);\n\tm_normals[3].Set(-1.0f, 0.0f);\n\tm_centroid = center;\n\n\tb2Transform xf;\n\txf.p = center;\n\txf.q.Set(angle);\n\n\t// Transform vertices and normals.\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tm_vertices[i] = b2Mul(xf, m_vertices[i]);\n\t\tm_normals[i] = b2Mul(xf.q, m_normals[i]);\n\t}\n}\n\nint32 b2PolygonShape::GetChildCount() const\n{\n\treturn 1;\n}\n\nstatic b2Vec2 ComputeCentroid(const b2Vec2* vs, int32 count)\n{\n\tb2Assert(count >= 3);\n\n\tb2Vec2 c; c.Set(0.0f, 0.0f);\n\tfloat32 area = 0.0f;\n\n\t// pRef is the reference point for forming triangles.\n\t// It's location doesn't change the result (except for rounding error).\n\tb2Vec2 pRef(0.0f, 0.0f);\n#if 0\n\t// This code would put the reference point inside the polygon.\n\tfor (int32 i = 0; i < count; ++i)\n\t{\n\t\tpRef += vs[i];\n\t}\n\tpRef *= 1.0f / count;\n#endif\n\n\tconst float32 inv3 = 1.0f / 3.0f;\n\n\tfor (int32 i = 0; i < count; ++i)\n\t{\n\t\t// Triangle vertices.\n\t\tb2Vec2 p1 = pRef;\n\t\tb2Vec2 p2 = vs[i];\n\t\tb2Vec2 p3 = i + 1 < count ? vs[i+1] : vs[0];\n\n\t\tb2Vec2 e1 = p2 - p1;\n\t\tb2Vec2 e2 = p3 - p1;\n\n\t\tfloat32 D = b2Cross(e1, e2);\n\n\t\tfloat32 triangleArea = 0.5f * D;\n\t\tarea += triangleArea;\n\n\t\t// Area weighted centroid\n\t\tc += triangleArea * inv3 * (p1 + p2 + p3);\n\t}\n\n\t// Centroid\n\tb2Assert(area > b2_epsilon);\n\tc *= 1.0f / area;\n\treturn c;\n}\n\nvoid b2PolygonShape::Set(const b2Vec2* vertices, int32 count)\n{\n\tb2Assert(3 <= count && count <= b2_maxPolygonVertices);\n\tif (count < 3)\n\t{\n\t\tSetAsBox(1.0f, 1.0f);\n\t\treturn;\n\t}\n\n\tint32 n = b2Min(count, b2_maxPolygonVertices);\n\n\t// Perform welding and copy vertices into local buffer.\n\tb2Vec2 ps[b2_maxPolygonVertices];\n\tint32 tempCount = 0;\n\tfor (int32 i = 0; i < n; ++i)\n\t{\n\t\tb2Vec2 v = vertices[i];\n\n\t\tbool unique = true;\n\t\tfor (int32 j = 0; j < tempCount; ++j)\n\t\t{\n\t\t\tif (b2DistanceSquared(v, ps[j]) < 0.5f * b2_linearSlop)\n\t\t\t{\n\t\t\t\tunique = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (unique)\n\t\t{\n\t\t\tps[tempCount++] = v;\n\t\t}\n\t}\n\n\tn = tempCount;\n\tif (n < 3)\n\t{\n\t\t// Polygon is degenerate.\n\t\tb2Assert(false);\n\t\tSetAsBox(1.0f, 1.0f);\n\t\treturn;\n\t}\n\n\t// Create the convex hull using the Gift wrapping algorithm\n\t// http://en.wikipedia.org/wiki/Gift_wrapping_algorithm\n\n\t// Find the right most point on the hull\n\tint32 i0 = 0;\n\tfloat32 x0 = ps[0].x;\n\tfor (int32 i = 1; i < n; ++i)\n\t{\n\t\tfloat32 x = ps[i].x;\n\t\tif (x > x0 || (x == x0 && ps[i].y < ps[i0].y))\n\t\t{\n\t\t\ti0 = i;\n\t\t\tx0 = x;\n\t\t}\n\t}\n\n\tint32 hull[b2_maxPolygonVertices];\n\tint32 m = 0;\n\tint32 ih = i0;\n\n\tfor (;;)\n\t{\n\t\thull[m] = ih;\n\n\t\tint32 ie = 0;\n\t\tfor (int32 j = 1; j < n; ++j)\n\t\t{\n\t\t\tif (ie == ih)\n\t\t\t{\n\t\t\t\tie = j;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tb2Vec2 r = ps[ie] - ps[hull[m]];\n\t\t\tb2Vec2 v = ps[j] - ps[hull[m]];\n\t\t\tfloat32 c = b2Cross(r, v);\n\t\t\tif (c < 0.0f)\n\t\t\t{\n\t\t\t\tie = j;\n\t\t\t}\n\n\t\t\t// Collinearity check\n\t\t\tif (c == 0.0f && v.LengthSquared() > r.LengthSquared())\n\t\t\t{\n\t\t\t\tie = j;\n\t\t\t}\n\t\t}\n\n\t\t++m;\n\t\tih = ie;\n\n\t\tif (ie == i0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tm_count = m;\n\n\t// Copy vertices.\n\tfor (int32 i = 0; i < m; ++i)\n\t{\n\t\tm_vertices[i] = ps[hull[i]];\n\t}\n\n\t// Compute normals. Ensure the edges have non-zero length.\n\tfor (int32 i = 0; i < m; ++i)\n\t{\n\t\tint32 i1 = i;\n\t\tint32 i2 = i + 1 < m ? i + 1 : 0;\n\t\tb2Vec2 edge = m_vertices[i2] - m_vertices[i1];\n\t\tb2Assert(edge.LengthSquared() > b2_epsilon * b2_epsilon);\n\t\tm_normals[i] = b2Cross(edge, 1.0f);\n\t\tm_normals[i].Normalize();\n\t}\n\n\t// Compute the polygon centroid.\n\tm_centroid = ComputeCentroid(m_vertices, m);\n}\n\nbool b2PolygonShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const\n{\n\tb2Vec2 pLocal = b2MulT(xf.q, p - xf.p);\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tfloat32 dot = b2Dot(m_normals[i], pLocal - m_vertices[i]);\n\t\tif (dot > 0.0f)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool b2PolygonShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\t\t\t\tconst b2Transform& xf, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\t// Put the ray into the polygon's frame of reference.\n\tb2Vec2 p1 = b2MulT(xf.q, input.p1 - xf.p);\n\tb2Vec2 p2 = b2MulT(xf.q, input.p2 - xf.p);\n\tb2Vec2 d = p2 - p1;\n\n\tfloat32 lower = 0.0f, upper = input.maxFraction;\n\n\tint32 index = -1;\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\t// p = p1 + a * d\n\t\t// dot(normal, p - v) = 0\n\t\t// dot(normal, p1 - v) + a * dot(normal, d) = 0\n\t\tfloat32 numerator = b2Dot(m_normals[i], m_vertices[i] - p1);\n\t\tfloat32 denominator = b2Dot(m_normals[i], d);\n\n\t\tif (denominator == 0.0f)\n\t\t{\n\t\t\tif (numerator < 0.0f)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Note: we want this predicate without division:\n\t\t\t// lower < numerator / denominator, where denominator < 0\n\t\t\t// Since denominator < 0, we have to flip the inequality:\n\t\t\t// lower < numerator / denominator <==> denominator * lower > numerator.\n\t\t\tif (denominator < 0.0f && numerator < lower * denominator)\n\t\t\t{\n\t\t\t\t// Increase lower.\n\t\t\t\t// The segment enters this half-space.\n\t\t\t\tlower = numerator / denominator;\n\t\t\t\tindex = i;\n\t\t\t}\n\t\t\telse if (denominator > 0.0f && numerator < upper * denominator)\n\t\t\t{\n\t\t\t\t// Decrease upper.\n\t\t\t\t// The segment exits this half-space.\n\t\t\t\tupper = numerator / denominator;\n\t\t\t}\n\t\t}\n\n\t\t// The use of epsilon here causes the assert on lower to trip\n\t\t// in some cases. Apparently the use of epsilon was to make edge\n\t\t// shapes work, but now those are handled separately.\n\t\t//if (upper < lower - b2_epsilon)\n\t\tif (upper < lower)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tb2Assert(0.0f <= lower && lower <= input.maxFraction);\n\n\tif (index >= 0)\n\t{\n\t\toutput->fraction = lower;\n\t\toutput->normal = b2Mul(xf.q, m_normals[index]);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid b2PolygonShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const\n{\n\tB2_NOT_USED(childIndex);\n\n\tb2Vec2 lower = b2Mul(xf, m_vertices[0]);\n\tb2Vec2 upper = lower;\n\n\tfor (int32 i = 1; i < m_count; ++i)\n\t{\n\t\tb2Vec2 v = b2Mul(xf, m_vertices[i]);\n\t\tlower = b2Min(lower, v);\n\t\tupper = b2Max(upper, v);\n\t}\n\n\tb2Vec2 r(m_radius, m_radius);\n\taabb->lowerBound = lower - r;\n\taabb->upperBound = upper + r;\n}\n\nvoid b2PolygonShape::ComputeMass(b2MassData* massData, float32 density) const\n{\n\t// Polygon mass, centroid, and inertia.\n\t// Let rho be the polygon density in mass per unit area.\n\t// Then:\n\t// mass = rho * int(dA)\n\t// centroid.x = (1/mass) * rho * int(x * dA)\n\t// centroid.y = (1/mass) * rho * int(y * dA)\n\t// I = rho * int((x*x + y*y) * dA)\n\t//\n\t// We can compute these integrals by summing all the integrals\n\t// for each triangle of the polygon. To evaluate the integral\n\t// for a single triangle, we make a change of variables to\n\t// the (u,v) coordinates of the triangle:\n\t// x = x0 + e1x * u + e2x * v\n\t// y = y0 + e1y * u + e2y * v\n\t// where 0 <= u && 0 <= v && u + v <= 1.\n\t//\n\t// We integrate u from [0,1-v] and then v from [0,1].\n\t// We also need to use the Jacobian of the transformation:\n\t// D = cross(e1, e2)\n\t//\n\t// Simplification: triangle centroid = (1/3) * (p1 + p2 + p3)\n\t//\n\t// The rest of the derivation is handled by computer algebra.\n\n\tb2Assert(m_count >= 3);\n\n\tb2Vec2 center; center.Set(0.0f, 0.0f);\n\tfloat32 area = 0.0f;\n\tfloat32 I = 0.0f;\n\n\t// s is the reference point for forming triangles.\n\t// It's location doesn't change the result (except for rounding error).\n\tb2Vec2 s(0.0f, 0.0f);\n\n\t// This code would put the reference point inside the polygon.\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\ts += m_vertices[i];\n\t}\n\ts *= 1.0f / m_count;\n\n\tconst float32 k_inv3 = 1.0f / 3.0f;\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\t// Triangle vertices.\n\t\tb2Vec2 e1 = m_vertices[i] - s;\n\t\tb2Vec2 e2 = i + 1 < m_count ? m_vertices[i+1] - s : m_vertices[0] - s;\n\n\t\tfloat32 D = b2Cross(e1, e2);\n\n\t\tfloat32 triangleArea = 0.5f * D;\n\t\tarea += triangleArea;\n\n\t\t// Area weighted centroid\n\t\tcenter += triangleArea * k_inv3 * (e1 + e2);\n\n\t\tfloat32 ex1 = e1.x, ey1 = e1.y;\n\t\tfloat32 ex2 = e2.x, ey2 = e2.y;\n\n\t\tfloat32 intx2 = ex1*ex1 + ex2*ex1 + ex2*ex2;\n\t\tfloat32 inty2 = ey1*ey1 + ey2*ey1 + ey2*ey2;\n\n\t\tI += (0.25f * k_inv3 * D) * (intx2 + inty2);\n\t}\n\n\t// Total mass\n\tmassData->mass = density * area;\n\n\t// Center of mass\n\tb2Assert(area > b2_epsilon);\n\tcenter *= 1.0f / area;\n\tmassData->center = center + s;\n\n\t// Inertia tensor relative to the local origin (point s).\n\tmassData->I = density * I;\n\n\t// Shift to center of mass then to original body origin.\n\tmassData->I += massData->mass * (b2Dot(massData->center, massData->center) - b2Dot(center, center));\n}\n\nbool b2PolygonShape::Validate() const\n{\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tint32 i1 = i;\n\t\tint32 i2 = i < m_count - 1 ? i1 + 1 : 0;\n\t\tb2Vec2 p = m_vertices[i1];\n\t\tb2Vec2 e = m_vertices[i2] - p;\n\n\t\tfor (int32 j = 0; j < m_count; ++j)\n\t\t{\n\t\t\tif (j == i1 || j == i2)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tb2Vec2 v = m_vertices[j] - p;\n\t\t\tfloat32 c = b2Cross(e, v);\n\t\t\tif (c < 0.0f)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n"
},
{
"path": "app/src/main/cpp/b2PrismaticJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PrismaticJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Linear constraint (point-to-line)\n// d = p2 - p1 = x2 + r2 - x1 - r1\n// C = dot(perp, d)\n// Cdot = dot(d, cross(w1, perp)) + dot(perp, v2 + cross(w2, r2) - v1 - cross(w1, r1))\n// = -dot(perp, v1) - dot(cross(d + r1, perp), w1) + dot(perp, v2) + dot(cross(r2, perp), v2)\n// J = [-perp, -cross(d + r1, perp), perp, cross(r2,perp)]\n//\n// Angular constraint\n// C = a2 - a1 + a_initial\n// Cdot = w2 - w1\n// J = [0 0 -1 0 0 1]\n//\n// K = J * invM * JT\n//\n// J = [-a -s1 a s2]\n// [0 -1 0 1]\n// a = perp\n// s1 = cross(d + r1, a) = cross(p2 - x1, a)\n// s2 = cross(r2, a) = cross(p2 - x2, a)\n\n\n// Motor/Limit linear constraint\n// C = dot(ax1, d)\n// Cdot = = -dot(ax1, v1) - dot(cross(d + r1, ax1), w1) + dot(ax1, v2) + dot(cross(r2, ax1), v2)\n// J = [-ax1 -cross(d+r1,ax1) ax1 cross(r2,ax1)]\n\n// Block Solver\n// We develop a block solver that includes the joint limit. This makes the limit stiff (inelastic) even\n// when the mass has poor distribution (leading to large torques about the joint anchor points).\n//\n// The Jacobian has 3 rows:\n// J = [-uT -s1 uT s2] // linear\n// [0 -1 0 1] // angular\n// [-vT -a1 vT a2] // limit\n//\n// u = perp\n// v = axis\n// s1 = cross(d + r1, u), s2 = cross(r2, u)\n// a1 = cross(d + r1, v), a2 = cross(r2, v)\n\n// M * (v2 - v1) = JT * df\n// J * v2 = bias\n//\n// v2 = v1 + invM * JT * df\n// J * (v1 + invM * JT * df) = bias\n// K * df = bias - J * v1 = -Cdot\n// K = J * invM * JT\n// Cdot = J * v1 - bias\n//\n// Now solve for f2.\n// df = f2 - f1\n// K * (f2 - f1) = -Cdot\n// f2 = invK * (-Cdot) + f1\n//\n// Clamp accumulated limit impulse.\n// lower: f2(3) = max(f2(3), 0)\n// upper: f2(3) = min(f2(3), 0)\n//\n// Solve for correct f2(1:2)\n// K(1:2, 1:2) * f2(1:2) = -Cdot(1:2) - K(1:2,3) * f2(3) + K(1:2,1:3) * f1\n// = -Cdot(1:2) - K(1:2,3) * f2(3) + K(1:2,1:2) * f1(1:2) + K(1:2,3) * f1(3)\n// K(1:2, 1:2) * f2(1:2) = -Cdot(1:2) - K(1:2,3) * (f2(3) - f1(3)) + K(1:2,1:2) * f1(1:2)\n// f2(1:2) = invK(1:2,1:2) * (-Cdot(1:2) - K(1:2,3) * (f2(3) - f1(3))) + f1(1:2)\n//\n// Now compute impulse to be applied:\n// df = f2 - f1\n\nvoid b2PrismaticJointDef::Initialize(b2Body* bA, b2Body* bB, const b2Vec2& anchor, const b2Vec2& axis)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor);\n\tlocalAxisA = bodyA->GetLocalVector(axis);\n\treferenceAngle = bodyB->GetAngle() - bodyA->GetAngle();\n}\n\nb2PrismaticJoint::b2PrismaticJoint(const b2PrismaticJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\tm_localXAxisA = def->localAxisA;\n\tm_localXAxisA.Normalize();\n\tm_localYAxisA = b2Cross(1.0f, m_localXAxisA);\n\tm_referenceAngle = def->referenceAngle;\n\n\tm_impulse.SetZero();\n\tm_motorMass = 0.0f;\n\tm_motorImpulse = 0.0f;\n\n\tm_lowerTranslation = def->lowerTranslation;\n\tm_upperTranslation = def->upperTranslation;\n\tm_maxMotorForce = def->maxMotorForce;\n\tm_motorSpeed = def->motorSpeed;\n\tm_enableLimit = def->enableLimit;\n\tm_enableMotor = def->enableMotor;\n\tm_limitState = e_inactiveLimit;\n\n\tm_axis.SetZero();\n\tm_perp.SetZero();\n}\n\nvoid b2PrismaticJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\t// Compute the effective masses.\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 d = (cB - cA) + rB - rA;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\t// Compute motor Jacobian and effective mass.\n\t{\n\t\tm_axis = b2Mul(qA, m_localXAxisA);\n\t\tm_a1 = b2Cross(d + rA, m_axis);\n\t\tm_a2 = b2Cross(rB, m_axis);\n\n\t\tm_motorMass = mA + mB + iA * m_a1 * m_a1 + iB * m_a2 * m_a2;\n\t\tif (m_motorMass > 0.0f)\n\t\t{\n\t\t\tm_motorMass = 1.0f / m_motorMass;\n\t\t}\n\t}\n\n\t// Prismatic constraint.\n\t{\n\t\tm_perp = b2Mul(qA, m_localYAxisA);\n\n\t\tm_s1 = b2Cross(d + rA, m_perp);\n\t\tm_s2 = b2Cross(rB, m_perp);\n\n\t\tfloat32 k11 = mA + mB + iA * m_s1 * m_s1 + iB * m_s2 * m_s2;\n\t\tfloat32 k12 = iA * m_s1 + iB * m_s2;\n\t\tfloat32 k13 = iA * m_s1 * m_a1 + iB * m_s2 * m_a2;\n\t\tfloat32 k22 = iA + iB;\n\t\tif (k22 == 0.0f)\n\t\t{\n\t\t\t// For bodies with fixed rotation.\n\t\t\tk22 = 1.0f;\n\t\t}\n\t\tfloat32 k23 = iA * m_a1 + iB * m_a2;\n\t\tfloat32 k33 = mA + mB + iA * m_a1 * m_a1 + iB * m_a2 * m_a2;\n\n\t\tm_K.ex.Set(k11, k12, k13);\n\t\tm_K.ey.Set(k12, k22, k23);\n\t\tm_K.ez.Set(k13, k23, k33);\n\t}\n\n\t// Compute motor and limit terms.\n\tif (m_enableLimit)\n\t{\n\t\tfloat32 jointTranslation = b2Dot(m_axis, d);\n\t\tif (b2Abs(m_upperTranslation - m_lowerTranslation) < 2.0f * b2_linearSlop)\n\t\t{\n\t\t\tm_limitState = e_equalLimits;\n\t\t}\n\t\telse if (jointTranslation <= m_lowerTranslation)\n\t\t{\n\t\t\tif (m_limitState != e_atLowerLimit)\n\t\t\t{\n\t\t\t\tm_limitState = e_atLowerLimit;\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t}\n\t\telse if (jointTranslation >= m_upperTranslation)\n\t\t{\n\t\t\tif (m_limitState != e_atUpperLimit)\n\t\t\t{\n\t\t\t\tm_limitState = e_atUpperLimit;\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_limitState = e_inactiveLimit;\n\t\t\tm_impulse.z = 0.0f;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_limitState = e_inactiveLimit;\n\t\tm_impulse.z = 0.0f;\n\t}\n\n\tif (m_enableMotor == false)\n\t{\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Account for variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\t\tm_motorImpulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P = m_impulse.x * m_perp + (m_motorImpulse + m_impulse.z) * m_axis;\n\t\tfloat32 LA = m_impulse.x * m_s1 + m_impulse.y + (m_motorImpulse + m_impulse.z) * m_a1;\n\t\tfloat32 LB = m_impulse.x * m_s2 + m_impulse.y + (m_motorImpulse + m_impulse.z) * m_a2;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\telse\n\t{\n\t\tm_impulse.SetZero();\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2PrismaticJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\t// Solve linear motor constraint.\n\tif (m_enableMotor && m_limitState != e_equalLimits)\n\t{\n\t\tfloat32 Cdot = b2Dot(m_axis, vB - vA) + m_a2 * wB - m_a1 * wA;\n\t\tfloat32 impulse = m_motorMass * (m_motorSpeed - Cdot);\n\t\tfloat32 oldImpulse = m_motorImpulse;\n\t\tfloat32 maxImpulse = data.step.dt * m_maxMotorForce;\n\t\tm_motorImpulse = b2Clamp(m_motorImpulse + impulse, -maxImpulse, maxImpulse);\n\t\timpulse = m_motorImpulse - oldImpulse;\n\n\t\tb2Vec2 P = impulse * m_axis;\n\t\tfloat32 LA = impulse * m_a1;\n\t\tfloat32 LB = impulse * m_a2;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\n\tb2Vec2 Cdot1;\n\tCdot1.x = b2Dot(m_perp, vB - vA) + m_s2 * wB - m_s1 * wA;\n\tCdot1.y = wB - wA;\n\n\tif (m_enableLimit && m_limitState != e_inactiveLimit)\n\t{\n\t\t// Solve prismatic and limit constraint in block form.\n\t\tfloat32 Cdot2;\n\t\tCdot2 = b2Dot(m_axis, vB - vA) + m_a2 * wB - m_a1 * wA;\n\t\tb2Vec3 Cdot(Cdot1.x, Cdot1.y, Cdot2);\n\n\t\tb2Vec3 f1 = m_impulse;\n\t\tb2Vec3 df = m_K.Solve33(-Cdot);\n\t\tm_impulse += df;\n\n\t\tif (m_limitState == e_atLowerLimit)\n\t\t{\n\t\t\tm_impulse.z = b2Max(m_impulse.z, 0.0f);\n\t\t}\n\t\telse if (m_limitState == e_atUpperLimit)\n\t\t{\n\t\t\tm_impulse.z = b2Min(m_impulse.z, 0.0f);\n\t\t}\n\n\t\t// f2(1:2) = invK(1:2,1:2) * (-Cdot(1:2) - K(1:2,3) * (f2(3) - f1(3))) + f1(1:2)\n\t\tb2Vec2 b = -Cdot1 - (m_impulse.z - f1.z) * b2Vec2(m_K.ez.x, m_K.ez.y);\n\t\tb2Vec2 f2r = m_K.Solve22(b) + b2Vec2(f1.x, f1.y);\n\t\tm_impulse.x = f2r.x;\n\t\tm_impulse.y = f2r.y;\n\n\t\tdf = m_impulse - f1;\n\n\t\tb2Vec2 P = df.x * m_perp + df.z * m_axis;\n\t\tfloat32 LA = df.x * m_s1 + df.y + df.z * m_a1;\n\t\tfloat32 LB = df.x * m_s2 + df.y + df.z * m_a2;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\telse\n\t{\n\t\t// Limit is inactive, just solve the prismatic constraint in block form.\n\t\tb2Vec2 df = m_K.Solve22(-Cdot1);\n\t\tm_impulse.x += df.x;\n\t\tm_impulse.y += df.y;\n\n\t\tb2Vec2 P = df.x * m_perp;\n\t\tfloat32 LA = df.x * m_s1 + df.y;\n\t\tfloat32 LB = df.x * m_s2 + df.y;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2PrismaticJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\t// Compute fresh Jacobians\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 d = cB + rB - cA - rA;\n\n\tb2Vec2 axis = b2Mul(qA, m_localXAxisA);\n\tfloat32 a1 = b2Cross(d + rA, axis);\n\tfloat32 a2 = b2Cross(rB, axis);\n\tb2Vec2 perp = b2Mul(qA, m_localYAxisA);\n\n\tfloat32 s1 = b2Cross(d + rA, perp);\n\tfloat32 s2 = b2Cross(rB, perp);\n\n\tb2Vec3 impulse;\n\tb2Vec2 C1;\n\tC1.x = b2Dot(perp, d);\n\tC1.y = aB - aA - m_referenceAngle;\n\n\tfloat32 linearError = b2Abs(C1.x);\n\tfloat32 angularError = b2Abs(C1.y);\n\n\tbool active = false;\n\tfloat32 C2 = 0.0f;\n\tif (m_enableLimit)\n\t{\n\t\tfloat32 translation = b2Dot(axis, d);\n\t\tif (b2Abs(m_upperTranslation - m_lowerTranslation) < 2.0f * b2_linearSlop)\n\t\t{\n\t\t\t// Prevent large angular corrections\n\t\t\tC2 = b2Clamp(translation, -b2_maxLinearCorrection, b2_maxLinearCorrection);\n\t\t\tlinearError = b2Max(linearError, b2Abs(translation));\n\t\t\tactive = true;\n\t\t}\n\t\telse if (translation <= m_lowerTranslation)\n\t\t{\n\t\t\t// Prevent large linear corrections and allow some slop.\n\t\t\tC2 = b2Clamp(translation - m_lowerTranslation + b2_linearSlop, -b2_maxLinearCorrection, 0.0f);\n\t\t\tlinearError = b2Max(linearError, m_lowerTranslation - translation);\n\t\t\tactive = true;\n\t\t}\n\t\telse if (translation >= m_upperTranslation)\n\t\t{\n\t\t\t// Prevent large linear corrections and allow some slop.\n\t\t\tC2 = b2Clamp(translation - m_upperTranslation - b2_linearSlop, 0.0f, b2_maxLinearCorrection);\n\t\t\tlinearError = b2Max(linearError, translation - m_upperTranslation);\n\t\t\tactive = true;\n\t\t}\n\t}\n\n\tif (active)\n\t{\n\t\tfloat32 k11 = mA + mB + iA * s1 * s1 + iB * s2 * s2;\n\t\tfloat32 k12 = iA * s1 + iB * s2;\n\t\tfloat32 k13 = iA * s1 * a1 + iB * s2 * a2;\n\t\tfloat32 k22 = iA + iB;\n\t\tif (k22 == 0.0f)\n\t\t{\n\t\t\t// For fixed rotation\n\t\t\tk22 = 1.0f;\n\t\t}\n\t\tfloat32 k23 = iA * a1 + iB * a2;\n\t\tfloat32 k33 = mA + mB + iA * a1 * a1 + iB * a2 * a2;\n\n\t\tb2Mat33 K;\n\t\tK.ex.Set(k11, k12, k13);\n\t\tK.ey.Set(k12, k22, k23);\n\t\tK.ez.Set(k13, k23, k33);\n\n\t\tb2Vec3 C;\n\t\tC.x = C1.x;\n\t\tC.y = C1.y;\n\t\tC.z = C2;\n\n\t\timpulse = K.Solve33(-C);\n\t}\n\telse\n\t{\n\t\tfloat32 k11 = mA + mB + iA * s1 * s1 + iB * s2 * s2;\n\t\tfloat32 k12 = iA * s1 + iB * s2;\n\t\tfloat32 k22 = iA + iB;\n\t\tif (k22 == 0.0f)\n\t\t{\n\t\t\tk22 = 1.0f;\n\t\t}\n\n\t\tb2Mat22 K;\n\t\tK.ex.Set(k11, k12);\n\t\tK.ey.Set(k12, k22);\n\n\t\tb2Vec2 impulse1 = K.Solve(-C1);\n\t\timpulse.x = impulse1.x;\n\t\timpulse.y = impulse1.y;\n\t\timpulse.z = 0.0f;\n\t}\n\n\tb2Vec2 P = impulse.x * perp + impulse.z * axis;\n\tfloat32 LA = impulse.x * s1 + impulse.y + impulse.z * a1;\n\tfloat32 LB = impulse.x * s2 + impulse.y + impulse.z * a2;\n\n\tcA -= mA * P;\n\taA -= iA * LA;\n\tcB += mB * P;\n\taB += iB * LB;\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn linearError <= b2_linearSlop && angularError <= b2_angularSlop;\n}\n\nb2Vec2 b2PrismaticJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2PrismaticJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2PrismaticJoint::GetReactionForce(float32 inv_dt) const\n{\n\treturn inv_dt * (m_impulse.x * m_perp + (m_motorImpulse + m_impulse.z) * m_axis);\n}\n\nfloat32 b2PrismaticJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_impulse.y;\n}\n\nfloat32 b2PrismaticJoint::GetJointTranslation() const\n{\n\tb2Vec2 pA = m_bodyA->GetWorldPoint(m_localAnchorA);\n\tb2Vec2 pB = m_bodyB->GetWorldPoint(m_localAnchorB);\n\tb2Vec2 d = pB - pA;\n\tb2Vec2 axis = m_bodyA->GetWorldVector(m_localXAxisA);\n\n\tfloat32 translation = b2Dot(d, axis);\n\treturn translation;\n}\n\nfloat32 b2PrismaticJoint::GetJointSpeed() const\n{\n\tb2Body* bA = m_bodyA;\n\tb2Body* bB = m_bodyB;\n\n\tb2Vec2 rA = b2Mul(bA->m_xf.q, m_localAnchorA - bA->m_sweep.localCenter);\n\tb2Vec2 rB = b2Mul(bB->m_xf.q, m_localAnchorB - bB->m_sweep.localCenter);\n\tb2Vec2 p1 = bA->m_sweep.c + rA;\n\tb2Vec2 p2 = bB->m_sweep.c + rB;\n\tb2Vec2 d = p2 - p1;\n\tb2Vec2 axis = b2Mul(bA->m_xf.q, m_localXAxisA);\n\n\tb2Vec2 vA = bA->m_linearVelocity;\n\tb2Vec2 vB = bB->m_linearVelocity;\n\tfloat32 wA = bA->m_angularVelocity;\n\tfloat32 wB = bB->m_angularVelocity;\n\n\tfloat32 speed = b2Dot(d, b2Cross(wA, axis)) + b2Dot(axis, vB + b2Cross(wB, rB) - vA - b2Cross(wA, rA));\n\treturn speed;\n}\n\nbool b2PrismaticJoint::IsLimitEnabled() const\n{\n\treturn m_enableLimit;\n}\n\nvoid b2PrismaticJoint::EnableLimit(bool flag)\n{\n\tif (flag != m_enableLimit)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_enableLimit = flag;\n\t\tm_impulse.z = 0.0f;\n\t}\n}\n\nfloat32 b2PrismaticJoint::GetLowerLimit() const\n{\n\treturn m_lowerTranslation;\n}\n\nfloat32 b2PrismaticJoint::GetUpperLimit() const\n{\n\treturn m_upperTranslation;\n}\n\nvoid b2PrismaticJoint::SetLimits(float32 lower, float32 upper)\n{\n\tb2Assert(lower <= upper);\n\tif (lower != m_lowerTranslation || upper != m_upperTranslation)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_lowerTranslation = lower;\n\t\tm_upperTranslation = upper;\n\t\tm_impulse.z = 0.0f;\n\t}\n}\n\nbool b2PrismaticJoint::IsMotorEnabled() const\n{\n\treturn m_enableMotor;\n}\n\nvoid b2PrismaticJoint::EnableMotor(bool flag)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_enableMotor = flag;\n}\n\nvoid b2PrismaticJoint::SetMotorSpeed(float32 speed)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_motorSpeed = speed;\n}\n\nvoid b2PrismaticJoint::SetMaxMotorForce(float32 force)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_maxMotorForce = force;\n}\n\nfloat32 b2PrismaticJoint::GetMotorForce(float32 inv_dt) const\n{\n\treturn inv_dt * m_motorImpulse;\n}\n\nvoid b2PrismaticJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2PrismaticJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.localAxisA.Set(%.15lef, %.15lef);\\n\", m_localXAxisA.x, m_localXAxisA.y);\n\tb2Log(\" jd.referenceAngle = %.15lef;\\n\", m_referenceAngle);\n\tb2Log(\" jd.enableLimit = bool(%d);\\n\", m_enableLimit);\n\tb2Log(\" jd.lowerTranslation = %.15lef;\\n\", m_lowerTranslation);\n\tb2Log(\" jd.upperTranslation = %.15lef;\\n\", m_upperTranslation);\n\tb2Log(\" jd.enableMotor = bool(%d);\\n\", m_enableMotor);\n\tb2Log(\" jd.motorSpeed = %.15lef;\\n\", m_motorSpeed);\n\tb2Log(\" jd.maxMotorForce = %.15lef;\\n\", m_maxMotorForce);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2PulleyJoint.cpp",
"content": "/*\n* Copyright (c) 2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PulleyJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Pulley:\n// length1 = norm(p1 - s1)\n// length2 = norm(p2 - s2)\n// C0 = (length1 + ratio * length2)_initial\n// C = C0 - (length1 + ratio * length2)\n// u1 = (p1 - s1) / norm(p1 - s1)\n// u2 = (p2 - s2) / norm(p2 - s2)\n// Cdot = -dot(u1, v1 + cross(w1, r1)) - ratio * dot(u2, v2 + cross(w2, r2))\n// J = -[u1 cross(r1, u1) ratio * u2 ratio * cross(r2, u2)]\n// K = J * invM * JT\n// = invMass1 + invI1 * cross(r1, u1)^2 + ratio^2 * (invMass2 + invI2 * cross(r2, u2)^2)\n\nvoid b2PulleyJointDef::Initialize(b2Body* bA, b2Body* bB,\n\t\t\t\tconst b2Vec2& groundA, const b2Vec2& groundB,\n\t\t\t\tconst b2Vec2& anchorA, const b2Vec2& anchorB,\n\t\t\t\tfloat32 r)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tgroundAnchorA = groundA;\n\tgroundAnchorB = groundB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchorA);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchorB);\n\tb2Vec2 dA = anchorA - groundA;\n\tlengthA = dA.Length();\n\tb2Vec2 dB = anchorB - groundB;\n\tlengthB = dB.Length();\n\tratio = r;\n\tb2Assert(ratio > b2_epsilon);\n}\n\nb2PulleyJoint::b2PulleyJoint(const b2PulleyJointDef* def)\n: b2Joint(def)\n{\n\tm_groundAnchorA = def->groundAnchorA;\n\tm_groundAnchorB = def->groundAnchorB;\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\n\tm_lengthA = def->lengthA;\n\tm_lengthB = def->lengthB;\n\n\tb2Assert(def->ratio != 0.0f);\n\tm_ratio = def->ratio;\n\n\tm_constant = def->lengthA + m_ratio * def->lengthB;\n\n\tm_impulse = 0.0f;\n}\n\nvoid b2PulleyJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// Get the pulley axes.\n\tm_uA = cA + m_rA - m_groundAnchorA;\n\tm_uB = cB + m_rB - m_groundAnchorB;\n\n\tfloat32 lengthA = m_uA.Length();\n\tfloat32 lengthB = m_uB.Length();\n\n\tif (lengthA > 10.0f * b2_linearSlop)\n\t{\n\t\tm_uA *= 1.0f / lengthA;\n\t}\n\telse\n\t{\n\t\tm_uA.SetZero();\n\t}\n\n\tif (lengthB > 10.0f * b2_linearSlop)\n\t{\n\t\tm_uB *= 1.0f / lengthB;\n\t}\n\telse\n\t{\n\t\tm_uB.SetZero();\n\t}\n\n\t// Compute effective mass.\n\tfloat32 ruA = b2Cross(m_rA, m_uA);\n\tfloat32 ruB = b2Cross(m_rB, m_uB);\n\n\tfloat32 mA = m_invMassA + m_invIA * ruA * ruA;\n\tfloat32 mB = m_invMassB + m_invIB * ruB * ruB;\n\n\tm_mass = mA + m_ratio * m_ratio * mB;\n\n\tif (m_mass > 0.0f)\n\t{\n\t\tm_mass = 1.0f / m_mass;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale impulses to support variable time steps.\n\t\tm_impulse *= data.step.dtRatio;\n\n\t\t// Warm starting.\n\t\tb2Vec2 PA = -(m_impulse) * m_uA;\n\t\tb2Vec2 PB = (-m_ratio * m_impulse) * m_uB;\n\n\t\tvA += m_invMassA * PA;\n\t\twA += m_invIA * b2Cross(m_rA, PA);\n\t\tvB += m_invMassB * PB;\n\t\twB += m_invIB * b2Cross(m_rB, PB);\n\t}\n\telse\n\t{\n\t\tm_impulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2PulleyJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Vec2 vpA = vA + b2Cross(wA, m_rA);\n\tb2Vec2 vpB = vB + b2Cross(wB, m_rB);\n\n\tfloat32 Cdot = -b2Dot(m_uA, vpA) - m_ratio * b2Dot(m_uB, vpB);\n\tfloat32 impulse = -m_mass * Cdot;\n\tm_impulse += impulse;\n\n\tb2Vec2 PA = -impulse * m_uA;\n\tb2Vec2 PB = -m_ratio * impulse * m_uB;\n\tvA += m_invMassA * PA;\n\twA += m_invIA * b2Cross(m_rA, PA);\n\tvB += m_invMassB * PB;\n\twB += m_invIB * b2Cross(m_rB, PB);\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2PulleyJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// Get the pulley axes.\n\tb2Vec2 uA = cA + rA - m_groundAnchorA;\n\tb2Vec2 uB = cB + rB - m_groundAnchorB;\n\n\tfloat32 lengthA = uA.Length();\n\tfloat32 lengthB = uB.Length();\n\n\tif (lengthA > 10.0f * b2_linearSlop)\n\t{\n\t\tuA *= 1.0f / lengthA;\n\t}\n\telse\n\t{\n\t\tuA.SetZero();\n\t}\n\n\tif (lengthB > 10.0f * b2_linearSlop)\n\t{\n\t\tuB *= 1.0f / lengthB;\n\t}\n\telse\n\t{\n\t\tuB.SetZero();\n\t}\n\n\t// Compute effective mass.\n\tfloat32 ruA = b2Cross(rA, uA);\n\tfloat32 ruB = b2Cross(rB, uB);\n\n\tfloat32 mA = m_invMassA + m_invIA * ruA * ruA;\n\tfloat32 mB = m_invMassB + m_invIB * ruB * ruB;\n\n\tfloat32 mass = mA + m_ratio * m_ratio * mB;\n\n\tif (mass > 0.0f)\n\t{\n\t\tmass = 1.0f / mass;\n\t}\n\n\tfloat32 C = m_constant - lengthA - m_ratio * lengthB;\n\tfloat32 linearError = b2Abs(C);\n\n\tfloat32 impulse = -mass * C;\n\n\tb2Vec2 PA = -impulse * uA;\n\tb2Vec2 PB = -m_ratio * impulse * uB;\n\n\tcA += m_invMassA * PA;\n\taA += m_invIA * b2Cross(rA, PA);\n\tcB += m_invMassB * PB;\n\taB += m_invIB * b2Cross(rB, PB);\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn linearError < b2_linearSlop;\n}\n\nb2Vec2 b2PulleyJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2PulleyJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2PulleyJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 P = m_impulse * m_uB;\n\treturn inv_dt * P;\n}\n\nfloat32 b2PulleyJoint::GetReactionTorque(float32 inv_dt) const\n{\n\tB2_NOT_USED(inv_dt);\n\treturn 0.0f;\n}\n\nb2Vec2 b2PulleyJoint::GetGroundAnchorA() const\n{\n\treturn m_groundAnchorA;\n}\n\nb2Vec2 b2PulleyJoint::GetGroundAnchorB() const\n{\n\treturn m_groundAnchorB;\n}\n\nfloat32 b2PulleyJoint::GetLengthA() const\n{\n\treturn m_lengthA;\n}\n\nfloat32 b2PulleyJoint::GetLengthB() const\n{\n\treturn m_lengthB;\n}\n\nfloat32 b2PulleyJoint::GetRatio() const\n{\n\treturn m_ratio;\n}\n\nfloat32 b2PulleyJoint::GetCurrentLengthA() const\n{\n\tb2Vec2 p = m_bodyA->GetWorldPoint(m_localAnchorA);\n\tb2Vec2 s = m_groundAnchorA;\n\tb2Vec2 d = p - s;\n\treturn d.Length();\n}\n\nfloat32 b2PulleyJoint::GetCurrentLengthB() const\n{\n\tb2Vec2 p = m_bodyB->GetWorldPoint(m_localAnchorB);\n\tb2Vec2 s = m_groundAnchorB;\n\tb2Vec2 d = p - s;\n\treturn d.Length();\n}\n\nvoid b2PulleyJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2PulleyJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.groundAnchorA.Set(%.15lef, %.15lef);\\n\", m_groundAnchorA.x, m_groundAnchorA.y);\n\tb2Log(\" jd.groundAnchorB.Set(%.15lef, %.15lef);\\n\", m_groundAnchorB.x, m_groundAnchorB.y);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.lengthA = %.15lef;\\n\", m_lengthA);\n\tb2Log(\" jd.lengthB = %.15lef;\\n\", m_lengthB);\n\tb2Log(\" jd.ratio = %.15lef;\\n\", m_ratio);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n\nvoid b2PulleyJoint::ShiftOrigin(const b2Vec2& newOrigin)\n{\n\tm_groundAnchorA -= newOrigin;\n\tm_groundAnchorB -= newOrigin;\n}\n"
},
{
"path": "app/src/main/cpp/b2RevoluteJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2RevoluteJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Point-to-point constraint\n// C = p2 - p1\n// Cdot = v2 - v1\n// = v2 + cross(w2, r2) - v1 - cross(w1, r1)\n// J = [-I -r1_skew I r2_skew ]\n// Identity used:\n// w k % (rx i + ry j) = w * (-ry i + rx j)\n\n// Motor constraint\n// Cdot = w2 - w1\n// J = [0 0 -1 0 0 1]\n// K = invI1 + invI2\n\nvoid b2RevoluteJointDef::Initialize(b2Body* bA, b2Body* bB, const b2Vec2& anchor)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor);\n\treferenceAngle = bodyB->GetAngle() - bodyA->GetAngle();\n}\n\nb2RevoluteJoint::b2RevoluteJoint(const b2RevoluteJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\tm_referenceAngle = def->referenceAngle;\n\n\tm_impulse.SetZero();\n\tm_motorImpulse = 0.0f;\n\n\tm_lowerAngle = def->lowerAngle;\n\tm_upperAngle = def->upperAngle;\n\tm_maxMotorTorque = def->maxMotorTorque;\n\tm_motorSpeed = def->motorSpeed;\n\tm_enableLimit = def->enableLimit;\n\tm_enableMotor = def->enableMotor;\n\tm_limitState = e_inactiveLimit;\n}\n\nvoid b2RevoluteJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// J = [-I -r1_skew I r2_skew]\n\t// [ 0 -1 0 1]\n\t// r_skew = [-ry; rx]\n\n\t// Matlab\n\t// K = [ mA+r1y^2*iA+mB+r2y^2*iB, -r1y*iA*r1x-r2y*iB*r2x, -r1y*iA-r2y*iB]\n\t// [ -r1y*iA*r1x-r2y*iB*r2x, mA+r1x^2*iA+mB+r2x^2*iB, r1x*iA+r2x*iB]\n\t// [ -r1y*iA-r2y*iB, r1x*iA+r2x*iB, iA+iB]\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tbool fixedRotation = (iA + iB == 0.0f);\n\n\tm_mass.ex.x = mA + mB + m_rA.y * m_rA.y * iA + m_rB.y * m_rB.y * iB;\n\tm_mass.ey.x = -m_rA.y * m_rA.x * iA - m_rB.y * m_rB.x * iB;\n\tm_mass.ez.x = -m_rA.y * iA - m_rB.y * iB;\n\tm_mass.ex.y = m_mass.ey.x;\n\tm_mass.ey.y = mA + mB + m_rA.x * m_rA.x * iA + m_rB.x * m_rB.x * iB;\n\tm_mass.ez.y = m_rA.x * iA + m_rB.x * iB;\n\tm_mass.ex.z = m_mass.ez.x;\n\tm_mass.ey.z = m_mass.ez.y;\n\tm_mass.ez.z = iA + iB;\n\n\tm_motorMass = iA + iB;\n\tif (m_motorMass > 0.0f)\n\t{\n\t\tm_motorMass = 1.0f / m_motorMass;\n\t}\n\n\tif (m_enableMotor == false || fixedRotation)\n\t{\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tif (m_enableLimit && fixedRotation == false)\n\t{\n\t\tfloat32 jointAngle = aB - aA - m_referenceAngle;\n\t\tif (b2Abs(m_upperAngle - m_lowerAngle) < 2.0f * b2_angularSlop)\n\t\t{\n\t\t\tm_limitState = e_equalLimits;\n\t\t}\n\t\telse if (jointAngle <= m_lowerAngle)\n\t\t{\n\t\t\tif (m_limitState != e_atLowerLimit)\n\t\t\t{\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t\tm_limitState = e_atLowerLimit;\n\t\t}\n\t\telse if (jointAngle >= m_upperAngle)\n\t\t{\n\t\t\tif (m_limitState != e_atUpperLimit)\n\t\t\t{\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t\tm_limitState = e_atUpperLimit;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_limitState = e_inactiveLimit;\n\t\t\tm_impulse.z = 0.0f;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_limitState = e_inactiveLimit;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale impulses to support a variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\t\tm_motorImpulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P(m_impulse.x, m_impulse.y);\n\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + m_motorImpulse + m_impulse.z);\n\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + m_motorImpulse + m_impulse.z);\n\t}\n\telse\n\t{\n\t\tm_impulse.SetZero();\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2RevoluteJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tbool fixedRotation = (iA + iB == 0.0f);\n\n\t// Solve motor constraint.\n\tif (m_enableMotor && m_limitState != e_equalLimits && fixedRotation == false)\n\t{\n\t\tfloat32 Cdot = wB - wA - m_motorSpeed;\n\t\tfloat32 impulse = -m_motorMass * Cdot;\n\t\tfloat32 oldImpulse = m_motorImpulse;\n\t\tfloat32 maxImpulse = data.step.dt * m_maxMotorTorque;\n\t\tm_motorImpulse = b2Clamp(m_motorImpulse + impulse, -maxImpulse, maxImpulse);\n\t\timpulse = m_motorImpulse - oldImpulse;\n\n\t\twA -= iA * impulse;\n\t\twB += iB * impulse;\n\t}\n\n\t// Solve limit constraint.\n\tif (m_enableLimit && m_limitState != e_inactiveLimit && fixedRotation == false)\n\t{\n\t\tb2Vec2 Cdot1 = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA);\n\t\tfloat32 Cdot2 = wB - wA;\n\t\tb2Vec3 Cdot(Cdot1.x, Cdot1.y, Cdot2);\n\n\t\tb2Vec3 impulse = -m_mass.Solve33(Cdot);\n\n\t\tif (m_limitState == e_equalLimits)\n\t\t{\n\t\t\tm_impulse += impulse;\n\t\t}\n\t\telse if (m_limitState == e_atLowerLimit)\n\t\t{\n\t\t\tfloat32 newImpulse = m_impulse.z + impulse.z;\n\t\t\tif (newImpulse < 0.0f)\n\t\t\t{\n\t\t\t\tb2Vec2 rhs = -Cdot1 + m_impulse.z * b2Vec2(m_mass.ez.x, m_mass.ez.y);\n\t\t\t\tb2Vec2 reduced = m_mass.Solve22(rhs);\n\t\t\t\timpulse.x = reduced.x;\n\t\t\t\timpulse.y = reduced.y;\n\t\t\t\timpulse.z = -m_impulse.z;\n\t\t\t\tm_impulse.x += reduced.x;\n\t\t\t\tm_impulse.y += reduced.y;\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_impulse += impulse;\n\t\t\t}\n\t\t}\n\t\telse if (m_limitState == e_atUpperLimit)\n\t\t{\n\t\t\tfloat32 newImpulse = m_impulse.z + impulse.z;\n\t\t\tif (newImpulse > 0.0f)\n\t\t\t{\n\t\t\t\tb2Vec2 rhs = -Cdot1 + m_impulse.z * b2Vec2(m_mass.ez.x, m_mass.ez.y);\n\t\t\t\tb2Vec2 reduced = m_mass.Solve22(rhs);\n\t\t\t\timpulse.x = reduced.x;\n\t\t\t\timpulse.y = reduced.y;\n\t\t\t\timpulse.z = -m_impulse.z;\n\t\t\t\tm_impulse.x += reduced.x;\n\t\t\t\tm_impulse.y += reduced.y;\n\t\t\t\tm_impulse.z = 0.0f;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_impulse += impulse;\n\t\t\t}\n\t\t}\n\n\t\tb2Vec2 P(impulse.x, impulse.y);\n\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + impulse.z);\n\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + impulse.z);\n\t}\n\telse\n\t{\n\t\t// Solve point-to-point constraint\n\t\tb2Vec2 Cdot = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA);\n\t\tb2Vec2 impulse = m_mass.Solve22(-Cdot);\n\n\t\tm_impulse.x += impulse.x;\n\t\tm_impulse.y += impulse.y;\n\n\t\tvA -= mA * impulse;\n\t\twA -= iA * b2Cross(m_rA, impulse);\n\n\t\tvB += mB * impulse;\n\t\twB += iB * b2Cross(m_rB, impulse);\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2RevoluteJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tfloat32 angularError = 0.0f;\n\tfloat32 positionError = 0.0f;\n\n\tbool fixedRotation = (m_invIA + m_invIB == 0.0f);\n\n\t// Solve angular limit constraint.\n\tif (m_enableLimit && m_limitState != e_inactiveLimit && fixedRotation == false)\n\t{\n\t\tfloat32 angle = aB - aA - m_referenceAngle;\n\t\tfloat32 limitImpulse = 0.0f;\n\n\t\tif (m_limitState == e_equalLimits)\n\t\t{\n\t\t\t// Prevent large angular corrections\n\t\t\tfloat32 C = b2Clamp(angle - m_lowerAngle, -b2_maxAngularCorrection, b2_maxAngularCorrection);\n\t\t\tlimitImpulse = -m_motorMass * C;\n\t\t\tangularError = b2Abs(C);\n\t\t}\n\t\telse if (m_limitState == e_atLowerLimit)\n\t\t{\n\t\t\tfloat32 C = angle - m_lowerAngle;\n\t\t\tangularError = -C;\n\n\t\t\t// Prevent large angular corrections and allow some slop.\n\t\t\tC = b2Clamp(C + b2_angularSlop, -b2_maxAngularCorrection, 0.0f);\n\t\t\tlimitImpulse = -m_motorMass * C;\n\t\t}\n\t\telse if (m_limitState == e_atUpperLimit)\n\t\t{\n\t\t\tfloat32 C = angle - m_upperAngle;\n\t\t\tangularError = C;\n\n\t\t\t// Prevent large angular corrections and allow some slop.\n\t\t\tC = b2Clamp(C - b2_angularSlop, 0.0f, b2_maxAngularCorrection);\n\t\t\tlimitImpulse = -m_motorMass * C;\n\t\t}\n\n\t\taA -= m_invIA * limitImpulse;\n\t\taB += m_invIB * limitImpulse;\n\t}\n\n\t// Solve point-to-point constraint.\n\t{\n\t\tqA.Set(aA);\n\t\tqB.Set(aB);\n\t\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\t\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t\tb2Vec2 C = cB + rB - cA - rA;\n\t\tpositionError = C.Length();\n\n\t\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\t\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\t\tb2Mat22 K;\n\t\tK.ex.x = mA + mB + iA * rA.y * rA.y + iB * rB.y * rB.y;\n\t\tK.ex.y = -iA * rA.x * rA.y - iB * rB.x * rB.y;\n\t\tK.ey.x = K.ex.y;\n\t\tK.ey.y = mA + mB + iA * rA.x * rA.x + iB * rB.x * rB.x;\n\n\t\tb2Vec2 impulse = -K.Solve(C);\n\n\t\tcA -= mA * impulse;\n\t\taA -= iA * b2Cross(rA, impulse);\n\n\t\tcB += mB * impulse;\n\t\taB += iB * b2Cross(rB, impulse);\n\t}\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn positionError <= b2_linearSlop && angularError <= b2_angularSlop;\n}\n\nb2Vec2 b2RevoluteJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2RevoluteJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2RevoluteJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 P(m_impulse.x, m_impulse.y);\n\treturn inv_dt * P;\n}\n\nfloat32 b2RevoluteJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_impulse.z;\n}\n\nfloat32 b2RevoluteJoint::GetJointAngle() const\n{\n\tb2Body* bA = m_bodyA;\n\tb2Body* bB = m_bodyB;\n\treturn bB->m_sweep.a - bA->m_sweep.a - m_referenceAngle;\n}\n\nfloat32 b2RevoluteJoint::GetJointSpeed() const\n{\n\tb2Body* bA = m_bodyA;\n\tb2Body* bB = m_bodyB;\n\treturn bB->m_angularVelocity - bA->m_angularVelocity;\n}\n\nbool b2RevoluteJoint::IsMotorEnabled() const\n{\n\treturn m_enableMotor;\n}\n\nvoid b2RevoluteJoint::EnableMotor(bool flag)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_enableMotor = flag;\n}\n\nfloat32 b2RevoluteJoint::GetMotorTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_motorImpulse;\n}\n\nvoid b2RevoluteJoint::SetMotorSpeed(float32 speed)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_motorSpeed = speed;\n}\n\nvoid b2RevoluteJoint::SetMaxMotorTorque(float32 torque)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_maxMotorTorque = torque;\n}\n\nbool b2RevoluteJoint::IsLimitEnabled() const\n{\n\treturn m_enableLimit;\n}\n\nvoid b2RevoluteJoint::EnableLimit(bool flag)\n{\n\tif (flag != m_enableLimit)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_enableLimit = flag;\n\t\tm_impulse.z = 0.0f;\n\t}\n}\n\nfloat32 b2RevoluteJoint::GetLowerLimit() const\n{\n\treturn m_lowerAngle;\n}\n\nfloat32 b2RevoluteJoint::GetUpperLimit() const\n{\n\treturn m_upperAngle;\n}\n\nvoid b2RevoluteJoint::SetLimits(float32 lower, float32 upper)\n{\n\tb2Assert(lower <= upper);\n\n\tif (lower != m_lowerAngle || upper != m_upperAngle)\n\t{\n\t\tm_bodyA->SetAwake(true);\n\t\tm_bodyB->SetAwake(true);\n\t\tm_impulse.z = 0.0f;\n\t\tm_lowerAngle = lower;\n\t\tm_upperAngle = upper;\n\t}\n}\n\nvoid b2RevoluteJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2RevoluteJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.referenceAngle = %.15lef;\\n\", m_referenceAngle);\n\tb2Log(\" jd.enableLimit = bool(%d);\\n\", m_enableLimit);\n\tb2Log(\" jd.lowerAngle = %.15lef;\\n\", m_lowerAngle);\n\tb2Log(\" jd.upperAngle = %.15lef;\\n\", m_upperAngle);\n\tb2Log(\" jd.enableMotor = bool(%d);\\n\", m_enableMotor);\n\tb2Log(\" jd.motorSpeed = %.15lef;\\n\", m_motorSpeed);\n\tb2Log(\" jd.maxMotorTorque = %.15lef;\\n\", m_maxMotorTorque);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2Rope.cpp",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Rope/b2Rope.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Draw.h\"\n\nb2Rope::b2Rope()\n{\n\tm_count = 0;\n\tm_ps = NULL;\n\tm_p0s = NULL;\n\tm_vs = NULL;\n\tm_ims = NULL;\n\tm_Ls = NULL;\n\tm_as = NULL;\n\tm_gravity.SetZero();\n\tm_k2 = 1.0f;\n\tm_k3 = 0.1f;\n}\n\nb2Rope::~b2Rope()\n{\n\tb2Free(m_ps);\n\tb2Free(m_p0s);\n\tb2Free(m_vs);\n\tb2Free(m_ims);\n\tb2Free(m_Ls);\n\tb2Free(m_as);\n}\n\nvoid b2Rope::Initialize(const b2RopeDef* def)\n{\n\tb2Assert(def->count >= 3);\n\tm_count = def->count;\n\tm_ps = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));\n\tm_p0s = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));\n\tm_vs = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));\n\tm_ims = (float32*)b2Alloc(m_count * sizeof(float32));\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tm_ps[i] = def->vertices[i];\n\t\tm_p0s[i] = def->vertices[i];\n\t\tm_vs[i].SetZero();\n\n\t\tfloat32 m = def->masses[i];\n\t\tif (m > 0.0f)\n\t\t{\n\t\t\tm_ims[i] = 1.0f / m;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_ims[i] = 0.0f;\n\t\t}\n\t}\n\n\tint32 count2 = m_count - 1;\n\tint32 count3 = m_count - 2;\n\tm_Ls = (float32*)b2Alloc(count2 * sizeof(float32));\n\tm_as = (float32*)b2Alloc(count3 * sizeof(float32));\n\n\tfor (int32 i = 0; i < count2; ++i)\n\t{\n\t\tb2Vec2 p1 = m_ps[i];\n\t\tb2Vec2 p2 = m_ps[i+1];\n\t\tm_Ls[i] = b2Distance(p1, p2);\n\t}\n\n\tfor (int32 i = 0; i < count3; ++i)\n\t{\n\t\tb2Vec2 p1 = m_ps[i];\n\t\tb2Vec2 p2 = m_ps[i + 1];\n\t\tb2Vec2 p3 = m_ps[i + 2];\n\n\t\tb2Vec2 d1 = p2 - p1;\n\t\tb2Vec2 d2 = p3 - p2;\n\n\t\tfloat32 a = b2Cross(d1, d2);\n\t\tfloat32 b = b2Dot(d1, d2);\n\n\t\tm_as[i] = b2Atan2(a, b);\n\t}\n\n\tm_gravity = def->gravity;\n\tm_damping = def->damping;\n\tm_k2 = def->k2;\n\tm_k3 = def->k3;\n}\n\nvoid b2Rope::Step(float32 h, int32 iterations)\n{\n\tif (h == 0.0)\n\t{\n\t\treturn;\n\t}\n\n\tfloat32 d = expf(- h * m_damping);\n\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tm_p0s[i] = m_ps[i];\n\t\tif (m_ims[i] > 0.0f)\n\t\t{\n\t\t\tm_vs[i] += h * m_gravity;\n\t\t}\n\t\tm_vs[i] *= d;\n\t\tm_ps[i] += h * m_vs[i];\n\n\t}\n\n\tfor (int32 i = 0; i < iterations; ++i)\n\t{\n\t\tSolveC2();\n\t\tSolveC3();\n\t\tSolveC2();\n\t}\n\n\tfloat32 inv_h = 1.0f / h;\n\tfor (int32 i = 0; i < m_count; ++i)\n\t{\n\t\tm_vs[i] = inv_h * (m_ps[i] - m_p0s[i]);\n\t}\n}\n\nvoid b2Rope::SolveC2()\n{\n\tint32 count2 = m_count - 1;\n\n\tfor (int32 i = 0; i < count2; ++i)\n\t{\n\t\tb2Vec2 p1 = m_ps[i];\n\t\tb2Vec2 p2 = m_ps[i + 1];\n\n\t\tb2Vec2 d = p2 - p1;\n\t\tfloat32 L = d.Normalize();\n\n\t\tfloat32 im1 = m_ims[i];\n\t\tfloat32 im2 = m_ims[i + 1];\n\n\t\tif (im1 + im2 == 0.0f)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tfloat32 s1 = im1 / (im1 + im2);\n\t\tfloat32 s2 = im2 / (im1 + im2);\n\n\t\tp1 -= m_k2 * s1 * (m_Ls[i] - L) * d;\n\t\tp2 += m_k2 * s2 * (m_Ls[i] - L) * d;\n\n\t\tm_ps[i] = p1;\n\t\tm_ps[i + 1] = p2;\n\t}\n}\n\nvoid b2Rope::SetAngle(float32 angle)\n{\n\tint32 count3 = m_count - 2;\n\tfor (int32 i = 0; i < count3; ++i)\n\t{\n\t\tm_as[i] = angle;\n\t}\n}\n\nvoid b2Rope::SolveC3()\n{\n\tint32 count3 = m_count - 2;\n\n\tfor (int32 i = 0; i < count3; ++i)\n\t{\n\t\tb2Vec2 p1 = m_ps[i];\n\t\tb2Vec2 p2 = m_ps[i + 1];\n\t\tb2Vec2 p3 = m_ps[i + 2];\n\n\t\tfloat32 m1 = m_ims[i];\n\t\tfloat32 m2 = m_ims[i + 1];\n\t\tfloat32 m3 = m_ims[i + 2];\n\n\t\tb2Vec2 d1 = p2 - p1;\n\t\tb2Vec2 d2 = p3 - p2;\n\n\t\tfloat32 L1sqr = d1.LengthSquared();\n\t\tfloat32 L2sqr = d2.LengthSquared();\n\n\t\tif (L1sqr * L2sqr == 0.0f)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tfloat32 a = b2Cross(d1, d2);\n\t\tfloat32 b = b2Dot(d1, d2);\n\n\t\tfloat32 angle = b2Atan2(a, b);\n\n\t\tb2Vec2 Jd1 = (-1.0f / L1sqr) * d1.Skew();\n\t\tb2Vec2 Jd2 = (1.0f / L2sqr) * d2.Skew();\n\n\t\tb2Vec2 J1 = -Jd1;\n\t\tb2Vec2 J2 = Jd1 - Jd2;\n\t\tb2Vec2 J3 = Jd2;\n\n\t\tfloat32 mass = m1 * b2Dot(J1, J1) + m2 * b2Dot(J2, J2) + m3 * b2Dot(J3, J3);\n\t\tif (mass == 0.0f)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tmass = 1.0f / mass;\n\n\t\tfloat32 C = angle - m_as[i];\n\n\t\twhile (C > b2_pi)\n\t\t{\n\t\t\tangle -= 2 * b2_pi;\n\t\t\tC = angle - m_as[i];\n\t\t}\n\n\t\twhile (C < -b2_pi)\n\t\t{\n\t\t\tangle += 2.0f * b2_pi;\n\t\t\tC = angle - m_as[i];\n\t\t}\n\n\t\tfloat32 impulse = - m_k3 * mass * C;\n\n\t\tp1 += (m1 * impulse) * J1;\n\t\tp2 += (m2 * impulse) * J2;\n\t\tp3 += (m3 * impulse) * J3;\n\n\t\tm_ps[i] = p1;\n\t\tm_ps[i + 1] = p2;\n\t\tm_ps[i + 2] = p3;\n\t}\n}\n\nvoid b2Rope::Draw(b2Draw* draw) const\n{\n\tb2Color c(0.4f, 0.5f, 0.7f);\n\n\tfor (int32 i = 0; i < m_count - 1; ++i)\n\t{\n\t\tdraw->DrawSegment(m_ps[i], m_ps[i+1], c);\n\t}\n}\n"
},
{
"path": "app/src/main/cpp/b2RopeJoint.cpp",
"content": "/*\n* Copyright (c) 2007-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2RopeJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n\n// Limit:\n// C = norm(pB - pA) - L\n// u = (pB - pA) / norm(pB - pA)\n// Cdot = dot(u, vB + cross(wB, rB) - vA - cross(wA, rA))\n// J = [-u -cross(rA, u) u cross(rB, u)]\n// K = J * invM * JT\n// = invMassA + invIA * cross(rA, u)^2 + invMassB + invIB * cross(rB, u)^2\n\nb2RopeJoint::b2RopeJoint(const b2RopeJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\n\tm_maxLength = def->maxLength;\n\n\tm_mass = 0.0f;\n\tm_impulse = 0.0f;\n\tm_state = e_inactiveLimit;\n\tm_length = 0.0f;\n}\n\nvoid b2RopeJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tm_u = cB + m_rB - cA - m_rA;\n\n\tm_length = m_u.Length();\n\n\tfloat32 C = m_length - m_maxLength;\n\tif (C > 0.0f)\n\t{\n\t\tm_state = e_atUpperLimit;\n\t}\n\telse\n\t{\n\t\tm_state = e_inactiveLimit;\n\t}\n\n\tif (m_length > b2_linearSlop)\n\t{\n\t\tm_u *= 1.0f / m_length;\n\t}\n\telse\n\t{\n\t\tm_u.SetZero();\n\t\tm_mass = 0.0f;\n\t\tm_impulse = 0.0f;\n\t\treturn;\n\t}\n\n\t// Compute effective mass.\n\tfloat32 crA = b2Cross(m_rA, m_u);\n\tfloat32 crB = b2Cross(m_rB, m_u);\n\tfloat32 invMass = m_invMassA + m_invIA * crA * crA + m_invMassB + m_invIB * crB * crB;\n\n\tm_mass = invMass != 0.0f ? 1.0f / invMass : 0.0f;\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale the impulse to support a variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P = m_impulse * m_u;\n\t\tvA -= m_invMassA * P;\n\t\twA -= m_invIA * b2Cross(m_rA, P);\n\t\tvB += m_invMassB * P;\n\t\twB += m_invIB * b2Cross(m_rB, P);\n\t}\n\telse\n\t{\n\t\tm_impulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2RopeJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\t// Cdot = dot(u, v + cross(w, r))\n\tb2Vec2 vpA = vA + b2Cross(wA, m_rA);\n\tb2Vec2 vpB = vB + b2Cross(wB, m_rB);\n\tfloat32 C = m_length - m_maxLength;\n\tfloat32 Cdot = b2Dot(m_u, vpB - vpA);\n\n\t// Predictive constraint.\n\tif (C < 0.0f)\n\t{\n\t\tCdot += data.step.inv_dt * C;\n\t}\n\n\tfloat32 impulse = -m_mass * Cdot;\n\tfloat32 oldImpulse = m_impulse;\n\tm_impulse = b2Min(0.0f, m_impulse + impulse);\n\timpulse = m_impulse - oldImpulse;\n\n\tb2Vec2 P = impulse * m_u;\n\tvA -= m_invMassA * P;\n\twA -= m_invIA * b2Cross(m_rA, P);\n\tvB += m_invMassB * P;\n\twB += m_invIB * b2Cross(m_rB, P);\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2RopeJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 u = cB + rB - cA - rA;\n\n\tfloat32 length = u.Normalize();\n\tfloat32 C = length - m_maxLength;\n\n\tC = b2Clamp(C, 0.0f, b2_maxLinearCorrection);\n\n\tfloat32 impulse = -m_mass * C;\n\tb2Vec2 P = impulse * u;\n\n\tcA -= m_invMassA * P;\n\taA -= m_invIA * b2Cross(rA, P);\n\tcB += m_invMassB * P;\n\taB += m_invIB * b2Cross(rB, P);\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn length - m_maxLength < b2_linearSlop;\n}\n\nb2Vec2 b2RopeJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2RopeJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2RopeJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 F = (inv_dt * m_impulse) * m_u;\n\treturn F;\n}\n\nfloat32 b2RopeJoint::GetReactionTorque(float32 inv_dt) const\n{\n\tB2_NOT_USED(inv_dt);\n\treturn 0.0f;\n}\n\nfloat32 b2RopeJoint::GetMaxLength() const\n{\n\treturn m_maxLength;\n}\n\nb2LimitState b2RopeJoint::GetLimitState() const\n{\n\treturn m_state;\n}\n\nvoid b2RopeJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2RopeJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.maxLength = %.15lef;\\n\", m_maxLength);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2Settings.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2Settings.h\"\n#include \n#include \n#include \n\nb2Version b2_version = {2, 3, 0};\n\n// Memory allocators. Modify these to use your own allocator.\nvoid* b2Alloc(int32 size)\n{\n\treturn malloc(size);\n}\n\nvoid b2Free(void* mem)\n{\n\tfree(mem);\n}\n\n// You can modify this to use your logging facility.\nvoid b2Log(const char* string, ...)\n{\n\tva_list args;\n\tva_start(args, string);\n\tvprintf(string, args);\n\tva_end(args);\n}\n"
},
{
"path": "app/src/main/cpp/b2StackAllocator.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2StackAllocator.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Math.h\"\n\nb2StackAllocator::b2StackAllocator()\n{\n\tm_index = 0;\n\tm_allocation = 0;\n\tm_maxAllocation = 0;\n\tm_entryCount = 0;\n}\n\nb2StackAllocator::~b2StackAllocator()\n{\n\tb2Assert(m_index == 0);\n\tb2Assert(m_entryCount == 0);\n}\n\nvoid* b2StackAllocator::Allocate(int32 size)\n{\n\tb2Assert(m_entryCount < b2_maxStackEntries);\n\n\tb2StackEntry* entry = m_entries + m_entryCount;\n\tentry->size = size;\n\tif (m_index + size > b2_stackSize)\n\t{\n\t\tentry->data = (char*)b2Alloc(size);\n\t\tentry->usedMalloc = true;\n\t}\n\telse\n\t{\n\t\tentry->data = m_data + m_index;\n\t\tentry->usedMalloc = false;\n\t\tm_index += size;\n\t}\n\n\tm_allocation += size;\n\tm_maxAllocation = b2Max(m_maxAllocation, m_allocation);\n\t++m_entryCount;\n\n\treturn entry->data;\n}\n\nvoid b2StackAllocator::Free(void* p)\n{\n\tb2Assert(m_entryCount > 0);\n\tb2StackEntry* entry = m_entries + m_entryCount - 1;\n\tb2Assert(p == entry->data);\n\tif (entry->usedMalloc)\n\t{\n\t\tb2Free(p);\n\t}\n\telse\n\t{\n\t\tm_index -= entry->size;\n\t}\n\tm_allocation -= entry->size;\n\t--m_entryCount;\n\n\tp = NULL;\n}\n\nint32 b2StackAllocator::GetMaxAllocation() const\n{\n\treturn m_maxAllocation;\n}\n"
},
{
"path": "app/src/main/cpp/b2TimeOfImpact.cpp",
"content": "/*\n* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2Distance.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Timer.h\"\n\n#include \n\nfloat32 b2_toiTime, b2_toiMaxTime;\nint32 b2_toiCalls, b2_toiIters, b2_toiMaxIters;\nint32 b2_toiRootIters, b2_toiMaxRootIters;\n\n//\nstruct b2SeparationFunction\n{\n\tenum Type\n\t{\n\t\te_points,\n\t\te_faceA,\n\t\te_faceB\n\t};\n\n\t// TODO_ERIN might not need to return the separation\n\n\tfloat32 Initialize(const b2SimplexCache* cache,\n\t\tconst b2DistanceProxy* proxyA, const b2Sweep& sweepA,\n\t\tconst b2DistanceProxy* proxyB, const b2Sweep& sweepB,\n\t\tfloat32 t1)\n\t{\n\t\tm_proxyA = proxyA;\n\t\tm_proxyB = proxyB;\n\t\tint32 count = cache->count;\n\t\tb2Assert(0 < count && count < 3);\n\n\t\tm_sweepA = sweepA;\n\t\tm_sweepB = sweepB;\n\n\t\tb2Transform xfA, xfB;\n\t\tm_sweepA.GetTransform(&xfA, t1);\n\t\tm_sweepB.GetTransform(&xfB, t1);\n\n\t\tif (count == 1)\n\t\t{\n\t\t\tm_type = e_points;\n\t\t\tb2Vec2 localPointA = m_proxyA->GetVertex(cache->indexA[0]);\n\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(cache->indexB[0]);\n\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\t\t\tm_axis = pointB - pointA;\n\t\t\tfloat32 s = m_axis.Normalize();\n\t\t\treturn s;\n\t\t}\n\t\telse if (cache->indexA[0] == cache->indexA[1])\n\t\t{\n\t\t\t// Two points on B and one on A.\n\t\t\tm_type = e_faceB;\n\t\t\tb2Vec2 localPointB1 = proxyB->GetVertex(cache->indexB[0]);\n\t\t\tb2Vec2 localPointB2 = proxyB->GetVertex(cache->indexB[1]);\n\n\t\t\tm_axis = b2Cross(localPointB2 - localPointB1, 1.0f);\n\t\t\tm_axis.Normalize();\n\t\t\tb2Vec2 normal = b2Mul(xfB.q, m_axis);\n\n\t\t\tm_localPoint = 0.5f * (localPointB1 + localPointB2);\n\t\t\tb2Vec2 pointB = b2Mul(xfB, m_localPoint);\n\n\t\t\tb2Vec2 localPointA = proxyA->GetVertex(cache->indexA[0]);\n\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\n\t\t\tfloat32 s = b2Dot(pointA - pointB, normal);\n\t\t\tif (s < 0.0f)\n\t\t\t{\n\t\t\t\tm_axis = -m_axis;\n\t\t\t\ts = -s;\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// Two points on A and one or two points on B.\n\t\t\tm_type = e_faceA;\n\t\t\tb2Vec2 localPointA1 = m_proxyA->GetVertex(cache->indexA[0]);\n\t\t\tb2Vec2 localPointA2 = m_proxyA->GetVertex(cache->indexA[1]);\n\n\t\t\tm_axis = b2Cross(localPointA2 - localPointA1, 1.0f);\n\t\t\tm_axis.Normalize();\n\t\t\tb2Vec2 normal = b2Mul(xfA.q, m_axis);\n\n\t\t\tm_localPoint = 0.5f * (localPointA1 + localPointA2);\n\t\t\tb2Vec2 pointA = b2Mul(xfA, m_localPoint);\n\n\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(cache->indexB[0]);\n\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\n\t\t\tfloat32 s = b2Dot(pointB - pointA, normal);\n\t\t\tif (s < 0.0f)\n\t\t\t{\n\t\t\t\tm_axis = -m_axis;\n\t\t\t\ts = -s;\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\t}\n\n\t//\n\tfloat32 FindMinSeparation(int32* indexA, int32* indexB, float32 t) const\n\t{\n\t\tb2Transform xfA, xfB;\n\t\tm_sweepA.GetTransform(&xfA, t);\n\t\tm_sweepB.GetTransform(&xfB, t);\n\n\t\tswitch (m_type)\n\t\t{\n\t\tcase e_points:\n\t\t\t{\n\t\t\t\tb2Vec2 axisA = b2MulT(xfA.q, m_axis);\n\t\t\t\tb2Vec2 axisB = b2MulT(xfB.q, -m_axis);\n\n\t\t\t\t*indexA = m_proxyA->GetSupport(axisA);\n\t\t\t\t*indexB = m_proxyB->GetSupport(axisB);\n\n\t\t\t\tb2Vec2 localPointA = m_proxyA->GetVertex(*indexA);\n\t\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(*indexB);\n\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\n\t\t\t\tfloat32 separation = b2Dot(pointB - pointA, m_axis);\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tcase e_faceA:\n\t\t\t{\n\t\t\t\tb2Vec2 normal = b2Mul(xfA.q, m_axis);\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, m_localPoint);\n\n\t\t\t\tb2Vec2 axisB = b2MulT(xfB.q, -normal);\n\n\t\t\t\t*indexA = -1;\n\t\t\t\t*indexB = m_proxyB->GetSupport(axisB);\n\n\t\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(*indexB);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\n\t\t\t\tfloat32 separation = b2Dot(pointB - pointA, normal);\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tcase e_faceB:\n\t\t\t{\n\t\t\t\tb2Vec2 normal = b2Mul(xfB.q, m_axis);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, m_localPoint);\n\n\t\t\t\tb2Vec2 axisA = b2MulT(xfA.q, -normal);\n\n\t\t\t\t*indexB = -1;\n\t\t\t\t*indexA = m_proxyA->GetSupport(axisA);\n\n\t\t\t\tb2Vec2 localPointA = m_proxyA->GetVertex(*indexA);\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\n\t\t\t\tfloat32 separation = b2Dot(pointA - pointB, normal);\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\t*indexA = -1;\n\t\t\t*indexB = -1;\n\t\t\treturn 0.0f;\n\t\t}\n\t}\n\n\t//\n\tfloat32 Evaluate(int32 indexA, int32 indexB, float32 t) const\n\t{\n\t\tb2Transform xfA, xfB;\n\t\tm_sweepA.GetTransform(&xfA, t);\n\t\tm_sweepB.GetTransform(&xfB, t);\n\n\t\tswitch (m_type)\n\t\t{\n\t\tcase e_points:\n\t\t\t{\n\t\t\t\tb2Vec2 localPointA = m_proxyA->GetVertex(indexA);\n\t\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(indexB);\n\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\t\t\t\tfloat32 separation = b2Dot(pointB - pointA, m_axis);\n\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tcase e_faceA:\n\t\t\t{\n\t\t\t\tb2Vec2 normal = b2Mul(xfA.q, m_axis);\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, m_localPoint);\n\n\t\t\t\tb2Vec2 localPointB = m_proxyB->GetVertex(indexB);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, localPointB);\n\n\t\t\t\tfloat32 separation = b2Dot(pointB - pointA, normal);\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tcase e_faceB:\n\t\t\t{\n\t\t\t\tb2Vec2 normal = b2Mul(xfB.q, m_axis);\n\t\t\t\tb2Vec2 pointB = b2Mul(xfB, m_localPoint);\n\n\t\t\t\tb2Vec2 localPointA = m_proxyA->GetVertex(indexA);\n\t\t\t\tb2Vec2 pointA = b2Mul(xfA, localPointA);\n\n\t\t\t\tfloat32 separation = b2Dot(pointA - pointB, normal);\n\t\t\t\treturn separation;\n\t\t\t}\n\n\t\tdefault:\n\t\t\tb2Assert(false);\n\t\t\treturn 0.0f;\n\t\t}\n\t}\n\n\tconst b2DistanceProxy* m_proxyA;\n\tconst b2DistanceProxy* m_proxyB;\n\tb2Sweep m_sweepA, m_sweepB;\n\tType m_type;\n\tb2Vec2 m_localPoint;\n\tb2Vec2 m_axis;\n};\n\n// CCD via the local separating axis method. This seeks progression\n// by computing the largest time at which separation is maintained.\nvoid b2TimeOfImpact(b2TOIOutput* output, const b2TOIInput* input)\n{\n\tb2Timer timer;\n\n\t++b2_toiCalls;\n\n\toutput->state = b2TOIOutput::e_unknown;\n\toutput->t = input->tMax;\n\n\tconst b2DistanceProxy* proxyA = &input->proxyA;\n\tconst b2DistanceProxy* proxyB = &input->proxyB;\n\n\tb2Sweep sweepA = input->sweepA;\n\tb2Sweep sweepB = input->sweepB;\n\n\t// Large rotations can make the root finder fail, so we normalize the\n\t// sweep angles.\n\tsweepA.Normalize();\n\tsweepB.Normalize();\n\n\tfloat32 tMax = input->tMax;\n\n\tfloat32 totalRadius = proxyA->m_radius + proxyB->m_radius;\n\tfloat32 target = b2Max(b2_linearSlop, totalRadius - 3.0f * b2_linearSlop);\n\tfloat32 tolerance = 0.25f * b2_linearSlop;\n\tb2Assert(target > tolerance);\n\n\tfloat32 t1 = 0.0f;\n\tconst int32 k_maxIterations = 20;\t// TODO_ERIN b2Settings\n\tint32 iter = 0;\n\n\t// Prepare input for distance query.\n\tb2SimplexCache cache;\n\tcache.count = 0;\n\tb2DistanceInput distanceInput;\n\tdistanceInput.proxyA = input->proxyA;\n\tdistanceInput.proxyB = input->proxyB;\n\tdistanceInput.useRadii = false;\n\n\t// The outer loop progressively attempts to compute new separating axes.\n\t// This loop terminates when an axis is repeated (no progress is made).\n\tfor(;;)\n\t{\n\t\tb2Transform xfA, xfB;\n\t\tsweepA.GetTransform(&xfA, t1);\n\t\tsweepB.GetTransform(&xfB, t1);\n\n\t\t// Get the distance between shapes. We can also use the results\n\t\t// to get a separating axis.\n\t\tdistanceInput.transformA = xfA;\n\t\tdistanceInput.transformB = xfB;\n\t\tb2DistanceOutput distanceOutput;\n\t\tb2Distance(&distanceOutput, &cache, &distanceInput);\n\n\t\t// If the shapes are overlapped, we give up on continuous collision.\n\t\tif (distanceOutput.distance <= 0.0f)\n\t\t{\n\t\t\t// Failure!\n\t\t\toutput->state = b2TOIOutput::e_overlapped;\n\t\t\toutput->t = 0.0f;\n\t\t\tbreak;\n\t\t}\n\n\t\tif (distanceOutput.distance < target + tolerance)\n\t\t{\n\t\t\t// Victory!\n\t\t\toutput->state = b2TOIOutput::e_touching;\n\t\t\toutput->t = t1;\n\t\t\tbreak;\n\t\t}\n\n\t\t// Initialize the separating axis.\n\t\tb2SeparationFunction fcn;\n\t\tfcn.Initialize(&cache, proxyA, sweepA, proxyB, sweepB, t1);\n#if 0\n\t\t// Dump the curve seen by the root finder\n\t\t{\n\t\t\tconst int32 N = 100;\n\t\t\tfloat32 dx = 1.0f / N;\n\t\t\tfloat32 xs[N+1];\n\t\t\tfloat32 fs[N+1];\n\n\t\t\tfloat32 x = 0.0f;\n\n\t\t\tfor (int32 i = 0; i <= N; ++i)\n\t\t\t{\n\t\t\t\tsweepA.GetTransform(&xfA, x);\n\t\t\t\tsweepB.GetTransform(&xfB, x);\n\t\t\t\tfloat32 f = fcn.Evaluate(xfA, xfB) - target;\n\n\t\t\t\tprintf(\"%g %g\\n\", x, f);\n\n\t\t\t\txs[i] = x;\n\t\t\t\tfs[i] = f;\n\n\t\t\t\tx += dx;\n\t\t\t}\n\t\t}\n#endif\n\n\t\t// Compute the TOI on the separating axis. We do this by successively\n\t\t// resolving the deepest point. This loop is bounded by the number of vertices.\n\t\tbool done = false;\n\t\tfloat32 t2 = tMax;\n\t\tint32 pushBackIter = 0;\n\t\tfor (;;)\n\t\t{\n\t\t\t// Find the deepest point at t2. Store the witness point indices.\n\t\t\tint32 indexA, indexB;\n\t\t\tfloat32 s2 = fcn.FindMinSeparation(&indexA, &indexB, t2);\n\n\t\t\t// Is the final configuration separated?\n\t\t\tif (s2 > target + tolerance)\n\t\t\t{\n\t\t\t\t// Victory!\n\t\t\t\toutput->state = b2TOIOutput::e_separated;\n\t\t\t\toutput->t = tMax;\n\t\t\t\tdone = true;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Has the separation reached tolerance?\n\t\t\tif (s2 > target - tolerance)\n\t\t\t{\n\t\t\t\t// Advance the sweeps\n\t\t\t\tt1 = t2;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Compute the initial separation of the witness points.\n\t\t\tfloat32 s1 = fcn.Evaluate(indexA, indexB, t1);\n\n\t\t\t// Check for initial overlap. This might happen if the root finder\n\t\t\t// runs out of iterations.\n\t\t\tif (s1 < target - tolerance)\n\t\t\t{\n\t\t\t\toutput->state = b2TOIOutput::e_failed;\n\t\t\t\toutput->t = t1;\n\t\t\t\tdone = true;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Check for touching\n\t\t\tif (s1 <= target + tolerance)\n\t\t\t{\n\t\t\t\t// Victory! t1 should hold the TOI (could be 0.0).\n\t\t\t\toutput->state = b2TOIOutput::e_touching;\n\t\t\t\toutput->t = t1;\n\t\t\t\tdone = true;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Compute 1D root of: f(x) - target = 0\n\t\t\tint32 rootIterCount = 0;\n\t\t\tfloat32 a1 = t1, a2 = t2;\n\t\t\tfor (;;)\n\t\t\t{\n\t\t\t\t// Use a mix of the secant rule and bisection.\n\t\t\t\tfloat32 t;\n\t\t\t\tif (rootIterCount & 1)\n\t\t\t\t{\n\t\t\t\t\t// Secant rule to improve convergence.\n\t\t\t\t\tt = a1 + (target - s1) * (a2 - a1) / (s2 - s1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// Bisection to guarantee progress.\n\t\t\t\t\tt = 0.5f * (a1 + a2);\n\t\t\t\t}\n\n\t\t\t\t++rootIterCount;\n\t\t\t\t++b2_toiRootIters;\n\n\t\t\t\tfloat32 s = fcn.Evaluate(indexA, indexB, t);\n\n\t\t\t\tif (b2Abs(s - target) < tolerance)\n\t\t\t\t{\n\t\t\t\t\t// t2 holds a tentative value for t1\n\t\t\t\t\tt2 = t;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t// Ensure we continue to bracket the root.\n\t\t\t\tif (s > target)\n\t\t\t\t{\n\t\t\t\t\ta1 = t;\n\t\t\t\t\ts1 = s;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ta2 = t;\n\t\t\t\t\ts2 = s;\n\t\t\t\t}\n\n\t\t\t\tif (rootIterCount == 50)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tb2_toiMaxRootIters = b2Max(b2_toiMaxRootIters, rootIterCount);\n\n\t\t\t++pushBackIter;\n\n\t\t\tif (pushBackIter == b2_maxPolygonVertices)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t++iter;\n\t\t++b2_toiIters;\n\n\t\tif (done)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tif (iter == k_maxIterations)\n\t\t{\n\t\t\t// Root finder got stuck. Semi-victory.\n\t\t\toutput->state = b2TOIOutput::e_failed;\n\t\t\toutput->t = t1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tb2_toiMaxIters = b2Max(b2_toiMaxIters, iter);\n\n\tfloat32 time = timer.GetMilliseconds();\n\tb2_toiMaxTime = b2Max(b2_toiMaxTime, time);\n\tb2_toiTime += time;\n}\n"
},
{
"path": "app/src/main/cpp/b2Timer.cpp",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Common/b2Timer.h\"\n\n#if defined(_WIN32)\n\nfloat64 b2Timer::s_invFrequency = 0.0f;\n\n#define WIN32_LEAN_AND_MEAN\n#include \n\nb2Timer::b2Timer()\n{\n\tLARGE_INTEGER largeInteger;\n\n\tif (s_invFrequency == 0.0f)\n\t{\n\t\tQueryPerformanceFrequency(&largeInteger);\n\t\ts_invFrequency = float64(largeInteger.QuadPart);\n\t\tif (s_invFrequency > 0.0f)\n\t\t{\n\t\t\ts_invFrequency = 1000.0f / s_invFrequency;\n\t\t}\n\t}\n\n\tQueryPerformanceCounter(&largeInteger);\n\tm_start = float64(largeInteger.QuadPart);\n}\n\nvoid b2Timer::Reset()\n{\n\tLARGE_INTEGER largeInteger;\n\tQueryPerformanceCounter(&largeInteger);\n\tm_start = float64(largeInteger.QuadPart);\n}\n\nfloat32 b2Timer::GetMilliseconds() const\n{\n\tLARGE_INTEGER largeInteger;\n\tQueryPerformanceCounter(&largeInteger);\n\tfloat64 count = float64(largeInteger.QuadPart);\n\tfloat32 ms = float32(s_invFrequency * (count - m_start));\n\treturn ms;\n}\n\n#elif defined(__linux__) || defined (__APPLE__)\n\n#include \n\nb2Timer::b2Timer()\n{\n Reset();\n}\n\nvoid b2Timer::Reset()\n{\n timeval t;\n gettimeofday(&t, 0);\n m_start_sec = t.tv_sec;\n m_start_usec = t.tv_usec;\n}\n\nfloat32 b2Timer::GetMilliseconds() const\n{\n timeval t;\n gettimeofday(&t, 0);\n return 1000.0f * (t.tv_sec - m_start_sec) + 0.001f * (t.tv_usec - m_start_usec);\n}\n\n#else\n\nb2Timer::b2Timer()\n{\n}\n\nvoid b2Timer::Reset()\n{\n}\n\nfloat32 b2Timer::GetMilliseconds() const\n{\n\treturn 0.0f;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/b2WeldJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2WeldJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Point-to-point constraint\n// C = p2 - p1\n// Cdot = v2 - v1\n// = v2 + cross(w2, r2) - v1 - cross(w1, r1)\n// J = [-I -r1_skew I r2_skew ]\n// Identity used:\n// w k % (rx i + ry j) = w * (-ry i + rx j)\n\n// Angle constraint\n// C = angle2 - angle1 - referenceAngle\n// Cdot = w2 - w1\n// J = [0 0 -1 0 0 1]\n// K = invI1 + invI2\n\nvoid b2WeldJointDef::Initialize(b2Body* bA, b2Body* bB, const b2Vec2& anchor)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor);\n\treferenceAngle = bodyB->GetAngle() - bodyA->GetAngle();\n}\n\nb2WeldJoint::b2WeldJoint(const b2WeldJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\tm_referenceAngle = def->referenceAngle;\n\tm_frequencyHz = def->frequencyHz;\n\tm_dampingRatio = def->dampingRatio;\n\n\tm_impulse.SetZero();\n}\n\nvoid b2WeldJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tm_rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tm_rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\t// J = [-I -r1_skew I r2_skew]\n\t// [ 0 -1 0 1]\n\t// r_skew = [-ry; rx]\n\n\t// Matlab\n\t// K = [ mA+r1y^2*iA+mB+r2y^2*iB, -r1y*iA*r1x-r2y*iB*r2x, -r1y*iA-r2y*iB]\n\t// [ -r1y*iA*r1x-r2y*iB*r2x, mA+r1x^2*iA+mB+r2x^2*iB, r1x*iA+r2x*iB]\n\t// [ -r1y*iA-r2y*iB, r1x*iA+r2x*iB, iA+iB]\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Mat33 K;\n\tK.ex.x = mA + mB + m_rA.y * m_rA.y * iA + m_rB.y * m_rB.y * iB;\n\tK.ey.x = -m_rA.y * m_rA.x * iA - m_rB.y * m_rB.x * iB;\n\tK.ez.x = -m_rA.y * iA - m_rB.y * iB;\n\tK.ex.y = K.ey.x;\n\tK.ey.y = mA + mB + m_rA.x * m_rA.x * iA + m_rB.x * m_rB.x * iB;\n\tK.ez.y = m_rA.x * iA + m_rB.x * iB;\n\tK.ex.z = K.ez.x;\n\tK.ey.z = K.ez.y;\n\tK.ez.z = iA + iB;\n\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\tK.GetInverse22(&m_mass);\n\n\t\tfloat32 invM = iA + iB;\n\t\tfloat32 m = invM > 0.0f ? 1.0f / invM : 0.0f;\n\n\t\tfloat32 C = aB - aA - m_referenceAngle;\n\n\t\t// Frequency\n\t\tfloat32 omega = 2.0f * b2_pi * m_frequencyHz;\n\n\t\t// Damping coefficient\n\t\tfloat32 d = 2.0f * m * m_dampingRatio * omega;\n\n\t\t// Spring stiffness\n\t\tfloat32 k = m * omega * omega;\n\n\t\t// magic formulas\n\t\tfloat32 h = data.step.dt;\n\t\tm_gamma = h * (d + h * k);\n\t\tm_gamma = m_gamma != 0.0f ? 1.0f / m_gamma : 0.0f;\n\t\tm_bias = C * h * k * m_gamma;\n\n\t\tinvM += m_gamma;\n\t\tm_mass.ez.z = invM != 0.0f ? 1.0f / invM : 0.0f;\n\t}\n\telse\n\t{\n\t\tK.GetSymInverse33(&m_mass);\n\t\tm_gamma = 0.0f;\n\t\tm_bias = 0.0f;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Scale impulses to support a variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P(m_impulse.x, m_impulse.y);\n\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + m_impulse.z);\n\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + m_impulse.z);\n\t}\n\telse\n\t{\n\t\tm_impulse.SetZero();\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2WeldJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\tfloat32 Cdot2 = wB - wA;\n\n\t\tfloat32 impulse2 = -m_mass.ez.z * (Cdot2 + m_bias + m_gamma * m_impulse.z);\n\t\tm_impulse.z += impulse2;\n\n\t\twA -= iA * impulse2;\n\t\twB += iB * impulse2;\n\n\t\tb2Vec2 Cdot1 = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA);\n\n\t\tb2Vec2 impulse1 = -b2Mul22(m_mass, Cdot1);\n\t\tm_impulse.x += impulse1.x;\n\t\tm_impulse.y += impulse1.y;\n\n\t\tb2Vec2 P = impulse1;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * b2Cross(m_rA, P);\n\n\t\tvB += mB * P;\n\t\twB += iB * b2Cross(m_rB, P);\n\t}\n\telse\n\t{\n\t\tb2Vec2 Cdot1 = vB + b2Cross(wB, m_rB) - vA - b2Cross(wA, m_rA);\n\t\tfloat32 Cdot2 = wB - wA;\n\t\tb2Vec3 Cdot(Cdot1.x, Cdot1.y, Cdot2);\n\n\t\tb2Vec3 impulse = -b2Mul(m_mass, Cdot);\n\t\tm_impulse += impulse;\n\n\t\tb2Vec2 P(impulse.x, impulse.y);\n\n\t\tvA -= mA * P;\n\t\twA -= iA * (b2Cross(m_rA, P) + impulse.z);\n\n\t\tvB += mB * P;\n\t\twB += iB * (b2Cross(m_rB, P) + impulse.z);\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2WeldJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\n\tfloat32 positionError, angularError;\n\n\tb2Mat33 K;\n\tK.ex.x = mA + mB + rA.y * rA.y * iA + rB.y * rB.y * iB;\n\tK.ey.x = -rA.y * rA.x * iA - rB.y * rB.x * iB;\n\tK.ez.x = -rA.y * iA - rB.y * iB;\n\tK.ex.y = K.ey.x;\n\tK.ey.y = mA + mB + rA.x * rA.x * iA + rB.x * rB.x * iB;\n\tK.ez.y = rA.x * iA + rB.x * iB;\n\tK.ex.z = K.ez.x;\n\tK.ey.z = K.ez.y;\n\tK.ez.z = iA + iB;\n\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\tb2Vec2 C1 = cB + rB - cA - rA;\n\n\t\tpositionError = C1.Length();\n\t\tangularError = 0.0f;\n\n\t\tb2Vec2 P = -K.Solve22(C1);\n\n\t\tcA -= mA * P;\n\t\taA -= iA * b2Cross(rA, P);\n\n\t\tcB += mB * P;\n\t\taB += iB * b2Cross(rB, P);\n\t}\n\telse\n\t{\n\t\tb2Vec2 C1 = cB + rB - cA - rA;\n\t\tfloat32 C2 = aB - aA - m_referenceAngle;\n\n\t\tpositionError = C1.Length();\n\t\tangularError = b2Abs(C2);\n\n\t\tb2Vec3 C(C1.x, C1.y, C2);\n\n\t\tb2Vec3 impulse = -K.Solve33(C);\n\t\tb2Vec2 P(impulse.x, impulse.y);\n\n\t\tcA -= mA * P;\n\t\taA -= iA * (b2Cross(rA, P) + impulse.z);\n\n\t\tcB += mB * P;\n\t\taB += iB * (b2Cross(rB, P) + impulse.z);\n\t}\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn positionError <= b2_linearSlop && angularError <= b2_angularSlop;\n}\n\nb2Vec2 b2WeldJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2WeldJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2WeldJoint::GetReactionForce(float32 inv_dt) const\n{\n\tb2Vec2 P(m_impulse.x, m_impulse.y);\n\treturn inv_dt * P;\n}\n\nfloat32 b2WeldJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_impulse.z;\n}\n\nvoid b2WeldJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2WeldJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.referenceAngle = %.15lef;\\n\", m_referenceAngle);\n\tb2Log(\" jd.frequencyHz = %.15lef;\\n\", m_frequencyHz);\n\tb2Log(\" jd.dampingRatio = %.15lef;\\n\", m_dampingRatio);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2WheelJoint.cpp",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2WheelJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h\"\n\n// Linear constraint (point-to-line)\n// d = pB - pA = xB + rB - xA - rA\n// C = dot(ay, d)\n// Cdot = dot(d, cross(wA, ay)) + dot(ay, vB + cross(wB, rB) - vA - cross(wA, rA))\n// = -dot(ay, vA) - dot(cross(d + rA, ay), wA) + dot(ay, vB) + dot(cross(rB, ay), vB)\n// J = [-ay, -cross(d + rA, ay), ay, cross(rB, ay)]\n\n// Spring linear constraint\n// C = dot(ax, d)\n// Cdot = = -dot(ax, vA) - dot(cross(d + rA, ax), wA) + dot(ax, vB) + dot(cross(rB, ax), vB)\n// J = [-ax -cross(d+rA, ax) ax cross(rB, ax)]\n\n// Motor rotational constraint\n// Cdot = wB - wA\n// J = [0 0 -1 0 0 1]\n\nvoid b2WheelJointDef::Initialize(b2Body* bA, b2Body* bB, const b2Vec2& anchor, const b2Vec2& axis)\n{\n\tbodyA = bA;\n\tbodyB = bB;\n\tlocalAnchorA = bodyA->GetLocalPoint(anchor);\n\tlocalAnchorB = bodyB->GetLocalPoint(anchor);\n\tlocalAxisA = bodyA->GetLocalVector(axis);\n}\n\nb2WheelJoint::b2WheelJoint(const b2WheelJointDef* def)\n: b2Joint(def)\n{\n\tm_localAnchorA = def->localAnchorA;\n\tm_localAnchorB = def->localAnchorB;\n\tm_localXAxisA = def->localAxisA;\n\tm_localYAxisA = b2Cross(1.0f, m_localXAxisA);\n\n\tm_mass = 0.0f;\n\tm_impulse = 0.0f;\n\tm_motorMass = 0.0f;\n\tm_motorImpulse = 0.0f;\n\tm_springMass = 0.0f;\n\tm_springImpulse = 0.0f;\n\n\tm_maxMotorTorque = def->maxMotorTorque;\n\tm_motorSpeed = def->motorSpeed;\n\tm_enableMotor = def->enableMotor;\n\n\tm_frequencyHz = def->frequencyHz;\n\tm_dampingRatio = def->dampingRatio;\n\n\tm_bias = 0.0f;\n\tm_gamma = 0.0f;\n\n\tm_ax.SetZero();\n\tm_ay.SetZero();\n}\n\nvoid b2WheelJoint::InitVelocityConstraints(const b2SolverData& data)\n{\n\tm_indexA = m_bodyA->m_islandIndex;\n\tm_indexB = m_bodyB->m_islandIndex;\n\tm_localCenterA = m_bodyA->m_sweep.localCenter;\n\tm_localCenterB = m_bodyB->m_sweep.localCenter;\n\tm_invMassA = m_bodyA->m_invMass;\n\tm_invMassB = m_bodyB->m_invMass;\n\tm_invIA = m_bodyA->m_invI;\n\tm_invIB = m_bodyB->m_invI;\n\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\tb2Rot qA(aA), qB(aB);\n\n\t// Compute the effective masses.\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 d = cB + rB - cA - rA;\n\n\t// Point to line constraint\n\t{\n\t\tm_ay = b2Mul(qA, m_localYAxisA);\n\t\tm_sAy = b2Cross(d + rA, m_ay);\n\t\tm_sBy = b2Cross(rB, m_ay);\n\n\t\tm_mass = mA + mB + iA * m_sAy * m_sAy + iB * m_sBy * m_sBy;\n\n\t\tif (m_mass > 0.0f)\n\t\t{\n\t\t\tm_mass = 1.0f / m_mass;\n\t\t}\n\t}\n\n\t// Spring constraint\n\tm_springMass = 0.0f;\n\tm_bias = 0.0f;\n\tm_gamma = 0.0f;\n\tif (m_frequencyHz > 0.0f)\n\t{\n\t\tm_ax = b2Mul(qA, m_localXAxisA);\n\t\tm_sAx = b2Cross(d + rA, m_ax);\n\t\tm_sBx = b2Cross(rB, m_ax);\n\n\t\tfloat32 invMass = mA + mB + iA * m_sAx * m_sAx + iB * m_sBx * m_sBx;\n\n\t\tif (invMass > 0.0f)\n\t\t{\n\t\t\tm_springMass = 1.0f / invMass;\n\n\t\t\tfloat32 C = b2Dot(d, m_ax);\n\n\t\t\t// Frequency\n\t\t\tfloat32 omega = 2.0f * b2_pi * m_frequencyHz;\n\n\t\t\t// Damping coefficient\n\t\t\tfloat32 d = 2.0f * m_springMass * m_dampingRatio * omega;\n\n\t\t\t// Spring stiffness\n\t\t\tfloat32 k = m_springMass * omega * omega;\n\n\t\t\t// magic formulas\n\t\t\tfloat32 h = data.step.dt;\n\t\t\tm_gamma = h * (d + h * k);\n\t\t\tif (m_gamma > 0.0f)\n\t\t\t{\n\t\t\t\tm_gamma = 1.0f / m_gamma;\n\t\t\t}\n\n\t\t\tm_bias = C * h * k * m_gamma;\n\n\t\t\tm_springMass = invMass + m_gamma;\n\t\t\tif (m_springMass > 0.0f)\n\t\t\t{\n\t\t\t\tm_springMass = 1.0f / m_springMass;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_springImpulse = 0.0f;\n\t}\n\n\t// Rotational motor\n\tif (m_enableMotor)\n\t{\n\t\tm_motorMass = iA + iB;\n\t\tif (m_motorMass > 0.0f)\n\t\t{\n\t\t\tm_motorMass = 1.0f / m_motorMass;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_motorMass = 0.0f;\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tif (data.step.warmStarting)\n\t{\n\t\t// Account for variable time step.\n\t\tm_impulse *= data.step.dtRatio;\n\t\tm_springImpulse *= data.step.dtRatio;\n\t\tm_motorImpulse *= data.step.dtRatio;\n\n\t\tb2Vec2 P = m_impulse * m_ay + m_springImpulse * m_ax;\n\t\tfloat32 LA = m_impulse * m_sAy + m_springImpulse * m_sAx + m_motorImpulse;\n\t\tfloat32 LB = m_impulse * m_sBy + m_springImpulse * m_sBx + m_motorImpulse;\n\n\t\tvA -= m_invMassA * P;\n\t\twA -= m_invIA * LA;\n\n\t\tvB += m_invMassB * P;\n\t\twB += m_invIB * LB;\n\t}\n\telse\n\t{\n\t\tm_impulse = 0.0f;\n\t\tm_springImpulse = 0.0f;\n\t\tm_motorImpulse = 0.0f;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nvoid b2WheelJoint::SolveVelocityConstraints(const b2SolverData& data)\n{\n\tfloat32 mA = m_invMassA, mB = m_invMassB;\n\tfloat32 iA = m_invIA, iB = m_invIB;\n\n\tb2Vec2 vA = data.velocities[m_indexA].v;\n\tfloat32 wA = data.velocities[m_indexA].w;\n\tb2Vec2 vB = data.velocities[m_indexB].v;\n\tfloat32 wB = data.velocities[m_indexB].w;\n\n\t// Solve spring constraint\n\t{\n\t\tfloat32 Cdot = b2Dot(m_ax, vB - vA) + m_sBx * wB - m_sAx * wA;\n\t\tfloat32 impulse = -m_springMass * (Cdot + m_bias + m_gamma * m_springImpulse);\n\t\tm_springImpulse += impulse;\n\n\t\tb2Vec2 P = impulse * m_ax;\n\t\tfloat32 LA = impulse * m_sAx;\n\t\tfloat32 LB = impulse * m_sBx;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\n\t// Solve rotational motor constraint\n\t{\n\t\tfloat32 Cdot = wB - wA - m_motorSpeed;\n\t\tfloat32 impulse = -m_motorMass * Cdot;\n\n\t\tfloat32 oldImpulse = m_motorImpulse;\n\t\tfloat32 maxImpulse = data.step.dt * m_maxMotorTorque;\n\t\tm_motorImpulse = b2Clamp(m_motorImpulse + impulse, -maxImpulse, maxImpulse);\n\t\timpulse = m_motorImpulse - oldImpulse;\n\n\t\twA -= iA * impulse;\n\t\twB += iB * impulse;\n\t}\n\n\t// Solve point to line constraint\n\t{\n\t\tfloat32 Cdot = b2Dot(m_ay, vB - vA) + m_sBy * wB - m_sAy * wA;\n\t\tfloat32 impulse = -m_mass * Cdot;\n\t\tm_impulse += impulse;\n\n\t\tb2Vec2 P = impulse * m_ay;\n\t\tfloat32 LA = impulse * m_sAy;\n\t\tfloat32 LB = impulse * m_sBy;\n\n\t\tvA -= mA * P;\n\t\twA -= iA * LA;\n\n\t\tvB += mB * P;\n\t\twB += iB * LB;\n\t}\n\n\tdata.velocities[m_indexA].v = vA;\n\tdata.velocities[m_indexA].w = wA;\n\tdata.velocities[m_indexB].v = vB;\n\tdata.velocities[m_indexB].w = wB;\n}\n\nbool b2WheelJoint::SolvePositionConstraints(const b2SolverData& data)\n{\n\tb2Vec2 cA = data.positions[m_indexA].c;\n\tfloat32 aA = data.positions[m_indexA].a;\n\tb2Vec2 cB = data.positions[m_indexB].c;\n\tfloat32 aB = data.positions[m_indexB].a;\n\n\tb2Rot qA(aA), qB(aB);\n\n\tb2Vec2 rA = b2Mul(qA, m_localAnchorA - m_localCenterA);\n\tb2Vec2 rB = b2Mul(qB, m_localAnchorB - m_localCenterB);\n\tb2Vec2 d = (cB - cA) + rB - rA;\n\n\tb2Vec2 ay = b2Mul(qA, m_localYAxisA);\n\n\tfloat32 sAy = b2Cross(d + rA, ay);\n\tfloat32 sBy = b2Cross(rB, ay);\n\n\tfloat32 C = b2Dot(d, ay);\n\n\tfloat32 k = m_invMassA + m_invMassB + m_invIA * m_sAy * m_sAy + m_invIB * m_sBy * m_sBy;\n\n\tfloat32 impulse;\n\tif (k != 0.0f)\n\t{\n\t\timpulse = - C / k;\n\t}\n\telse\n\t{\n\t\timpulse = 0.0f;\n\t}\n\n\tb2Vec2 P = impulse * ay;\n\tfloat32 LA = impulse * sAy;\n\tfloat32 LB = impulse * sBy;\n\n\tcA -= m_invMassA * P;\n\taA -= m_invIA * LA;\n\tcB += m_invMassB * P;\n\taB += m_invIB * LB;\n\n\tdata.positions[m_indexA].c = cA;\n\tdata.positions[m_indexA].a = aA;\n\tdata.positions[m_indexB].c = cB;\n\tdata.positions[m_indexB].a = aB;\n\n\treturn b2Abs(C) <= b2_linearSlop;\n}\n\nb2Vec2 b2WheelJoint::GetAnchorA() const\n{\n\treturn m_bodyA->GetWorldPoint(m_localAnchorA);\n}\n\nb2Vec2 b2WheelJoint::GetAnchorB() const\n{\n\treturn m_bodyB->GetWorldPoint(m_localAnchorB);\n}\n\nb2Vec2 b2WheelJoint::GetReactionForce(float32 inv_dt) const\n{\n\treturn inv_dt * (m_impulse * m_ay + m_springImpulse * m_ax);\n}\n\nfloat32 b2WheelJoint::GetReactionTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_motorImpulse;\n}\n\nfloat32 b2WheelJoint::GetJointTranslation() const\n{\n\tb2Body* bA = m_bodyA;\n\tb2Body* bB = m_bodyB;\n\n\tb2Vec2 pA = bA->GetWorldPoint(m_localAnchorA);\n\tb2Vec2 pB = bB->GetWorldPoint(m_localAnchorB);\n\tb2Vec2 d = pB - pA;\n\tb2Vec2 axis = bA->GetWorldVector(m_localXAxisA);\n\n\tfloat32 translation = b2Dot(d, axis);\n\treturn translation;\n}\n\nfloat32 b2WheelJoint::GetJointSpeed() const\n{\n\tfloat32 wA = m_bodyA->m_angularVelocity;\n\tfloat32 wB = m_bodyB->m_angularVelocity;\n\treturn wB - wA;\n}\n\nbool b2WheelJoint::IsMotorEnabled() const\n{\n\treturn m_enableMotor;\n}\n\nvoid b2WheelJoint::EnableMotor(bool flag)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_enableMotor = flag;\n}\n\nvoid b2WheelJoint::SetMotorSpeed(float32 speed)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_motorSpeed = speed;\n}\n\nvoid b2WheelJoint::SetMaxMotorTorque(float32 torque)\n{\n\tm_bodyA->SetAwake(true);\n\tm_bodyB->SetAwake(true);\n\tm_maxMotorTorque = torque;\n}\n\nfloat32 b2WheelJoint::GetMotorTorque(float32 inv_dt) const\n{\n\treturn inv_dt * m_motorImpulse;\n}\n\nvoid b2WheelJoint::Dump()\n{\n\tint32 indexA = m_bodyA->m_islandIndex;\n\tint32 indexB = m_bodyB->m_islandIndex;\n\n\tb2Log(\" b2WheelJointDef jd;\\n\");\n\tb2Log(\" jd.bodyA = bodies[%d];\\n\", indexA);\n\tb2Log(\" jd.bodyB = bodies[%d];\\n\", indexB);\n\tb2Log(\" jd.collideConnected = bool(%d);\\n\", m_collideConnected);\n\tb2Log(\" jd.localAnchorA.Set(%.15lef, %.15lef);\\n\", m_localAnchorA.x, m_localAnchorA.y);\n\tb2Log(\" jd.localAnchorB.Set(%.15lef, %.15lef);\\n\", m_localAnchorB.x, m_localAnchorB.y);\n\tb2Log(\" jd.localAxisA.Set(%.15lef, %.15lef);\\n\", m_localXAxisA.x, m_localXAxisA.y);\n\tb2Log(\" jd.enableMotor = bool(%d);\\n\", m_enableMotor);\n\tb2Log(\" jd.motorSpeed = %.15lef;\\n\", m_motorSpeed);\n\tb2Log(\" jd.maxMotorTorque = %.15lef;\\n\", m_maxMotorTorque);\n\tb2Log(\" jd.frequencyHz = %.15lef;\\n\", m_frequencyHz);\n\tb2Log(\" jd.dampingRatio = %.15lef;\\n\", m_dampingRatio);\n\tb2Log(\" joints[%d] = m_world->CreateJoint(&jd);\\n\", m_index);\n}\n"
},
{
"path": "app/src/main/cpp/b2World.cpp",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2World.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Body.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Island.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Joints/b2PulleyJoint.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ContactSolver.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2Collision.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2BroadPhase.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h\"\n#include \"isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Draw.h\"\n#include \"isEngine/ext_lib/Box2D/Common/b2Timer.h\"\n#include \n\nb2World::b2World(const b2Vec2& gravity)\n{\n\tm_destructionListener = NULL;\n\tm_debugDraw = NULL;\n\n\tm_bodyList = NULL;\n\tm_jointList = NULL;\n\n\tm_bodyCount = 0;\n\tm_jointCount = 0;\n\n\tm_warmStarting = true;\n\tm_continuousPhysics = true;\n\tm_subStepping = false;\n\n\tm_stepComplete = true;\n\n\tm_allowSleep = true;\n\tm_gravity = gravity;\n\n\tm_flags = e_clearForces;\n\n\tm_inv_dt0 = 0.0f;\n\n\tm_contactManager.m_allocator = &m_blockAllocator;\n\n\tmemset(&m_profile, 0, sizeof(b2Profile));\n}\n\nb2World::~b2World()\n{\n\t// Some shapes allocate using b2Alloc.\n\tb2Body* b = m_bodyList;\n\twhile (b)\n\t{\n\t\tb2Body* bNext = b->m_next;\n\n\t\tb2Fixture* f = b->m_fixtureList;\n\t\twhile (f)\n\t\t{\n\t\t\tb2Fixture* fNext = f->m_next;\n\t\t\tf->m_proxyCount = 0;\n\t\t\tf->Destroy(&m_blockAllocator);\n\t\t\tf = fNext;\n\t\t}\n\n\t\tb = bNext;\n\t}\n}\n\nvoid b2World::SetDestructionListener(b2DestructionListener* listener)\n{\n\tm_destructionListener = listener;\n}\n\nvoid b2World::SetContactFilter(b2ContactFilter* filter)\n{\n\tm_contactManager.m_contactFilter = filter;\n}\n\nvoid b2World::SetContactListener(b2ContactListener* listener)\n{\n\tm_contactManager.m_contactListener = listener;\n}\n\nvoid b2World::SetDebugDraw(b2Draw* debugDraw)\n{\n\tm_debugDraw = debugDraw;\n}\n\nb2Body* b2World::CreateBody(const b2BodyDef* def)\n{\n\tb2Assert(IsLocked() == false);\n\tif (IsLocked())\n\t{\n\t\treturn NULL;\n\t}\n\n\tvoid* mem = m_blockAllocator.Allocate(sizeof(b2Body));\n\tb2Body* b = new (mem) b2Body(def, this);\n\n\t// Add to world doubly linked list.\n\tb->m_prev = NULL;\n\tb->m_next = m_bodyList;\n\tif (m_bodyList)\n\t{\n\t\tm_bodyList->m_prev = b;\n\t}\n\tm_bodyList = b;\n\t++m_bodyCount;\n\n\treturn b;\n}\n\nvoid b2World::DestroyBody(b2Body* b)\n{\n\tb2Assert(m_bodyCount > 0);\n\tb2Assert(IsLocked() == false);\n\tif (IsLocked())\n\t{\n\t\treturn;\n\t}\n\n\t// Delete the attached joints.\n\tb2JointEdge* je = b->m_jointList;\n\twhile (je)\n\t{\n\t\tb2JointEdge* je0 = je;\n\t\tje = je->next;\n\n\t\tif (m_destructionListener)\n\t\t{\n\t\t\tm_destructionListener->SayGoodbye(je0->joint);\n\t\t}\n\n\t\tDestroyJoint(je0->joint);\n\n\t\tb->m_jointList = je;\n\t}\n\tb->m_jointList = NULL;\n\n\t// Delete the attached contacts.\n\tb2ContactEdge* ce = b->m_contactList;\n\twhile (ce)\n\t{\n\t\tb2ContactEdge* ce0 = ce;\n\t\tce = ce->next;\n\t\tm_contactManager.Destroy(ce0->contact);\n\t}\n\tb->m_contactList = NULL;\n\n\t// Delete the attached fixtures. This destroys broad-phase proxies.\n\tb2Fixture* f = b->m_fixtureList;\n\twhile (f)\n\t{\n\t\tb2Fixture* f0 = f;\n\t\tf = f->m_next;\n\n\t\tif (m_destructionListener)\n\t\t{\n\t\t\tm_destructionListener->SayGoodbye(f0);\n\t\t}\n\n\t\tf0->DestroyProxies(&m_contactManager.m_broadPhase);\n\t\tf0->Destroy(&m_blockAllocator);\n\t\tf0->~b2Fixture();\n\t\tm_blockAllocator.Free(f0, sizeof(b2Fixture));\n\n\t\tb->m_fixtureList = f;\n\t\tb->m_fixtureCount -= 1;\n\t}\n\tb->m_fixtureList = NULL;\n\tb->m_fixtureCount = 0;\n\n\t// Remove world body list.\n\tif (b->m_prev)\n\t{\n\t\tb->m_prev->m_next = b->m_next;\n\t}\n\n\tif (b->m_next)\n\t{\n\t\tb->m_next->m_prev = b->m_prev;\n\t}\n\n\tif (b == m_bodyList)\n\t{\n\t\tm_bodyList = b->m_next;\n\t}\n\n\t--m_bodyCount;\n\tb->~b2Body();\n\tm_blockAllocator.Free(b, sizeof(b2Body));\n}\n\nb2Joint* b2World::CreateJoint(const b2JointDef* def)\n{\n\tb2Assert(IsLocked() == false);\n\tif (IsLocked())\n\t{\n\t\treturn NULL;\n\t}\n\n\tb2Joint* j = b2Joint::Create(def, &m_blockAllocator);\n\n\t// Connect to the world list.\n\tj->m_prev = NULL;\n\tj->m_next = m_jointList;\n\tif (m_jointList)\n\t{\n\t\tm_jointList->m_prev = j;\n\t}\n\tm_jointList = j;\n\t++m_jointCount;\n\n\t// Connect to the bodies' doubly linked lists.\n\tj->m_edgeA.joint = j;\n\tj->m_edgeA.other = j->m_bodyB;\n\tj->m_edgeA.prev = NULL;\n\tj->m_edgeA.next = j->m_bodyA->m_jointList;\n\tif (j->m_bodyA->m_jointList) j->m_bodyA->m_jointList->prev = &j->m_edgeA;\n\tj->m_bodyA->m_jointList = &j->m_edgeA;\n\n\tj->m_edgeB.joint = j;\n\tj->m_edgeB.other = j->m_bodyA;\n\tj->m_edgeB.prev = NULL;\n\tj->m_edgeB.next = j->m_bodyB->m_jointList;\n\tif (j->m_bodyB->m_jointList) j->m_bodyB->m_jointList->prev = &j->m_edgeB;\n\tj->m_bodyB->m_jointList = &j->m_edgeB;\n\n\tb2Body* bodyA = def->bodyA;\n\tb2Body* bodyB = def->bodyB;\n\n\t// If the joint prevents collisions, then flag any contacts for filtering.\n\tif (def->collideConnected == false)\n\t{\n\t\tb2ContactEdge* edge = bodyB->GetContactList();\n\t\twhile (edge)\n\t\t{\n\t\t\tif (edge->other == bodyA)\n\t\t\t{\n\t\t\t\t// Flag the contact for filtering at the next time step (where either\n\t\t\t\t// body is awake).\n\t\t\t\tedge->contact->FlagForFiltering();\n\t\t\t}\n\n\t\t\tedge = edge->next;\n\t\t}\n\t}\n\n\t// Note: creating a joint doesn't wake the bodies.\n\n\treturn j;\n}\n\nvoid b2World::DestroyJoint(b2Joint* j)\n{\n\tb2Assert(IsLocked() == false);\n\tif (IsLocked())\n\t{\n\t\treturn;\n\t}\n\n\tbool collideConnected = j->m_collideConnected;\n\n\t// Remove from the doubly linked list.\n\tif (j->m_prev)\n\t{\n\t\tj->m_prev->m_next = j->m_next;\n\t}\n\n\tif (j->m_next)\n\t{\n\t\tj->m_next->m_prev = j->m_prev;\n\t}\n\n\tif (j == m_jointList)\n\t{\n\t\tm_jointList = j->m_next;\n\t}\n\n\t// Disconnect from island graph.\n\tb2Body* bodyA = j->m_bodyA;\n\tb2Body* bodyB = j->m_bodyB;\n\n\t// Wake up connected bodies.\n\tbodyA->SetAwake(true);\n\tbodyB->SetAwake(true);\n\n\t// Remove from body 1.\n\tif (j->m_edgeA.prev)\n\t{\n\t\tj->m_edgeA.prev->next = j->m_edgeA.next;\n\t}\n\n\tif (j->m_edgeA.next)\n\t{\n\t\tj->m_edgeA.next->prev = j->m_edgeA.prev;\n\t}\n\n\tif (&j->m_edgeA == bodyA->m_jointList)\n\t{\n\t\tbodyA->m_jointList = j->m_edgeA.next;\n\t}\n\n\tj->m_edgeA.prev = NULL;\n\tj->m_edgeA.next = NULL;\n\n\t// Remove from body 2\n\tif (j->m_edgeB.prev)\n\t{\n\t\tj->m_edgeB.prev->next = j->m_edgeB.next;\n\t}\n\n\tif (j->m_edgeB.next)\n\t{\n\t\tj->m_edgeB.next->prev = j->m_edgeB.prev;\n\t}\n\n\tif (&j->m_edgeB == bodyB->m_jointList)\n\t{\n\t\tbodyB->m_jointList = j->m_edgeB.next;\n\t}\n\n\tj->m_edgeB.prev = NULL;\n\tj->m_edgeB.next = NULL;\n\n\tb2Joint::Destroy(j, &m_blockAllocator);\n\n\tb2Assert(m_jointCount > 0);\n\t--m_jointCount;\n\n\t// If the joint prevents collisions, then flag any contacts for filtering.\n\tif (collideConnected == false)\n\t{\n\t\tb2ContactEdge* edge = bodyB->GetContactList();\n\t\twhile (edge)\n\t\t{\n\t\t\tif (edge->other == bodyA)\n\t\t\t{\n\t\t\t\t// Flag the contact for filtering at the next time step (where either\n\t\t\t\t// body is awake).\n\t\t\t\tedge->contact->FlagForFiltering();\n\t\t\t}\n\n\t\t\tedge = edge->next;\n\t\t}\n\t}\n}\n\n//\nvoid b2World::SetAllowSleeping(bool flag)\n{\n\tif (flag == m_allowSleep)\n\t{\n\t\treturn;\n\t}\n\n\tm_allowSleep = flag;\n\tif (m_allowSleep == false)\n\t{\n\t\tfor (b2Body* b = m_bodyList; b; b = b->m_next)\n\t\t{\n\t\t\tb->SetAwake(true);\n\t\t}\n\t}\n}\n\n// Find islands, integrate and solve constraints, solve position constraints\nvoid b2World::Solve(const b2TimeStep& step)\n{\n\tm_profile.solveInit = 0.0f;\n\tm_profile.solveVelocity = 0.0f;\n\tm_profile.solvePosition = 0.0f;\n\n\t// Size the island for the worst case.\n\tb2Island island(m_bodyCount,\n\t\t\t\t\tm_contactManager.m_contactCount,\n\t\t\t\t\tm_jointCount,\n\t\t\t\t\t&m_stackAllocator,\n\t\t\t\t\tm_contactManager.m_contactListener);\n\n\t// Clear all the island flags.\n\tfor (b2Body* b = m_bodyList; b; b = b->m_next)\n\t{\n\t\tb->m_flags &= ~b2Body::e_islandFlag;\n\t}\n\tfor (b2Contact* c = m_contactManager.m_contactList; c; c = c->m_next)\n\t{\n\t\tc->m_flags &= ~b2Contact::e_islandFlag;\n\t}\n\tfor (b2Joint* j = m_jointList; j; j = j->m_next)\n\t{\n\t\tj->m_islandFlag = false;\n\t}\n\n\t// Build and simulate all awake islands.\n\tint32 stackSize = m_bodyCount;\n\tb2Body** stack = (b2Body**)m_stackAllocator.Allocate(stackSize * sizeof(b2Body*));\n\tfor (b2Body* seed = m_bodyList; seed; seed = seed->m_next)\n\t{\n\t\tif (seed->m_flags & b2Body::e_islandFlag)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (seed->IsAwake() == false || seed->IsActive() == false)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t// The seed can be dynamic or kinematic.\n\t\tif (seed->GetType() == b2_staticBody)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Reset island and stack.\n\t\tisland.Clear();\n\t\tint32 stackCount = 0;\n\t\tstack[stackCount++] = seed;\n\t\tseed->m_flags |= b2Body::e_islandFlag;\n\n\t\t// Perform a depth first search (DFS) on the constraint graph.\n\t\twhile (stackCount > 0)\n\t\t{\n\t\t\t// Grab the next body off the stack and add it to the island.\n\t\t\tb2Body* b = stack[--stackCount];\n\t\t\tb2Assert(b->IsActive() == true);\n\t\t\tisland.Add(b);\n\n\t\t\t// Make sure the body is awake.\n\t\t\tb->SetAwake(true);\n\n\t\t\t// To keep islands as small as possible, we don't\n\t\t\t// propagate islands across static bodies.\n\t\t\tif (b->GetType() == b2_staticBody)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Search all contacts connected to this body.\n\t\t\tfor (b2ContactEdge* ce = b->m_contactList; ce; ce = ce->next)\n\t\t\t{\n\t\t\t\tb2Contact* contact = ce->contact;\n\n\t\t\t\t// Has this contact already been added to an island?\n\t\t\t\tif (contact->m_flags & b2Contact::e_islandFlag)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t// Is this contact solid and touching?\n\t\t\t\tif (contact->IsEnabled() == false ||\n\t\t\t\t\tcontact->IsTouching() == false)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t// Skip sensors.\n\t\t\t\tbool sensorA = contact->m_fixtureA->m_isSensor;\n\t\t\t\tbool sensorB = contact->m_fixtureB->m_isSensor;\n\t\t\t\tif (sensorA || sensorB)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tisland.Add(contact);\n\t\t\t\tcontact->m_flags |= b2Contact::e_islandFlag;\n\n\t\t\t\tb2Body* other = ce->other;\n\n\t\t\t\t// Was the other body already added to this island?\n\t\t\t\tif (other->m_flags & b2Body::e_islandFlag)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tb2Assert(stackCount < stackSize);\n\t\t\t\tstack[stackCount++] = other;\n\t\t\t\tother->m_flags |= b2Body::e_islandFlag;\n\t\t\t}\n\n\t\t\t// Search all joints connect to this body.\n\t\t\tfor (b2JointEdge* je = b->m_jointList; je; je = je->next)\n\t\t\t{\n\t\t\t\tif (je->joint->m_islandFlag == true)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tb2Body* other = je->other;\n\n\t\t\t\t// Don't simulate joints connected to inactive bodies.\n\t\t\t\tif (other->IsActive() == false)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tisland.Add(je->joint);\n\t\t\t\tje->joint->m_islandFlag = true;\n\n\t\t\t\tif (other->m_flags & b2Body::e_islandFlag)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tb2Assert(stackCount < stackSize);\n\t\t\t\tstack[stackCount++] = other;\n\t\t\t\tother->m_flags |= b2Body::e_islandFlag;\n\t\t\t}\n\t\t}\n\n\t\tb2Profile profile;\n\t\tisland.Solve(&profile, step, m_gravity, m_allowSleep);\n\t\tm_profile.solveInit += profile.solveInit;\n\t\tm_profile.solveVelocity += profile.solveVelocity;\n\t\tm_profile.solvePosition += profile.solvePosition;\n\n\t\t// Post solve cleanup.\n\t\tfor (int32 i = 0; i < island.m_bodyCount; ++i)\n\t\t{\n\t\t\t// Allow static bodies to participate in other islands.\n\t\t\tb2Body* b = island.m_bodies[i];\n\t\t\tif (b->GetType() == b2_staticBody)\n\t\t\t{\n\t\t\t\tb->m_flags &= ~b2Body::e_islandFlag;\n\t\t\t}\n\t\t}\n\t}\n\n\tm_stackAllocator.Free(stack);\n\n\t{\n\t\tb2Timer timer;\n\t\t// Synchronize fixtures, check for out of range bodies.\n\t\tfor (b2Body* b = m_bodyList; b; b = b->GetNext())\n\t\t{\n\t\t\t// If a body was not in an island then it did not move.\n\t\t\tif ((b->m_flags & b2Body::e_islandFlag) == 0)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (b->GetType() == b2_staticBody)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Update fixtures (for broad-phase).\n\t\t\tb->SynchronizeFixtures();\n\t\t}\n\n\t\t// Look for new contacts.\n\t\tm_contactManager.FindNewContacts();\n\t\tm_profile.broadphase = timer.GetMilliseconds();\n\t}\n}\n\n// Find TOI contacts and solve them.\nvoid b2World::SolveTOI(const b2TimeStep& step)\n{\n\tb2Island island(2 * b2_maxTOIContacts, b2_maxTOIContacts, 0, &m_stackAllocator, m_contactManager.m_contactListener);\n\n\tif (m_stepComplete)\n\t{\n\t\tfor (b2Body* b = m_bodyList; b; b = b->m_next)\n\t\t{\n\t\t\tb->m_flags &= ~b2Body::e_islandFlag;\n\t\t\tb->m_sweep.alpha0 = 0.0f;\n\t\t}\n\n\t\tfor (b2Contact* c = m_contactManager.m_contactList; c; c = c->m_next)\n\t\t{\n\t\t\t// Invalidate TOI\n\t\t\tc->m_flags &= ~(b2Contact::e_toiFlag | b2Contact::e_islandFlag);\n\t\t\tc->m_toiCount = 0;\n\t\t\tc->m_toi = 1.0f;\n\t\t}\n\t}\n\n\t// Find TOI events and solve them.\n\tfor (;;)\n\t{\n\t\t// Find the first TOI.\n\t\tb2Contact* minContact = NULL;\n\t\tfloat32 minAlpha = 1.0f;\n\n\t\tfor (b2Contact* c = m_contactManager.m_contactList; c; c = c->m_next)\n\t\t{\n\t\t\t// Is this contact disabled?\n\t\t\tif (c->IsEnabled() == false)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Prevent excessive sub-stepping.\n\t\t\tif (c->m_toiCount > b2_maxSubSteps)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfloat32 alpha = 1.0f;\n\t\t\tif (c->m_flags & b2Contact::e_toiFlag)\n\t\t\t{\n\t\t\t\t// This contact has a valid cached TOI.\n\t\t\t\talpha = c->m_toi;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb2Fixture* fA = c->GetFixtureA();\n\t\t\t\tb2Fixture* fB = c->GetFixtureB();\n\n\t\t\t\t// Is there a sensor?\n\t\t\t\tif (fA->IsSensor() || fB->IsSensor())\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tb2Body* bA = fA->GetBody();\n\t\t\t\tb2Body* bB = fB->GetBody();\n\n\t\t\t\tb2BodyType typeA = bA->m_type;\n\t\t\t\tb2BodyType typeB = bB->m_type;\n\t\t\t\tb2Assert(typeA == b2_dynamicBody || typeB == b2_dynamicBody);\n\n\t\t\t\tbool activeA = bA->IsAwake() && typeA != b2_staticBody;\n\t\t\t\tbool activeB = bB->IsAwake() && typeB != b2_staticBody;\n\n\t\t\t\t// Is at least one body active (awake and dynamic or kinematic)?\n\t\t\t\tif (activeA == false && activeB == false)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tbool collideA = bA->IsBullet() || typeA != b2_dynamicBody;\n\t\t\t\tbool collideB = bB->IsBullet() || typeB != b2_dynamicBody;\n\n\t\t\t\t// Are these two non-bullet dynamic bodies?\n\t\t\t\tif (collideA == false && collideB == false)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t// Compute the TOI for this contact.\n\t\t\t\t// Put the sweeps onto the same time interval.\n\t\t\t\tfloat32 alpha0 = bA->m_sweep.alpha0;\n\n\t\t\t\tif (bA->m_sweep.alpha0 < bB->m_sweep.alpha0)\n\t\t\t\t{\n\t\t\t\t\talpha0 = bB->m_sweep.alpha0;\n\t\t\t\t\tbA->m_sweep.Advance(alpha0);\n\t\t\t\t}\n\t\t\t\telse if (bB->m_sweep.alpha0 < bA->m_sweep.alpha0)\n\t\t\t\t{\n\t\t\t\t\talpha0 = bA->m_sweep.alpha0;\n\t\t\t\t\tbB->m_sweep.Advance(alpha0);\n\t\t\t\t}\n\n\t\t\t\tb2Assert(alpha0 < 1.0f);\n\n\t\t\t\tint32 indexA = c->GetChildIndexA();\n\t\t\t\tint32 indexB = c->GetChildIndexB();\n\n\t\t\t\t// Compute the time of impact in interval [0, minTOI]\n\t\t\t\tb2TOIInput input;\n\t\t\t\tinput.proxyA.Set(fA->GetShape(), indexA);\n\t\t\t\tinput.proxyB.Set(fB->GetShape(), indexB);\n\t\t\t\tinput.sweepA = bA->m_sweep;\n\t\t\t\tinput.sweepB = bB->m_sweep;\n\t\t\t\tinput.tMax = 1.0f;\n\n\t\t\t\tb2TOIOutput output;\n\t\t\t\tb2TimeOfImpact(&output, &input);\n\n\t\t\t\t// Beta is the fraction of the remaining portion of the .\n\t\t\t\tfloat32 beta = output.t;\n\t\t\t\tif (output.state == b2TOIOutput::e_touching)\n\t\t\t\t{\n\t\t\t\t\talpha = b2Min(alpha0 + (1.0f - alpha0) * beta, 1.0f);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\talpha = 1.0f;\n\t\t\t\t}\n\n\t\t\t\tc->m_toi = alpha;\n\t\t\t\tc->m_flags |= b2Contact::e_toiFlag;\n\t\t\t}\n\n\t\t\tif (alpha < minAlpha)\n\t\t\t{\n\t\t\t\t// This is the minimum TOI found so far.\n\t\t\t\tminContact = c;\n\t\t\t\tminAlpha = alpha;\n\t\t\t}\n\t\t}\n\n\t\tif (minContact == NULL || 1.0f - 10.0f * b2_epsilon < minAlpha)\n\t\t{\n\t\t\t// No more TOI events. Done!\n\t\t\tm_stepComplete = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t// Advance the bodies to the TOI.\n\t\tb2Fixture* fA = minContact->GetFixtureA();\n\t\tb2Fixture* fB = minContact->GetFixtureB();\n\t\tb2Body* bA = fA->GetBody();\n\t\tb2Body* bB = fB->GetBody();\n\n\t\tb2Sweep backup1 = bA->m_sweep;\n\t\tb2Sweep backup2 = bB->m_sweep;\n\n\t\tbA->Advance(minAlpha);\n\t\tbB->Advance(minAlpha);\n\n\t\t// The TOI contact likely has some new contact points.\n\t\tminContact->Update(m_contactManager.m_contactListener);\n\t\tminContact->m_flags &= ~b2Contact::e_toiFlag;\n\t\t++minContact->m_toiCount;\n\n\t\t// Is the contact solid?\n\t\tif (minContact->IsEnabled() == false || minContact->IsTouching() == false)\n\t\t{\n\t\t\t// Restore the sweeps.\n\t\t\tminContact->SetEnabled(false);\n\t\t\tbA->m_sweep = backup1;\n\t\t\tbB->m_sweep = backup2;\n\t\t\tbA->SynchronizeTransform();\n\t\t\tbB->SynchronizeTransform();\n\t\t\tcontinue;\n\t\t}\n\n\t\tbA->SetAwake(true);\n\t\tbB->SetAwake(true);\n\n\t\t// Build the island\n\t\tisland.Clear();\n\t\tisland.Add(bA);\n\t\tisland.Add(bB);\n\t\tisland.Add(minContact);\n\n\t\tbA->m_flags |= b2Body::e_islandFlag;\n\t\tbB->m_flags |= b2Body::e_islandFlag;\n\t\tminContact->m_flags |= b2Contact::e_islandFlag;\n\n\t\t// Get contacts on bodyA and bodyB.\n\t\tb2Body* bodies[2] = {bA, bB};\n\t\tfor (int32 i = 0; i < 2; ++i)\n\t\t{\n\t\t\tb2Body* body = bodies[i];\n\t\t\tif (body->m_type == b2_dynamicBody)\n\t\t\t{\n\t\t\t\tfor (b2ContactEdge* ce = body->m_contactList; ce; ce = ce->next)\n\t\t\t\t{\n\t\t\t\t\tif (island.m_bodyCount == island.m_bodyCapacity)\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (island.m_contactCount == island.m_contactCapacity)\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tb2Contact* contact = ce->contact;\n\n\t\t\t\t\t// Has this contact already been added to the island?\n\t\t\t\t\tif (contact->m_flags & b2Contact::e_islandFlag)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Only add static, kinematic, or bullet bodies.\n\t\t\t\t\tb2Body* other = ce->other;\n\t\t\t\t\tif (other->m_type == b2_dynamicBody &&\n\t\t\t\t\t\tbody->IsBullet() == false && other->IsBullet() == false)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Skip sensors.\n\t\t\t\t\tbool sensorA = contact->m_fixtureA->m_isSensor;\n\t\t\t\t\tbool sensorB = contact->m_fixtureB->m_isSensor;\n\t\t\t\t\tif (sensorA || sensorB)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Tentatively advance the body to the TOI.\n\t\t\t\t\tb2Sweep backup = other->m_sweep;\n\t\t\t\t\tif ((other->m_flags & b2Body::e_islandFlag) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tother->Advance(minAlpha);\n\t\t\t\t\t}\n\n\t\t\t\t\t// Update the contact points\n\t\t\t\t\tcontact->Update(m_contactManager.m_contactListener);\n\n\t\t\t\t\t// Was the contact disabled by the user?\n\t\t\t\t\tif (contact->IsEnabled() == false)\n\t\t\t\t\t{\n\t\t\t\t\t\tother->m_sweep = backup;\n\t\t\t\t\t\tother->SynchronizeTransform();\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Are there contact points?\n\t\t\t\t\tif (contact->IsTouching() == false)\n\t\t\t\t\t{\n\t\t\t\t\t\tother->m_sweep = backup;\n\t\t\t\t\t\tother->SynchronizeTransform();\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Add the contact to the island\n\t\t\t\t\tcontact->m_flags |= b2Contact::e_islandFlag;\n\t\t\t\t\tisland.Add(contact);\n\n\t\t\t\t\t// Has the other body already been added to the island?\n\t\t\t\t\tif (other->m_flags & b2Body::e_islandFlag)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Add the other body to the island.\n\t\t\t\t\tother->m_flags |= b2Body::e_islandFlag;\n\n\t\t\t\t\tif (other->m_type != b2_staticBody)\n\t\t\t\t\t{\n\t\t\t\t\t\tother->SetAwake(true);\n\t\t\t\t\t}\n\n\t\t\t\t\tisland.Add(other);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tb2TimeStep subStep;\n\t\tsubStep.dt = (1.0f - minAlpha) * step.dt;\n\t\tsubStep.inv_dt = 1.0f / subStep.dt;\n\t\tsubStep.dtRatio = 1.0f;\n\t\tsubStep.positionIterations = 20;\n\t\tsubStep.velocityIterations = step.velocityIterations;\n\t\tsubStep.warmStarting = false;\n\t\tisland.SolveTOI(subStep, bA->m_islandIndex, bB->m_islandIndex);\n\n\t\t// Reset island flags and synchronize broad-phase proxies.\n\t\tfor (int32 i = 0; i < island.m_bodyCount; ++i)\n\t\t{\n\t\t\tb2Body* body = island.m_bodies[i];\n\t\t\tbody->m_flags &= ~b2Body::e_islandFlag;\n\n\t\t\tif (body->m_type != b2_dynamicBody)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tbody->SynchronizeFixtures();\n\n\t\t\t// Invalidate all contact TOIs on this displaced body.\n\t\t\tfor (b2ContactEdge* ce = body->m_contactList; ce; ce = ce->next)\n\t\t\t{\n\t\t\t\tce->contact->m_flags &= ~(b2Contact::e_toiFlag | b2Contact::e_islandFlag);\n\t\t\t}\n\t\t}\n\n\t\t// Commit fixture proxy movements to the broad-phase so that new contacts are created.\n\t\t// Also, some contacts can be destroyed.\n\t\tm_contactManager.FindNewContacts();\n\n\t\tif (m_subStepping)\n\t\t{\n\t\t\tm_stepComplete = false;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid b2World::Step(float32 dt, int32 velocityIterations, int32 positionIterations)\n{\n\tb2Timer stepTimer;\n\n\t// If new fixtures were added, we need to find the new contacts.\n\tif (m_flags & e_newFixture)\n\t{\n\t\tm_contactManager.FindNewContacts();\n\t\tm_flags &= ~e_newFixture;\n\t}\n\n\tm_flags |= e_locked;\n\n\tb2TimeStep step;\n\tstep.dt = dt;\n\tstep.velocityIterations\t= velocityIterations;\n\tstep.positionIterations = positionIterations;\n\tif (dt > 0.0f)\n\t{\n\t\tstep.inv_dt = 1.0f / dt;\n\t}\n\telse\n\t{\n\t\tstep.inv_dt = 0.0f;\n\t}\n\n\tstep.dtRatio = m_inv_dt0 * dt;\n\n\tstep.warmStarting = m_warmStarting;\n\n\t// Update contacts. This is where some contacts are destroyed.\n\t{\n\t\tb2Timer timer;\n\t\tm_contactManager.Collide();\n\t\tm_profile.collide = timer.GetMilliseconds();\n\t}\n\n\t// Integrate velocities, solve velocity constraints, and integrate positions.\n\tif (m_stepComplete && step.dt > 0.0f)\n\t{\n\t\tb2Timer timer;\n\t\tSolve(step);\n\t\tm_profile.solve = timer.GetMilliseconds();\n\t}\n\n\t// Handle TOI events.\n\tif (m_continuousPhysics && step.dt > 0.0f)\n\t{\n\t\tb2Timer timer;\n\t\tSolveTOI(step);\n\t\tm_profile.solveTOI = timer.GetMilliseconds();\n\t}\n\n\tif (step.dt > 0.0f)\n\t{\n\t\tm_inv_dt0 = step.inv_dt;\n\t}\n\n\tif (m_flags & e_clearForces)\n\t{\n\t\tClearForces();\n\t}\n\n\tm_flags &= ~e_locked;\n\n\tm_profile.step = stepTimer.GetMilliseconds();\n}\n\nvoid b2World::ClearForces()\n{\n\tfor (b2Body* body = m_bodyList; body; body = body->GetNext())\n\t{\n\t\tbody->m_force.SetZero();\n\t\tbody->m_torque = 0.0f;\n\t}\n}\n\nstruct b2WorldQueryWrapper\n{\n\tbool QueryCallback(int32 proxyId)\n\t{\n\t\tb2FixtureProxy* proxy = (b2FixtureProxy*)broadPhase->GetUserData(proxyId);\n\t\treturn callback->ReportFixture(proxy->fixture);\n\t}\n\n\tconst b2BroadPhase* broadPhase;\n\tb2QueryCallback* callback;\n};\n\nvoid b2World::QueryAABB(b2QueryCallback* callback, const b2AABB& aabb) const\n{\n\tb2WorldQueryWrapper wrapper;\n\twrapper.broadPhase = &m_contactManager.m_broadPhase;\n\twrapper.callback = callback;\n\tm_contactManager.m_broadPhase.Query(&wrapper, aabb);\n}\n\nstruct b2WorldRayCastWrapper\n{\n\tfloat32 RayCastCallback(const b2RayCastInput& input, int32 proxyId)\n\t{\n\t\tvoid* userData = broadPhase->GetUserData(proxyId);\n\t\tb2FixtureProxy* proxy = (b2FixtureProxy*)userData;\n\t\tb2Fixture* fixture = proxy->fixture;\n\t\tint32 index = proxy->childIndex;\n\t\tb2RayCastOutput output;\n\t\tbool hit = fixture->RayCast(&output, input, index);\n\n\t\tif (hit)\n\t\t{\n\t\t\tfloat32 fraction = output.fraction;\n\t\t\tb2Vec2 point = (1.0f - fraction) * input.p1 + fraction * input.p2;\n\t\t\treturn callback->ReportFixture(fixture, point, output.normal, fraction);\n\t\t}\n\n\t\treturn input.maxFraction;\n\t}\n\n\tconst b2BroadPhase* broadPhase;\n\tb2RayCastCallback* callback;\n};\n\nvoid b2World::RayCast(b2RayCastCallback* callback, const b2Vec2& point1, const b2Vec2& point2) const\n{\n\tb2WorldRayCastWrapper wrapper;\n\twrapper.broadPhase = &m_contactManager.m_broadPhase;\n\twrapper.callback = callback;\n\tb2RayCastInput input;\n\tinput.maxFraction = 1.0f;\n\tinput.p1 = point1;\n\tinput.p2 = point2;\n\tm_contactManager.m_broadPhase.RayCast(&wrapper, input);\n}\n\nvoid b2World::DrawShape(b2Fixture* fixture, const b2Transform& xf, const b2Color& color)\n{\n\tswitch (fixture->GetType())\n\t{\n\tcase b2Shape::e_circle:\n\t\t{\n\t\t\tb2CircleShape* circle = (b2CircleShape*)fixture->GetShape();\n\n\t\t\tb2Vec2 center = b2Mul(xf, circle->m_p);\n\t\t\tfloat32 radius = circle->m_radius;\n\t\t\tb2Vec2 axis = b2Mul(xf.q, b2Vec2(1.0f, 0.0f));\n\n\t\t\tm_debugDraw->DrawSolidCircle(center, radius, axis, color);\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_edge:\n\t\t{\n\t\t\tb2EdgeShape* edge = (b2EdgeShape*)fixture->GetShape();\n\t\t\tb2Vec2 v1 = b2Mul(xf, edge->m_vertex1);\n\t\t\tb2Vec2 v2 = b2Mul(xf, edge->m_vertex2);\n\t\t\tm_debugDraw->DrawSegment(v1, v2, color);\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_chain:\n\t\t{\n\t\t\tb2ChainShape* chain = (b2ChainShape*)fixture->GetShape();\n\t\t\tint32 count = chain->m_count;\n\t\t\tconst b2Vec2* vertices = chain->m_vertices;\n\n\t\t\tb2Vec2 v1 = b2Mul(xf, vertices[0]);\n\t\t\tfor (int32 i = 1; i < count; ++i)\n\t\t\t{\n\t\t\t\tb2Vec2 v2 = b2Mul(xf, vertices[i]);\n\t\t\t\tm_debugDraw->DrawSegment(v1, v2, color);\n\t\t\t\tm_debugDraw->DrawCircle(v1, 0.05f, color);\n\t\t\t\tv1 = v2;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\n\tcase b2Shape::e_polygon:\n\t\t{\n\t\t\tb2PolygonShape* poly = (b2PolygonShape*)fixture->GetShape();\n\t\t\tint32 vertexCount = poly->m_count;\n\t\t\tb2Assert(vertexCount <= b2_maxPolygonVertices);\n\t\t\tb2Vec2 vertices[b2_maxPolygonVertices];\n\n\t\t\tfor (int32 i = 0; i < vertexCount; ++i)\n\t\t\t{\n\t\t\t\tvertices[i] = b2Mul(xf, poly->m_vertices[i]);\n\t\t\t}\n\n\t\t\tm_debugDraw->DrawSolidPolygon(vertices, vertexCount, color);\n\t\t}\n\t\tbreak;\n\n default:\n break;\n\t}\n}\n\nvoid b2World::DrawJoint(b2Joint* joint)\n{\n\tb2Body* bodyA = joint->GetBodyA();\n\tb2Body* bodyB = joint->GetBodyB();\n\tconst b2Transform& xf1 = bodyA->GetTransform();\n\tconst b2Transform& xf2 = bodyB->GetTransform();\n\tb2Vec2 x1 = xf1.p;\n\tb2Vec2 x2 = xf2.p;\n\tb2Vec2 p1 = joint->GetAnchorA();\n\tb2Vec2 p2 = joint->GetAnchorB();\n\n\tb2Color color(0.5f, 0.8f, 0.8f);\n\n\tswitch (joint->GetType())\n\t{\n\tcase e_distanceJoint:\n\t\tm_debugDraw->DrawSegment(p1, p2, color);\n\t\tbreak;\n\n\tcase e_pulleyJoint:\n\t\t{\n\t\t\tb2PulleyJoint* pulley = (b2PulleyJoint*)joint;\n\t\t\tb2Vec2 s1 = pulley->GetGroundAnchorA();\n\t\t\tb2Vec2 s2 = pulley->GetGroundAnchorB();\n\t\t\tm_debugDraw->DrawSegment(s1, p1, color);\n\t\t\tm_debugDraw->DrawSegment(s2, p2, color);\n\t\t\tm_debugDraw->DrawSegment(s1, s2, color);\n\t\t}\n\t\tbreak;\n\n\tcase e_mouseJoint:\n\t\t// don't draw this\n\t\tbreak;\n\n\tdefault:\n\t\tm_debugDraw->DrawSegment(x1, p1, color);\n\t\tm_debugDraw->DrawSegment(p1, p2, color);\n\t\tm_debugDraw->DrawSegment(x2, p2, color);\n\t}\n}\n\nvoid b2World::DrawDebugData()\n{\n\tif (m_debugDraw == NULL)\n\t{\n\t\treturn;\n\t}\n\n\tuint32 flags = m_debugDraw->GetFlags();\n\n\tif (flags & b2Draw::e_shapeBit)\n\t{\n\t\tfor (b2Body* b = m_bodyList; b; b = b->GetNext())\n\t\t{\n\t\t\tconst b2Transform& xf = b->GetTransform();\n\t\t\tfor (b2Fixture* f = b->GetFixtureList(); f; f = f->GetNext())\n\t\t\t{\n\t\t\t\tif (b->IsActive() == false)\n\t\t\t\t{\n\t\t\t\t\tDrawShape(f, xf, b2Color(0.5f, 0.5f, 0.3f));\n\t\t\t\t}\n\t\t\t\telse if (b->GetType() == b2_staticBody)\n\t\t\t\t{\n\t\t\t\t\tDrawShape(f, xf, b2Color(0.5f, 0.9f, 0.5f));\n\t\t\t\t}\n\t\t\t\telse if (b->GetType() == b2_kinematicBody)\n\t\t\t\t{\n\t\t\t\t\tDrawShape(f, xf, b2Color(0.5f, 0.5f, 0.9f));\n\t\t\t\t}\n\t\t\t\telse if (b->IsAwake() == false)\n\t\t\t\t{\n\t\t\t\t\tDrawShape(f, xf, b2Color(0.6f, 0.6f, 0.6f));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tDrawShape(f, xf, b2Color(0.9f, 0.7f, 0.7f));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (flags & b2Draw::e_jointBit)\n\t{\n\t\tfor (b2Joint* j = m_jointList; j; j = j->GetNext())\n\t\t{\n\t\t\tDrawJoint(j);\n\t\t}\n\t}\n\n\tif (flags & b2Draw::e_pairBit)\n\t{\n\t\tb2Color color(0.3f, 0.9f, 0.9f);\n\t\tfor (b2Contact* c = m_contactManager.m_contactList; c; c = c->GetNext())\n\t\t{\n\t\t\t//b2Fixture* fixtureA = c->GetFixtureA();\n\t\t\t//b2Fixture* fixtureB = c->GetFixtureB();\n\n\t\t\t//b2Vec2 cA = fixtureA->GetAABB().GetCenter();\n\t\t\t//b2Vec2 cB = fixtureB->GetAABB().GetCenter();\n\n\t\t\t//m_debugDraw->DrawSegment(cA, cB, color);\n\t\t}\n\t}\n\n\tif (flags & b2Draw::e_aabbBit)\n\t{\n\t\tb2Color color(0.9f, 0.3f, 0.9f);\n\t\tb2BroadPhase* bp = &m_contactManager.m_broadPhase;\n\n\t\tfor (b2Body* b = m_bodyList; b; b = b->GetNext())\n\t\t{\n\t\t\tif (b->IsActive() == false)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (b2Fixture* f = b->GetFixtureList(); f; f = f->GetNext())\n\t\t\t{\n\t\t\t\tfor (int32 i = 0; i < f->m_proxyCount; ++i)\n\t\t\t\t{\n\t\t\t\t\tb2FixtureProxy* proxy = f->m_proxies + i;\n\t\t\t\t\tb2AABB aabb = bp->GetFatAABB(proxy->proxyId);\n\t\t\t\t\tb2Vec2 vs[4];\n\t\t\t\t\tvs[0].Set(aabb.lowerBound.x, aabb.lowerBound.y);\n\t\t\t\t\tvs[1].Set(aabb.upperBound.x, aabb.lowerBound.y);\n\t\t\t\t\tvs[2].Set(aabb.upperBound.x, aabb.upperBound.y);\n\t\t\t\t\tvs[3].Set(aabb.lowerBound.x, aabb.upperBound.y);\n\n\t\t\t\t\tm_debugDraw->DrawPolygon(vs, 4, color);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (flags & b2Draw::e_centerOfMassBit)\n\t{\n\t\tfor (b2Body* b = m_bodyList; b; b = b->GetNext())\n\t\t{\n\t\t\tb2Transform xf = b->GetTransform();\n\t\t\txf.p = b->GetWorldCenter();\n\t\t\tm_debugDraw->DrawTransform(xf);\n\t\t}\n\t}\n}\n\nint32 b2World::GetProxyCount() const\n{\n\treturn m_contactManager.m_broadPhase.GetProxyCount();\n}\n\nint32 b2World::GetTreeHeight() const\n{\n\treturn m_contactManager.m_broadPhase.GetTreeHeight();\n}\n\nint32 b2World::GetTreeBalance() const\n{\n\treturn m_contactManager.m_broadPhase.GetTreeBalance();\n}\n\nfloat32 b2World::GetTreeQuality() const\n{\n\treturn m_contactManager.m_broadPhase.GetTreeQuality();\n}\n\nvoid b2World::ShiftOrigin(const b2Vec2& newOrigin)\n{\n\tb2Assert((m_flags & e_locked) == 0);\n\tif ((m_flags & e_locked) == e_locked)\n\t{\n\t\treturn;\n\t}\n\n\tfor (b2Body* b = m_bodyList; b; b = b->m_next)\n\t{\n\t\tb->m_xf.p -= newOrigin;\n\t\tb->m_sweep.c0 -= newOrigin;\n\t\tb->m_sweep.c -= newOrigin;\n\t}\n\n\tfor (b2Joint* j = m_jointList; j; j = j->m_next)\n\t{\n\t\tj->ShiftOrigin(newOrigin);\n\t}\n\n\tm_contactManager.m_broadPhase.ShiftOrigin(newOrigin);\n}\n\nvoid b2World::Dump()\n{\n\tif ((m_flags & e_locked) == e_locked)\n\t{\n\t\treturn;\n\t}\n\n\tb2Log(\"b2Vec2 g(%.15lef, %.15lef);\\n\", m_gravity.x, m_gravity.y);\n\tb2Log(\"m_world->SetGravity(g);\\n\");\n\n\tb2Log(\"b2Body** bodies = (b2Body**)b2Alloc(%d * sizeof(b2Body*));\\n\", m_bodyCount);\n\tb2Log(\"b2Joint** joints = (b2Joint**)b2Alloc(%d * sizeof(b2Joint*));\\n\", m_jointCount);\n\tint32 i = 0;\n\tfor (b2Body* b = m_bodyList; b; b = b->m_next)\n\t{\n\t\tb->m_islandIndex = i;\n\t\tb->Dump();\n\t\t++i;\n\t}\n\n\ti = 0;\n\tfor (b2Joint* j = m_jointList; j; j = j->m_next)\n\t{\n\t\tj->m_index = i;\n\t\t++i;\n\t}\n\n\t// First pass on joints, skip gear joints.\n\tfor (b2Joint* j = m_jointList; j; j = j->m_next)\n\t{\n\t\tif (j->m_type == e_gearJoint)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tb2Log(\"{\\n\");\n\t\tj->Dump();\n\t\tb2Log(\"}\\n\");\n\t}\n\n\t// Second pass on joints, only gear joints.\n\tfor (b2Joint* j = m_jointList; j; j = j->m_next)\n\t{\n\t\tif (j->m_type != e_gearJoint)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tb2Log(\"{\\n\");\n\t\tj->Dump();\n\t\tb2Log(\"}\\n\");\n\t}\n\n\tb2Log(\"b2Free(joints);\\n\");\n\tb2Log(\"b2Free(bodies);\\n\");\n\tb2Log(\"joints = NULL;\\n\");\n\tb2Log(\"bodies = NULL;\\n\");\n}\n"
},
{
"path": "app/src/main/cpp/b2WorldCallbacks.cpp",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2WorldCallbacks.h\"\n#include \"isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h\"\n\n// Return true if contact calculations should be performed between these two shapes.\n// If you implement your own collision filter you may want to build from this implementation.\nbool b2ContactFilter::ShouldCollide(b2Fixture* fixtureA, b2Fixture* fixtureB)\n{\n\tconst b2Filter& filterA = fixtureA->GetFilterData();\n\tconst b2Filter& filterB = fixtureB->GetFilterData();\n\n\tif (filterA.groupIndex == filterB.groupIndex && filterA.groupIndex != 0)\n\t{\n\t\treturn filterA.groupIndex > 0;\n\t}\n\n\tbool collide = (filterA.maskBits & filterB.categoryBits) != 0 && (filterA.categoryBits & filterB.maskBits) != 0;\n\treturn collide;\n}\n"
},
{
"path": "app/src/main/cpp/basicSFMLmain.cpp",
"content": "#include \"isEngine/core/GameEngine.h\"\n\nnamespace is\n{\nbool GameEngine::basicSFMLmain()\n{\n////////////////////////////////////////////////////////////\n// WINDOW CREATION\n////////////////////////////////////////////////////////////\n#if defined(__ANDROID__)\n m_window.create(sf::VideoMode::getDesktopMode(), \"\");\n#else\n m_window.create(sf::VideoMode(is::GameConfig::WINDOW_WIDTH,\n is::GameConfig::WINDOW_HEIGHT),\n is::GameConfig::GAME_NAME,\n is::getWindowStyle());\n\n // load application icon\n sf::Image iconTex;\n if (!iconTex.loadFromFile(is::GameConfig::GUI_DIR + \"icon.png\")) return false;\n#if !defined (IS_ENGINE_SDL_2) && !defined(IS_ENGINE_VS)\n m_window.setIcon(32, 32, iconTex.getPixelsPtr());\n#endif\n#endif // defined\n setFPS(m_window, is::GameConfig::FPS); // set frames per second (FPS)\n sf::View m_view(sf::Vector2f(is::GameConfig::VIEW_WIDTH / 2.f, is::GameConfig::VIEW_HEIGHT / 2.f), sf::Vector2f(is::GameConfig::VIEW_WIDTH, is::GameConfig::VIEW_HEIGHT));\n m_window.setView(m_view);\n\n////////////////////////////////////////////////////////////\n// INITIALIZATION\n////////////////////////////////////////////////////////////\n\n // is::GameConfig::MUSIC_DIR, is::GameConfig::GUI_DIR, is::GameConfig::FONT_DIR\n // Are variables that return the path of resources located in the \"assets\" folder\n\n // Load music buffer\n sf::SoundBuffer musicBuffer; // Music is played in the render loop. See line 172\n is::loadSFMLSoundBuffer(musicBuffer, is::GameConfig::MUSIC_DIR + \"game_music.wav\");\n sf::Sound music(musicBuffer);\n music.play();\n\n // Load texture\n sf::Texture texture;\n is::loadSFMLTexture(texture, is::GameConfig::GUI_DIR + \"icon.png\");\n\n // Create Sprite and set Texture\n sf::Sprite image(texture);\n is::centerSFMLObj(image); // Allows to center the sprite\n image.setPosition(is::GameConfig::VIEW_WIDTH / 2.f, is::GameConfig::VIEW_HEIGHT / 2.f);\n\n // Load font\n sf::Font font;\n is::loadSFMLFont(font, is::GameConfig::FONT_DIR + \"font_system.ttf\", 16); // When you develop for the Web you must define\n // the size that the texts will have with this font\n // Create text and set font\n sf::Text text;\n text.setFont(font);\n text.setString(\"Hello World !\");\n is::centerSFMLObj(text); // Allows to center the text\n text.setPosition(is::GameConfig::VIEW_WIDTH / 2.f, 64.f);\n\n bool focus = true; // Doesn't work when you're on the web version\n\n////////////////////////////////////////////////////////////\n// RENDER LOOP //\n////////////////////////////////////////////////////////////\n// This starts the render loop. //\n// Don't touch unless you know what you're doing. //\n#if !defined(IS_ENGINE_HTML_5) //\n while (m_window.isOpen() //\n#ifdef __SWITCH__ \t\t\t //\n && appletMainLoop() \t //\n#endif \t\t\t\t\t\t //\n ) \t\t\t\t\t //\n#else //\n EM_ASM(console.log(\"Start successfully!\");, 0); //\n execMainLoop([&] //\n { //\n if (emscripten_run_script_int(\"Module.syncdone\") == 1)//\n#endif //\n { //\n////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////\n// EVENT\n////////////////////////////////////////////////////////////\n sf::Vector2i mousePosition(-1, -1); // Allows to get mouse or touch position\n // A negative value means that no position has been recorded\n sf::Event event;\n while (m_window.pollEvent(event))\n {\n switch (event.type)\n {\n case sf::Event::Closed:\n m_window.close();\n break;\n\n #if (defined(__ANDROID__) || defined(__SWITCH__))\n case sf::Event::TouchBegan:\n if (event.touch.finger == 0)\n {\n mousePosition.x = is::getCursor(m_window, 0).x;\n mousePosition.y = is::getCursor(m_window, 0).y;\n is::vibrate(100);\n }\n break;\n #else\n case sf::Event::MouseButtonPressed:\n mousePosition.x = is::getCursor(m_window).x;\n mousePosition.y = is::getCursor(m_window).y;\n break;\n #endif // defined\n\n case sf::Event::LostFocus:\n focus = false; //don't draw, if the window is not shown\n is::showLog(\"LOST FOCUS!\");\n break;\n\n case sf::Event::GainedFocus:\n focus = true; //draw if the window is shown\n is::showLog(\"GAINED FOCUS!\");\n break;\n\n default: break;\n }\n }\n\n////////////////////////////////////////////////////////////\n// UPDATE OBJECTS\n////////////////////////////////////////////////////////////\n\n if (mousePosition.x != -1 && mousePosition.y != -1) image.setPosition(mousePosition.x, mousePosition.y);\n\n////////////////////////////////////////////////////////////\n// DRAW OBJECTS\n////////////////////////////////////////////////////////////\n if (focus)\n {\n m_window.clear(sf::Color::Blue);\n m_window.draw(text);\n m_window.draw(image);\n m_window.display();\n }\n }\n\n////////////////////////////////////////////////////////////\n// Don't touch unless you know what you're doing. //\n #if defined(IS_ENGINE_HTML_5) //\n }); //\n #endif //\n////////////////////////////////////////////////////////////\n return true;\n}\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/core/ActivityController.h",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2025 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef ACTIVITYCONTROLLER_H_INCLUDED\n#define ACTIVITYCONTROLLER_H_INCLUDED\n\n#include \"../../app_src/activity/GameActivity.h\"\n\nclass ActivityController\n{\npublic:\n ActivityController(is::GameSystemExtended &gameSysExt):\n m_gameSysExt(gameSysExt)\n {\n m_gameActivity = std::make_shared(m_gameSysExt);\n }\n void update()\n {\n m_gameActivity->onUpdate();\n }\n void draw()\n {\n m_gameActivity->onDraw();\n if (m_gameActivity->m_changeActivity)\n {\n m_gameActivity.reset();\n m_gameActivity = std::make_shared(m_gameSysExt);\n }\n }\nprivate:\n is::GameSystemExtended &m_gameSysExt;\n std::shared_ptr m_gameActivity;\n};\n\n#endif // ACTIVITYCONTROLLER_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/isEngine/core/GameEngine.h",
"content": "/*\n is::Engine (Infinity Solutions Engine)\n Copyright (C) 2018-2025 Is Daouda \n\n This software is provided 'as-is', without any express or implied\n warranty. In no event will the authors be held liable for any damages\n arising from the use of this software.\n\n Permission is granted to anyone to use this software for any purpose,\n including commercial applications, and to alter it and redistribute it\n freely, subject to the following restrictions:\n\n 1. The origin of this software must not be misrepresented; you must not\n claim that you wrote the original software. If you use this software\n in a product, an acknowledgment in the product documentation would be\n appreciated but is not required.\n 2. Altered source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef GAMEENGINE_H_INCLUDED\n#define GAMEENGINE_H_INCLUDED\n\n#include \"ActivityController.h\"\n#include \n\n////////////////////////////////////////////////////////////\n// PC version code\n#if !defined(__ANDROID__)\n #if !defined(SFML_SYSTEM_LINUX) && !defined(IS_ENGINE_HTML_5) && !defined(IS_ENGINE_LINUX) && !defined(IS_ENGINE_SWITCH)\n#include \n #else\n#include \n #endif // defined\n#endif // defined\n////////////////////////////////////////////////////////////\n\nnamespace is\n{\n////////////////////////////////////////////////////////////\n/// \\brief Class to operate the entire game system\n///\n/// It allows the interconnection of different engine components\n////////////////////////////////////////////////////////////\nclass GameEngine\n{\nprivate:\n sf::RenderWindow m_window;\n is::GameSystemExtended m_gameSysExt;\n\npublic:\n GameEngine();\n\n ~GameEngine();\n\n /// Initialize game engine\n void initEngine();\n\n#if defined(IS_ENGINE_HTML_5)\n /// Allow to launch main loop\n void execMainLoop(std::function loop);\n void execMainLoop(std::function loop);\n#endif\n\n /// Starts the engine rendering loop\n bool play();\n\n ////////////////////////////////////////////////////////////\n /// \\brief Starts the SFML classic rendering loop\n ///\n /// Useful for implementing a custom rendering loop to facilitate\n /// the integration of other projects with the engine\n ////////////////////////////////////////////////////////////\n bool basicSFMLmain();\n\n /// return Render Window\n sf::RenderWindow& getRenderWindow() {return m_window;}\n};\n}\n\n#endif // GAMEENGINE_H_INCLUDED\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Box2D.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef BOX2D_H\n#define BOX2D_H\n\n/**\n\\mainpage Box2D API Documentation\n\n\\section intro_sec Getting Started\n\nFor documentation please see http://box2d.org/documentation.html\n\nFor discussion please visit http://box2d.org/forum\n*/\n\n// These include files constitute the main Box2D API\n\n#include \"Common/b2Settings.h\"\n#include \"Common/b2Draw.h\"\n#include \"Common/b2Timer.h\"\n\n#include \"Collision/Shapes/b2CircleShape.h\"\n#include \"Collision/Shapes/b2EdgeShape.h\"\n#include \"Collision/Shapes/b2ChainShape.h\"\n#include \"Collision/Shapes/b2PolygonShape.h\"\n\n#include \"Collision/b2BroadPhase.h\"\n#include \"Collision/b2Distance.h\"\n#include \"Collision/b2DynamicTree.h\"\n#include \"Collision/b2TimeOfImpact.h\"\n\n#include \"Dynamics/b2Body.h\"\n#include \"Dynamics/b2Fixture.h\"\n#include \"Dynamics/b2WorldCallbacks.h\"\n#include \"Dynamics/b2TimeStep.h\"\n#include \"Dynamics/b2World.h\"\n\n#include \"Dynamics/Contacts/b2Contact.h\"\n\n#include \"Dynamics/Joints/b2DistanceJoint.h\"\n#include \"Dynamics/Joints/b2FrictionJoint.h\"\n#include \"Dynamics/Joints/b2GearJoint.h\"\n#include \"Dynamics/Joints/b2MotorJoint.h\"\n#include \"Dynamics/Joints/b2MouseJoint.h\"\n#include \"Dynamics/Joints/b2PrismaticJoint.h\"\n#include \"Dynamics/Joints/b2PulleyJoint.h\"\n#include \"Dynamics/Joints/b2RevoluteJoint.h\"\n#include \"Dynamics/Joints/b2RopeJoint.h\"\n#include \"Dynamics/Joints/b2WeldJoint.h\"\n#include \"Dynamics/Joints/b2WheelJoint.h\"\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/Shapes/b2ChainShape.h",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CHAIN_SHAPE_H\n#define B2_CHAIN_SHAPE_H\n\n#include \"b2Shape.h\"\n\nclass b2EdgeShape;\n\n/// A chain shape is a free form sequence of line segments.\n/// The chain has two-sided collision, so you can use inside and outside collision.\n/// Therefore, you may use any winding order.\n/// Since there may be many vertices, they are allocated using b2Alloc.\n/// Connectivity information is used to create smooth collisions.\n/// WARNING: The chain will not collide properly if there are self-intersections.\nclass b2ChainShape : public b2Shape\n{\npublic:\n\tb2ChainShape();\n\n\t/// The destructor frees the vertices using b2Free.\n\t~b2ChainShape();\n\n\t/// Create a loop. This automatically adjusts connectivity.\n\t/// @param vertices an array of vertices, these are copied\n\t/// @param count the vertex count\n\tvoid CreateLoop(const b2Vec2* vertices, int32 count);\n\n\t/// Create a chain with isolated end vertices.\n\t/// @param vertices an array of vertices, these are copied\n\t/// @param count the vertex count\n\tvoid CreateChain(const b2Vec2* vertices, int32 count);\n\n\t/// Establish connectivity to a vertex that precedes the first vertex.\n\t/// Don't call this for loops.\n\tvoid SetPrevVertex(const b2Vec2& prevVertex);\n\n\t/// Establish connectivity to a vertex that follows the last vertex.\n\t/// Don't call this for loops.\n\tvoid SetNextVertex(const b2Vec2& nextVertex);\n\n\t/// Implement b2Shape. Vertices are cloned using b2Alloc.\n\tb2Shape* Clone(b2BlockAllocator* allocator) const;\n\n\t/// @see b2Shape::GetChildCount\n\tint32 GetChildCount() const;\n\n\t/// Get a child edge.\n\tvoid GetChildEdge(b2EdgeShape* edge, int32 index) const;\n\n\t/// This always return false.\n\t/// @see b2Shape::TestPoint\n\tbool TestPoint(const b2Transform& transform, const b2Vec2& p) const;\n\n\t/// Implement b2Shape.\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\tconst b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeAABB\n\tvoid ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;\n\n\t/// Chains have zero mass.\n\t/// @see b2Shape::ComputeMass\n\tvoid ComputeMass(b2MassData* massData, float32 density) const;\n\n\t/// The vertices. Owned by this class.\n\tb2Vec2* m_vertices;\n\n\t/// The vertex count.\n\tint32 m_count;\n\n\tb2Vec2 m_prevVertex, m_nextVertex;\n\tbool m_hasPrevVertex, m_hasNextVertex;\n};\n\ninline b2ChainShape::b2ChainShape()\n{\n\tm_type = e_chain;\n\tm_radius = b2_polygonRadius;\n\tm_vertices = NULL;\n\tm_count = 0;\n\tm_hasPrevVertex = false;\n\tm_hasNextVertex = false;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/Shapes/b2CircleShape.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CIRCLE_SHAPE_H\n#define B2_CIRCLE_SHAPE_H\n\n#include \"b2Shape.h\"\n\n/// A circle shape.\nclass b2CircleShape : public b2Shape\n{\npublic:\n\tb2CircleShape();\n\n\t/// Implement b2Shape.\n\tb2Shape* Clone(b2BlockAllocator* allocator) const;\n\n\t/// @see b2Shape::GetChildCount\n\tint32 GetChildCount() const;\n\n\t/// Implement b2Shape.\n\tbool TestPoint(const b2Transform& transform, const b2Vec2& p) const;\n\n\t/// Implement b2Shape.\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\tconst b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeAABB\n\tvoid ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeMass\n\tvoid ComputeMass(b2MassData* massData, float32 density) const;\n\n\t/// Get the supporting vertex index in the given direction.\n\tint32 GetSupport(const b2Vec2& d) const;\n\n\t/// Get the supporting vertex in the given direction.\n\tconst b2Vec2& GetSupportVertex(const b2Vec2& d) const;\n\n\t/// Get the vertex count.\n\tint32 GetVertexCount() const { return 1; }\n\n\t/// Get a vertex by index. Used by b2Distance.\n\tconst b2Vec2& GetVertex(int32 index) const;\n\n\t/// Position\n\tb2Vec2 m_p;\n};\n\ninline b2CircleShape::b2CircleShape()\n{\n\tm_type = e_circle;\n\tm_radius = 0.0f;\n\tm_p.SetZero();\n}\n\ninline int32 b2CircleShape::GetSupport(const b2Vec2 &d) const\n{\n\tB2_NOT_USED(d);\n\treturn 0;\n}\n\ninline const b2Vec2& b2CircleShape::GetSupportVertex(const b2Vec2 &d) const\n{\n\tB2_NOT_USED(d);\n\treturn m_p;\n}\n\ninline const b2Vec2& b2CircleShape::GetVertex(int32 index) const\n{\n\tB2_NOT_USED(index);\n\tb2Assert(index == 0);\n\treturn m_p;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/Shapes/b2EdgeShape.h",
"content": "/*\n* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_EDGE_SHAPE_H\n#define B2_EDGE_SHAPE_H\n\n#include \"b2Shape.h\"\n\n/// A line segment (edge) shape. These can be connected in chains or loops\n/// to other edge shapes. The connectivity information is used to ensure\n/// correct contact normals.\nclass b2EdgeShape : public b2Shape\n{\npublic:\n\tb2EdgeShape();\n\n\t/// Set this as an isolated edge.\n\tvoid Set(const b2Vec2& v1, const b2Vec2& v2);\n\n\t/// Implement b2Shape.\n\tb2Shape* Clone(b2BlockAllocator* allocator) const;\n\n\t/// @see b2Shape::GetChildCount\n\tint32 GetChildCount() const;\n\n\t/// @see b2Shape::TestPoint\n\tbool TestPoint(const b2Transform& transform, const b2Vec2& p) const;\n\n\t/// Implement b2Shape.\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\tconst b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeAABB\n\tvoid ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeMass\n\tvoid ComputeMass(b2MassData* massData, float32 density) const;\n\n\t/// These are the edge vertices\n\tb2Vec2 m_vertex1, m_vertex2;\n\n\t/// Optional adjacent vertices. These are used for smooth collision.\n\tb2Vec2 m_vertex0, m_vertex3;\n\tbool m_hasVertex0, m_hasVertex3;\n};\n\ninline b2EdgeShape::b2EdgeShape()\n{\n\tm_type = e_edge;\n\tm_radius = b2_polygonRadius;\n\tm_vertex0.x = 0.0f;\n\tm_vertex0.y = 0.0f;\n\tm_vertex3.x = 0.0f;\n\tm_vertex3.y = 0.0f;\n\tm_hasVertex0 = false;\n\tm_hasVertex3 = false;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/Shapes/b2PolygonShape.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_POLYGON_SHAPE_H\n#define B2_POLYGON_SHAPE_H\n\n#include \"b2Shape.h\"\n\n/// A convex polygon. It is assumed that the interior of the polygon is to\n/// the left of each edge.\n/// Polygons have a maximum number of vertices equal to b2_maxPolygonVertices.\n/// In most cases you should not need many vertices for a convex polygon.\nclass b2PolygonShape : public b2Shape\n{\npublic:\n\tb2PolygonShape();\n\n\t/// Implement b2Shape.\n\tb2Shape* Clone(b2BlockAllocator* allocator) const;\n\n\t/// @see b2Shape::GetChildCount\n\tint32 GetChildCount() const;\n\n\t/// Create a convex hull from the given array of local points.\n\t/// The count must be in the range [3, b2_maxPolygonVertices].\n\t/// @warning the points may be re-ordered, even if they form a convex polygon\n\t/// @warning collinear points are handled but not removed. Collinear points\n\t/// may lead to poor stacking behavior.\n\tvoid Set(const b2Vec2* points, int32 count);\n\n\t/// Build vertices to represent an axis-aligned box centered on the local origin.\n\t/// @param hx the half-width.\n\t/// @param hy the half-height.\n\tvoid SetAsBox(float32 hx, float32 hy);\n\n\t/// Build vertices to represent an oriented box.\n\t/// @param hx the half-width.\n\t/// @param hy the half-height.\n\t/// @param center the center of the box in local coordinates.\n\t/// @param angle the rotation of the box in local coordinates.\n\tvoid SetAsBox(float32 hx, float32 hy, const b2Vec2& center, float32 angle);\n\n\t/// @see b2Shape::TestPoint\n\tbool TestPoint(const b2Transform& transform, const b2Vec2& p) const;\n\n\t/// Implement b2Shape.\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\tconst b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeAABB\n\tvoid ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;\n\n\t/// @see b2Shape::ComputeMass\n\tvoid ComputeMass(b2MassData* massData, float32 density) const;\n\n\t/// Get the vertex count.\n\tint32 GetVertexCount() const { return m_count; }\n\n\t/// Get a vertex by index.\n\tconst b2Vec2& GetVertex(int32 index) const;\n\n\t/// Validate convexity. This is a very time consuming operation.\n\t/// @returns true if valid\n\tbool Validate() const;\n\n\tb2Vec2 m_centroid;\n\tb2Vec2 m_vertices[b2_maxPolygonVertices];\n\tb2Vec2 m_normals[b2_maxPolygonVertices];\n\tint32 m_count;\n};\n\ninline b2PolygonShape::b2PolygonShape()\n{\n\tm_type = e_polygon;\n\tm_radius = b2_polygonRadius;\n\tm_count = 0;\n\tm_centroid.SetZero();\n}\n\ninline const b2Vec2& b2PolygonShape::GetVertex(int32 index) const\n{\n\tb2Assert(0 <= index && index < m_count);\n\treturn m_vertices[index];\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/Shapes/b2Shape.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_SHAPE_H\n#define B2_SHAPE_H\n\n#include \"../../Common/b2BlockAllocator.h\"\n#include \"../../Common/b2Math.h\"\n#include \"../b2Collision.h\"\n\n/// This holds the mass data computed for a shape.\nstruct b2MassData\n{\n\t/// The mass of the shape, usually in kilograms.\n\tfloat32 mass;\n\n\t/// The position of the shape's centroid relative to the shape's origin.\n\tb2Vec2 center;\n\n\t/// The rotational inertia of the shape about the local origin.\n\tfloat32 I;\n};\n\n/// A shape is used for collision detection. You can create a shape however you like.\n/// Shapes used for simulation in b2World are created automatically when a b2Fixture\n/// is created. Shapes may encapsulate a one or more child shapes.\nclass b2Shape\n{\npublic:\n\n\tenum Type\n\t{\n\t\te_circle = 0,\n\t\te_edge = 1,\n\t\te_polygon = 2,\n\t\te_chain = 3,\n\t\te_typeCount = 4\n\t};\n\n\tvirtual ~b2Shape() {}\n\n\t/// Clone the concrete shape using the provided allocator.\n\tvirtual b2Shape* Clone(b2BlockAllocator* allocator) const = 0;\n\n\t/// Get the type of this shape. You can use this to down cast to the concrete shape.\n\t/// @return the shape type.\n\tType GetType() const;\n\n\t/// Get the number of child primitives.\n\tvirtual int32 GetChildCount() const = 0;\n\n\t/// Test a point for containment in this shape. This only works for convex shapes.\n\t/// @param xf the shape world transform.\n\t/// @param p a point in world coordinates.\n\tvirtual bool TestPoint(const b2Transform& xf, const b2Vec2& p) const = 0;\n\n\t/// Cast a ray against a child shape.\n\t/// @param output the ray-cast results.\n\t/// @param input the ray-cast input parameters.\n\t/// @param transform the transform to be applied to the shape.\n\t/// @param childIndex the child shape index\n\tvirtual bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,\n\t\t\t\t\t\tconst b2Transform& transform, int32 childIndex) const = 0;\n\n\t/// Given a transform, compute the associated axis aligned bounding box for a child shape.\n\t/// @param aabb returns the axis aligned box.\n\t/// @param xf the world transform of the shape.\n\t/// @param childIndex the child shape\n\tvirtual void ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const = 0;\n\n\t/// Compute the mass properties of this shape using its dimensions and density.\n\t/// The inertia tensor is computed about the local origin.\n\t/// @param massData returns the mass data for this shape.\n\t/// @param density the density in kilograms per meter squared.\n\tvirtual void ComputeMass(b2MassData* massData, float32 density) const = 0;\n\n\tType m_type;\n\tfloat32 m_radius;\n};\n\ninline b2Shape::Type b2Shape::GetType() const\n{\n\treturn m_type;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/b2BroadPhase.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_BROAD_PHASE_H\n#define B2_BROAD_PHASE_H\n\n#include \"../Common/b2Settings.h\"\n#include \"b2Collision.h\"\n#include \"b2DynamicTree.h\"\n#include \n\nstruct b2Pair\n{\n\tint32 proxyIdA;\n\tint32 proxyIdB;\n};\n\n/// The broad-phase is used for computing pairs and performing volume queries and ray casts.\n/// This broad-phase does not persist pairs. Instead, this reports potentially new pairs.\n/// It is up to the client to consume the new pairs and to track subsequent overlap.\nclass b2BroadPhase\n{\npublic:\n\n\tenum\n\t{\n\t\te_nullProxy = -1\n\t};\n\n\tb2BroadPhase();\n\t~b2BroadPhase();\n\n\t/// Create a proxy with an initial AABB. Pairs are not reported until\n\t/// UpdatePairs is called.\n\tint32 CreateProxy(const b2AABB& aabb, void* userData);\n\n\t/// Destroy a proxy. It is up to the client to remove any pairs.\n\tvoid DestroyProxy(int32 proxyId);\n\n\t/// Call MoveProxy as many times as you like, then when you are done\n\t/// call UpdatePairs to finalized the proxy pairs (for your time step).\n\tvoid MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement);\n\n\t/// Call to trigger a re-processing of it's pairs on the next call to UpdatePairs.\n\tvoid TouchProxy(int32 proxyId);\n\n\t/// Get the fat AABB for a proxy.\n\tconst b2AABB& GetFatAABB(int32 proxyId) const;\n\n\t/// Get user data from a proxy. Returns NULL if the id is invalid.\n\tvoid* GetUserData(int32 proxyId) const;\n\n\t/// Test overlap of fat AABBs.\n\tbool TestOverlap(int32 proxyIdA, int32 proxyIdB) const;\n\n\t/// Get the number of proxies.\n\tint32 GetProxyCount() const;\n\n\t/// Update the pairs. This results in pair callbacks. This can only add pairs.\n\ttemplate \n\tvoid UpdatePairs(T* callback);\n\n\t/// Query an AABB for overlapping proxies. The callback class\n\t/// is called for each proxy that overlaps the supplied AABB.\n\ttemplate \n\tvoid Query(T* callback, const b2AABB& aabb) const;\n\n\t/// Ray-cast against the proxies in the tree. This relies on the callback\n\t/// to perform a exact ray-cast in the case were the proxy contains a shape.\n\t/// The callback also performs the any collision filtering. This has performance\n\t/// roughly equal to k * log(n), where k is the number of collisions and n is the\n\t/// number of proxies in the tree.\n\t/// @param input the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).\n\t/// @param callback a callback class that is called for each proxy that is hit by the ray.\n\ttemplate \n\tvoid RayCast(T* callback, const b2RayCastInput& input) const;\n\n\t/// Get the height of the embedded tree.\n\tint32 GetTreeHeight() const;\n\n\t/// Get the balance of the embedded tree.\n\tint32 GetTreeBalance() const;\n\n\t/// Get the quality metric of the embedded tree.\n\tfloat32 GetTreeQuality() const;\n\n\t/// Shift the world origin. Useful for large worlds.\n\t/// The shift formula is: position -= newOrigin\n\t/// @param newOrigin the new origin with respect to the old origin\n\tvoid ShiftOrigin(const b2Vec2& newOrigin);\n\nprivate:\n\n\tfriend class b2DynamicTree;\n\n\tvoid BufferMove(int32 proxyId);\n\tvoid UnBufferMove(int32 proxyId);\n\n\tbool QueryCallback(int32 proxyId);\n\n\tb2DynamicTree m_tree;\n\n\tint32 m_proxyCount;\n\n\tint32* m_moveBuffer;\n\tint32 m_moveCapacity;\n\tint32 m_moveCount;\n\n\tb2Pair* m_pairBuffer;\n\tint32 m_pairCapacity;\n\tint32 m_pairCount;\n\n\tint32 m_queryProxyId;\n};\n\n/// This is used to sort pairs.\ninline bool b2PairLessThan(const b2Pair& pair1, const b2Pair& pair2)\n{\n\tif (pair1.proxyIdA < pair2.proxyIdA)\n\t{\n\t\treturn true;\n\t}\n\n\tif (pair1.proxyIdA == pair2.proxyIdA)\n\t{\n\t\treturn pair1.proxyIdB < pair2.proxyIdB;\n\t}\n\n\treturn false;\n}\n\ninline void* b2BroadPhase::GetUserData(int32 proxyId) const\n{\n\treturn m_tree.GetUserData(proxyId);\n}\n\ninline bool b2BroadPhase::TestOverlap(int32 proxyIdA, int32 proxyIdB) const\n{\n\tconst b2AABB& aabbA = m_tree.GetFatAABB(proxyIdA);\n\tconst b2AABB& aabbB = m_tree.GetFatAABB(proxyIdB);\n\treturn b2TestOverlap(aabbA, aabbB);\n}\n\ninline const b2AABB& b2BroadPhase::GetFatAABB(int32 proxyId) const\n{\n\treturn m_tree.GetFatAABB(proxyId);\n}\n\ninline int32 b2BroadPhase::GetProxyCount() const\n{\n\treturn m_proxyCount;\n}\n\ninline int32 b2BroadPhase::GetTreeHeight() const\n{\n\treturn m_tree.GetHeight();\n}\n\ninline int32 b2BroadPhase::GetTreeBalance() const\n{\n\treturn m_tree.GetMaxBalance();\n}\n\ninline float32 b2BroadPhase::GetTreeQuality() const\n{\n\treturn m_tree.GetAreaRatio();\n}\n\ntemplate \nvoid b2BroadPhase::UpdatePairs(T* callback)\n{\n\t// Reset pair buffer\n\tm_pairCount = 0;\n\n\t// Perform tree queries for all moving proxies.\n\tfor (int32 i = 0; i < m_moveCount; ++i)\n\t{\n\t\tm_queryProxyId = m_moveBuffer[i];\n\t\tif (m_queryProxyId == e_nullProxy)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t// We have to query the tree with the fat AABB so that\n\t\t// we don't fail to create a pair that may touch later.\n\t\tconst b2AABB& fatAABB = m_tree.GetFatAABB(m_queryProxyId);\n\n\t\t// Query tree, create pairs and add them pair buffer.\n\t\tm_tree.Query(this, fatAABB);\n\t}\n\n\t// Reset move buffer\n\tm_moveCount = 0;\n\n\t// Sort the pair buffer to expose duplicates.\n\tstd::sort(m_pairBuffer, m_pairBuffer + m_pairCount, b2PairLessThan);\n\n\t// Send the pairs back to the client.\n\tint32 i = 0;\n\twhile (i < m_pairCount)\n\t{\n\t\tb2Pair* primaryPair = m_pairBuffer + i;\n\t\tvoid* userDataA = m_tree.GetUserData(primaryPair->proxyIdA);\n\t\tvoid* userDataB = m_tree.GetUserData(primaryPair->proxyIdB);\n\n\t\tcallback->AddPair(userDataA, userDataB);\n\t\t++i;\n\n\t\t// Skip any duplicate pairs.\n\t\twhile (i < m_pairCount)\n\t\t{\n\t\t\tb2Pair* pair = m_pairBuffer + i;\n\t\t\tif (pair->proxyIdA != primaryPair->proxyIdA || pair->proxyIdB != primaryPair->proxyIdB)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++i;\n\t\t}\n\t}\n\n\t// Try to keep the tree balanced.\n\t//m_tree.Rebalance(4);\n}\n\ntemplate \ninline void b2BroadPhase::Query(T* callback, const b2AABB& aabb) const\n{\n\tm_tree.Query(callback, aabb);\n}\n\ntemplate \ninline void b2BroadPhase::RayCast(T* callback, const b2RayCastInput& input) const\n{\n\tm_tree.RayCast(callback, input);\n}\n\ninline void b2BroadPhase::ShiftOrigin(const b2Vec2& newOrigin)\n{\n\tm_tree.ShiftOrigin(newOrigin);\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/b2Collision.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_COLLISION_H\n#define B2_COLLISION_H\n\n#include \"../Common/b2Math.h\"\n#include \n\n/// @file\n/// Structures and functions used for computing contact points, distance\n/// queries, and TOI queries.\n\nclass b2Shape;\nclass b2CircleShape;\nclass b2EdgeShape;\nclass b2PolygonShape;\n\nconst uint8 b2_nullFeature = UCHAR_MAX;\n\n/// The features that intersect to form the contact point\n/// This must be 4 bytes or less.\nstruct b2ContactFeature\n{\n\tenum Type\n\t{\n\t\te_vertex = 0,\n\t\te_face = 1\n\t};\n\n\tuint8 indexA;\t\t///< Feature index on shapeA\n\tuint8 indexB;\t\t///< Feature index on shapeB\n\tuint8 typeA;\t\t///< The feature type on shapeA\n\tuint8 typeB;\t\t///< The feature type on shapeB\n};\n\n/// Contact ids to facilitate warm starting.\nunion b2ContactID\n{\n\tb2ContactFeature cf;\n\tuint32 key;\t\t\t\t\t///< Used to quickly compare contact ids.\n};\n\n/// A manifold point is a contact point belonging to a contact\n/// manifold. It holds details related to the geometry and dynamics\n/// of the contact points.\n/// The local point usage depends on the manifold type:\n/// -e_circles: the local center of circleB\n/// -e_faceA: the local center of cirlceB or the clip point of polygonB\n/// -e_faceB: the clip point of polygonA\n/// This structure is stored across time steps, so we keep it small.\n/// Note: the impulses are used for internal caching and may not\n/// provide reliable contact forces, especially for high speed collisions.\nstruct b2ManifoldPoint\n{\n\tb2Vec2 localPoint;\t\t///< usage depends on manifold type\n\tfloat32 normalImpulse;\t///< the non-penetration impulse\n\tfloat32 tangentImpulse;\t///< the friction impulse\n\tb2ContactID id;\t\t\t///< uniquely identifies a contact point between two shapes\n};\n\n/// A manifold for two touching convex shapes.\n/// Box2D supports multiple types of contact:\n/// - clip point versus plane with radius\n/// - point versus point with radius (circles)\n/// The local point usage depends on the manifold type:\n/// -e_circles: the local center of circleA\n/// -e_faceA: the center of faceA\n/// -e_faceB: the center of faceB\n/// Similarly the local normal usage:\n/// -e_circles: not used\n/// -e_faceA: the normal on polygonA\n/// -e_faceB: the normal on polygonB\n/// We store contacts in this way so that position correction can\n/// account for movement, which is critical for continuous physics.\n/// All contact scenarios must be expressed in one of these types.\n/// This structure is stored across time steps, so we keep it small.\nstruct b2Manifold\n{\n\tenum Type\n\t{\n\t\te_circles,\n\t\te_faceA,\n\t\te_faceB\n\t};\n\n\tb2ManifoldPoint points[b2_maxManifoldPoints];\t///< the points of contact\n\tb2Vec2 localNormal;\t\t\t\t\t\t\t\t///< not use for Type::e_points\n\tb2Vec2 localPoint;\t\t\t\t\t\t\t\t///< usage depends on manifold type\n\tType type;\n\tint32 pointCount;\t\t\t\t\t\t\t\t///< the number of manifold points\n};\n\n/// This is used to compute the current state of a contact manifold.\nstruct b2WorldManifold\n{\n\t/// Evaluate the manifold with supplied transforms. This assumes\n\t/// modest motion from the original state. This does not change the\n\t/// point count, impulses, etc. The radii must come from the shapes\n\t/// that generated the manifold.\n\tvoid Initialize(const b2Manifold* manifold,\n\t\t\t\t\tconst b2Transform& xfA, float32 radiusA,\n\t\t\t\t\tconst b2Transform& xfB, float32 radiusB);\n\n\tb2Vec2 normal;\t\t\t\t\t\t\t\t///< world vector pointing from A to B\n\tb2Vec2 points[b2_maxManifoldPoints];\t\t///< world contact point (point of intersection)\n\tfloat32 separations[b2_maxManifoldPoints];\t///< a negative value indicates overlap, in meters\n};\n\n/// This is used for determining the state of contact points.\nenum b2PointState\n{\n\tb2_nullState,\t\t///< point does not exist\n\tb2_addState,\t\t///< point was added in the update\n\tb2_persistState,\t///< point persisted across the update\n\tb2_removeState\t\t///< point was removed in the update\n};\n\n/// Compute the point states given two manifolds. The states pertain to the transition from manifold1\n/// to manifold2. So state1 is either persist or remove while state2 is either add or persist.\nvoid b2GetPointStates(b2PointState state1[b2_maxManifoldPoints], b2PointState state2[b2_maxManifoldPoints],\n\t\t\t\t\t const b2Manifold* manifold1, const b2Manifold* manifold2);\n\n/// Used for computing contact manifolds.\nstruct b2ClipVertex\n{\n\tb2Vec2 v;\n\tb2ContactID id;\n};\n\n/// Ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).\nstruct b2RayCastInput\n{\n\tb2Vec2 p1, p2;\n\tfloat32 maxFraction;\n};\n\n/// Ray-cast output data. The ray hits at p1 + fraction * (p2 - p1), where p1 and p2\n/// come from b2RayCastInput.\nstruct b2RayCastOutput\n{\n\tb2Vec2 normal;\n\tfloat32 fraction;\n};\n\n/// An axis aligned bounding box.\nstruct b2AABB\n{\n\t/// Verify that the bounds are sorted.\n\tbool IsValid() const;\n\n\t/// Get the center of the AABB.\n\tb2Vec2 GetCenter() const\n\t{\n\t\treturn 0.5f * (lowerBound + upperBound);\n\t}\n\n\t/// Get the extents of the AABB (half-widths).\n\tb2Vec2 GetExtents() const\n\t{\n\t\treturn 0.5f * (upperBound - lowerBound);\n\t}\n\n\t/// Get the perimeter length\n\tfloat32 GetPerimeter() const\n\t{\n\t\tfloat32 wx = upperBound.x - lowerBound.x;\n\t\tfloat32 wy = upperBound.y - lowerBound.y;\n\t\treturn 2.0f * (wx + wy);\n\t}\n\n\t/// Combine an AABB into this one.\n\tvoid Combine(const b2AABB& aabb)\n\t{\n\t\tlowerBound = b2Min(lowerBound, aabb.lowerBound);\n\t\tupperBound = b2Max(upperBound, aabb.upperBound);\n\t}\n\n\t/// Combine two AABBs into this one.\n\tvoid Combine(const b2AABB& aabb1, const b2AABB& aabb2)\n\t{\n\t\tlowerBound = b2Min(aabb1.lowerBound, aabb2.lowerBound);\n\t\tupperBound = b2Max(aabb1.upperBound, aabb2.upperBound);\n\t}\n\n\t/// Does this aabb contain the provided AABB.\n\tbool Contains(const b2AABB& aabb) const\n\t{\n\t\tbool result = true;\n\t\tresult = result && lowerBound.x <= aabb.lowerBound.x;\n\t\tresult = result && lowerBound.y <= aabb.lowerBound.y;\n\t\tresult = result && aabb.upperBound.x <= upperBound.x;\n\t\tresult = result && aabb.upperBound.y <= upperBound.y;\n\t\treturn result;\n\t}\n\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input) const;\n\n\tb2Vec2 lowerBound;\t///< the lower vertex\n\tb2Vec2 upperBound;\t///< the upper vertex\n};\n\n/// Compute the collision manifold between two circles.\nvoid b2CollideCircles(b2Manifold* manifold,\n\t\t\t\t\t const b2CircleShape* circleA, const b2Transform& xfA,\n\t\t\t\t\t const b2CircleShape* circleB, const b2Transform& xfB);\n\n/// Compute the collision manifold between a polygon and a circle.\nvoid b2CollidePolygonAndCircle(b2Manifold* manifold,\n\t\t\t\t\t\t\t const b2PolygonShape* polygonA, const b2Transform& xfA,\n\t\t\t\t\t\t\t const b2CircleShape* circleB, const b2Transform& xfB);\n\n/// Compute the collision manifold between two polygons.\nvoid b2CollidePolygons(b2Manifold* manifold,\n\t\t\t\t\t const b2PolygonShape* polygonA, const b2Transform& xfA,\n\t\t\t\t\t const b2PolygonShape* polygonB, const b2Transform& xfB);\n\n/// Compute the collision manifold between an edge and a circle.\nvoid b2CollideEdgeAndCircle(b2Manifold* manifold,\n\t\t\t\t\t\t\t const b2EdgeShape* polygonA, const b2Transform& xfA,\n\t\t\t\t\t\t\t const b2CircleShape* circleB, const b2Transform& xfB);\n\n/// Compute the collision manifold between an edge and a circle.\nvoid b2CollideEdgeAndPolygon(b2Manifold* manifold,\n\t\t\t\t\t\t\t const b2EdgeShape* edgeA, const b2Transform& xfA,\n\t\t\t\t\t\t\t const b2PolygonShape* circleB, const b2Transform& xfB);\n\n/// Clipping for contact manifolds.\nint32 b2ClipSegmentToLine(b2ClipVertex vOut[2], const b2ClipVertex vIn[2],\n\t\t\t\t\t\t\tconst b2Vec2& normal, float32 offset, int32 vertexIndexA);\n\n/// Determine if two generic shapes overlap.\nbool b2TestOverlap(\tconst b2Shape* shapeA, int32 indexA,\n\t\t\t\t\tconst b2Shape* shapeB, int32 indexB,\n\t\t\t\t\tconst b2Transform& xfA, const b2Transform& xfB);\n\n// ---------------- Inline Functions ------------------------------------------\n\ninline bool b2AABB::IsValid() const\n{\n\tb2Vec2 d = upperBound - lowerBound;\n\tbool valid = d.x >= 0.0f && d.y >= 0.0f;\n\tvalid = valid && lowerBound.IsValid() && upperBound.IsValid();\n\treturn valid;\n}\n\ninline bool b2TestOverlap(const b2AABB& a, const b2AABB& b)\n{\n\tb2Vec2 d1, d2;\n\td1 = b.lowerBound - a.upperBound;\n\td2 = a.lowerBound - b.upperBound;\n\n\tif (d1.x > 0.0f || d1.y > 0.0f)\n\t\treturn false;\n\n\tif (d2.x > 0.0f || d2.y > 0.0f)\n\t\treturn false;\n\n\treturn true;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/b2Distance.h",
"content": "\n/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_DISTANCE_H\n#define B2_DISTANCE_H\n\n#include \"../Common/b2Math.h\"\n\nclass b2Shape;\n\n/// A distance proxy is used by the GJK algorithm.\n/// It encapsulates any shape.\nstruct b2DistanceProxy\n{\n\tb2DistanceProxy() : m_vertices(NULL), m_count(0), m_radius(0.0f) {}\n\n\t/// Initialize the proxy using the given shape. The shape\n\t/// must remain in scope while the proxy is in use.\n\tvoid Set(const b2Shape* shape, int32 index);\n\n\t/// Get the supporting vertex index in the given direction.\n\tint32 GetSupport(const b2Vec2& d) const;\n\n\t/// Get the supporting vertex in the given direction.\n\tconst b2Vec2& GetSupportVertex(const b2Vec2& d) const;\n\n\t/// Get the vertex count.\n\tint32 GetVertexCount() const;\n\n\t/// Get a vertex by index. Used by b2Distance.\n\tconst b2Vec2& GetVertex(int32 index) const;\n\n\tb2Vec2 m_buffer[2];\n\tconst b2Vec2* m_vertices;\n\tint32 m_count;\n\tfloat32 m_radius;\n};\n\n/// Used to warm start b2Distance.\n/// Set count to zero on first call.\nstruct b2SimplexCache\n{\n\tfloat32 metric;\t\t///< length or area\n\tuint16 count;\n\tuint8 indexA[3];\t///< vertices on shape A\n\tuint8 indexB[3];\t///< vertices on shape B\n};\n\n/// Input for b2Distance.\n/// You have to option to use the shape radii\n/// in the computation. Even\nstruct b2DistanceInput\n{\n\tb2DistanceProxy proxyA;\n\tb2DistanceProxy proxyB;\n\tb2Transform transformA;\n\tb2Transform transformB;\n\tbool useRadii;\n};\n\n/// Output for b2Distance.\nstruct b2DistanceOutput\n{\n\tb2Vec2 pointA;\t\t///< closest point on shapeA\n\tb2Vec2 pointB;\t\t///< closest point on shapeB\n\tfloat32 distance;\n\tint32 iterations;\t///< number of GJK iterations used\n};\n\n/// Compute the closest points between two shapes. Supports any combination of:\n/// b2CircleShape, b2PolygonShape, b2EdgeShape. The simplex cache is input/output.\n/// On the first call set b2SimplexCache.count to zero.\nvoid b2Distance(b2DistanceOutput* output,\n\t\t\t\tb2SimplexCache* cache,\n\t\t\t\tconst b2DistanceInput* input);\n\n\n//////////////////////////////////////////////////////////////////////////\n\ninline int32 b2DistanceProxy::GetVertexCount() const\n{\n\treturn m_count;\n}\n\ninline const b2Vec2& b2DistanceProxy::GetVertex(int32 index) const\n{\n\tb2Assert(0 <= index && index < m_count);\n\treturn m_vertices[index];\n}\n\ninline int32 b2DistanceProxy::GetSupport(const b2Vec2& d) const\n{\n\tint32 bestIndex = 0;\n\tfloat32 bestValue = b2Dot(m_vertices[0], d);\n\tfor (int32 i = 1; i < m_count; ++i)\n\t{\n\t\tfloat32 value = b2Dot(m_vertices[i], d);\n\t\tif (value > bestValue)\n\t\t{\n\t\t\tbestIndex = i;\n\t\t\tbestValue = value;\n\t\t}\n\t}\n\n\treturn bestIndex;\n}\n\ninline const b2Vec2& b2DistanceProxy::GetSupportVertex(const b2Vec2& d) const\n{\n\tint32 bestIndex = 0;\n\tfloat32 bestValue = b2Dot(m_vertices[0], d);\n\tfor (int32 i = 1; i < m_count; ++i)\n\t{\n\t\tfloat32 value = b2Dot(m_vertices[i], d);\n\t\tif (value > bestValue)\n\t\t{\n\t\t\tbestIndex = i;\n\t\t\tbestValue = value;\n\t\t}\n\t}\n\n\treturn m_vertices[bestIndex];\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/b2DynamicTree.h",
"content": "/*\n* Copyright (c) 2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_DYNAMIC_TREE_H\n#define B2_DYNAMIC_TREE_H\n\n#include \"b2Collision.h\"\n#include \"../Common/b2GrowableStack.h\"\n\n#define b2_nullNode (-1)\n\n/// A node in the dynamic tree. The client does not interact with this directly.\nstruct b2TreeNode\n{\n\tbool IsLeaf() const\n\t{\n\t\treturn child1 == b2_nullNode;\n\t}\n\n\t/// Enlarged AABB\n\tb2AABB aabb;\n\n\tvoid* userData;\n\n\tunion\n\t{\n\t\tint32 parent;\n\t\tint32 next;\n\t};\n\n\tint32 child1;\n\tint32 child2;\n\n\t// leaf = 0, free node = -1\n\tint32 height;\n};\n\n/// A dynamic AABB tree broad-phase, inspired by Nathanael Presson's btDbvt.\n/// A dynamic tree arranges data in a binary tree to accelerate\n/// queries such as volume queries and ray casts. Leafs are proxies\n/// with an AABB. In the tree we expand the proxy AABB by b2_fatAABBFactor\n/// so that the proxy AABB is bigger than the client object. This allows the client\n/// object to move by small amounts without triggering a tree update.\n///\n/// Nodes are pooled and relocatable, so we use node indices rather than pointers.\nclass b2DynamicTree\n{\npublic:\n\t/// Constructing the tree initializes the node pool.\n\tb2DynamicTree();\n\n\t/// Destroy the tree, freeing the node pool.\n\t~b2DynamicTree();\n\n\t/// Create a proxy. Provide a tight fitting AABB and a userData pointer.\n\tint32 CreateProxy(const b2AABB& aabb, void* userData);\n\n\t/// Destroy a proxy. This asserts if the id is invalid.\n\tvoid DestroyProxy(int32 proxyId);\n\n\t/// Move a proxy with a swepted AABB. If the proxy has moved outside of its fattened AABB,\n\t/// then the proxy is removed from the tree and re-inserted. Otherwise\n\t/// the function returns immediately.\n\t/// @return true if the proxy was re-inserted.\n\tbool MoveProxy(int32 proxyId, const b2AABB& aabb1, const b2Vec2& displacement);\n\n\t/// Get proxy user data.\n\t/// @return the proxy user data or 0 if the id is invalid.\n\tvoid* GetUserData(int32 proxyId) const;\n\n\t/// Get the fat AABB for a proxy.\n\tconst b2AABB& GetFatAABB(int32 proxyId) const;\n\n\t/// Query an AABB for overlapping proxies. The callback class\n\t/// is called for each proxy that overlaps the supplied AABB.\n\ttemplate \n\tvoid Query(T* callback, const b2AABB& aabb) const;\n\n\t/// Ray-cast against the proxies in the tree. This relies on the callback\n\t/// to perform a exact ray-cast in the case were the proxy contains a shape.\n\t/// The callback also performs the any collision filtering. This has performance\n\t/// roughly equal to k * log(n), where k is the number of collisions and n is the\n\t/// number of proxies in the tree.\n\t/// @param input the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).\n\t/// @param callback a callback class that is called for each proxy that is hit by the ray.\n\ttemplate \n\tvoid RayCast(T* callback, const b2RayCastInput& input) const;\n\n\t/// Validate this tree. For testing.\n\tvoid Validate() const;\n\n\t/// Compute the height of the binary tree in O(N) time. Should not be\n\t/// called often.\n\tint32 GetHeight() const;\n\n\t/// Get the maximum balance of an node in the tree. The balance is the difference\n\t/// in height of the two children of a node.\n\tint32 GetMaxBalance() const;\n\n\t/// Get the ratio of the sum of the node areas to the root area.\n\tfloat32 GetAreaRatio() const;\n\n\t/// Build an optimal tree. Very expensive. For testing.\n\tvoid RebuildBottomUp();\n\n\t/// Shift the world origin. Useful for large worlds.\n\t/// The shift formula is: position -= newOrigin\n\t/// @param newOrigin the new origin with respect to the old origin\n\tvoid ShiftOrigin(const b2Vec2& newOrigin);\n\nprivate:\n\n\tint32 AllocateNode();\n\tvoid FreeNode(int32 node);\n\n\tvoid InsertLeaf(int32 node);\n\tvoid RemoveLeaf(int32 node);\n\n\tint32 Balance(int32 index);\n\n\tint32 ComputeHeight() const;\n\tint32 ComputeHeight(int32 nodeId) const;\n\n\tvoid ValidateStructure(int32 index) const;\n\tvoid ValidateMetrics(int32 index) const;\n\n\tint32 m_root;\n\n\tb2TreeNode* m_nodes;\n\tint32 m_nodeCount;\n\tint32 m_nodeCapacity;\n\n\tint32 m_freeList;\n\n\t/// This is used to incrementally traverse the tree for re-balancing.\n\tuint32 m_path;\n\n\tint32 m_insertionCount;\n};\n\ninline void* b2DynamicTree::GetUserData(int32 proxyId) const\n{\n\tb2Assert(0 <= proxyId && proxyId < m_nodeCapacity);\n\treturn m_nodes[proxyId].userData;\n}\n\ninline const b2AABB& b2DynamicTree::GetFatAABB(int32 proxyId) const\n{\n\tb2Assert(0 <= proxyId && proxyId < m_nodeCapacity);\n\treturn m_nodes[proxyId].aabb;\n}\n\ntemplate \ninline void b2DynamicTree::Query(T* callback, const b2AABB& aabb) const\n{\n\tb2GrowableStack stack;\n\tstack.Push(m_root);\n\n\twhile (stack.GetCount() > 0)\n\t{\n\t\tint32 nodeId = stack.Pop();\n\t\tif (nodeId == b2_nullNode)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst b2TreeNode* node = m_nodes + nodeId;\n\n\t\tif (b2TestOverlap(node->aabb, aabb))\n\t\t{\n\t\t\tif (node->IsLeaf())\n\t\t\t{\n\t\t\t\tbool proceed = callback->QueryCallback(nodeId);\n\t\t\t\tif (proceed == false)\n\t\t\t\t{\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstack.Push(node->child1);\n\t\t\t\tstack.Push(node->child2);\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate \ninline void b2DynamicTree::RayCast(T* callback, const b2RayCastInput& input) const\n{\n\tb2Vec2 p1 = input.p1;\n\tb2Vec2 p2 = input.p2;\n\tb2Vec2 r = p2 - p1;\n\tb2Assert(r.LengthSquared() > 0.0f);\n\tr.Normalize();\n\n\t// v is perpendicular to the segment.\n\tb2Vec2 v = b2Cross(1.0f, r);\n\tb2Vec2 abs_v = b2Abs(v);\n\n\t// Separating axis for segment (Gino, p80).\n\t// |dot(v, p1 - c)| > dot(|v|, h)\n\n\tfloat32 maxFraction = input.maxFraction;\n\n\t// Build a bounding box for the segment.\n\tb2AABB segmentAABB;\n\t{\n\t\tb2Vec2 t = p1 + maxFraction * (p2 - p1);\n\t\tsegmentAABB.lowerBound = b2Min(p1, t);\n\t\tsegmentAABB.upperBound = b2Max(p1, t);\n\t}\n\n\tb2GrowableStack stack;\n\tstack.Push(m_root);\n\n\twhile (stack.GetCount() > 0)\n\t{\n\t\tint32 nodeId = stack.Pop();\n\t\tif (nodeId == b2_nullNode)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst b2TreeNode* node = m_nodes + nodeId;\n\n\t\tif (b2TestOverlap(node->aabb, segmentAABB) == false)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Separating axis for segment (Gino, p80).\n\t\t// |dot(v, p1 - c)| > dot(|v|, h)\n\t\tb2Vec2 c = node->aabb.GetCenter();\n\t\tb2Vec2 h = node->aabb.GetExtents();\n\t\tfloat32 separation = b2Abs(b2Dot(v, p1 - c)) - b2Dot(abs_v, h);\n\t\tif (separation > 0.0f)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (node->IsLeaf())\n\t\t{\n\t\t\tb2RayCastInput subInput;\n\t\t\tsubInput.p1 = input.p1;\n\t\t\tsubInput.p2 = input.p2;\n\t\t\tsubInput.maxFraction = maxFraction;\n\n\t\t\tfloat32 value = callback->RayCastCallback(subInput, nodeId);\n\n\t\t\tif (value == 0.0f)\n\t\t\t{\n\t\t\t\t// The client has terminated the ray cast.\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (value > 0.0f)\n\t\t\t{\n\t\t\t\t// Update segment bounding box.\n\t\t\t\tmaxFraction = value;\n\t\t\t\tb2Vec2 t = p1 + maxFraction * (p2 - p1);\n\t\t\t\tsegmentAABB.lowerBound = b2Min(p1, t);\n\t\t\t\tsegmentAABB.upperBound = b2Max(p1, t);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstack.Push(node->child1);\n\t\t\tstack.Push(node->child2);\n\t\t}\n\t}\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Collision/b2TimeOfImpact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_TIME_OF_IMPACT_H\n#define B2_TIME_OF_IMPACT_H\n\n#include \"../Common/b2Math.h\"\n#include \"b2Distance.h\"\n\n/// Input parameters for b2TimeOfImpact\nstruct b2TOIInput\n{\n\tb2DistanceProxy proxyA;\n\tb2DistanceProxy proxyB;\n\tb2Sweep sweepA;\n\tb2Sweep sweepB;\n\tfloat32 tMax;\t\t// defines sweep interval [0, tMax]\n};\n\n// Output parameters for b2TimeOfImpact.\nstruct b2TOIOutput\n{\n\tenum State\n\t{\n\t\te_unknown,\n\t\te_failed,\n\t\te_overlapped,\n\t\te_touching,\n\t\te_separated\n\t};\n\n\tState state;\n\tfloat32 t;\n};\n\n/// Compute the upper bound on time before two shapes penetrate. Time is represented as\n/// a fraction between [0,tMax]. This uses a swept separating axis and may miss some intermediate,\n/// non-tunneling collision. If you change the time interval, you should call this function\n/// again.\n/// Note: use b2Distance to compute the contact point and normal at the time of impact.\nvoid b2TimeOfImpact(b2TOIOutput* output, const b2TOIInput* input);\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2BlockAllocator.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_BLOCK_ALLOCATOR_H\n#define B2_BLOCK_ALLOCATOR_H\n\n#include \"b2Settings.h\"\n\nconst int32 b2_chunkSize = 16 * 1024;\nconst int32 b2_maxBlockSize = 640;\nconst int32 b2_blockSizes = 14;\nconst int32 b2_chunkArrayIncrement = 128;\n\nstruct b2Block;\nstruct b2Chunk;\n\n/// This is a small object allocator used for allocating small\n/// objects that persist for more than one time step.\n/// See: http://www.codeproject.com/useritems/Small_Block_Allocator.asp\nclass b2BlockAllocator\n{\npublic:\n\tb2BlockAllocator();\n\t~b2BlockAllocator();\n\n\t/// Allocate memory. This will use b2Alloc if the size is larger than b2_maxBlockSize.\n\tvoid* Allocate(int32 size);\n\n\t/// Free memory. This will use b2Free if the size is larger than b2_maxBlockSize.\n\tvoid Free(void* p, int32 size);\n\n\tvoid Clear();\n\nprivate:\n\n\tb2Chunk* m_chunks;\n\tint32 m_chunkCount;\n\tint32 m_chunkSpace;\n\n\tb2Block* m_freeLists[b2_blockSizes];\n\n\tstatic int32 s_blockSizes[b2_blockSizes];\n\tstatic uint8 s_blockSizeLookup[b2_maxBlockSize + 1];\n\tstatic bool s_blockSizeLookupInitialized;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2Draw.h",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_DRAW_H\n#define B2_DRAW_H\n\n#include \"b2Math.h\"\n\n/// Color for debug drawing. Each value has the range [0,1].\nstruct b2Color\n{\n\tb2Color() {}\n\tb2Color(float32 r, float32 g, float32 b) : r(r), g(g), b(b) {}\n\tvoid Set(float32 ri, float32 gi, float32 bi) { r = ri; g = gi; b = bi; }\n\tfloat32 r, g, b;\n};\n\n/// Implement and register this class with a b2World to provide debug drawing of physics\n/// entities in your game.\nclass b2Draw\n{\npublic:\n\tb2Draw();\n\n\tvirtual ~b2Draw() {}\n\n\tenum\n\t{\n\t\te_shapeBit\t\t\t\t= 0x0001,\t///< draw shapes\n\t\te_jointBit\t\t\t\t= 0x0002,\t///< draw joint connections\n\t\te_aabbBit\t\t\t\t= 0x0004,\t///< draw axis aligned bounding boxes\n\t\te_pairBit\t\t\t\t= 0x0008,\t///< draw broad-phase pairs\n\t\te_centerOfMassBit\t\t= 0x0010\t///< draw center of mass frame\n\t};\n\n\t/// Set the drawing flags.\n\tvoid SetFlags(uint32 flags);\n\n\t/// Get the drawing flags.\n\tuint32 GetFlags() const;\n\n\t/// Append flags to the current flags.\n\tvoid AppendFlags(uint32 flags);\n\n\t/// Clear flags from the current flags.\n\tvoid ClearFlags(uint32 flags);\n\n\t/// Draw a closed polygon provided in CCW order.\n\tvirtual void DrawPolygon(const b2Vec2* vertices, int32 vertexCount, const b2Color& color) = 0;\n\n\t/// Draw a solid closed polygon provided in CCW order.\n\tvirtual void DrawSolidPolygon(const b2Vec2* vertices, int32 vertexCount, const b2Color& color) = 0;\n\n\t/// Draw a circle.\n\tvirtual void DrawCircle(const b2Vec2& center, float32 radius, const b2Color& color) = 0;\n\n\t/// Draw a solid circle.\n\tvirtual void DrawSolidCircle(const b2Vec2& center, float32 radius, const b2Vec2& axis, const b2Color& color) = 0;\n\n\t/// Draw a line segment.\n\tvirtual void DrawSegment(const b2Vec2& p1, const b2Vec2& p2, const b2Color& color) = 0;\n\n\t/// Draw a transform. Choose your own length scale.\n\t/// @param xf a transform.\n\tvirtual void DrawTransform(const b2Transform& xf) = 0;\n\nprotected:\n\tuint32 m_drawFlags;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2GrowableStack.h",
"content": "/*\n* Copyright (c) 2010 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_GROWABLE_STACK_H\n#define B2_GROWABLE_STACK_H\n#include \"b2Settings.h\"\n#include \n#include \n\n/// This is a growable LIFO stack with an initial capacity of N.\n/// If the stack size exceeds the initial capacity, the heap is used\n/// to increase the size of the stack.\ntemplate \nclass b2GrowableStack\n{\npublic:\n\tb2GrowableStack()\n\t{\n\t\tm_stack = m_array;\n\t\tm_count = 0;\n\t\tm_capacity = N;\n\t}\n\n\t~b2GrowableStack()\n\t{\n\t\tif (m_stack != m_array)\n\t\t{\n\t\t\tb2Free(m_stack);\n\t\t\tm_stack = NULL;\n\t\t}\n\t}\n\n\tvoid Push(const T& element)\n\t{\n\t\tif (m_count == m_capacity)\n\t\t{\n\t\t\tT* old = m_stack;\n\t\t\tm_capacity *= 2;\n\t\t\tm_stack = (T*)b2Alloc(m_capacity * sizeof(T));\n\t\t\tmemcpy(m_stack, old, m_count * sizeof(T));\n\t\t\tif (old != m_array)\n\t\t\t{\n\t\t\t\tb2Free(old);\n\t\t\t}\n\t\t}\n\n\t\tm_stack[m_count] = element;\n\t\t++m_count;\n\t}\n\n\tT Pop()\n\t{\n\t\tb2Assert(m_count > 0);\n\t\t--m_count;\n\t\treturn m_stack[m_count];\n\t}\n\n\tint32 GetCount()\n\t{\n\t\treturn m_count;\n\t}\n\nprivate:\n\tT* m_stack;\n\tT m_array[N];\n\tint32 m_count;\n\tint32 m_capacity;\n};\n\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2Math.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_MATH_H\n#define B2_MATH_H\n\n#include \"b2Settings.h\"\n#include \n\n/// This function is used to ensure that a floating point number is not a NaN or infinity.\ninline bool b2IsValid(float32 x)\n{\n\tint32 ix = *reinterpret_cast(&x);\n\treturn (ix & 0x7f800000) != 0x7f800000;\n}\n\n/// This is a approximate yet fast inverse square-root.\ninline float32 b2InvSqrt(float32 x)\n{\n\tunion\n\t{\n\t\tfloat32 x;\n\t\tint32 i;\n\t} convert;\n\n\tconvert.x = x;\n\tfloat32 xhalf = 0.5f * x;\n\tconvert.i = 0x5f3759df - (convert.i >> 1);\n\tx = convert.x;\n\tx = x * (1.5f - xhalf * x * x);\n\treturn x;\n}\n\n#define\tb2Sqrt(x)\tsqrtf(x)\n#define\tb2Atan2(y, x)\tatan2f(y, x)\n\n/// A 2D column vector.\nstruct b2Vec2\n{\n\t/// Default constructor does nothing (for performance).\n\tb2Vec2() {}\n\n\t/// Construct using coordinates.\n\tb2Vec2(float32 x, float32 y) : x(x), y(y) {}\n\n\t/// Set this vector to all zeros.\n\tvoid SetZero() { x = 0.0f; y = 0.0f; }\n\n\t/// Set this vector to some specified coordinates.\n\tvoid Set(float32 x_, float32 y_) { x = x_; y = y_; }\n\n\t/// Negate this vector.\n\tb2Vec2 operator -() const { b2Vec2 v; v.Set(-x, -y); return v; }\n\n\t/// Read from and indexed element.\n\tfloat32 operator () (int32 i) const\n\t{\n\t\treturn (&x)[i];\n\t}\n\n\t/// Write to an indexed element.\n\tfloat32& operator () (int32 i)\n\t{\n\t\treturn (&x)[i];\n\t}\n\n\t/// Add a vector to this vector.\n\tvoid operator += (const b2Vec2& v)\n\t{\n\t\tx += v.x; y += v.y;\n\t}\n\n\t/// Subtract a vector from this vector.\n\tvoid operator -= (const b2Vec2& v)\n\t{\n\t\tx -= v.x; y -= v.y;\n\t}\n\n\t/// Multiply this vector by a scalar.\n\tvoid operator *= (float32 a)\n\t{\n\t\tx *= a; y *= a;\n\t}\n\n\t/// Get the length of this vector (the norm).\n\tfloat32 Length() const\n\t{\n\t\treturn b2Sqrt(x * x + y * y);\n\t}\n\n\t/// Get the length squared. For performance, use this instead of\n\t/// b2Vec2::Length (if possible).\n\tfloat32 LengthSquared() const\n\t{\n\t\treturn x * x + y * y;\n\t}\n\n\t/// Convert this vector into a unit vector. Returns the length.\n\tfloat32 Normalize()\n\t{\n\t\tfloat32 length = Length();\n\t\tif (length < b2_epsilon)\n\t\t{\n\t\t\treturn 0.0f;\n\t\t}\n\t\tfloat32 invLength = 1.0f / length;\n\t\tx *= invLength;\n\t\ty *= invLength;\n\n\t\treturn length;\n\t}\n\n\t/// Does this vector contain finite coordinates?\n\tbool IsValid() const\n\t{\n\t\treturn b2IsValid(x) && b2IsValid(y);\n\t}\n\n\t/// Get the skew vector such that dot(skew_vec, other) == cross(vec, other)\n\tb2Vec2 Skew() const\n\t{\n\t\treturn b2Vec2(-y, x);\n\t}\n\n\tfloat32 x, y;\n};\n\n/// A 2D column vector with 3 elements.\nstruct b2Vec3\n{\n\t/// Default constructor does nothing (for performance).\n\tb2Vec3() {}\n\n\t/// Construct using coordinates.\n\tb2Vec3(float32 x, float32 y, float32 z) : x(x), y(y), z(z) {}\n\n\t/// Set this vector to all zeros.\n\tvoid SetZero() { x = 0.0f; y = 0.0f; z = 0.0f; }\n\n\t/// Set this vector to some specified coordinates.\n\tvoid Set(float32 x_, float32 y_, float32 z_) { x = x_; y = y_; z = z_; }\n\n\t/// Negate this vector.\n\tb2Vec3 operator -() const { b2Vec3 v; v.Set(-x, -y, -z); return v; }\n\n\t/// Add a vector to this vector.\n\tvoid operator += (const b2Vec3& v)\n\t{\n\t\tx += v.x; y += v.y; z += v.z;\n\t}\n\n\t/// Subtract a vector from this vector.\n\tvoid operator -= (const b2Vec3& v)\n\t{\n\t\tx -= v.x; y -= v.y; z -= v.z;\n\t}\n\n\t/// Multiply this vector by a scalar.\n\tvoid operator *= (float32 s)\n\t{\n\t\tx *= s; y *= s; z *= s;\n\t}\n\n\tfloat32 x, y, z;\n};\n\n/// A 2-by-2 matrix. Stored in column-major order.\nstruct b2Mat22\n{\n\t/// The default constructor does nothing (for performance).\n\tb2Mat22() {}\n\n\t/// Construct this matrix using columns.\n\tb2Mat22(const b2Vec2& c1, const b2Vec2& c2)\n\t{\n\t\tex = c1;\n\t\tey = c2;\n\t}\n\n\t/// Construct this matrix using scalars.\n\tb2Mat22(float32 a11, float32 a12, float32 a21, float32 a22)\n\t{\n\t\tex.x = a11; ex.y = a21;\n\t\tey.x = a12; ey.y = a22;\n\t}\n\n\t/// Initialize this matrix using columns.\n\tvoid Set(const b2Vec2& c1, const b2Vec2& c2)\n\t{\n\t\tex = c1;\n\t\tey = c2;\n\t}\n\n\t/// Set this to the identity matrix.\n\tvoid SetIdentity()\n\t{\n\t\tex.x = 1.0f; ey.x = 0.0f;\n\t\tex.y = 0.0f; ey.y = 1.0f;\n\t}\n\n\t/// Set this matrix to all zeros.\n\tvoid SetZero()\n\t{\n\t\tex.x = 0.0f; ey.x = 0.0f;\n\t\tex.y = 0.0f; ey.y = 0.0f;\n\t}\n\n\tb2Mat22 GetInverse() const\n\t{\n\t\tfloat32 a = ex.x, b = ey.x, c = ex.y, d = ey.y;\n\t\tb2Mat22 B;\n\t\tfloat32 det = a * d - b * c;\n\t\tif (det != 0.0f)\n\t\t{\n\t\t\tdet = 1.0f / det;\n\t\t}\n\t\tB.ex.x = det * d;\tB.ey.x = -det * b;\n\t\tB.ex.y = -det * c;\tB.ey.y = det * a;\n\t\treturn B;\n\t}\n\n\t/// Solve A * x = b, where b is a column vector. This is more efficient\n\t/// than computing the inverse in one-shot cases.\n\tb2Vec2 Solve(const b2Vec2& b) const\n\t{\n\t\tfloat32 a11 = ex.x, a12 = ey.x, a21 = ex.y, a22 = ey.y;\n\t\tfloat32 det = a11 * a22 - a12 * a21;\n\t\tif (det != 0.0f)\n\t\t{\n\t\t\tdet = 1.0f / det;\n\t\t}\n\t\tb2Vec2 x;\n\t\tx.x = det * (a22 * b.x - a12 * b.y);\n\t\tx.y = det * (a11 * b.y - a21 * b.x);\n\t\treturn x;\n\t}\n\n\tb2Vec2 ex, ey;\n};\n\n/// A 3-by-3 matrix. Stored in column-major order.\nstruct b2Mat33\n{\n\t/// The default constructor does nothing (for performance).\n\tb2Mat33() {}\n\n\t/// Construct this matrix using columns.\n\tb2Mat33(const b2Vec3& c1, const b2Vec3& c2, const b2Vec3& c3)\n\t{\n\t\tex = c1;\n\t\tey = c2;\n\t\tez = c3;\n\t}\n\n\t/// Set this matrix to all zeros.\n\tvoid SetZero()\n\t{\n\t\tex.SetZero();\n\t\tey.SetZero();\n\t\tez.SetZero();\n\t}\n\n\t/// Solve A * x = b, where b is a column vector. This is more efficient\n\t/// than computing the inverse in one-shot cases.\n\tb2Vec3 Solve33(const b2Vec3& b) const;\n\n\t/// Solve A * x = b, where b is a column vector. This is more efficient\n\t/// than computing the inverse in one-shot cases. Solve only the upper\n\t/// 2-by-2 matrix equation.\n\tb2Vec2 Solve22(const b2Vec2& b) const;\n\n\t/// Get the inverse of this matrix as a 2-by-2.\n\t/// Returns the zero matrix if singular.\n\tvoid GetInverse22(b2Mat33* M) const;\n\n\t/// Get the symmetric inverse of this matrix as a 3-by-3.\n\t/// Returns the zero matrix if singular.\n\tvoid GetSymInverse33(b2Mat33* M) const;\n\n\tb2Vec3 ex, ey, ez;\n};\n\n/// Rotation\nstruct b2Rot\n{\n\tb2Rot() {}\n\n\t/// Initialize from an angle in radians\n\texplicit b2Rot(float32 angle)\n\t{\n\t\t/// TODO_ERIN optimize\n\t\ts = sinf(angle);\n\t\tc = cosf(angle);\n\t}\n\n\t/// Set using an angle in radians.\n\tvoid Set(float32 angle)\n\t{\n\t\t/// TODO_ERIN optimize\n\t\ts = sinf(angle);\n\t\tc = cosf(angle);\n\t}\n\n\t/// Set to the identity rotation\n\tvoid SetIdentity()\n\t{\n\t\ts = 0.0f;\n\t\tc = 1.0f;\n\t}\n\n\t/// Get the angle in radians\n\tfloat32 GetAngle() const\n\t{\n\t\treturn b2Atan2(s, c);\n\t}\n\n\t/// Get the x-axis\n\tb2Vec2 GetXAxis() const\n\t{\n\t\treturn b2Vec2(c, s);\n\t}\n\n\t/// Get the u-axis\n\tb2Vec2 GetYAxis() const\n\t{\n\t\treturn b2Vec2(-s, c);\n\t}\n\n\t/// Sine and cosine\n\tfloat32 s, c;\n};\n\n/// A transform contains translation and rotation. It is used to represent\n/// the position and orientation of rigid frames.\nstruct b2Transform\n{\n\t/// The default constructor does nothing.\n\tb2Transform() {}\n\n\t/// Initialize using a position vector and a rotation.\n\tb2Transform(const b2Vec2& position, const b2Rot& rotation) : p(position), q(rotation) {}\n\n\t/// Set this to the identity transform.\n\tvoid SetIdentity()\n\t{\n\t\tp.SetZero();\n\t\tq.SetIdentity();\n\t}\n\n\t/// Set this based on the position and angle.\n\tvoid Set(const b2Vec2& position, float32 angle)\n\t{\n\t\tp = position;\n\t\tq.Set(angle);\n\t}\n\n\tb2Vec2 p;\n\tb2Rot q;\n};\n\n/// This describes the motion of a body/shape for TOI computation.\n/// Shapes are defined with respect to the body origin, which may\n/// no coincide with the center of mass. However, to support dynamics\n/// we must interpolate the center of mass position.\nstruct b2Sweep\n{\n\t/// Get the interpolated transform at a specific time.\n\t/// @param beta is a factor in [0,1], where 0 indicates alpha0.\n\tvoid GetTransform(b2Transform* xfb, float32 beta) const;\n\n\t/// Advance the sweep forward, yielding a new initial state.\n\t/// @param alpha the new initial time.\n\tvoid Advance(float32 alpha);\n\n\t/// Normalize the angles.\n\tvoid Normalize();\n\n\tb2Vec2 localCenter;\t///< local center of mass position\n\tb2Vec2 c0, c;\t\t///< center world positions\n\tfloat32 a0, a;\t\t///< world angles\n\n\t/// Fraction of the current time step in the range [0,1]\n\t/// c0 and a0 are the positions at alpha0.\n\tfloat32 alpha0;\n};\n\n/// Useful constant\nextern const b2Vec2 b2Vec2_zero;\n\n/// Perform the dot product on two vectors.\ninline float32 b2Dot(const b2Vec2& a, const b2Vec2& b)\n{\n\treturn a.x * b.x + a.y * b.y;\n}\n\n/// Perform the cross product on two vectors. In 2D this produces a scalar.\ninline float32 b2Cross(const b2Vec2& a, const b2Vec2& b)\n{\n\treturn a.x * b.y - a.y * b.x;\n}\n\n/// Perform the cross product on a vector and a scalar. In 2D this produces\n/// a vector.\ninline b2Vec2 b2Cross(const b2Vec2& a, float32 s)\n{\n\treturn b2Vec2(s * a.y, -s * a.x);\n}\n\n/// Perform the cross product on a scalar and a vector. In 2D this produces\n/// a vector.\ninline b2Vec2 b2Cross(float32 s, const b2Vec2& a)\n{\n\treturn b2Vec2(-s * a.y, s * a.x);\n}\n\n/// Multiply a matrix times a vector. If a rotation matrix is provided,\n/// then this transforms the vector from one frame to another.\ninline b2Vec2 b2Mul(const b2Mat22& A, const b2Vec2& v)\n{\n\treturn b2Vec2(A.ex.x * v.x + A.ey.x * v.y, A.ex.y * v.x + A.ey.y * v.y);\n}\n\n/// Multiply a matrix transpose times a vector. If a rotation matrix is provided,\n/// then this transforms the vector from one frame to another (inverse transform).\ninline b2Vec2 b2MulT(const b2Mat22& A, const b2Vec2& v)\n{\n\treturn b2Vec2(b2Dot(v, A.ex), b2Dot(v, A.ey));\n}\n\n/// Add two vectors component-wise.\ninline b2Vec2 operator + (const b2Vec2& a, const b2Vec2& b)\n{\n\treturn b2Vec2(a.x + b.x, a.y + b.y);\n}\n\n/// Subtract two vectors component-wise.\ninline b2Vec2 operator - (const b2Vec2& a, const b2Vec2& b)\n{\n\treturn b2Vec2(a.x - b.x, a.y - b.y);\n}\n\ninline b2Vec2 operator * (float32 s, const b2Vec2& a)\n{\n\treturn b2Vec2(s * a.x, s * a.y);\n}\n\ninline bool operator == (const b2Vec2& a, const b2Vec2& b)\n{\n\treturn a.x == b.x && a.y == b.y;\n}\n\ninline float32 b2Distance(const b2Vec2& a, const b2Vec2& b)\n{\n\tb2Vec2 c = a - b;\n\treturn c.Length();\n}\n\ninline float32 b2DistanceSquared(const b2Vec2& a, const b2Vec2& b)\n{\n\tb2Vec2 c = a - b;\n\treturn b2Dot(c, c);\n}\n\ninline b2Vec3 operator * (float32 s, const b2Vec3& a)\n{\n\treturn b2Vec3(s * a.x, s * a.y, s * a.z);\n}\n\n/// Add two vectors component-wise.\ninline b2Vec3 operator + (const b2Vec3& a, const b2Vec3& b)\n{\n\treturn b2Vec3(a.x + b.x, a.y + b.y, a.z + b.z);\n}\n\n/// Subtract two vectors component-wise.\ninline b2Vec3 operator - (const b2Vec3& a, const b2Vec3& b)\n{\n\treturn b2Vec3(a.x - b.x, a.y - b.y, a.z - b.z);\n}\n\n/// Perform the dot product on two vectors.\ninline float32 b2Dot(const b2Vec3& a, const b2Vec3& b)\n{\n\treturn a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\n/// Perform the cross product on two vectors.\ninline b2Vec3 b2Cross(const b2Vec3& a, const b2Vec3& b)\n{\n\treturn b2Vec3(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);\n}\n\ninline b2Mat22 operator + (const b2Mat22& A, const b2Mat22& B)\n{\n\treturn b2Mat22(A.ex + B.ex, A.ey + B.ey);\n}\n\n// A * B\ninline b2Mat22 b2Mul(const b2Mat22& A, const b2Mat22& B)\n{\n\treturn b2Mat22(b2Mul(A, B.ex), b2Mul(A, B.ey));\n}\n\n// A^T * B\ninline b2Mat22 b2MulT(const b2Mat22& A, const b2Mat22& B)\n{\n\tb2Vec2 c1(b2Dot(A.ex, B.ex), b2Dot(A.ey, B.ex));\n\tb2Vec2 c2(b2Dot(A.ex, B.ey), b2Dot(A.ey, B.ey));\n\treturn b2Mat22(c1, c2);\n}\n\n/// Multiply a matrix times a vector.\ninline b2Vec3 b2Mul(const b2Mat33& A, const b2Vec3& v)\n{\n\treturn v.x * A.ex + v.y * A.ey + v.z * A.ez;\n}\n\n/// Multiply a matrix times a vector.\ninline b2Vec2 b2Mul22(const b2Mat33& A, const b2Vec2& v)\n{\n\treturn b2Vec2(A.ex.x * v.x + A.ey.x * v.y, A.ex.y * v.x + A.ey.y * v.y);\n}\n\n/// Multiply two rotations: q * r\ninline b2Rot b2Mul(const b2Rot& q, const b2Rot& r)\n{\n\t// [qc -qs] * [rc -rs] = [qc*rc-qs*rs -qc*rs-qs*rc]\n\t// [qs qc] [rs rc] [qs*rc+qc*rs -qs*rs+qc*rc]\n\t// s = qs * rc + qc * rs\n\t// c = qc * rc - qs * rs\n\tb2Rot qr;\n\tqr.s = q.s * r.c + q.c * r.s;\n\tqr.c = q.c * r.c - q.s * r.s;\n\treturn qr;\n}\n\n/// Transpose multiply two rotations: qT * r\ninline b2Rot b2MulT(const b2Rot& q, const b2Rot& r)\n{\n\t// [ qc qs] * [rc -rs] = [qc*rc+qs*rs -qc*rs+qs*rc]\n\t// [-qs qc] [rs rc] [-qs*rc+qc*rs qs*rs+qc*rc]\n\t// s = qc * rs - qs * rc\n\t// c = qc * rc + qs * rs\n\tb2Rot qr;\n\tqr.s = q.c * r.s - q.s * r.c;\n\tqr.c = q.c * r.c + q.s * r.s;\n\treturn qr;\n}\n\n/// Rotate a vector\ninline b2Vec2 b2Mul(const b2Rot& q, const b2Vec2& v)\n{\n\treturn b2Vec2(q.c * v.x - q.s * v.y, q.s * v.x + q.c * v.y);\n}\n\n/// Inverse rotate a vector\ninline b2Vec2 b2MulT(const b2Rot& q, const b2Vec2& v)\n{\n\treturn b2Vec2(q.c * v.x + q.s * v.y, -q.s * v.x + q.c * v.y);\n}\n\ninline b2Vec2 b2Mul(const b2Transform& T, const b2Vec2& v)\n{\n\tfloat32 x = (T.q.c * v.x - T.q.s * v.y) + T.p.x;\n\tfloat32 y = (T.q.s * v.x + T.q.c * v.y) + T.p.y;\n\n\treturn b2Vec2(x, y);\n}\n\ninline b2Vec2 b2MulT(const b2Transform& T, const b2Vec2& v)\n{\n\tfloat32 px = v.x - T.p.x;\n\tfloat32 py = v.y - T.p.y;\n\tfloat32 x = (T.q.c * px + T.q.s * py);\n\tfloat32 y = (-T.q.s * px + T.q.c * py);\n\n\treturn b2Vec2(x, y);\n}\n\n// v2 = A.q.Rot(B.q.Rot(v1) + B.p) + A.p\n// = (A.q * B.q).Rot(v1) + A.q.Rot(B.p) + A.p\ninline b2Transform b2Mul(const b2Transform& A, const b2Transform& B)\n{\n\tb2Transform C;\n\tC.q = b2Mul(A.q, B.q);\n\tC.p = b2Mul(A.q, B.p) + A.p;\n\treturn C;\n}\n\n// v2 = A.q' * (B.q * v1 + B.p - A.p)\n// = A.q' * B.q * v1 + A.q' * (B.p - A.p)\ninline b2Transform b2MulT(const b2Transform& A, const b2Transform& B)\n{\n\tb2Transform C;\n\tC.q = b2MulT(A.q, B.q);\n\tC.p = b2MulT(A.q, B.p - A.p);\n\treturn C;\n}\n\ntemplate \ninline T b2Abs(T a)\n{\n\treturn a > T(0) ? a : -a;\n}\n\ninline b2Vec2 b2Abs(const b2Vec2& a)\n{\n\treturn b2Vec2(b2Abs(a.x), b2Abs(a.y));\n}\n\ninline b2Mat22 b2Abs(const b2Mat22& A)\n{\n\treturn b2Mat22(b2Abs(A.ex), b2Abs(A.ey));\n}\n\ntemplate \ninline T b2Min(T a, T b)\n{\n\treturn a < b ? a : b;\n}\n\ninline b2Vec2 b2Min(const b2Vec2& a, const b2Vec2& b)\n{\n\treturn b2Vec2(b2Min(a.x, b.x), b2Min(a.y, b.y));\n}\n\ntemplate \ninline T b2Max(T a, T b)\n{\n\treturn a > b ? a : b;\n}\n\ninline b2Vec2 b2Max(const b2Vec2& a, const b2Vec2& b)\n{\n\treturn b2Vec2(b2Max(a.x, b.x), b2Max(a.y, b.y));\n}\n\ntemplate \ninline T b2Clamp(T a, T low, T high)\n{\n\treturn b2Max(low, b2Min(a, high));\n}\n\ninline b2Vec2 b2Clamp(const b2Vec2& a, const b2Vec2& low, const b2Vec2& high)\n{\n\treturn b2Max(low, b2Min(a, high));\n}\n\ntemplate inline void b2Swap(T& a, T& b)\n{\n\tT tmp = a;\n\ta = b;\n\tb = tmp;\n}\n\n/// \"Next Largest Power of 2\n/// Given a binary integer value x, the next largest power of 2 can be computed by a SWAR algorithm\n/// that recursively \"folds\" the upper bits into the lower bits. This process yields a bit vector with\n/// the same most significant 1 as x, but all 1's below it. Adding 1 to that value yields the next\n/// largest power of 2. For a 32-bit value:\"\ninline uint32 b2NextPowerOfTwo(uint32 x)\n{\n\tx |= (x >> 1);\n\tx |= (x >> 2);\n\tx |= (x >> 4);\n\tx |= (x >> 8);\n\tx |= (x >> 16);\n\treturn x + 1;\n}\n\ninline bool b2IsPowerOfTwo(uint32 x)\n{\n\tbool result = x > 0 && (x & (x - 1)) == 0;\n\treturn result;\n}\n\ninline void b2Sweep::GetTransform(b2Transform* xf, float32 beta) const\n{\n\txf->p = (1.0f - beta) * c0 + beta * c;\n\tfloat32 angle = (1.0f - beta) * a0 + beta * a;\n\txf->q.Set(angle);\n\n\t// Shift to origin\n\txf->p -= b2Mul(xf->q, localCenter);\n}\n\ninline void b2Sweep::Advance(float32 alpha)\n{\n\tb2Assert(alpha0 < 1.0f);\n\tfloat32 beta = (alpha - alpha0) / (1.0f - alpha0);\n\tc0 += beta * (c - c0);\n\ta0 += beta * (a - a0);\n\talpha0 = alpha;\n}\n\n/// Normalize an angle in radians to be between -pi and pi\ninline void b2Sweep::Normalize()\n{\n\tfloat32 twoPi = 2.0f * b2_pi;\n\tfloat32 d = twoPi * floorf(a0 / twoPi);\n\ta0 -= d;\n\ta -= d;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2Settings.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_SETTINGS_H\n#define B2_SETTINGS_H\n\n#include \n#include \n#include \n\n#define B2_NOT_USED(x) ((void)(x))\n#define b2Assert(A) assert(A)\n\ntypedef signed char\tint8;\ntypedef signed short int16;\ntypedef signed int int32;\ntypedef unsigned char uint8;\ntypedef unsigned short uint16;\ntypedef unsigned int uint32;\ntypedef float float32;\ntypedef double float64;\n\n#define\tb2_maxFloat\t\tFLT_MAX\n#define\tb2_epsilon\t\tFLT_EPSILON\n#define b2_pi\t\t\t3.14159265359f\n\n/// @file\n/// Global tuning constants based on meters-kilograms-seconds (MKS) units.\n///\n\n// Collision\n\n/// The maximum number of contact points between two convex shapes. Do\n/// not change this value.\n#define b2_maxManifoldPoints\t2\n\n/// The maximum number of vertices on a convex polygon. You cannot increase\n/// this too much because b2BlockAllocator has a maximum object size.\n#define b2_maxPolygonVertices\t8\n\n/// This is used to fatten AABBs in the dynamic tree. This allows proxies\n/// to move by a small amount without triggering a tree adjustment.\n/// This is in meters.\n#define b2_aabbExtension\t\t0.1f\n\n/// This is used to fatten AABBs in the dynamic tree. This is used to predict\n/// the future position based on the current displacement.\n/// This is a dimensionless multiplier.\n#define b2_aabbMultiplier\t\t2.0f\n\n/// A small length used as a collision and constraint tolerance. Usually it is\n/// chosen to be numerically significant, but visually insignificant.\n#define b2_linearSlop\t\t\t0.005f\n\n/// A small angle used as a collision and constraint tolerance. Usually it is\n/// chosen to be numerically significant, but visually insignificant.\n#define b2_angularSlop\t\t\t(2.0f / 180.0f * b2_pi)\n\n/// The radius of the polygon/edge shape skin. This should not be modified. Making\n/// this smaller means polygons will have an insufficient buffer for continuous collision.\n/// Making it larger may create artifacts for vertex collision.\n#define b2_polygonRadius\t\t(2.0f * b2_linearSlop)\n\n/// Maximum number of sub-steps per contact in continuous physics simulation.\n#define b2_maxSubSteps\t\t\t8\n\n\n// Dynamics\n\n/// Maximum number of contacts to be handled to solve a TOI impact.\n#define b2_maxTOIContacts\t\t\t32\n\n/// A velocity threshold for elastic collisions. Any collision with a relative linear\n/// velocity below this threshold will be treated as inelastic.\n#define b2_velocityThreshold\t\t1.0f\n\n/// The maximum linear position correction used when solving constraints. This helps to\n/// prevent overshoot.\n#define b2_maxLinearCorrection\t\t0.2f\n\n/// The maximum angular position correction used when solving constraints. This helps to\n/// prevent overshoot.\n#define b2_maxAngularCorrection\t\t(8.0f / 180.0f * b2_pi)\n\n/// The maximum linear velocity of a body. This limit is very large and is used\n/// to prevent numerical problems. You shouldn't need to adjust this.\n#define b2_maxTranslation\t\t\t2.0f\n#define b2_maxTranslationSquared\t(b2_maxTranslation * b2_maxTranslation)\n\n/// The maximum angular velocity of a body. This limit is very large and is used\n/// to prevent numerical problems. You shouldn't need to adjust this.\n#define b2_maxRotation\t\t\t\t(0.5f * b2_pi)\n#define b2_maxRotationSquared\t\t(b2_maxRotation * b2_maxRotation)\n\n/// This scale factor controls how fast overlap is resolved. Ideally this would be 1 so\n/// that overlap is removed in one time step. However using values close to 1 often lead\n/// to overshoot.\n#define b2_baumgarte\t\t\t\t0.2f\n#define b2_toiBaugarte\t\t\t\t0.75f\n\n\n// Sleep\n\n/// The time that a body must be still before it will go to sleep.\n#define b2_timeToSleep\t\t\t\t0.5f\n\n/// A body cannot sleep if its linear velocity is above this tolerance.\n#define b2_linearSleepTolerance\t\t0.01f\n\n/// A body cannot sleep if its angular velocity is above this tolerance.\n#define b2_angularSleepTolerance\t(2.0f / 180.0f * b2_pi)\n\n// Memory Allocation\n\n/// Implement this function to use your own memory allocator.\nvoid* b2Alloc(int32 size);\n\n/// If you implement b2Alloc, you should also implement this function.\nvoid b2Free(void* mem);\n\n/// Logging function.\nvoid b2Log(const char* string, ...);\n\n/// Version numbering scheme.\n/// See http://en.wikipedia.org/wiki/Software_versioning\nstruct b2Version\n{\n\tint32 major;\t\t///< significant changes\n\tint32 minor;\t\t///< incremental changes\n\tint32 revision;\t\t///< bug fixes\n};\n\n/// Current version.\nextern b2Version b2_version;\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2StackAllocator.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_STACK_ALLOCATOR_H\n#define B2_STACK_ALLOCATOR_H\n\n#include \"b2Settings.h\"\n\nconst int32 b2_stackSize = 100 * 1024;\t// 100k\nconst int32 b2_maxStackEntries = 32;\n\nstruct b2StackEntry\n{\n\tchar* data;\n\tint32 size;\n\tbool usedMalloc;\n};\n\n// This is a stack allocator used for fast per step allocations.\n// You must nest allocate/free pairs. The code will assert\n// if you try to interleave multiple allocate/free pairs.\nclass b2StackAllocator\n{\npublic:\n\tb2StackAllocator();\n\t~b2StackAllocator();\n\n\tvoid* Allocate(int32 size);\n\tvoid Free(void* p);\n\n\tint32 GetMaxAllocation() const;\n\nprivate:\n\n\tchar m_data[b2_stackSize];\n\tint32 m_index;\n\n\tint32 m_allocation;\n\tint32 m_maxAllocation;\n\n\tb2StackEntry m_entries[b2_maxStackEntries];\n\tint32 m_entryCount;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Common/b2Timer.h",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_TIMER_H\n#define B2_TIMER_H\n\n#include \"b2Settings.h\"\n\n/// Timer for profiling. This has platform specific code and may\n/// not work on every platform.\nclass b2Timer\n{\npublic:\n\n\t/// Constructor\n\tb2Timer();\n\n\t/// Reset the timer.\n\tvoid Reset();\n\n\t/// Get the time since construction or the last reset.\n\tfloat32 GetMilliseconds() const;\n\nprivate:\n\n#if defined(_WIN32)\n\tfloat64 m_start;\n\tstatic float64 s_invFrequency;\n#elif defined(__linux__) || defined (__APPLE__)\n\tunsigned long m_start_sec;\n\tunsigned long m_start_usec;\n#endif\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CHAIN_AND_CIRCLE_CONTACT_H\n#define B2_CHAIN_AND_CIRCLE_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2ChainAndCircleContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2ChainAndCircleContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);\n\t~b2ChainAndCircleContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CHAIN_AND_POLYGON_CONTACT_H\n#define B2_CHAIN_AND_POLYGON_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2ChainAndPolygonContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2ChainAndPolygonContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);\n\t~b2ChainAndPolygonContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2CircleContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CIRCLE_CONTACT_H\n#define B2_CIRCLE_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2CircleContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2CircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);\n\t~b2CircleContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2Contact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CONTACT_H\n#define B2_CONTACT_H\n\n#include \"../../Common/b2Math.h\"\n#include \"../../Collision/b2Collision.h\"\n#include \"../../Collision/Shapes/b2Shape.h\"\n#include \"../b2Fixture.h\"\n\nclass b2Body;\nclass b2Contact;\nclass b2Fixture;\nclass b2World;\nclass b2BlockAllocator;\nclass b2StackAllocator;\nclass b2ContactListener;\n\n/// Friction mixing law. The idea is to allow either fixture to drive the restitution to zero.\n/// For example, anything slides on ice.\ninline float32 b2MixFriction(float32 friction1, float32 friction2)\n{\n\treturn b2Sqrt(friction1 * friction2);\n}\n\n/// Restitution mixing law. The idea is allow for anything to bounce off an inelastic surface.\n/// For example, a superball bounces on anything.\ninline float32 b2MixRestitution(float32 restitution1, float32 restitution2)\n{\n\treturn restitution1 > restitution2 ? restitution1 : restitution2;\n}\n\ntypedef b2Contact* b2ContactCreateFcn(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB,\n\t\t\t\t\t\t\t\t\t\tb2BlockAllocator* allocator);\ntypedef void b2ContactDestroyFcn(b2Contact* contact, b2BlockAllocator* allocator);\n\nstruct b2ContactRegister\n{\n\tb2ContactCreateFcn* createFcn;\n\tb2ContactDestroyFcn* destroyFcn;\n\tbool primary;\n};\n\n/// A contact edge is used to connect bodies and contacts together\n/// in a contact graph where each body is a node and each contact\n/// is an edge. A contact edge belongs to a doubly linked list\n/// maintained in each attached body. Each contact has two contact\n/// nodes, one for each attached body.\nstruct b2ContactEdge\n{\n\tb2Body* other;\t\t\t///< provides quick access to the other body attached.\n\tb2Contact* contact;\t\t///< the contact\n\tb2ContactEdge* prev;\t///< the previous contact edge in the body's contact list\n\tb2ContactEdge* next;\t///< the next contact edge in the body's contact list\n};\n\n/// The class manages contact between two shapes. A contact exists for each overlapping\n/// AABB in the broad-phase (except if filtered). Therefore a contact object may exist\n/// that has no contact points.\nclass b2Contact\n{\npublic:\n\n\t/// Get the contact manifold. Do not modify the manifold unless you understand the\n\t/// internals of Box2D.\n\tb2Manifold* GetManifold();\n\tconst b2Manifold* GetManifold() const;\n\n\t/// Get the world manifold.\n\tvoid GetWorldManifold(b2WorldManifold* worldManifold) const;\n\n\t/// Is this contact touching?\n\tbool IsTouching() const;\n\n\t/// Enable/disable this contact. This can be used inside the pre-solve\n\t/// contact listener. The contact is only disabled for the current\n\t/// time step (or sub-step in continuous collisions).\n\tvoid SetEnabled(bool flag);\n\n\t/// Has this contact been disabled?\n\tbool IsEnabled() const;\n\n\t/// Get the next contact in the world's contact list.\n\tb2Contact* GetNext();\n\tconst b2Contact* GetNext() const;\n\n\t/// Get fixture A in this contact.\n\tb2Fixture* GetFixtureA();\n\tconst b2Fixture* GetFixtureA() const;\n\n\t/// Get the child primitive index for fixture A.\n\tint32 GetChildIndexA() const;\n\n\t/// Get fixture B in this contact.\n\tb2Fixture* GetFixtureB();\n\tconst b2Fixture* GetFixtureB() const;\n\n\t/// Get the child primitive index for fixture B.\n\tint32 GetChildIndexB() const;\n\n\t/// Override the default friction mixture. You can call this in b2ContactListener::PreSolve.\n\t/// This value persists until set or reset.\n\tvoid SetFriction(float32 friction);\n\n\t/// Get the friction.\n\tfloat32 GetFriction() const;\n\n\t/// Reset the friction mixture to the default value.\n\tvoid ResetFriction();\n\n\t/// Override the default restitution mixture. You can call this in b2ContactListener::PreSolve.\n\t/// The value persists until you set or reset.\n\tvoid SetRestitution(float32 restitution);\n\n\t/// Get the restitution.\n\tfloat32 GetRestitution() const;\n\n\t/// Reset the restitution to the default value.\n\tvoid ResetRestitution();\n\n\t/// Set the desired tangent speed for a conveyor belt behavior. In meters per second.\n\tvoid SetTangentSpeed(float32 speed);\n\n\t/// Get the desired tangent speed. In meters per second.\n\tfloat32 GetTangentSpeed() const;\n\n\t/// Evaluate this contact with your own manifold and transforms.\n\tvirtual void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) = 0;\n\nprotected:\n\tfriend class b2ContactManager;\n\tfriend class b2World;\n\tfriend class b2ContactSolver;\n\tfriend class b2Body;\n\tfriend class b2Fixture;\n\n\t// Flags stored in m_flags\n\tenum\n\t{\n\t\t// Used when crawling contact graph when forming islands.\n\t\te_islandFlag\t\t= 0x0001,\n\n // Set when the shapes are touching.\n\t\te_touchingFlag\t\t= 0x0002,\n\n\t\t// This contact can be disabled (by user)\n\t\te_enabledFlag\t\t= 0x0004,\n\n\t\t// This contact needs filtering because a fixture filter was changed.\n\t\te_filterFlag\t\t= 0x0008,\n\n\t\t// This bullet contact had a TOI event\n\t\te_bulletHitFlag\t\t= 0x0010,\n\n\t\t// This contact has a valid TOI in m_toi\n\t\te_toiFlag\t\t\t= 0x0020\n\t};\n\n\t/// Flag this contact for filtering. Filtering will occur the next time step.\n\tvoid FlagForFiltering();\n\n\tstatic void AddType(b2ContactCreateFcn* createFcn, b2ContactDestroyFcn* destroyFcn,\n\t\t\t\t\t\tb2Shape::Type typeA, b2Shape::Type typeB);\n\tstatic void InitializeRegisters();\n\tstatic b2Contact* Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2Shape::Type typeA, b2Shape::Type typeB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2Contact() : m_fixtureA(NULL), m_fixtureB(NULL) {}\n\tb2Contact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);\n\tvirtual ~b2Contact() {}\n\n\tvoid Update(b2ContactListener* listener);\n\n\tstatic b2ContactRegister s_registers[b2Shape::e_typeCount][b2Shape::e_typeCount];\n\tstatic bool s_initialized;\n\n\tuint32 m_flags;\n\n\t// World pool and list pointers.\n\tb2Contact* m_prev;\n\tb2Contact* m_next;\n\n\t// Nodes for connecting bodies.\n\tb2ContactEdge m_nodeA;\n\tb2ContactEdge m_nodeB;\n\n\tb2Fixture* m_fixtureA;\n\tb2Fixture* m_fixtureB;\n\n\tint32 m_indexA;\n\tint32 m_indexB;\n\n\tb2Manifold m_manifold;\n\n\tint32 m_toiCount;\n\tfloat32 m_toi;\n\n\tfloat32 m_friction;\n\tfloat32 m_restitution;\n\n\tfloat32 m_tangentSpeed;\n};\n\ninline b2Manifold* b2Contact::GetManifold()\n{\n\treturn &m_manifold;\n}\n\ninline const b2Manifold* b2Contact::GetManifold() const\n{\n\treturn &m_manifold;\n}\n\ninline void b2Contact::GetWorldManifold(b2WorldManifold* worldManifold) const\n{\n\tconst b2Body* bodyA = m_fixtureA->GetBody();\n\tconst b2Body* bodyB = m_fixtureB->GetBody();\n\tconst b2Shape* shapeA = m_fixtureA->GetShape();\n\tconst b2Shape* shapeB = m_fixtureB->GetShape();\n\n\tworldManifold->Initialize(&m_manifold, bodyA->GetTransform(), shapeA->m_radius, bodyB->GetTransform(), shapeB->m_radius);\n}\n\ninline void b2Contact::SetEnabled(bool flag)\n{\n\tif (flag)\n\t{\n\t\tm_flags |= e_enabledFlag;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_enabledFlag;\n\t}\n}\n\ninline bool b2Contact::IsEnabled() const\n{\n\treturn (m_flags & e_enabledFlag) == e_enabledFlag;\n}\n\ninline bool b2Contact::IsTouching() const\n{\n\treturn (m_flags & e_touchingFlag) == e_touchingFlag;\n}\n\ninline b2Contact* b2Contact::GetNext()\n{\n\treturn m_next;\n}\n\ninline const b2Contact* b2Contact::GetNext() const\n{\n\treturn m_next;\n}\n\ninline b2Fixture* b2Contact::GetFixtureA()\n{\n\treturn m_fixtureA;\n}\n\ninline const b2Fixture* b2Contact::GetFixtureA() const\n{\n\treturn m_fixtureA;\n}\n\ninline b2Fixture* b2Contact::GetFixtureB()\n{\n\treturn m_fixtureB;\n}\n\ninline int32 b2Contact::GetChildIndexA() const\n{\n\treturn m_indexA;\n}\n\ninline const b2Fixture* b2Contact::GetFixtureB() const\n{\n\treturn m_fixtureB;\n}\n\ninline int32 b2Contact::GetChildIndexB() const\n{\n\treturn m_indexB;\n}\n\ninline void b2Contact::FlagForFiltering()\n{\n\tm_flags |= e_filterFlag;\n}\n\ninline void b2Contact::SetFriction(float32 friction)\n{\n\tm_friction = friction;\n}\n\ninline float32 b2Contact::GetFriction() const\n{\n\treturn m_friction;\n}\n\ninline void b2Contact::ResetFriction()\n{\n\tm_friction = b2MixFriction(m_fixtureA->m_friction, m_fixtureB->m_friction);\n}\n\ninline void b2Contact::SetRestitution(float32 restitution)\n{\n\tm_restitution = restitution;\n}\n\ninline float32 b2Contact::GetRestitution() const\n{\n\treturn m_restitution;\n}\n\ninline void b2Contact::ResetRestitution()\n{\n\tm_restitution = b2MixRestitution(m_fixtureA->m_restitution, m_fixtureB->m_restitution);\n}\n\ninline void b2Contact::SetTangentSpeed(float32 speed)\n{\n\tm_tangentSpeed = speed;\n}\n\ninline float32 b2Contact::GetTangentSpeed() const\n{\n\treturn m_tangentSpeed;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2ContactSolver.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CONTACT_SOLVER_H\n#define B2_CONTACT_SOLVER_H\n\n#include \"../../Common/b2Math.h\"\n#include \"../../Collision/b2Collision.h\"\n#include \"../b2TimeStep.h\"\n\nclass b2Contact;\nclass b2Body;\nclass b2StackAllocator;\nstruct b2ContactPositionConstraint;\n\nstruct b2VelocityConstraintPoint\n{\n\tb2Vec2 rA;\n\tb2Vec2 rB;\n\tfloat32 normalImpulse;\n\tfloat32 tangentImpulse;\n\tfloat32 normalMass;\n\tfloat32 tangentMass;\n\tfloat32 velocityBias;\n};\n\nstruct b2ContactVelocityConstraint\n{\n\tb2VelocityConstraintPoint points[b2_maxManifoldPoints];\n\tb2Vec2 normal;\n\tb2Mat22 normalMass;\n\tb2Mat22 K;\n\tint32 indexA;\n\tint32 indexB;\n\tfloat32 invMassA, invMassB;\n\tfloat32 invIA, invIB;\n\tfloat32 friction;\n\tfloat32 restitution;\n\tfloat32 tangentSpeed;\n\tint32 pointCount;\n\tint32 contactIndex;\n};\n\nstruct b2ContactSolverDef\n{\n\tb2TimeStep step;\n\tb2Contact** contacts;\n\tint32 count;\n\tb2Position* positions;\n\tb2Velocity* velocities;\n\tb2StackAllocator* allocator;\n};\n\nclass b2ContactSolver\n{\npublic:\n\tb2ContactSolver(b2ContactSolverDef* def);\n\t~b2ContactSolver();\n\n\tvoid InitializeVelocityConstraints();\n\n\tvoid WarmStart();\n\tvoid SolveVelocityConstraints();\n\tvoid StoreImpulses();\n\n\tbool SolvePositionConstraints();\n\tbool SolveTOIPositionConstraints(int32 toiIndexA, int32 toiIndexB);\n\n\tb2TimeStep m_step;\n\tb2Position* m_positions;\n\tb2Velocity* m_velocities;\n\tb2StackAllocator* m_allocator;\n\tb2ContactPositionConstraint* m_positionConstraints;\n\tb2ContactVelocityConstraint* m_velocityConstraints;\n\tb2Contact** m_contacts;\n\tint m_count;\n};\n\n#endif\n\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_EDGE_AND_CIRCLE_CONTACT_H\n#define B2_EDGE_AND_CIRCLE_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2EdgeAndCircleContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2EdgeAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);\n\t~b2EdgeAndCircleContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_EDGE_AND_POLYGON_CONTACT_H\n#define B2_EDGE_AND_POLYGON_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2EdgeAndPolygonContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2EdgeAndPolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB);\n\t~b2EdgeAndPolygonContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_POLYGON_AND_CIRCLE_CONTACT_H\n#define B2_POLYGON_AND_CIRCLE_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2PolygonAndCircleContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2PolygonAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);\n\t~b2PolygonAndCircleContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Contacts/b2PolygonContact.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_POLYGON_CONTACT_H\n#define B2_POLYGON_CONTACT_H\n\n#include \"b2Contact.h\"\n\nclass b2BlockAllocator;\n\nclass b2PolygonContact : public b2Contact\n{\npublic:\n\tstatic b2Contact* Create(\tb2Fixture* fixtureA, int32 indexA,\n\t\t\t\t\t\t\t\tb2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Contact* contact, b2BlockAllocator* allocator);\n\n\tb2PolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB);\n\t~b2PolygonContact() {}\n\n\tvoid Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB);\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2DistanceJoint.h",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_DISTANCE_JOINT_H\n#define B2_DISTANCE_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Distance joint definition. This requires defining an\n/// anchor point on both bodies and the non-zero length of the\n/// distance joint. The definition uses local anchor points\n/// so that the initial configuration can violate the constraint\n/// slightly. This helps when saving and loading a game.\n/// @warning Do not use a zero or short length.\nstruct b2DistanceJointDef : public b2JointDef\n{\n\tb2DistanceJointDef()\n\t{\n\t\ttype = e_distanceJoint;\n\t\tlocalAnchorA.Set(0.0f, 0.0f);\n\t\tlocalAnchorB.Set(0.0f, 0.0f);\n\t\tlength = 1.0f;\n\t\tfrequencyHz = 0.0f;\n\t\tdampingRatio = 0.0f;\n\t}\n\n\t/// Initialize the bodies, anchors, and length using the world\n\t/// anchors.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB,\n\t\t\t\t\tconst b2Vec2& anchorA, const b2Vec2& anchorB);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The natural length between the anchor points.\n\tfloat32 length;\n\n\t/// The mass-spring-damper frequency in Hertz. A value of 0\n\t/// disables softness.\n\tfloat32 frequencyHz;\n\n\t/// The damping ratio. 0 = no damping, 1 = critical damping.\n\tfloat32 dampingRatio;\n};\n\n/// A distance joint constrains two points on two bodies\n/// to remain at a fixed distance from each other. You can view\n/// this as a massless, rigid rod.\nclass b2DistanceJoint : public b2Joint\n{\npublic:\n\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\t/// Get the reaction force given the inverse time step.\n\t/// Unit is N.\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\n\t/// Get the reaction torque given the inverse time step.\n\t/// Unit is N*m. This is always zero for a distance joint.\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// Set/get the natural length.\n\t/// Manipulating the length can lead to non-physical behavior when the frequency is zero.\n\tvoid SetLength(float32 length);\n\tfloat32 GetLength() const;\n\n\t/// Set/get frequency in Hz.\n\tvoid SetFrequency(float32 hz);\n\tfloat32 GetFrequency() const;\n\n\t/// Set/get damping ratio.\n\tvoid SetDampingRatio(float32 ratio);\n\tfloat32 GetDampingRatio() const;\n\n\t/// Dump joint to dmLog\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\tb2DistanceJoint(const b2DistanceJointDef* data);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tfloat32 m_frequencyHz;\n\tfloat32 m_dampingRatio;\n\tfloat32 m_bias;\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tfloat32 m_gamma;\n\tfloat32 m_impulse;\n\tfloat32 m_length;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_u;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tfloat32 m_mass;\n};\n\ninline void b2DistanceJoint::SetLength(float32 length)\n{\n\tm_length = length;\n}\n\ninline float32 b2DistanceJoint::GetLength() const\n{\n\treturn m_length;\n}\n\ninline void b2DistanceJoint::SetFrequency(float32 hz)\n{\n\tm_frequencyHz = hz;\n}\n\ninline float32 b2DistanceJoint::GetFrequency() const\n{\n\treturn m_frequencyHz;\n}\n\ninline void b2DistanceJoint::SetDampingRatio(float32 ratio)\n{\n\tm_dampingRatio = ratio;\n}\n\ninline float32 b2DistanceJoint::GetDampingRatio() const\n{\n\treturn m_dampingRatio;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2FrictionJoint.h",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_FRICTION_JOINT_H\n#define B2_FRICTION_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Friction joint definition.\nstruct b2FrictionJointDef : public b2JointDef\n{\n\tb2FrictionJointDef()\n\t{\n\t\ttype = e_frictionJoint;\n\t\tlocalAnchorA.SetZero();\n\t\tlocalAnchorB.SetZero();\n\t\tmaxForce = 0.0f;\n\t\tmaxTorque = 0.0f;\n\t}\n\n\t/// Initialize the bodies, anchors, axis, and reference angle using the world\n\t/// anchor and world axis.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB, const b2Vec2& anchor);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The maximum friction force in N.\n\tfloat32 maxForce;\n\n\t/// The maximum friction torque in N-m.\n\tfloat32 maxTorque;\n};\n\n/// Friction joint. This is used for top-down friction.\n/// It provides 2D translational friction and angular friction.\nclass b2FrictionJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// Set the maximum friction force in N.\n\tvoid SetMaxForce(float32 force);\n\n\t/// Get the maximum friction force in N.\n\tfloat32 GetMaxForce() const;\n\n\t/// Set the maximum friction torque in N*m.\n\tvoid SetMaxTorque(float32 torque);\n\n\t/// Get the maximum friction torque in N*m.\n\tfloat32 GetMaxTorque() const;\n\n\t/// Dump joint to dmLog\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\n\tb2FrictionJoint(const b2FrictionJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\n\t// Solver shared\n\tb2Vec2 m_linearImpulse;\n\tfloat32 m_angularImpulse;\n\tfloat32 m_maxForce;\n\tfloat32 m_maxTorque;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tb2Mat22 m_linearMass;\n\tfloat32 m_angularMass;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2GearJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_GEAR_JOINT_H\n#define B2_GEAR_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Gear joint definition. This definition requires two existing\n/// revolute or prismatic joints (any combination will work).\nstruct b2GearJointDef : public b2JointDef\n{\n\tb2GearJointDef()\n\t{\n\t\ttype = e_gearJoint;\n\t\tjoint1 = NULL;\n\t\tjoint2 = NULL;\n\t\tratio = 1.0f;\n\t}\n\n\t/// The first revolute/prismatic joint attached to the gear joint.\n\tb2Joint* joint1;\n\n\t/// The second revolute/prismatic joint attached to the gear joint.\n\tb2Joint* joint2;\n\n\t/// The gear ratio.\n\t/// @see b2GearJoint for explanation.\n\tfloat32 ratio;\n};\n\n/// A gear joint is used to connect two joints together. Either joint\n/// can be a revolute or prismatic joint. You specify a gear ratio\n/// to bind the motions together:\n/// coordinate1 + ratio * coordinate2 = constant\n/// The ratio can be negative or positive. If one joint is a revolute joint\n/// and the other joint is a prismatic joint, then the ratio will have units\n/// of length or units of 1/length.\n/// @warning You have to manually destroy the gear joint if joint1 or joint2\n/// is destroyed.\nclass b2GearJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// Get the first joint.\n\tb2Joint* GetJoint1() { return m_joint1; }\n\n\t/// Get the second joint.\n\tb2Joint* GetJoint2() { return m_joint2; }\n\n\t/// Set/Get the gear ratio.\n\tvoid SetRatio(float32 ratio);\n\tfloat32 GetRatio() const;\n\n\t/// Dump joint to dmLog\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\tb2GearJoint(const b2GearJointDef* data);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tb2Joint* m_joint1;\n\tb2Joint* m_joint2;\n\n\tb2JointType m_typeA;\n\tb2JointType m_typeB;\n\n\t// Body A is connected to body C\n\t// Body B is connected to body D\n\tb2Body* m_bodyC;\n\tb2Body* m_bodyD;\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tb2Vec2 m_localAnchorC;\n\tb2Vec2 m_localAnchorD;\n\n\tb2Vec2 m_localAxisC;\n\tb2Vec2 m_localAxisD;\n\n\tfloat32 m_referenceAngleA;\n\tfloat32 m_referenceAngleB;\n\n\tfloat32 m_constant;\n\tfloat32 m_ratio;\n\n\tfloat32 m_impulse;\n\n\t// Solver temp\n\tint32 m_indexA, m_indexB, m_indexC, m_indexD;\n\tb2Vec2 m_lcA, m_lcB, m_lcC, m_lcD;\n\tfloat32 m_mA, m_mB, m_mC, m_mD;\n\tfloat32 m_iA, m_iB, m_iC, m_iD;\n\tb2Vec2 m_JvAC, m_JvBD;\n\tfloat32 m_JwA, m_JwB, m_JwC, m_JwD;\n\tfloat32 m_mass;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2Joint.h",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_JOINT_H\n#define B2_JOINT_H\n\n#include \"../../Common/b2Math.h\"\n\nclass b2Body;\nclass b2Joint;\nstruct b2SolverData;\nclass b2BlockAllocator;\n\nenum b2JointType\n{\n\te_unknownJoint,\n\te_revoluteJoint,\n\te_prismaticJoint,\n\te_distanceJoint,\n\te_pulleyJoint,\n\te_mouseJoint,\n\te_gearJoint,\n\te_wheelJoint,\n e_weldJoint,\n\te_frictionJoint,\n\te_ropeJoint,\n\te_motorJoint\n};\n\nenum b2LimitState\n{\n\te_inactiveLimit,\n\te_atLowerLimit,\n\te_atUpperLimit,\n\te_equalLimits\n};\n\nstruct b2Jacobian\n{\n\tb2Vec2 linear;\n\tfloat32 angularA;\n\tfloat32 angularB;\n};\n\n/// A joint edge is used to connect bodies and joints together\n/// in a joint graph where each body is a node and each joint\n/// is an edge. A joint edge belongs to a doubly linked list\n/// maintained in each attached body. Each joint has two joint\n/// nodes, one for each attached body.\nstruct b2JointEdge\n{\n\tb2Body* other;\t\t\t///< provides quick access to the other body attached.\n\tb2Joint* joint;\t\t\t///< the joint\n\tb2JointEdge* prev;\t\t///< the previous joint edge in the body's joint list\n\tb2JointEdge* next;\t\t///< the next joint edge in the body's joint list\n};\n\n/// Joint definitions are used to construct joints.\nstruct b2JointDef\n{\n\tb2JointDef()\n\t{\n\t\ttype = e_unknownJoint;\n\t\tuserData = NULL;\n\t\tbodyA = NULL;\n\t\tbodyB = NULL;\n\t\tcollideConnected = false;\n\t}\n\n\t/// The joint type is set automatically for concrete joint types.\n\tb2JointType type;\n\n\t/// Use this to attach application specific data to your joints.\n\tvoid* userData;\n\n\t/// The first attached body.\n\tb2Body* bodyA;\n\n\t/// The second attached body.\n\tb2Body* bodyB;\n\n\t/// Set this flag to true if the attached bodies should collide.\n\tbool collideConnected;\n};\n\n/// The base joint class. Joints are used to constraint two bodies together in\n/// various fashions. Some joints also feature limits and motors.\nclass b2Joint\n{\npublic:\n\n\t/// Get the type of the concrete joint.\n\tb2JointType GetType() const;\n\n\t/// Get the first body attached to this joint.\n\tb2Body* GetBodyA();\n\n\t/// Get the second body attached to this joint.\n\tb2Body* GetBodyB();\n\n\t/// Get the anchor point on bodyA in world coordinates.\n\tvirtual b2Vec2 GetAnchorA() const = 0;\n\n\t/// Get the anchor point on bodyB in world coordinates.\n\tvirtual b2Vec2 GetAnchorB() const = 0;\n\n\t/// Get the reaction force on bodyB at the joint anchor in Newtons.\n\tvirtual b2Vec2 GetReactionForce(float32 inv_dt) const = 0;\n\n\t/// Get the reaction torque on bodyB in N*m.\n\tvirtual float32 GetReactionTorque(float32 inv_dt) const = 0;\n\n\t/// Get the next joint the world joint list.\n\tb2Joint* GetNext();\n\tconst b2Joint* GetNext() const;\n\n\t/// Get the user data pointer.\n\tvoid* GetUserData() const;\n\n\t/// Set the user data pointer.\n\tvoid SetUserData(void* data);\n\n\t/// Short-cut function to determine if either body is inactive.\n\tbool IsActive() const;\n\n\t/// Get collide connected.\n\t/// Note: modifying the collide connect flag won't work correctly because\n\t/// the flag is only checked when fixture AABBs begin to overlap.\n\tbool GetCollideConnected() const;\n\n\t/// Dump this joint to the log file.\n\tvirtual void Dump() { b2Log(\"// Dump is not supported for this joint type.\\n\"); }\n\n\t/// Shift the origin for any points stored in world coordinates.\n\tvirtual void ShiftOrigin(const b2Vec2& newOrigin) { B2_NOT_USED(newOrigin); }\n\nprotected:\n\tfriend class b2World;\n\tfriend class b2Body;\n\tfriend class b2Island;\n\tfriend class b2GearJoint;\n\n\tstatic b2Joint* Create(const b2JointDef* def, b2BlockAllocator* allocator);\n\tstatic void Destroy(b2Joint* joint, b2BlockAllocator* allocator);\n\n\tb2Joint(const b2JointDef* def);\n\tvirtual ~b2Joint() {}\n\n\tvirtual void InitVelocityConstraints(const b2SolverData& data) = 0;\n\tvirtual void SolveVelocityConstraints(const b2SolverData& data) = 0;\n\n\t// This returns true if the position errors are within tolerance.\n\tvirtual bool SolvePositionConstraints(const b2SolverData& data) = 0;\n\n\tb2JointType m_type;\n\tb2Joint* m_prev;\n\tb2Joint* m_next;\n\tb2JointEdge m_edgeA;\n\tb2JointEdge m_edgeB;\n\tb2Body* m_bodyA;\n\tb2Body* m_bodyB;\n\n\tint32 m_index;\n\n\tbool m_islandFlag;\n\tbool m_collideConnected;\n\n\tvoid* m_userData;\n};\n\ninline b2JointType b2Joint::GetType() const\n{\n\treturn m_type;\n}\n\ninline b2Body* b2Joint::GetBodyA()\n{\n\treturn m_bodyA;\n}\n\ninline b2Body* b2Joint::GetBodyB()\n{\n\treturn m_bodyB;\n}\n\ninline b2Joint* b2Joint::GetNext()\n{\n\treturn m_next;\n}\n\ninline const b2Joint* b2Joint::GetNext() const\n{\n\treturn m_next;\n}\n\ninline void* b2Joint::GetUserData() const\n{\n\treturn m_userData;\n}\n\ninline void b2Joint::SetUserData(void* data)\n{\n\tm_userData = data;\n}\n\ninline bool b2Joint::GetCollideConnected() const\n{\n\treturn m_collideConnected;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2MotorJoint.h",
"content": "/*\n* Copyright (c) 2006-2012 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_MOTOR_JOINT_H\n#define B2_MOTOR_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Motor joint definition.\nstruct b2MotorJointDef : public b2JointDef\n{\n\tb2MotorJointDef()\n\t{\n\t\ttype = e_motorJoint;\n\t\tlinearOffset.SetZero();\n\t\tangularOffset = 0.0f;\n\t\tmaxForce = 1.0f;\n\t\tmaxTorque = 1.0f;\n\t\tcorrectionFactor = 0.3f;\n\t}\n\n\t/// Initialize the bodies and offsets using the current transforms.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB);\n\n\t/// Position of bodyB minus the position of bodyA, in bodyA's frame, in meters.\n\tb2Vec2 linearOffset;\n\n\t/// The bodyB angle minus bodyA angle in radians.\n\tfloat32 angularOffset;\n\n\t/// The maximum motor force in N.\n\tfloat32 maxForce;\n\n\t/// The maximum motor torque in N-m.\n\tfloat32 maxTorque;\n\n\t/// Position correction factor in the range [0,1].\n\tfloat32 correctionFactor;\n};\n\n/// A motor joint is used to control the relative motion\n/// between two bodies. A typical usage is to control the movement\n/// of a dynamic body with respect to the ground.\nclass b2MotorJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// Set/get the target linear offset, in frame A, in meters.\n\tvoid SetLinearOffset(const b2Vec2& linearOffset);\n\tconst b2Vec2& GetLinearOffset() const;\n\n\t/// Set/get the target angular offset, in radians.\n\tvoid SetAngularOffset(float32 angularOffset);\n\tfloat32 GetAngularOffset() const;\n\n\t/// Set the maximum friction force in N.\n\tvoid SetMaxForce(float32 force);\n\n\t/// Get the maximum friction force in N.\n\tfloat32 GetMaxForce() const;\n\n\t/// Set the maximum friction torque in N*m.\n\tvoid SetMaxTorque(float32 torque);\n\n\t/// Get the maximum friction torque in N*m.\n\tfloat32 GetMaxTorque() const;\n\n\t/// Set the position correction factor in the range [0,1].\n\tvoid SetCorrectionFactor(float32 factor);\n\n\t/// Get the position correction factor in the range [0,1].\n\tfloat32 GetCorrectionFactor() const;\n\n\t/// Dump to b2Log\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\n\tb2MotorJoint(const b2MotorJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\t// Solver shared\n\tb2Vec2 m_linearOffset;\n\tfloat32 m_angularOffset;\n\tb2Vec2 m_linearImpulse;\n\tfloat32 m_angularImpulse;\n\tfloat32 m_maxForce;\n\tfloat32 m_maxTorque;\n\tfloat32 m_correctionFactor;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tb2Vec2 m_linearError;\n\tfloat32 m_angularError;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tb2Mat22 m_linearMass;\n\tfloat32 m_angularMass;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2MouseJoint.h",
"content": "/*\n* Copyright (c) 2006-2007 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_MOUSE_JOINT_H\n#define B2_MOUSE_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Mouse joint definition. This requires a world target point,\n/// tuning parameters, and the time step.\nstruct b2MouseJointDef : public b2JointDef\n{\n\tb2MouseJointDef()\n\t{\n\t\ttype = e_mouseJoint;\n\t\ttarget.Set(0.0f, 0.0f);\n\t\tmaxForce = 0.0f;\n\t\tfrequencyHz = 5.0f;\n\t\tdampingRatio = 0.7f;\n\t}\n\n\t/// The initial world target point. This is assumed\n\t/// to coincide with the body anchor initially.\n\tb2Vec2 target;\n\n\t/// The maximum constraint force that can be exerted\n\t/// to move the candidate body. Usually you will express\n\t/// as some multiple of the weight (multiplier * mass * gravity).\n\tfloat32 maxForce;\n\n\t/// The response speed.\n\tfloat32 frequencyHz;\n\n\t/// The damping ratio. 0 = no damping, 1 = critical damping.\n\tfloat32 dampingRatio;\n};\n\n/// A mouse joint is used to make a point on a body track a\n/// specified world point. This a soft constraint with a maximum\n/// force. This allows the constraint to stretch and without\n/// applying huge forces.\n/// NOTE: this joint is not documented in the manual because it was\n/// developed to be used in the testbed. If you want to learn how to\n/// use the mouse joint, look at the testbed.\nclass b2MouseJoint : public b2Joint\n{\npublic:\n\n\t/// Implements b2Joint.\n\tb2Vec2 GetAnchorA() const;\n\n\t/// Implements b2Joint.\n\tb2Vec2 GetAnchorB() const;\n\n\t/// Implements b2Joint.\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\n\t/// Implements b2Joint.\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// Use this to update the target point.\n\tvoid SetTarget(const b2Vec2& target);\n\tconst b2Vec2& GetTarget() const;\n\n\t/// Set/get the maximum force in Newtons.\n\tvoid SetMaxForce(float32 force);\n\tfloat32 GetMaxForce() const;\n\n\t/// Set/get the frequency in Hertz.\n\tvoid SetFrequency(float32 hz);\n\tfloat32 GetFrequency() const;\n\n\t/// Set/get the damping ratio (dimensionless).\n\tvoid SetDampingRatio(float32 ratio);\n\tfloat32 GetDampingRatio() const;\n\n\t/// The mouse joint does not support dumping.\n\tvoid Dump() { b2Log(\"Mouse joint dumping is not supported.\\n\"); }\n\n\t/// Implement b2Joint::ShiftOrigin\n\tvoid ShiftOrigin(const b2Vec2& newOrigin);\n\nprotected:\n\tfriend class b2Joint;\n\n\tb2MouseJoint(const b2MouseJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tb2Vec2 m_localAnchorB;\n\tb2Vec2 m_targetA;\n\tfloat32 m_frequencyHz;\n\tfloat32 m_dampingRatio;\n\tfloat32 m_beta;\n\n\t// Solver shared\n\tb2Vec2 m_impulse;\n\tfloat32 m_maxForce;\n\tfloat32 m_gamma;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIB;\n\tb2Mat22 m_mass;\n\tb2Vec2 m_C;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2PrismaticJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_PRISMATIC_JOINT_H\n#define B2_PRISMATIC_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Prismatic joint definition. This requires defining a line of\n/// motion using an axis and an anchor point. The definition uses local\n/// anchor points and a local axis so that the initial configuration\n/// can violate the constraint slightly. The joint translation is zero\n/// when the local anchor points coincide in world space. Using local\n/// anchors and a local axis helps when saving and loading a game.\nstruct b2PrismaticJointDef : public b2JointDef\n{\n\tb2PrismaticJointDef()\n\t{\n\t\ttype = e_prismaticJoint;\n\t\tlocalAnchorA.SetZero();\n\t\tlocalAnchorB.SetZero();\n\t\tlocalAxisA.Set(1.0f, 0.0f);\n\t\treferenceAngle = 0.0f;\n\t\tenableLimit = false;\n\t\tlowerTranslation = 0.0f;\n\t\tupperTranslation = 0.0f;\n\t\tenableMotor = false;\n\t\tmaxMotorForce = 0.0f;\n\t\tmotorSpeed = 0.0f;\n\t}\n\n\t/// Initialize the bodies, anchors, axis, and reference angle using the world\n\t/// anchor and unit world axis.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB, const b2Vec2& anchor, const b2Vec2& axis);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The local translation unit axis in bodyA.\n\tb2Vec2 localAxisA;\n\n\t/// The constrained angle between the bodies: bodyB_angle - bodyA_angle.\n\tfloat32 referenceAngle;\n\n\t/// Enable/disable the joint limit.\n\tbool enableLimit;\n\n\t/// The lower translation limit, usually in meters.\n\tfloat32 lowerTranslation;\n\n\t/// The upper translation limit, usually in meters.\n\tfloat32 upperTranslation;\n\n\t/// Enable/disable the joint motor.\n\tbool enableMotor;\n\n\t/// The maximum motor torque, usually in N-m.\n\tfloat32 maxMotorForce;\n\n\t/// The desired motor speed in radians per second.\n\tfloat32 motorSpeed;\n};\n\n/// A prismatic joint. This joint provides one degree of freedom: translation\n/// along an axis fixed in bodyA. Relative rotation is prevented. You can\n/// use a joint limit to restrict the range of motion and a joint motor to\n/// drive the motion or to model joint friction.\nclass b2PrismaticJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// The local joint axis relative to bodyA.\n\tconst b2Vec2& GetLocalAxisA() const { return m_localXAxisA; }\n\n\t/// Get the reference angle.\n\tfloat32 GetReferenceAngle() const { return m_referenceAngle; }\n\n\t/// Get the current joint translation, usually in meters.\n\tfloat32 GetJointTranslation() const;\n\n\t/// Get the current joint translation speed, usually in meters per second.\n\tfloat32 GetJointSpeed() const;\n\n\t/// Is the joint limit enabled?\n\tbool IsLimitEnabled() const;\n\n\t/// Enable/disable the joint limit.\n\tvoid EnableLimit(bool flag);\n\n\t/// Get the lower joint limit, usually in meters.\n\tfloat32 GetLowerLimit() const;\n\n\t/// Get the upper joint limit, usually in meters.\n\tfloat32 GetUpperLimit() const;\n\n\t/// Set the joint limits, usually in meters.\n\tvoid SetLimits(float32 lower, float32 upper);\n\n\t/// Is the joint motor enabled?\n\tbool IsMotorEnabled() const;\n\n\t/// Enable/disable the joint motor.\n\tvoid EnableMotor(bool flag);\n\n\t/// Set the motor speed, usually in meters per second.\n\tvoid SetMotorSpeed(float32 speed);\n\n\t/// Get the motor speed, usually in meters per second.\n\tfloat32 GetMotorSpeed() const;\n\n\t/// Set the maximum motor force, usually in N.\n\tvoid SetMaxMotorForce(float32 force);\n\tfloat32 GetMaxMotorForce() const { return m_maxMotorForce; }\n\n\t/// Get the current motor force given the inverse time step, usually in N.\n\tfloat32 GetMotorForce(float32 inv_dt) const;\n\n\t/// Dump to b2Log\n\tvoid Dump();\n\nprotected:\n\tfriend class b2Joint;\n\tfriend class b2GearJoint;\n\tb2PrismaticJoint(const b2PrismaticJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tb2Vec2 m_localXAxisA;\n\tb2Vec2 m_localYAxisA;\n\tfloat32 m_referenceAngle;\n\tb2Vec3 m_impulse;\n\tfloat32 m_motorImpulse;\n\tfloat32 m_lowerTranslation;\n\tfloat32 m_upperTranslation;\n\tfloat32 m_maxMotorForce;\n\tfloat32 m_motorSpeed;\n\tbool m_enableLimit;\n\tbool m_enableMotor;\n\tb2LimitState m_limitState;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tb2Vec2 m_axis, m_perp;\n\tfloat32 m_s1, m_s2;\n\tfloat32 m_a1, m_a2;\n\tb2Mat33 m_K;\n\tfloat32 m_motorMass;\n};\n\ninline float32 b2PrismaticJoint::GetMotorSpeed() const\n{\n\treturn m_motorSpeed;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2PulleyJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_PULLEY_JOINT_H\n#define B2_PULLEY_JOINT_H\n\n#include \"b2Joint.h\"\n\nconst float32 b2_minPulleyLength = 2.0f;\n\n/// Pulley joint definition. This requires two ground anchors,\n/// two dynamic body anchor points, and a pulley ratio.\nstruct b2PulleyJointDef : public b2JointDef\n{\n\tb2PulleyJointDef()\n\t{\n\t\ttype = e_pulleyJoint;\n\t\tgroundAnchorA.Set(-1.0f, 1.0f);\n\t\tgroundAnchorB.Set(1.0f, 1.0f);\n\t\tlocalAnchorA.Set(-1.0f, 0.0f);\n\t\tlocalAnchorB.Set(1.0f, 0.0f);\n\t\tlengthA = 0.0f;\n\t\tlengthB = 0.0f;\n\t\tratio = 1.0f;\n\t\tcollideConnected = true;\n\t}\n\n\t/// Initialize the bodies, anchors, lengths, max lengths, and ratio using the world anchors.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB,\n\t\t\t\t\tconst b2Vec2& groundAnchorA, const b2Vec2& groundAnchorB,\n\t\t\t\t\tconst b2Vec2& anchorA, const b2Vec2& anchorB,\n\t\t\t\t\tfloat32 ratio);\n\n\t/// The first ground anchor in world coordinates. This point never moves.\n\tb2Vec2 groundAnchorA;\n\n\t/// The second ground anchor in world coordinates. This point never moves.\n\tb2Vec2 groundAnchorB;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The a reference length for the segment attached to bodyA.\n\tfloat32 lengthA;\n\n\t/// The a reference length for the segment attached to bodyB.\n\tfloat32 lengthB;\n\n\t/// The pulley ratio, used to simulate a block-and-tackle.\n\tfloat32 ratio;\n};\n\n/// The pulley joint is connected to two bodies and two fixed ground points.\n/// The pulley supports a ratio such that:\n/// length1 + ratio * length2 <= constant\n/// Yes, the force transmitted is scaled by the ratio.\n/// Warning: the pulley joint can get a bit squirrelly by itself. They often\n/// work better when combined with prismatic joints. You should also cover the\n/// the anchor points with static shapes to prevent one side from going to\n/// zero length.\nclass b2PulleyJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// Get the first ground anchor.\n\tb2Vec2 GetGroundAnchorA() const;\n\n\t/// Get the second ground anchor.\n\tb2Vec2 GetGroundAnchorB() const;\n\n\t/// Get the current length of the segment attached to bodyA.\n\tfloat32 GetLengthA() const;\n\n\t/// Get the current length of the segment attached to bodyB.\n\tfloat32 GetLengthB() const;\n\n\t/// Get the pulley ratio.\n\tfloat32 GetRatio() const;\n\n\t/// Get the current length of the segment attached to bodyA.\n\tfloat32 GetCurrentLengthA() const;\n\n\t/// Get the current length of the segment attached to bodyB.\n\tfloat32 GetCurrentLengthB() const;\n\n\t/// Dump joint to dmLog\n\tvoid Dump();\n\n\t/// Implement b2Joint::ShiftOrigin\n\tvoid ShiftOrigin(const b2Vec2& newOrigin);\n\nprotected:\n\n\tfriend class b2Joint;\n\tb2PulleyJoint(const b2PulleyJointDef* data);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tb2Vec2 m_groundAnchorA;\n\tb2Vec2 m_groundAnchorB;\n\tfloat32 m_lengthA;\n\tfloat32 m_lengthB;\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tfloat32 m_constant;\n\tfloat32 m_ratio;\n\tfloat32 m_impulse;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_uA;\n\tb2Vec2 m_uB;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tfloat32 m_mass;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2RevoluteJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_REVOLUTE_JOINT_H\n#define B2_REVOLUTE_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Revolute joint definition. This requires defining an\n/// anchor point where the bodies are joined. The definition\n/// uses local anchor points so that the initial configuration\n/// can violate the constraint slightly. You also need to\n/// specify the initial relative angle for joint limits. This\n/// helps when saving and loading a game.\n/// The local anchor points are measured from the body's origin\n/// rather than the center of mass because:\n/// 1. you might not know where the center of mass will be.\n/// 2. if you add/remove shapes from a body and recompute the mass,\n/// the joints will be broken.\nstruct b2RevoluteJointDef : public b2JointDef\n{\n\tb2RevoluteJointDef()\n\t{\n\t\ttype = e_revoluteJoint;\n\t\tlocalAnchorA.Set(0.0f, 0.0f);\n\t\tlocalAnchorB.Set(0.0f, 0.0f);\n\t\treferenceAngle = 0.0f;\n\t\tlowerAngle = 0.0f;\n\t\tupperAngle = 0.0f;\n\t\tmaxMotorTorque = 0.0f;\n\t\tmotorSpeed = 0.0f;\n\t\tenableLimit = false;\n\t\tenableMotor = false;\n\t}\n\n\t/// Initialize the bodies, anchors, and reference angle using a world\n\t/// anchor point.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB, const b2Vec2& anchor);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The bodyB angle minus bodyA angle in the reference state (radians).\n\tfloat32 referenceAngle;\n\n\t/// A flag to enable joint limits.\n\tbool enableLimit;\n\n\t/// The lower angle for the joint limit (radians).\n\tfloat32 lowerAngle;\n\n\t/// The upper angle for the joint limit (radians).\n\tfloat32 upperAngle;\n\n\t/// A flag to enable the joint motor.\n\tbool enableMotor;\n\n\t/// The desired motor speed. Usually in radians per second.\n\tfloat32 motorSpeed;\n\n\t/// The maximum motor torque used to achieve the desired motor speed.\n\t/// Usually in N-m.\n\tfloat32 maxMotorTorque;\n};\n\n/// A revolute joint constrains two bodies to share a common point while they\n/// are free to rotate about the point. The relative rotation about the shared\n/// point is the joint angle. You can limit the relative rotation with\n/// a joint limit that specifies a lower and upper angle. You can use a motor\n/// to drive the relative rotation about the shared point. A maximum motor torque\n/// is provided so that infinite forces are not generated.\nclass b2RevoluteJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// Get the reference angle.\n\tfloat32 GetReferenceAngle() const { return m_referenceAngle; }\n\n\t/// Get the current joint angle in radians.\n\tfloat32 GetJointAngle() const;\n\n\t/// Get the current joint angle speed in radians per second.\n\tfloat32 GetJointSpeed() const;\n\n\t/// Is the joint limit enabled?\n\tbool IsLimitEnabled() const;\n\n\t/// Enable/disable the joint limit.\n\tvoid EnableLimit(bool flag);\n\n\t/// Get the lower joint limit in radians.\n\tfloat32 GetLowerLimit() const;\n\n\t/// Get the upper joint limit in radians.\n\tfloat32 GetUpperLimit() const;\n\n\t/// Set the joint limits in radians.\n\tvoid SetLimits(float32 lower, float32 upper);\n\n\t/// Is the joint motor enabled?\n\tbool IsMotorEnabled() const;\n\n\t/// Enable/disable the joint motor.\n\tvoid EnableMotor(bool flag);\n\n\t/// Set the motor speed in radians per second.\n\tvoid SetMotorSpeed(float32 speed);\n\n\t/// Get the motor speed in radians per second.\n\tfloat32 GetMotorSpeed() const;\n\n\t/// Set the maximum motor torque, usually in N-m.\n\tvoid SetMaxMotorTorque(float32 torque);\n\tfloat32 GetMaxMotorTorque() const { return m_maxMotorTorque; }\n\n\t/// Get the reaction force given the inverse time step.\n\t/// Unit is N.\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\n\t/// Get the reaction torque due to the joint limit given the inverse time step.\n\t/// Unit is N*m.\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// Get the current motor torque given the inverse time step.\n\t/// Unit is N*m.\n\tfloat32 GetMotorTorque(float32 inv_dt) const;\n\n\t/// Dump to b2Log.\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\tfriend class b2GearJoint;\n\n\tb2RevoluteJoint(const b2RevoluteJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tb2Vec3 m_impulse;\n\tfloat32 m_motorImpulse;\n\n\tbool m_enableMotor;\n\tfloat32 m_maxMotorTorque;\n\tfloat32 m_motorSpeed;\n\n\tbool m_enableLimit;\n\tfloat32 m_referenceAngle;\n\tfloat32 m_lowerAngle;\n\tfloat32 m_upperAngle;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tb2Mat33 m_mass;\t\t\t// effective mass for point-to-point constraint.\n\tfloat32 m_motorMass;\t// effective mass for motor/limit angular constraint.\n\tb2LimitState m_limitState;\n};\n\ninline float32 b2RevoluteJoint::GetMotorSpeed() const\n{\n\treturn m_motorSpeed;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2RopeJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_ROPE_JOINT_H\n#define B2_ROPE_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Rope joint definition. This requires two body anchor points and\n/// a maximum lengths.\n/// Note: by default the connected objects will not collide.\n/// see collideConnected in b2JointDef.\nstruct b2RopeJointDef : public b2JointDef\n{\n\tb2RopeJointDef()\n\t{\n\t\ttype = e_ropeJoint;\n\t\tlocalAnchorA.Set(-1.0f, 0.0f);\n\t\tlocalAnchorB.Set(1.0f, 0.0f);\n\t\tmaxLength = 0.0f;\n\t}\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The maximum length of the rope.\n\t/// Warning: this must be larger than b2_linearSlop or\n\t/// the joint will have no effect.\n\tfloat32 maxLength;\n};\n\n/// A rope joint enforces a maximum distance between two points\n/// on two bodies. It has no other effect.\n/// Warning: if you attempt to change the maximum length during\n/// the simulation you will get some non-physical behavior.\n/// A model that would allow you to dynamically modify the length\n/// would have some sponginess, so I chose not to implement it\n/// that way. See b2DistanceJoint if you want to dynamically\n/// control length.\nclass b2RopeJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// Set/Get the maximum length of the rope.\n\tvoid SetMaxLength(float32 length) { m_maxLength = length; }\n\tfloat32 GetMaxLength() const;\n\n\tb2LimitState GetLimitState() const;\n\n\t/// Dump joint to dmLog\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\tb2RopeJoint(const b2RopeJointDef* data);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tfloat32 m_maxLength;\n\tfloat32 m_length;\n\tfloat32 m_impulse;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_u;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tfloat32 m_mass;\n\tb2LimitState m_state;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2WeldJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_WELD_JOINT_H\n#define B2_WELD_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Weld joint definition. You need to specify local anchor points\n/// where they are attached and the relative body angle. The position\n/// of the anchor points is important for computing the reaction torque.\nstruct b2WeldJointDef : public b2JointDef\n{\n\tb2WeldJointDef()\n\t{\n\t\ttype = e_weldJoint;\n\t\tlocalAnchorA.Set(0.0f, 0.0f);\n\t\tlocalAnchorB.Set(0.0f, 0.0f);\n\t\treferenceAngle = 0.0f;\n\t\tfrequencyHz = 0.0f;\n\t\tdampingRatio = 0.0f;\n\t}\n\n\t/// Initialize the bodies, anchors, and reference angle using a world\n\t/// anchor point.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB, const b2Vec2& anchor);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The bodyB angle minus bodyA angle in the reference state (radians).\n\tfloat32 referenceAngle;\n\n\t/// The mass-spring-damper frequency in Hertz. Rotation only.\n\t/// Disable softness with a value of 0.\n\tfloat32 frequencyHz;\n\n\t/// The damping ratio. 0 = no damping, 1 = critical damping.\n\tfloat32 dampingRatio;\n};\n\n/// A weld joint essentially glues two bodies together. A weld joint may\n/// distort somewhat because the island constraint solver is approximate.\nclass b2WeldJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// Get the reference angle.\n\tfloat32 GetReferenceAngle() const { return m_referenceAngle; }\n\n\t/// Set/get frequency in Hz.\n\tvoid SetFrequency(float32 hz) { m_frequencyHz = hz; }\n\tfloat32 GetFrequency() const { return m_frequencyHz; }\n\n\t/// Set/get damping ratio.\n\tvoid SetDampingRatio(float32 ratio) { m_dampingRatio = ratio; }\n\tfloat32 GetDampingRatio() const { return m_dampingRatio; }\n\n\t/// Dump to b2Log\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\n\tb2WeldJoint(const b2WeldJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tfloat32 m_frequencyHz;\n\tfloat32 m_dampingRatio;\n\tfloat32 m_bias;\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tfloat32 m_referenceAngle;\n\tfloat32 m_gamma;\n\tb2Vec3 m_impulse;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_rA;\n\tb2Vec2 m_rB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\tb2Mat33 m_mass;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/Joints/b2WheelJoint.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_WHEEL_JOINT_H\n#define B2_WHEEL_JOINT_H\n\n#include \"b2Joint.h\"\n\n/// Wheel joint definition. This requires defining a line of\n/// motion using an axis and an anchor point. The definition uses local\n/// anchor points and a local axis so that the initial configuration\n/// can violate the constraint slightly. The joint translation is zero\n/// when the local anchor points coincide in world space. Using local\n/// anchors and a local axis helps when saving and loading a game.\nstruct b2WheelJointDef : public b2JointDef\n{\n\tb2WheelJointDef()\n\t{\n\t\ttype = e_wheelJoint;\n\t\tlocalAnchorA.SetZero();\n\t\tlocalAnchorB.SetZero();\n\t\tlocalAxisA.Set(1.0f, 0.0f);\n\t\tenableMotor = false;\n\t\tmaxMotorTorque = 0.0f;\n\t\tmotorSpeed = 0.0f;\n\t\tfrequencyHz = 2.0f;\n\t\tdampingRatio = 0.7f;\n\t}\n\n\t/// Initialize the bodies, anchors, axis, and reference angle using the world\n\t/// anchor and world axis.\n\tvoid Initialize(b2Body* bodyA, b2Body* bodyB, const b2Vec2& anchor, const b2Vec2& axis);\n\n\t/// The local anchor point relative to bodyA's origin.\n\tb2Vec2 localAnchorA;\n\n\t/// The local anchor point relative to bodyB's origin.\n\tb2Vec2 localAnchorB;\n\n\t/// The local translation axis in bodyA.\n\tb2Vec2 localAxisA;\n\n\t/// Enable/disable the joint motor.\n\tbool enableMotor;\n\n\t/// The maximum motor torque, usually in N-m.\n\tfloat32 maxMotorTorque;\n\n\t/// The desired motor speed in radians per second.\n\tfloat32 motorSpeed;\n\n\t/// Suspension frequency, zero indicates no suspension\n\tfloat32 frequencyHz;\n\n\t/// Suspension damping ratio, one indicates critical damping\n\tfloat32 dampingRatio;\n};\n\n/// A wheel joint. This joint provides two degrees of freedom: translation\n/// along an axis fixed in bodyA and rotation in the plane. You can use a\n/// joint limit to restrict the range of motion and a joint motor to drive\n/// the rotation or to model rotational friction.\n/// This joint is designed for vehicle suspensions.\nclass b2WheelJoint : public b2Joint\n{\npublic:\n\tb2Vec2 GetAnchorA() const;\n\tb2Vec2 GetAnchorB() const;\n\n\tb2Vec2 GetReactionForce(float32 inv_dt) const;\n\tfloat32 GetReactionTorque(float32 inv_dt) const;\n\n\t/// The local anchor point relative to bodyA's origin.\n\tconst b2Vec2& GetLocalAnchorA() const { return m_localAnchorA; }\n\n\t/// The local anchor point relative to bodyB's origin.\n\tconst b2Vec2& GetLocalAnchorB() const { return m_localAnchorB; }\n\n\t/// The local joint axis relative to bodyA.\n\tconst b2Vec2& GetLocalAxisA() const { return m_localXAxisA; }\n\n\t/// Get the current joint translation, usually in meters.\n\tfloat32 GetJointTranslation() const;\n\n\t/// Get the current joint translation speed, usually in meters per second.\n\tfloat32 GetJointSpeed() const;\n\n\t/// Is the joint motor enabled?\n\tbool IsMotorEnabled() const;\n\n\t/// Enable/disable the joint motor.\n\tvoid EnableMotor(bool flag);\n\n\t/// Set the motor speed, usually in radians per second.\n\tvoid SetMotorSpeed(float32 speed);\n\n\t/// Get the motor speed, usually in radians per second.\n\tfloat32 GetMotorSpeed() const;\n\n\t/// Set/Get the maximum motor force, usually in N-m.\n\tvoid SetMaxMotorTorque(float32 torque);\n\tfloat32 GetMaxMotorTorque() const;\n\n\t/// Get the current motor torque given the inverse time step, usually in N-m.\n\tfloat32 GetMotorTorque(float32 inv_dt) const;\n\n\t/// Set/Get the spring frequency in hertz. Setting the frequency to zero disables the spring.\n\tvoid SetSpringFrequencyHz(float32 hz);\n\tfloat32 GetSpringFrequencyHz() const;\n\n\t/// Set/Get the spring damping ratio\n\tvoid SetSpringDampingRatio(float32 ratio);\n\tfloat32 GetSpringDampingRatio() const;\n\n\t/// Dump to b2Log\n\tvoid Dump();\n\nprotected:\n\n\tfriend class b2Joint;\n\tb2WheelJoint(const b2WheelJointDef* def);\n\n\tvoid InitVelocityConstraints(const b2SolverData& data);\n\tvoid SolveVelocityConstraints(const b2SolverData& data);\n\tbool SolvePositionConstraints(const b2SolverData& data);\n\n\tfloat32 m_frequencyHz;\n\tfloat32 m_dampingRatio;\n\n\t// Solver shared\n\tb2Vec2 m_localAnchorA;\n\tb2Vec2 m_localAnchorB;\n\tb2Vec2 m_localXAxisA;\n\tb2Vec2 m_localYAxisA;\n\n\tfloat32 m_impulse;\n\tfloat32 m_motorImpulse;\n\tfloat32 m_springImpulse;\n\n\tfloat32 m_maxMotorTorque;\n\tfloat32 m_motorSpeed;\n\tbool m_enableMotor;\n\n\t// Solver temp\n\tint32 m_indexA;\n\tint32 m_indexB;\n\tb2Vec2 m_localCenterA;\n\tb2Vec2 m_localCenterB;\n\tfloat32 m_invMassA;\n\tfloat32 m_invMassB;\n\tfloat32 m_invIA;\n\tfloat32 m_invIB;\n\n\tb2Vec2 m_ax, m_ay;\n\tfloat32 m_sAx, m_sBx;\n\tfloat32 m_sAy, m_sBy;\n\n\tfloat32 m_mass;\n\tfloat32 m_motorMass;\n\tfloat32 m_springMass;\n\n\tfloat32 m_bias;\n\tfloat32 m_gamma;\n};\n\ninline float32 b2WheelJoint::GetMotorSpeed() const\n{\n\treturn m_motorSpeed;\n}\n\ninline float32 b2WheelJoint::GetMaxMotorTorque() const\n{\n\treturn m_maxMotorTorque;\n}\n\ninline void b2WheelJoint::SetSpringFrequencyHz(float32 hz)\n{\n\tm_frequencyHz = hz;\n}\n\ninline float32 b2WheelJoint::GetSpringFrequencyHz() const\n{\n\treturn m_frequencyHz;\n}\n\ninline void b2WheelJoint::SetSpringDampingRatio(float32 ratio)\n{\n\tm_dampingRatio = ratio;\n}\n\ninline float32 b2WheelJoint::GetSpringDampingRatio() const\n{\n\treturn m_dampingRatio;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2Body.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_BODY_H\n#define B2_BODY_H\n\n#include \"../Common/b2Math.h\"\n#include \"../Collision/Shapes/b2Shape.h\"\n#include \n\nclass b2Fixture;\nclass b2Joint;\nclass b2Contact;\nclass b2Controller;\nclass b2World;\nstruct b2FixtureDef;\nstruct b2JointEdge;\nstruct b2ContactEdge;\n\n/// The body type.\n/// static: zero mass, zero velocity, may be manually moved\n/// kinematic: zero mass, non-zero velocity set by user, moved by solver\n/// dynamic: positive mass, non-zero velocity determined by forces, moved by solver\nenum b2BodyType\n{\n\tb2_staticBody = 0,\n\tb2_kinematicBody,\n\tb2_dynamicBody\n\n\t// TODO_ERIN\n\t//b2_bulletBody,\n};\n\n/// A body definition holds all the data needed to construct a rigid body.\n/// You can safely re-use body definitions. Shapes are added to a body after construction.\nstruct b2BodyDef\n{\n\t/// This constructor sets the body definition default values.\n\tb2BodyDef()\n\t{\n\t\tuserData = NULL;\n\t\tposition.Set(0.0f, 0.0f);\n\t\tangle = 0.0f;\n\t\tlinearVelocity.Set(0.0f, 0.0f);\n\t\tangularVelocity = 0.0f;\n\t\tlinearDamping = 0.0f;\n\t\tangularDamping = 0.0f;\n\t\tallowSleep = true;\n\t\tawake = true;\n\t\tfixedRotation = false;\n\t\tbullet = false;\n\t\ttype = b2_staticBody;\n\t\tactive = true;\n\t\tgravityScale = 1.0f;\n\t}\n\n\t/// The body type: static, kinematic, or dynamic.\n\t/// Note: if a dynamic body would have zero mass, the mass is set to one.\n\tb2BodyType type;\n\n\t/// The world position of the body. Avoid creating bodies at the origin\n\t/// since this can lead to many overlapping shapes.\n\tb2Vec2 position;\n\n\t/// The world angle of the body in radians.\n\tfloat32 angle;\n\n\t/// The linear velocity of the body's origin in world co-ordinates.\n\tb2Vec2 linearVelocity;\n\n\t/// The angular velocity of the body.\n\tfloat32 angularVelocity;\n\n\t/// Linear damping is use to reduce the linear velocity. The damping parameter\n\t/// can be larger than 1.0f but the damping effect becomes sensitive to the\n\t/// time step when the damping parameter is large.\n\tfloat32 linearDamping;\n\n\t/// Angular damping is use to reduce the angular velocity. The damping parameter\n\t/// can be larger than 1.0f but the damping effect becomes sensitive to the\n\t/// time step when the damping parameter is large.\n\tfloat32 angularDamping;\n\n\t/// Set this flag to false if this body should never fall asleep. Note that\n\t/// this increases CPU usage.\n\tbool allowSleep;\n\n\t/// Is this body initially awake or sleeping?\n\tbool awake;\n\n\t/// Should this body be prevented from rotating? Useful for characters.\n\tbool fixedRotation;\n\n\t/// Is this a fast moving body that should be prevented from tunneling through\n\t/// other moving bodies? Note that all bodies are prevented from tunneling through\n\t/// kinematic and static bodies. This setting is only considered on dynamic bodies.\n\t/// @warning You should use this flag sparingly since it increases processing time.\n\tbool bullet;\n\n\t/// Does this body start out active?\n\tbool active;\n\n\t/// Use this to store application specific body data.\n\tvoid* userData;\n\n\t/// Scale the gravity applied to this body.\n\tfloat32 gravityScale;\n};\n\n/// A rigid body. These are created via b2World::CreateBody.\nclass b2Body\n{\npublic:\n\t/// Creates a fixture and attach it to this body. Use this function if you need\n\t/// to set some fixture parameters, like friction. Otherwise you can create the\n\t/// fixture directly from a shape.\n\t/// If the density is non-zero, this function automatically updates the mass of the body.\n\t/// Contacts are not created until the next time step.\n\t/// @param def the fixture definition.\n\t/// @warning This function is locked during callbacks.\n\tb2Fixture* CreateFixture(const b2FixtureDef* def);\n\n\t/// Creates a fixture from a shape and attach it to this body.\n\t/// This is a convenience function. Use b2FixtureDef if you need to set parameters\n\t/// like friction, restitution, user data, or filtering.\n\t/// If the density is non-zero, this function automatically updates the mass of the body.\n\t/// @param shape the shape to be cloned.\n\t/// @param density the shape density (set to zero for static bodies).\n\t/// @warning This function is locked during callbacks.\n\tb2Fixture* CreateFixture(const b2Shape* shape, float32 density);\n\n\t/// Destroy a fixture. This removes the fixture from the broad-phase and\n\t/// destroys all contacts associated with this fixture. This will\n\t/// automatically adjust the mass of the body if the body is dynamic and the\n\t/// fixture has positive density.\n\t/// All fixtures attached to a body are implicitly destroyed when the body is destroyed.\n\t/// @param fixture the fixture to be removed.\n\t/// @warning This function is locked during callbacks.\n\tvoid DestroyFixture(b2Fixture* fixture);\n\n\t/// Set the position of the body's origin and rotation.\n\t/// Manipulating a body's transform may cause non-physical behavior.\n\t/// Note: contacts are updated on the next call to b2World::Step.\n\t/// @param position the world position of the body's local origin.\n\t/// @param angle the world rotation in radians.\n\tvoid SetTransform(const b2Vec2& position, float32 angle);\n\n\t/// Get the body transform for the body's origin.\n\t/// @return the world transform of the body's origin.\n\tconst b2Transform& GetTransform() const;\n\n\t/// Get the world body origin position.\n\t/// @return the world position of the body's origin.\n\tconst b2Vec2& GetPosition() const;\n\n\t/// Get the angle in radians.\n\t/// @return the current world rotation angle in radians.\n\tfloat32 GetAngle() const;\n\n\t/// Get the world position of the center of mass.\n\tconst b2Vec2& GetWorldCenter() const;\n\n\t/// Get the local position of the center of mass.\n\tconst b2Vec2& GetLocalCenter() const;\n\n\t/// Set the linear velocity of the center of mass.\n\t/// @param v the new linear velocity of the center of mass.\n\tvoid SetLinearVelocity(const b2Vec2& v);\n\n\t/// Get the linear velocity of the center of mass.\n\t/// @return the linear velocity of the center of mass.\n\tconst b2Vec2& GetLinearVelocity() const;\n\n\t/// Set the angular velocity.\n\t/// @param omega the new angular velocity in radians/second.\n\tvoid SetAngularVelocity(float32 omega);\n\n\t/// Get the angular velocity.\n\t/// @return the angular velocity in radians/second.\n\tfloat32 GetAngularVelocity() const;\n\n\t/// Apply a force at a world point. If the force is not\n\t/// applied at the center of mass, it will generate a torque and\n\t/// affect the angular velocity. This wakes up the body.\n\t/// @param force the world force vector, usually in Newtons (N).\n\t/// @param point the world position of the point of application.\n\t/// @param wake also wake up the body\n\tvoid ApplyForce(const b2Vec2& force, const b2Vec2& point, bool wake);\n\n\t/// Apply a force to the center of mass. This wakes up the body.\n\t/// @param force the world force vector, usually in Newtons (N).\n\t/// @param wake also wake up the body\n\tvoid ApplyForceToCenter(const b2Vec2& force, bool wake);\n\n\t/// Apply a torque. This affects the angular velocity\n\t/// without affecting the linear velocity of the center of mass.\n\t/// This wakes up the body.\n\t/// @param torque about the z-axis (out of the screen), usually in N-m.\n\t/// @param wake also wake up the body\n\tvoid ApplyTorque(float32 torque, bool wake);\n\n\t/// Apply an impulse at a point. This immediately modifies the velocity.\n\t/// It also modifies the angular velocity if the point of application\n\t/// is not at the center of mass. This wakes up the body.\n\t/// @param impulse the world impulse vector, usually in N-seconds or kg-m/s.\n\t/// @param point the world position of the point of application.\n\t/// @param wake also wake up the body\n\tvoid ApplyLinearImpulse(const b2Vec2& impulse, const b2Vec2& point, bool wake);\n\n\t/// Apply an angular impulse.\n\t/// @param impulse the angular impulse in units of kg*m*m/s\n\t/// @param wake also wake up the body\n\tvoid ApplyAngularImpulse(float32 impulse, bool wake);\n\n\t/// Get the total mass of the body.\n\t/// @return the mass, usually in kilograms (kg).\n\tfloat32 GetMass() const;\n\n\t/// Get the rotational inertia of the body about the local origin.\n\t/// @return the rotational inertia, usually in kg-m^2.\n\tfloat32 GetInertia() const;\n\n\t/// Get the mass data of the body.\n\t/// @return a struct containing the mass, inertia and center of the body.\n\tvoid GetMassData(b2MassData* data) const;\n\n\t/// Set the mass properties to override the mass properties of the fixtures.\n\t/// Note that this changes the center of mass position.\n\t/// Note that creating or destroying fixtures can also alter the mass.\n\t/// This function has no effect if the body isn't dynamic.\n\t/// @param massData the mass properties.\n\tvoid SetMassData(const b2MassData* data);\n\n\t/// This resets the mass properties to the sum of the mass properties of the fixtures.\n\t/// This normally does not need to be called unless you called SetMassData to override\n\t/// the mass and you later want to reset the mass.\n\tvoid ResetMassData();\n\n\t/// Get the world coordinates of a point given the local coordinates.\n\t/// @param localPoint a point on the body measured relative the the body's origin.\n\t/// @return the same point expressed in world coordinates.\n\tb2Vec2 GetWorldPoint(const b2Vec2& localPoint) const;\n\n\t/// Get the world coordinates of a vector given the local coordinates.\n\t/// @param localVector a vector fixed in the body.\n\t/// @return the same vector expressed in world coordinates.\n\tb2Vec2 GetWorldVector(const b2Vec2& localVector) const;\n\n\t/// Gets a local point relative to the body's origin given a world point.\n\t/// @param a point in world coordinates.\n\t/// @return the corresponding local point relative to the body's origin.\n\tb2Vec2 GetLocalPoint(const b2Vec2& worldPoint) const;\n\n\t/// Gets a local vector given a world vector.\n\t/// @param a vector in world coordinates.\n\t/// @return the corresponding local vector.\n\tb2Vec2 GetLocalVector(const b2Vec2& worldVector) const;\n\n\t/// Get the world linear velocity of a world point attached to this body.\n\t/// @param a point in world coordinates.\n\t/// @return the world velocity of a point.\n\tb2Vec2 GetLinearVelocityFromWorldPoint(const b2Vec2& worldPoint) const;\n\n\t/// Get the world velocity of a local point.\n\t/// @param a point in local coordinates.\n\t/// @return the world velocity of a point.\n\tb2Vec2 GetLinearVelocityFromLocalPoint(const b2Vec2& localPoint) const;\n\n\t/// Get the linear damping of the body.\n\tfloat32 GetLinearDamping() const;\n\n\t/// Set the linear damping of the body.\n\tvoid SetLinearDamping(float32 linearDamping);\n\n\t/// Get the angular damping of the body.\n\tfloat32 GetAngularDamping() const;\n\n\t/// Set the angular damping of the body.\n\tvoid SetAngularDamping(float32 angularDamping);\n\n\t/// Get the gravity scale of the body.\n\tfloat32 GetGravityScale() const;\n\n\t/// Set the gravity scale of the body.\n\tvoid SetGravityScale(float32 scale);\n\n\t/// Set the type of this body. This may alter the mass and velocity.\n\tvoid SetType(b2BodyType type);\n\n\t/// Get the type of this body.\n\tb2BodyType GetType() const;\n\n\t/// Should this body be treated like a bullet for continuous collision detection?\n\tvoid SetBullet(bool flag);\n\n\t/// Is this body treated like a bullet for continuous collision detection?\n\tbool IsBullet() const;\n\n\t/// You can disable sleeping on this body. If you disable sleeping, the\n\t/// body will be woken.\n\tvoid SetSleepingAllowed(bool flag);\n\n\t/// Is this body allowed to sleep\n\tbool IsSleepingAllowed() const;\n\n\t/// Set the sleep state of the body. A sleeping body has very\n\t/// low CPU cost.\n\t/// @param flag set to true to wake the body, false to put it to sleep.\n\tvoid SetAwake(bool flag);\n\n\t/// Get the sleeping state of this body.\n\t/// @return true if the body is awake.\n\tbool IsAwake() const;\n\n\t/// Set the active state of the body. An inactive body is not\n\t/// simulated and cannot be collided with or woken up.\n\t/// If you pass a flag of true, all fixtures will be added to the\n\t/// broad-phase.\n\t/// If you pass a flag of false, all fixtures will be removed from\n\t/// the broad-phase and all contacts will be destroyed.\n\t/// Fixtures and joints are otherwise unaffected. You may continue\n\t/// to create/destroy fixtures and joints on inactive bodies.\n\t/// Fixtures on an inactive body are implicitly inactive and will\n\t/// not participate in collisions, ray-casts, or queries.\n\t/// Joints connected to an inactive body are implicitly inactive.\n\t/// An inactive body is still owned by a b2World object and remains\n\t/// in the body list.\n\tvoid SetActive(bool flag);\n\n\t/// Get the active state of the body.\n\tbool IsActive() const;\n\n\t/// Set this body to have fixed rotation. This causes the mass\n\t/// to be reset.\n\tvoid SetFixedRotation(bool flag);\n\n\t/// Does this body have fixed rotation?\n\tbool IsFixedRotation() const;\n\n\t/// Get the list of all fixtures attached to this body.\n\tb2Fixture* GetFixtureList();\n\tconst b2Fixture* GetFixtureList() const;\n\n\t/// Get the list of all joints attached to this body.\n\tb2JointEdge* GetJointList();\n\tconst b2JointEdge* GetJointList() const;\n\n\t/// Get the list of all contacts attached to this body.\n\t/// @warning this list changes during the time step and you may\n\t/// miss some collisions if you don't use b2ContactListener.\n\tb2ContactEdge* GetContactList();\n\tconst b2ContactEdge* GetContactList() const;\n\n\t/// Get the next body in the world's body list.\n\tb2Body* GetNext();\n\tconst b2Body* GetNext() const;\n\n\t/// Get the user data pointer that was provided in the body definition.\n\tvoid* GetUserData() const;\n\n\t/// Set the user data. Use this to store your application specific data.\n\tvoid SetUserData(void* data);\n\n\t/// Get the parent world of this body.\n\tb2World* GetWorld();\n\tconst b2World* GetWorld() const;\n\n\t/// Dump this body to a log file\n\tvoid Dump();\n\nprivate:\n\n\tfriend class b2World;\n\tfriend class b2Island;\n\tfriend class b2ContactManager;\n\tfriend class b2ContactSolver;\n\tfriend class b2Contact;\n\n\tfriend class b2DistanceJoint;\n\tfriend class b2FrictionJoint;\n\tfriend class b2GearJoint;\n\tfriend class b2MotorJoint;\n\tfriend class b2MouseJoint;\n\tfriend class b2PrismaticJoint;\n\tfriend class b2PulleyJoint;\n\tfriend class b2RevoluteJoint;\n\tfriend class b2RopeJoint;\n\tfriend class b2WeldJoint;\n\tfriend class b2WheelJoint;\n\n\t// m_flags\n\tenum\n\t{\n\t\te_islandFlag\t\t= 0x0001,\n\t\te_awakeFlag\t\t\t= 0x0002,\n\t\te_autoSleepFlag\t\t= 0x0004,\n\t\te_bulletFlag\t\t= 0x0008,\n\t\te_fixedRotationFlag\t= 0x0010,\n\t\te_activeFlag\t\t= 0x0020,\n\t\te_toiFlag\t\t\t= 0x0040\n\t};\n\n\tb2Body(const b2BodyDef* bd, b2World* world);\n\t~b2Body();\n\n\tvoid SynchronizeFixtures();\n\tvoid SynchronizeTransform();\n\n\t// This is used to prevent connected bodies from colliding.\n\t// It may lie, depending on the collideConnected flag.\n\tbool ShouldCollide(const b2Body* other) const;\n\n\tvoid Advance(float32 t);\n\n\tb2BodyType m_type;\n\n\tuint16 m_flags;\n\n\tint32 m_islandIndex;\n\n\tb2Transform m_xf;\t\t// the body origin transform\n\tb2Sweep m_sweep;\t\t// the swept motion for CCD\n\n\tb2Vec2 m_linearVelocity;\n\tfloat32 m_angularVelocity;\n\n\tb2Vec2 m_force;\n\tfloat32 m_torque;\n\n\tb2World* m_world;\n\tb2Body* m_prev;\n\tb2Body* m_next;\n\n\tb2Fixture* m_fixtureList;\n\tint32 m_fixtureCount;\n\n\tb2JointEdge* m_jointList;\n\tb2ContactEdge* m_contactList;\n\n\tfloat32 m_mass, m_invMass;\n\n\t// Rotational inertia about the center of mass.\n\tfloat32 m_I, m_invI;\n\n\tfloat32 m_linearDamping;\n\tfloat32 m_angularDamping;\n\tfloat32 m_gravityScale;\n\n\tfloat32 m_sleepTime;\n\n\tvoid* m_userData;\n};\n\ninline b2BodyType b2Body::GetType() const\n{\n\treturn m_type;\n}\n\ninline const b2Transform& b2Body::GetTransform() const\n{\n\treturn m_xf;\n}\n\ninline const b2Vec2& b2Body::GetPosition() const\n{\n\treturn m_xf.p;\n}\n\ninline float32 b2Body::GetAngle() const\n{\n\treturn m_sweep.a;\n}\n\ninline const b2Vec2& b2Body::GetWorldCenter() const\n{\n\treturn m_sweep.c;\n}\n\ninline const b2Vec2& b2Body::GetLocalCenter() const\n{\n\treturn m_sweep.localCenter;\n}\n\ninline void b2Body::SetLinearVelocity(const b2Vec2& v)\n{\n\tif (m_type == b2_staticBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (b2Dot(v,v) > 0.0f)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\tm_linearVelocity = v;\n}\n\ninline const b2Vec2& b2Body::GetLinearVelocity() const\n{\n\treturn m_linearVelocity;\n}\n\ninline void b2Body::SetAngularVelocity(float32 w)\n{\n\tif (m_type == b2_staticBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (w * w > 0.0f)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\tm_angularVelocity = w;\n}\n\ninline float32 b2Body::GetAngularVelocity() const\n{\n\treturn m_angularVelocity;\n}\n\ninline float32 b2Body::GetMass() const\n{\n\treturn m_mass;\n}\n\ninline float32 b2Body::GetInertia() const\n{\n\treturn m_I + m_mass * b2Dot(m_sweep.localCenter, m_sweep.localCenter);\n}\n\ninline void b2Body::GetMassData(b2MassData* data) const\n{\n\tdata->mass = m_mass;\n\tdata->I = m_I + m_mass * b2Dot(m_sweep.localCenter, m_sweep.localCenter);\n\tdata->center = m_sweep.localCenter;\n}\n\ninline b2Vec2 b2Body::GetWorldPoint(const b2Vec2& localPoint) const\n{\n\treturn b2Mul(m_xf, localPoint);\n}\n\ninline b2Vec2 b2Body::GetWorldVector(const b2Vec2& localVector) const\n{\n\treturn b2Mul(m_xf.q, localVector);\n}\n\ninline b2Vec2 b2Body::GetLocalPoint(const b2Vec2& worldPoint) const\n{\n\treturn b2MulT(m_xf, worldPoint);\n}\n\ninline b2Vec2 b2Body::GetLocalVector(const b2Vec2& worldVector) const\n{\n\treturn b2MulT(m_xf.q, worldVector);\n}\n\ninline b2Vec2 b2Body::GetLinearVelocityFromWorldPoint(const b2Vec2& worldPoint) const\n{\n\treturn m_linearVelocity + b2Cross(m_angularVelocity, worldPoint - m_sweep.c);\n}\n\ninline b2Vec2 b2Body::GetLinearVelocityFromLocalPoint(const b2Vec2& localPoint) const\n{\n\treturn GetLinearVelocityFromWorldPoint(GetWorldPoint(localPoint));\n}\n\ninline float32 b2Body::GetLinearDamping() const\n{\n\treturn m_linearDamping;\n}\n\ninline void b2Body::SetLinearDamping(float32 linearDamping)\n{\n\tm_linearDamping = linearDamping;\n}\n\ninline float32 b2Body::GetAngularDamping() const\n{\n\treturn m_angularDamping;\n}\n\ninline void b2Body::SetAngularDamping(float32 angularDamping)\n{\n\tm_angularDamping = angularDamping;\n}\n\ninline float32 b2Body::GetGravityScale() const\n{\n\treturn m_gravityScale;\n}\n\ninline void b2Body::SetGravityScale(float32 scale)\n{\n\tm_gravityScale = scale;\n}\n\ninline void b2Body::SetBullet(bool flag)\n{\n\tif (flag)\n\t{\n\t\tm_flags |= e_bulletFlag;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_bulletFlag;\n\t}\n}\n\ninline bool b2Body::IsBullet() const\n{\n\treturn (m_flags & e_bulletFlag) == e_bulletFlag;\n}\n\ninline void b2Body::SetAwake(bool flag)\n{\n\tif (flag)\n\t{\n\t\tif ((m_flags & e_awakeFlag) == 0)\n\t\t{\n\t\t\tm_flags |= e_awakeFlag;\n\t\t\tm_sleepTime = 0.0f;\n\t\t}\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_awakeFlag;\n\t\tm_sleepTime = 0.0f;\n\t\tm_linearVelocity.SetZero();\n\t\tm_angularVelocity = 0.0f;\n\t\tm_force.SetZero();\n\t\tm_torque = 0.0f;\n\t}\n}\n\ninline bool b2Body::IsAwake() const\n{\n\treturn (m_flags & e_awakeFlag) == e_awakeFlag;\n}\n\ninline bool b2Body::IsActive() const\n{\n\treturn (m_flags & e_activeFlag) == e_activeFlag;\n}\n\ninline bool b2Body::IsFixedRotation() const\n{\n\treturn (m_flags & e_fixedRotationFlag) == e_fixedRotationFlag;\n}\n\ninline void b2Body::SetSleepingAllowed(bool flag)\n{\n\tif (flag)\n\t{\n\t\tm_flags |= e_autoSleepFlag;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_autoSleepFlag;\n\t\tSetAwake(true);\n\t}\n}\n\ninline bool b2Body::IsSleepingAllowed() const\n{\n\treturn (m_flags & e_autoSleepFlag) == e_autoSleepFlag;\n}\n\ninline b2Fixture* b2Body::GetFixtureList()\n{\n\treturn m_fixtureList;\n}\n\ninline const b2Fixture* b2Body::GetFixtureList() const\n{\n\treturn m_fixtureList;\n}\n\ninline b2JointEdge* b2Body::GetJointList()\n{\n\treturn m_jointList;\n}\n\ninline const b2JointEdge* b2Body::GetJointList() const\n{\n\treturn m_jointList;\n}\n\ninline b2ContactEdge* b2Body::GetContactList()\n{\n\treturn m_contactList;\n}\n\ninline const b2ContactEdge* b2Body::GetContactList() const\n{\n\treturn m_contactList;\n}\n\ninline b2Body* b2Body::GetNext()\n{\n\treturn m_next;\n}\n\ninline const b2Body* b2Body::GetNext() const\n{\n\treturn m_next;\n}\n\ninline void b2Body::SetUserData(void* data)\n{\n\tm_userData = data;\n}\n\ninline void* b2Body::GetUserData() const\n{\n\treturn m_userData;\n}\n\ninline void b2Body::ApplyForce(const b2Vec2& force, const b2Vec2& point, bool wake)\n{\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (wake && (m_flags & e_awakeFlag) == 0)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\t// Don't accumulate a force if the body is sleeping.\n\tif (m_flags & e_awakeFlag)\n\t{\n\t\tm_force += force;\n\t\tm_torque += b2Cross(point - m_sweep.c, force);\n\t}\n}\n\ninline void b2Body::ApplyForceToCenter(const b2Vec2& force, bool wake)\n{\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (wake && (m_flags & e_awakeFlag) == 0)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\t// Don't accumulate a force if the body is sleeping\n\tif (m_flags & e_awakeFlag)\n\t{\n\t\tm_force += force;\n\t}\n}\n\ninline void b2Body::ApplyTorque(float32 torque, bool wake)\n{\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (wake && (m_flags & e_awakeFlag) == 0)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\t// Don't accumulate a force if the body is sleeping\n\tif (m_flags & e_awakeFlag)\n\t{\n\t\tm_torque += torque;\n\t}\n}\n\ninline void b2Body::ApplyLinearImpulse(const b2Vec2& impulse, const b2Vec2& point, bool wake)\n{\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (wake && (m_flags & e_awakeFlag) == 0)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\t// Don't accumulate velocity if the body is sleeping\n\tif (m_flags & e_awakeFlag)\n\t{\n\t\tm_linearVelocity += m_invMass * impulse;\n\t\tm_angularVelocity += m_invI * b2Cross(point - m_sweep.c, impulse);\n\t}\n}\n\ninline void b2Body::ApplyAngularImpulse(float32 impulse, bool wake)\n{\n\tif (m_type != b2_dynamicBody)\n\t{\n\t\treturn;\n\t}\n\n\tif (wake && (m_flags & e_awakeFlag) == 0)\n\t{\n\t\tSetAwake(true);\n\t}\n\n\t// Don't accumulate velocity if the body is sleeping\n\tif (m_flags & e_awakeFlag)\n\t{\n\t\tm_angularVelocity += m_invI * impulse;\n\t}\n}\n\ninline void b2Body::SynchronizeTransform()\n{\n\tm_xf.q.Set(m_sweep.a);\n\tm_xf.p = m_sweep.c - b2Mul(m_xf.q, m_sweep.localCenter);\n}\n\ninline void b2Body::Advance(float32 alpha)\n{\n\t// Advance to the new safe time. This doesn't sync the broad-phase.\n\tm_sweep.Advance(alpha);\n\tm_sweep.c = m_sweep.c0;\n\tm_sweep.a = m_sweep.a0;\n\tm_xf.q.Set(m_sweep.a);\n\tm_xf.p = m_sweep.c - b2Mul(m_xf.q, m_sweep.localCenter);\n}\n\ninline b2World* b2Body::GetWorld()\n{\n\treturn m_world;\n}\n\ninline const b2World* b2Body::GetWorld() const\n{\n\treturn m_world;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2ContactManager.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_CONTACT_MANAGER_H\n#define B2_CONTACT_MANAGER_H\n\n#include \"../Collision/b2BroadPhase.h\"\n\nclass b2Contact;\nclass b2ContactFilter;\nclass b2ContactListener;\nclass b2BlockAllocator;\n\n// Delegate of b2World.\nclass b2ContactManager\n{\npublic:\n\tb2ContactManager();\n\n\t// Broad-phase callback.\n\tvoid AddPair(void* proxyUserDataA, void* proxyUserDataB);\n\n\tvoid FindNewContacts();\n\n\tvoid Destroy(b2Contact* c);\n\n\tvoid Collide();\n\n\tb2BroadPhase m_broadPhase;\n\tb2Contact* m_contactList;\n\tint32 m_contactCount;\n\tb2ContactFilter* m_contactFilter;\n\tb2ContactListener* m_contactListener;\n\tb2BlockAllocator* m_allocator;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2Fixture.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_FIXTURE_H\n#define B2_FIXTURE_H\n\n#include \"b2Body.h\"\n#include \"../Collision/b2Collision.h\"\n#include \"../Collision/Shapes/b2Shape.h\"\n\nclass b2BlockAllocator;\nclass b2Body;\nclass b2BroadPhase;\nclass b2Fixture;\n\n/// This holds contact filtering data.\nstruct b2Filter\n{\n\tb2Filter()\n\t{\n\t\tcategoryBits = 0x0001;\n\t\tmaskBits = 0xFFFF;\n\t\tgroupIndex = 0;\n\t}\n\n\t/// The collision category bits. Normally you would just set one bit.\n\tuint16 categoryBits;\n\n\t/// The collision mask bits. This states the categories that this\n\t/// shape would accept for collision.\n\tuint16 maskBits;\n\n\t/// Collision groups allow a certain group of objects to never collide (negative)\n\t/// or always collide (positive). Zero means no collision group. Non-zero group\n\t/// filtering always wins against the mask bits.\n\tint16 groupIndex;\n};\n\n/// A fixture definition is used to create a fixture. This class defines an\n/// abstract fixture definition. You can reuse fixture definitions safely.\nstruct b2FixtureDef\n{\n\t/// The constructor sets the default fixture definition values.\n\tb2FixtureDef()\n\t{\n\t\tshape = NULL;\n\t\tuserData = NULL;\n\t\tfriction = 0.2f;\n\t\trestitution = 0.0f;\n\t\tdensity = 0.0f;\n\t\tisSensor = false;\n\t}\n\n\t/// The shape, this must be set. The shape will be cloned, so you\n\t/// can create the shape on the stack.\n\tconst b2Shape* shape;\n\n\t/// Use this to store application specific fixture data.\n\tvoid* userData;\n\n\t/// The friction coefficient, usually in the range [0,1].\n\tfloat32 friction;\n\n\t/// The restitution (elasticity) usually in the range [0,1].\n\tfloat32 restitution;\n\n\t/// The density, usually in kg/m^2.\n\tfloat32 density;\n\n\t/// A sensor shape collects contact information but never generates a collision\n\t/// response.\n\tbool isSensor;\n\n\t/// Contact filtering data.\n\tb2Filter filter;\n};\n\n/// This proxy is used internally to connect fixtures to the broad-phase.\nstruct b2FixtureProxy\n{\n\tb2AABB aabb;\n\tb2Fixture* fixture;\n\tint32 childIndex;\n\tint32 proxyId;\n};\n\n/// A fixture is used to attach a shape to a body for collision detection. A fixture\n/// inherits its transform from its parent. Fixtures hold additional non-geometric data\n/// such as friction, collision filters, etc.\n/// Fixtures are created via b2Body::CreateFixture.\n/// @warning you cannot reuse fixtures.\nclass b2Fixture\n{\npublic:\n\t/// Get the type of the child shape. You can use this to down cast to the concrete shape.\n\t/// @return the shape type.\n\tb2Shape::Type GetType() const;\n\n\t/// Get the child shape. You can modify the child shape, however you should not change the\n\t/// number of vertices because this will crash some collision caching mechanisms.\n\t/// Manipulating the shape may lead to non-physical behavior.\n\tb2Shape* GetShape();\n\tconst b2Shape* GetShape() const;\n\n\t/// Set if this fixture is a sensor.\n\tvoid SetSensor(bool sensor);\n\n\t/// Is this fixture a sensor (non-solid)?\n\t/// @return the true if the shape is a sensor.\n\tbool IsSensor() const;\n\n\t/// Set the contact filtering data. This will not update contacts until the next time\n\t/// step when either parent body is active and awake.\n\t/// This automatically calls Refilter.\n\tvoid SetFilterData(const b2Filter& filter);\n\n\t/// Get the contact filtering data.\n\tconst b2Filter& GetFilterData() const;\n\n\t/// Call this if you want to establish collision that was previously disabled by b2ContactFilter::ShouldCollide.\n\tvoid Refilter();\n\n\t/// Get the parent body of this fixture. This is NULL if the fixture is not attached.\n\t/// @return the parent body.\n\tb2Body* GetBody();\n\tconst b2Body* GetBody() const;\n\n\t/// Get the next fixture in the parent body's fixture list.\n\t/// @return the next shape.\n\tb2Fixture* GetNext();\n\tconst b2Fixture* GetNext() const;\n\n\t/// Get the user data that was assigned in the fixture definition. Use this to\n\t/// store your application specific data.\n\tvoid* GetUserData() const;\n\n\t/// Set the user data. Use this to store your application specific data.\n\tvoid SetUserData(void* data);\n\n\t/// Test a point for containment in this fixture.\n\t/// @param p a point in world coordinates.\n\tbool TestPoint(const b2Vec2& p) const;\n\n\t/// Cast a ray against this shape.\n\t/// @param output the ray-cast results.\n\t/// @param input the ray-cast input parameters.\n\tbool RayCast(b2RayCastOutput* output, const b2RayCastInput& input, int32 childIndex) const;\n\n\t/// Get the mass data for this fixture. The mass data is based on the density and\n\t/// the shape. The rotational inertia is about the shape's origin. This operation\n\t/// may be expensive.\n\tvoid GetMassData(b2MassData* massData) const;\n\n\t/// Set the density of this fixture. This will _not_ automatically adjust the mass\n\t/// of the body. You must call b2Body::ResetMassData to update the body's mass.\n\tvoid SetDensity(float32 density);\n\n\t/// Get the density of this fixture.\n\tfloat32 GetDensity() const;\n\n\t/// Get the coefficient of friction.\n\tfloat32 GetFriction() const;\n\n\t/// Set the coefficient of friction. This will _not_ change the friction of\n\t/// existing contacts.\n\tvoid SetFriction(float32 friction);\n\n\t/// Get the coefficient of restitution.\n\tfloat32 GetRestitution() const;\n\n\t/// Set the coefficient of restitution. This will _not_ change the restitution of\n\t/// existing contacts.\n\tvoid SetRestitution(float32 restitution);\n\n\t/// Get the fixture's AABB. This AABB may be enlarge and/or stale.\n\t/// If you need a more accurate AABB, compute it using the shape and\n\t/// the body transform.\n\tconst b2AABB& GetAABB(int32 childIndex) const;\n\n\t/// Dump this fixture to the log file.\n\tvoid Dump(int32 bodyIndex);\n\nprotected:\n\n\tfriend class b2Body;\n\tfriend class b2World;\n\tfriend class b2Contact;\n\tfriend class b2ContactManager;\n\n\tb2Fixture();\n\n\t// We need separation create/destroy functions from the constructor/destructor because\n\t// the destructor cannot access the allocator (no destructor arguments allowed by C++).\n\tvoid Create(b2BlockAllocator* allocator, b2Body* body, const b2FixtureDef* def);\n\tvoid Destroy(b2BlockAllocator* allocator);\n\n\t// These support body activation/deactivation.\n\tvoid CreateProxies(b2BroadPhase* broadPhase, const b2Transform& xf);\n\tvoid DestroyProxies(b2BroadPhase* broadPhase);\n\n\tvoid Synchronize(b2BroadPhase* broadPhase, const b2Transform& xf1, const b2Transform& xf2);\n\n\tfloat32 m_density;\n\n\tb2Fixture* m_next;\n\tb2Body* m_body;\n\n\tb2Shape* m_shape;\n\n\tfloat32 m_friction;\n\tfloat32 m_restitution;\n\n\tb2FixtureProxy* m_proxies;\n\tint32 m_proxyCount;\n\n\tb2Filter m_filter;\n\n\tbool m_isSensor;\n\n\tvoid* m_userData;\n};\n\ninline b2Shape::Type b2Fixture::GetType() const\n{\n\treturn m_shape->GetType();\n}\n\ninline b2Shape* b2Fixture::GetShape()\n{\n\treturn m_shape;\n}\n\ninline const b2Shape* b2Fixture::GetShape() const\n{\n\treturn m_shape;\n}\n\ninline bool b2Fixture::IsSensor() const\n{\n\treturn m_isSensor;\n}\n\ninline const b2Filter& b2Fixture::GetFilterData() const\n{\n\treturn m_filter;\n}\n\ninline void* b2Fixture::GetUserData() const\n{\n\treturn m_userData;\n}\n\ninline void b2Fixture::SetUserData(void* data)\n{\n\tm_userData = data;\n}\n\ninline b2Body* b2Fixture::GetBody()\n{\n\treturn m_body;\n}\n\ninline const b2Body* b2Fixture::GetBody() const\n{\n\treturn m_body;\n}\n\ninline b2Fixture* b2Fixture::GetNext()\n{\n\treturn m_next;\n}\n\ninline const b2Fixture* b2Fixture::GetNext() const\n{\n\treturn m_next;\n}\n\ninline void b2Fixture::SetDensity(float32 density)\n{\n\tb2Assert(b2IsValid(density) && density >= 0.0f);\n\tm_density = density;\n}\n\ninline float32 b2Fixture::GetDensity() const\n{\n\treturn m_density;\n}\n\ninline float32 b2Fixture::GetFriction() const\n{\n\treturn m_friction;\n}\n\ninline void b2Fixture::SetFriction(float32 friction)\n{\n\tm_friction = friction;\n}\n\ninline float32 b2Fixture::GetRestitution() const\n{\n\treturn m_restitution;\n}\n\ninline void b2Fixture::SetRestitution(float32 restitution)\n{\n\tm_restitution = restitution;\n}\n\ninline bool b2Fixture::TestPoint(const b2Vec2& p) const\n{\n\treturn m_shape->TestPoint(m_body->GetTransform(), p);\n}\n\ninline bool b2Fixture::RayCast(b2RayCastOutput* output, const b2RayCastInput& input, int32 childIndex) const\n{\n\treturn m_shape->RayCast(output, input, m_body->GetTransform(), childIndex);\n}\n\ninline void b2Fixture::GetMassData(b2MassData* massData) const\n{\n\tm_shape->ComputeMass(massData, m_density);\n}\n\ninline const b2AABB& b2Fixture::GetAABB(int32 childIndex) const\n{\n\tb2Assert(0 <= childIndex && childIndex < m_proxyCount);\n\treturn m_proxies[childIndex].aabb;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2Island.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_ISLAND_H\n#define B2_ISLAND_H\n\n#include \"../Common/b2Math.h\"\n#include \"b2Body.h\"\n#include \"b2TimeStep.h\"\n\nclass b2Contact;\nclass b2Joint;\nclass b2StackAllocator;\nclass b2ContactListener;\nstruct b2ContactVelocityConstraint;\nstruct b2Profile;\n\n/// This is an internal class.\nclass b2Island\n{\npublic:\n\tb2Island(int32 bodyCapacity, int32 contactCapacity, int32 jointCapacity,\n\t\t\tb2StackAllocator* allocator, b2ContactListener* listener);\n\t~b2Island();\n\n\tvoid Clear()\n\t{\n\t\tm_bodyCount = 0;\n\t\tm_contactCount = 0;\n\t\tm_jointCount = 0;\n\t}\n\n\tvoid Solve(b2Profile* profile, const b2TimeStep& step, const b2Vec2& gravity, bool allowSleep);\n\n\tvoid SolveTOI(const b2TimeStep& subStep, int32 toiIndexA, int32 toiIndexB);\n\n\tvoid Add(b2Body* body)\n\t{\n\t\tb2Assert(m_bodyCount < m_bodyCapacity);\n\t\tbody->m_islandIndex = m_bodyCount;\n\t\tm_bodies[m_bodyCount] = body;\n\t\t++m_bodyCount;\n\t}\n\n\tvoid Add(b2Contact* contact)\n\t{\n\t\tb2Assert(m_contactCount < m_contactCapacity);\n\t\tm_contacts[m_contactCount++] = contact;\n\t}\n\n\tvoid Add(b2Joint* joint)\n\t{\n\t\tb2Assert(m_jointCount < m_jointCapacity);\n\t\tm_joints[m_jointCount++] = joint;\n\t}\n\n\tvoid Report(const b2ContactVelocityConstraint* constraints);\n\n\tb2StackAllocator* m_allocator;\n\tb2ContactListener* m_listener;\n\n\tb2Body** m_bodies;\n\tb2Contact** m_contacts;\n\tb2Joint** m_joints;\n\n\tb2Position* m_positions;\n\tb2Velocity* m_velocities;\n\n\tint32 m_bodyCount;\n\tint32 m_jointCount;\n\tint32 m_contactCount;\n\n\tint32 m_bodyCapacity;\n\tint32 m_contactCapacity;\n\tint32 m_jointCapacity;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2TimeStep.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_TIME_STEP_H\n#define B2_TIME_STEP_H\n\n#include \"../Common/b2Math.h\"\n\n/// Profiling data. Times are in milliseconds.\nstruct b2Profile\n{\n\tfloat32 step;\n\tfloat32 collide;\n\tfloat32 solve;\n\tfloat32 solveInit;\n\tfloat32 solveVelocity;\n\tfloat32 solvePosition;\n\tfloat32 broadphase;\n\tfloat32 solveTOI;\n};\n\n/// This is an internal structure.\nstruct b2TimeStep\n{\n\tfloat32 dt;\t\t\t// time step\n\tfloat32 inv_dt;\t\t// inverse time step (0 if dt == 0).\n\tfloat32 dtRatio;\t// dt * inv_dt0\n\tint32 velocityIterations;\n\tint32 positionIterations;\n\tbool warmStarting;\n};\n\n/// This is an internal structure.\nstruct b2Position\n{\n\tb2Vec2 c;\n\tfloat32 a;\n};\n\n/// This is an internal structure.\nstruct b2Velocity\n{\n\tb2Vec2 v;\n\tfloat32 w;\n};\n\n/// Solver Data\nstruct b2SolverData\n{\n\tb2TimeStep step;\n\tb2Position* positions;\n\tb2Velocity* velocities;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2World.h",
"content": "/*\n* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_WORLD_H\n#define B2_WORLD_H\n\n#include \"../Common/b2Math.h\"\n#include \"../Common/b2BlockAllocator.h\"\n#include \"../Common/b2StackAllocator.h\"\n#include \"b2ContactManager.h\"\n#include \"b2WorldCallbacks.h\"\n#include \"b2TimeStep.h\"\n\nstruct b2AABB;\nstruct b2BodyDef;\nstruct b2Color;\nstruct b2JointDef;\nclass b2Body;\nclass b2Draw;\nclass b2Fixture;\nclass b2Joint;\n\n/// The world class manages all physics entities, dynamic simulation,\n/// and asynchronous queries. The world also contains efficient memory\n/// management facilities.\nclass b2World\n{\npublic:\n\t/// Construct a world object.\n\t/// @param gravity the world gravity vector.\n\tb2World(const b2Vec2& gravity);\n\n\t/// Destruct the world. All physics entities are destroyed and all heap memory is released.\n\t~b2World();\n\n\t/// Register a destruction listener. The listener is owned by you and must\n\t/// remain in scope.\n\tvoid SetDestructionListener(b2DestructionListener* listener);\n\n\t/// Register a contact filter to provide specific control over collision.\n\t/// Otherwise the default filter is used (b2_defaultFilter). The listener is\n\t/// owned by you and must remain in scope.\n\tvoid SetContactFilter(b2ContactFilter* filter);\n\n\t/// Register a contact event listener. The listener is owned by you and must\n\t/// remain in scope.\n\tvoid SetContactListener(b2ContactListener* listener);\n\n\t/// Register a routine for debug drawing. The debug draw functions are called\n\t/// inside with b2World::DrawDebugData method. The debug draw object is owned\n\t/// by you and must remain in scope.\n\tvoid SetDebugDraw(b2Draw* debugDraw);\n\n\t/// Create a rigid body given a definition. No reference to the definition\n\t/// is retained.\n\t/// @warning This function is locked during callbacks.\n\tb2Body* CreateBody(const b2BodyDef* def);\n\n\t/// Destroy a rigid body given a definition. No reference to the definition\n\t/// is retained. This function is locked during callbacks.\n\t/// @warning This automatically deletes all associated shapes and joints.\n\t/// @warning This function is locked during callbacks.\n\tvoid DestroyBody(b2Body* body);\n\n\t/// Create a joint to constrain bodies together. No reference to the definition\n\t/// is retained. This may cause the connected bodies to cease colliding.\n\t/// @warning This function is locked during callbacks.\n\tb2Joint* CreateJoint(const b2JointDef* def);\n\n\t/// Destroy a joint. This may cause the connected bodies to begin colliding.\n\t/// @warning This function is locked during callbacks.\n\tvoid DestroyJoint(b2Joint* joint);\n\n\t/// Take a time step. This performs collision detection, integration,\n\t/// and constraint solution.\n\t/// @param timeStep the amount of time to simulate, this should not vary.\n\t/// @param velocityIterations for the velocity constraint solver.\n\t/// @param positionIterations for the position constraint solver.\n\tvoid Step(\tfloat32 timeStep,\n\t\t\t\tint32 velocityIterations,\n\t\t\t\tint32 positionIterations);\n\n\t/// Manually clear the force buffer on all bodies. By default, forces are cleared automatically\n\t/// after each call to Step. The default behavior is modified by calling SetAutoClearForces.\n\t/// The purpose of this function is to support sub-stepping. Sub-stepping is often used to maintain\n\t/// a fixed sized time step under a variable frame-rate.\n\t/// When you perform sub-stepping you will disable auto clearing of forces and instead call\n\t/// ClearForces after all sub-steps are complete in one pass of your game loop.\n\t/// @see SetAutoClearForces\n\tvoid ClearForces();\n\n\t/// Call this to draw shapes and other debug draw data. This is intentionally non-const.\n\tvoid DrawDebugData();\n\n\t/// Query the world for all fixtures that potentially overlap the\n\t/// provided AABB.\n\t/// @param callback a user implemented callback class.\n\t/// @param aabb the query box.\n\tvoid QueryAABB(b2QueryCallback* callback, const b2AABB& aabb) const;\n\n\t/// Ray-cast the world for all fixtures in the path of the ray. Your callback\n\t/// controls whether you get the closest point, any point, or n-points.\n\t/// The ray-cast ignores shapes that contain the starting point.\n\t/// @param callback a user implemented callback class.\n\t/// @param point1 the ray starting point\n\t/// @param point2 the ray ending point\n\tvoid RayCast(b2RayCastCallback* callback, const b2Vec2& point1, const b2Vec2& point2) const;\n\n\t/// Get the world body list. With the returned body, use b2Body::GetNext to get\n\t/// the next body in the world list. A NULL body indicates the end of the list.\n\t/// @return the head of the world body list.\n\tb2Body* GetBodyList();\n\tconst b2Body* GetBodyList() const;\n\n\t/// Get the world joint list. With the returned joint, use b2Joint::GetNext to get\n\t/// the next joint in the world list. A NULL joint indicates the end of the list.\n\t/// @return the head of the world joint list.\n\tb2Joint* GetJointList();\n\tconst b2Joint* GetJointList() const;\n\n\t/// Get the world contact list. With the returned contact, use b2Contact::GetNext to get\n\t/// the next contact in the world list. A NULL contact indicates the end of the list.\n\t/// @return the head of the world contact list.\n\t/// @warning contacts are created and destroyed in the middle of a time step.\n\t/// Use b2ContactListener to avoid missing contacts.\n\tb2Contact* GetContactList();\n\tconst b2Contact* GetContactList() const;\n\n\t/// Enable/disable sleep.\n\tvoid SetAllowSleeping(bool flag);\n\tbool GetAllowSleeping() const { return m_allowSleep; }\n\n\t/// Enable/disable warm starting. For testing.\n\tvoid SetWarmStarting(bool flag) { m_warmStarting = flag; }\n\tbool GetWarmStarting() const { return m_warmStarting; }\n\n\t/// Enable/disable continuous physics. For testing.\n\tvoid SetContinuousPhysics(bool flag) { m_continuousPhysics = flag; }\n\tbool GetContinuousPhysics() const { return m_continuousPhysics; }\n\n\t/// Enable/disable single stepped continuous physics. For testing.\n\tvoid SetSubStepping(bool flag) { m_subStepping = flag; }\n\tbool GetSubStepping() const { return m_subStepping; }\n\n\t/// Get the number of broad-phase proxies.\n\tint32 GetProxyCount() const;\n\n\t/// Get the number of bodies.\n\tint32 GetBodyCount() const;\n\n\t/// Get the number of joints.\n\tint32 GetJointCount() const;\n\n\t/// Get the number of contacts (each may have 0 or more contact points).\n\tint32 GetContactCount() const;\n\n\t/// Get the height of the dynamic tree.\n\tint32 GetTreeHeight() const;\n\n\t/// Get the balance of the dynamic tree.\n\tint32 GetTreeBalance() const;\n\n\t/// Get the quality metric of the dynamic tree. The smaller the better.\n\t/// The minimum is 1.\n\tfloat32 GetTreeQuality() const;\n\n\t/// Change the global gravity vector.\n\tvoid SetGravity(const b2Vec2& gravity);\n\n\t/// Get the global gravity vector.\n\tb2Vec2 GetGravity() const;\n\n\t/// Is the world locked (in the middle of a time step).\n\tbool IsLocked() const;\n\n\t/// Set flag to control automatic clearing of forces after each time step.\n\tvoid SetAutoClearForces(bool flag);\n\n\t/// Get the flag that controls automatic clearing of forces after each time step.\n\tbool GetAutoClearForces() const;\n\n\t/// Shift the world origin. Useful for large worlds.\n\t/// The body shift formula is: position -= newOrigin\n\t/// @param newOrigin the new origin with respect to the old origin\n\tvoid ShiftOrigin(const b2Vec2& newOrigin);\n\n\t/// Get the contact manager for testing.\n\tconst b2ContactManager& GetContactManager() const;\n\n\t/// Get the current profile.\n\tconst b2Profile& GetProfile() const;\n\n\t/// Dump the world into the log file.\n\t/// @warning this should be called outside of a time step.\n\tvoid Dump();\n\nprivate:\n\n\t// m_flags\n\tenum\n\t{\n\t\te_newFixture\t= 0x0001,\n\t\te_locked\t\t= 0x0002,\n\t\te_clearForces\t= 0x0004\n\t};\n\n\tfriend class b2Body;\n\tfriend class b2Fixture;\n\tfriend class b2ContactManager;\n\tfriend class b2Controller;\n\n\tvoid Solve(const b2TimeStep& step);\n\tvoid SolveTOI(const b2TimeStep& step);\n\n\tvoid DrawJoint(b2Joint* joint);\n\tvoid DrawShape(b2Fixture* shape, const b2Transform& xf, const b2Color& color);\n\n\tb2BlockAllocator m_blockAllocator;\n\tb2StackAllocator m_stackAllocator;\n\n\tint32 m_flags;\n\n\tb2ContactManager m_contactManager;\n\n\tb2Body* m_bodyList;\n\tb2Joint* m_jointList;\n\n\tint32 m_bodyCount;\n\tint32 m_jointCount;\n\n\tb2Vec2 m_gravity;\n\tbool m_allowSleep;\n\n\tb2DestructionListener* m_destructionListener;\n\tb2Draw* m_debugDraw;\n\n\t// This is used to compute the time step ratio to\n\t// support a variable time step.\n\tfloat32 m_inv_dt0;\n\n\t// These are for debugging the solver.\n\tbool m_warmStarting;\n\tbool m_continuousPhysics;\n\tbool m_subStepping;\n\n\tbool m_stepComplete;\n\n\tb2Profile m_profile;\n};\n\ninline b2Body* b2World::GetBodyList()\n{\n\treturn m_bodyList;\n}\n\ninline const b2Body* b2World::GetBodyList() const\n{\n\treturn m_bodyList;\n}\n\ninline b2Joint* b2World::GetJointList()\n{\n\treturn m_jointList;\n}\n\ninline const b2Joint* b2World::GetJointList() const\n{\n\treturn m_jointList;\n}\n\ninline b2Contact* b2World::GetContactList()\n{\n\treturn m_contactManager.m_contactList;\n}\n\ninline const b2Contact* b2World::GetContactList() const\n{\n\treturn m_contactManager.m_contactList;\n}\n\ninline int32 b2World::GetBodyCount() const\n{\n\treturn m_bodyCount;\n}\n\ninline int32 b2World::GetJointCount() const\n{\n\treturn m_jointCount;\n}\n\ninline int32 b2World::GetContactCount() const\n{\n\treturn m_contactManager.m_contactCount;\n}\n\ninline void b2World::SetGravity(const b2Vec2& gravity)\n{\n\tm_gravity = gravity;\n}\n\ninline b2Vec2 b2World::GetGravity() const\n{\n\treturn m_gravity;\n}\n\ninline bool b2World::IsLocked() const\n{\n\treturn (m_flags & e_locked) == e_locked;\n}\n\ninline void b2World::SetAutoClearForces(bool flag)\n{\n\tif (flag)\n\t{\n\t\tm_flags |= e_clearForces;\n\t}\n\telse\n\t{\n\t\tm_flags &= ~e_clearForces;\n\t}\n}\n\n/// Get the flag that controls automatic clearing of forces after each time step.\ninline bool b2World::GetAutoClearForces() const\n{\n\treturn (m_flags & e_clearForces) == e_clearForces;\n}\n\ninline const b2ContactManager& b2World::GetContactManager() const\n{\n\treturn m_contactManager;\n}\n\ninline const b2Profile& b2World::GetProfile() const\n{\n\treturn m_profile;\n}\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Dynamics/b2WorldCallbacks.h",
"content": "/*\n* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_WORLD_CALLBACKS_H\n#define B2_WORLD_CALLBACKS_H\n\n#include \"../Common/b2Settings.h\"\n\nstruct b2Vec2;\nstruct b2Transform;\nclass b2Fixture;\nclass b2Body;\nclass b2Joint;\nclass b2Contact;\nstruct b2ContactResult;\nstruct b2Manifold;\n\n/// Joints and fixtures are destroyed when their associated\n/// body is destroyed. Implement this listener so that you\n/// may nullify references to these joints and shapes.\nclass b2DestructionListener\n{\npublic:\n\tvirtual ~b2DestructionListener() {}\n\n\t/// Called when any joint is about to be destroyed due\n\t/// to the destruction of one of its attached bodies.\n\tvirtual void SayGoodbye(b2Joint* joint) = 0;\n\n\t/// Called when any fixture is about to be destroyed due\n\t/// to the destruction of its parent body.\n\tvirtual void SayGoodbye(b2Fixture* fixture) = 0;\n};\n\n/// Implement this class to provide collision filtering. In other words, you can implement\n/// this class if you want finer control over contact creation.\nclass b2ContactFilter\n{\npublic:\n\tvirtual ~b2ContactFilter() {}\n\n\t/// Return true if contact calculations should be performed between these two shapes.\n\t/// @warning for performance reasons this is only called when the AABBs begin to overlap.\n\tvirtual bool ShouldCollide(b2Fixture* fixtureA, b2Fixture* fixtureB);\n};\n\n/// Contact impulses for reporting. Impulses are used instead of forces because\n/// sub-step forces may approach infinity for rigid body collisions. These\n/// match up one-to-one with the contact points in b2Manifold.\nstruct b2ContactImpulse\n{\n\tfloat32 normalImpulses[b2_maxManifoldPoints];\n\tfloat32 tangentImpulses[b2_maxManifoldPoints];\n\tint32 count;\n};\n\n/// Implement this class to get contact information. You can use these results for\n/// things like sounds and game logic. You can also get contact results by\n/// traversing the contact lists after the time step. However, you might miss\n/// some contacts because continuous physics leads to sub-stepping.\n/// Additionally you may receive multiple callbacks for the same contact in a\n/// single time step.\n/// You should strive to make your callbacks efficient because there may be\n/// many callbacks per time step.\n/// @warning You cannot create/destroy Box2D entities inside these callbacks.\nclass b2ContactListener\n{\npublic:\n\tvirtual ~b2ContactListener() {}\n\n\t/// Called when two fixtures begin to touch.\n\tvirtual void BeginContact(b2Contact* contact) { B2_NOT_USED(contact); }\n\n\t/// Called when two fixtures cease to touch.\n\tvirtual void EndContact(b2Contact* contact) { B2_NOT_USED(contact); }\n\n\t/// This is called after a contact is updated. This allows you to inspect a\n\t/// contact before it goes to the solver. If you are careful, you can modify the\n\t/// contact manifold (e.g. disable contact).\n\t/// A copy of the old manifold is provided so that you can detect changes.\n\t/// Note: this is called only for awake bodies.\n\t/// Note: this is called even when the number of contact points is zero.\n\t/// Note: this is not called for sensors.\n\t/// Note: if you set the number of contact points to zero, you will not\n\t/// get an EndContact callback. However, you may get a BeginContact callback\n\t/// the next step.\n\tvirtual void PreSolve(b2Contact* contact, const b2Manifold* oldManifold)\n\t{\n\t\tB2_NOT_USED(contact);\n\t\tB2_NOT_USED(oldManifold);\n\t}\n\n\t/// This lets you inspect a contact after the solver is finished. This is useful\n\t/// for inspecting impulses.\n\t/// Note: the contact manifold does not include time of impact impulses, which can be\n\t/// arbitrarily large if the sub-step is small. Hence the impulse is provided explicitly\n\t/// in a separate data structure.\n\t/// Note: this is only called for contacts that are touching, solid, and awake.\n\tvirtual void PostSolve(b2Contact* contact, const b2ContactImpulse* impulse)\n\t{\n\t\tB2_NOT_USED(contact);\n\t\tB2_NOT_USED(impulse);\n\t}\n};\n\n/// Callback class for AABB queries.\n/// See b2World::Query\nclass b2QueryCallback\n{\npublic:\n\tvirtual ~b2QueryCallback() {}\n\n\t/// Called for each fixture found in the query AABB.\n\t/// @return false to terminate the query.\n\tvirtual bool ReportFixture(b2Fixture* fixture) = 0;\n};\n\n/// Callback class for ray casts.\n/// See b2World::RayCast\nclass b2RayCastCallback\n{\npublic:\n\tvirtual ~b2RayCastCallback() {}\n\n\t/// Called for each fixture found in the query. You control how the ray cast\n\t/// proceeds by returning a float:\n\t/// return -1: ignore this fixture and continue\n\t/// return 0: terminate the ray cast\n\t/// return fraction: clip the ray to this point\n\t/// return 1: don't clip the ray and continue\n\t/// @param fixture the fixture hit by the ray\n\t/// @param point the point of initial intersection\n\t/// @param normal the normal vector at the point of intersection\n\t/// @return -1 to filter, 0 to terminate, fraction to clip the ray for\n\t/// closest hit, 1 to continue\n\tvirtual float32 ReportFixture(\tb2Fixture* fixture, const b2Vec2& point,\n\t\t\t\t\t\t\t\t\tconst b2Vec2& normal, float32 fraction) = 0;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/Box2D/Rope/b2Rope.h",
"content": "/*\n* Copyright (c) 2011 Erin Catto http://www.box2d.org\n*\n* This software is provided 'as-is', without any express or implied\n* warranty. In no event will the authors be held liable for any damages\n* arising from the use of this software.\n* Permission is granted to anyone to use this software for any purpose,\n* including commercial applications, and to alter it and redistribute it\n* freely, subject to the following restrictions:\n* 1. The origin of this software must not be misrepresented; you must not\n* claim that you wrote the original software. If you use this software\n* in a product, an acknowledgment in the product documentation would be\n* appreciated but is not required.\n* 2. Altered source versions must be plainly marked as such, and must not be\n* misrepresented as being the original software.\n* 3. This notice may not be removed or altered from any source distribution.\n*/\n\n#ifndef B2_ROPE_H\n#define B2_ROPE_H\n\n#include \"../Common/b2Math.h\"\n\nclass b2Draw;\n\n///\nstruct b2RopeDef\n{\n\tb2RopeDef()\n\t{\n\t\tvertices = NULL;\n\t\tcount = 0;\n\t\tmasses = NULL;\n\t\tgravity.SetZero();\n\t\tdamping = 0.1f;\n\t\tk2 = 0.9f;\n\t\tk3 = 0.1f;\n\t}\n\n\t///\n\tb2Vec2* vertices;\n\n\t///\n\tint32 count;\n\n\t///\n\tfloat32* masses;\n\n\t///\n\tb2Vec2 gravity;\n\n\t///\n\tfloat32 damping;\n\n\t/// Stretching stiffness\n\tfloat32 k2;\n\n\t/// Bending stiffness. Values above 0.5 can make the simulation blow up.\n\tfloat32 k3;\n};\n\n///\nclass b2Rope\n{\npublic:\n\tb2Rope();\n\t~b2Rope();\n\n\t///\n\tvoid Initialize(const b2RopeDef* def);\n\n\t///\n\tvoid Step(float32 timeStep, int32 iterations);\n\n\t///\n\tint32 GetVertexCount() const\n\t{\n\t\treturn m_count;\n\t}\n\n\t///\n\tconst b2Vec2* GetVertices() const\n\t{\n\t\treturn m_ps;\n\t}\n\n\t///\n\tvoid Draw(b2Draw* draw) const;\n\n\t///\n\tvoid SetAngle(float32 angle);\n\nprivate:\n\n\tvoid SolveC2();\n\tvoid SolveC3();\n\n\tint32 m_count;\n\tb2Vec2* m_ps;\n\tb2Vec2* m_p0s;\n\tb2Vec2* m_vs;\n\n\tfloat32* m_ims;\n\n\tfloat32* m_Ls;\n\tfloat32* m_as;\n\n\tb2Vec2 m_gravity;\n\tfloat32 m_damping;\n\n\tfloat32 m_k2;\n\tfloat32 m_k3;\n};\n\n#endif\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/Config.hpp",
"content": "/*********************************************************************\nMatt Marchant 2016 - 2020\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#pragma once\n\n//check which platform we're on and create export macros as necessary\n#if !defined(TMXLITE_STATIC)\n\n#if defined(_WIN32)\n\n//windows compilers need specific (and different) keywords for export\n#define TMXLITE_EXPORT_API __declspec(dllexport)\n\n//for vc compilers we also need to turn off this annoying C4251 warning\n#ifdef _MSC_VER\n#pragma warning(disable: 4251)\n#endif //_MSC_VER\n\n#else //linux, FreeBSD, Mac OS X\n\n#if __GNUC__ >= 4\n\n//gcc 4 has special keywords for showing/hiding symbols,\n//the same keyword is used for both importing and exporting\n#define TMXLITE_EXPORT_API __attribute__ ((__visibility__ (\"default\")))\n\n#else\n\n//gcc < 4 has no mechanism to explicitly hide symbols, everything's exported\n#define TMXLITE_EXPORT_API\n#endif //__GNUC__\n\n#endif //_WIN32\n\n#else\n\n//static build doesn't need import/export macros\n#define TMXLITE_EXPORT_API\n\n#endif //TMXLITE_STATIC"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/FreeFuncs.cpp",
"content": "/*********************************************************************\nMatt Marchant 2016\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#include \"FreeFuncs.hpp\"\n#include \"detail/Log.hpp\"\n#include \"miniz.h\"\n\n#include \n\nbool tmx::decompress(const char* source, std::vector& dest, std::size_t inSize, std::size_t expectedSize)\n{\n if (!source)\n {\n LOG(\"Input string is empty, decompression failed.\", Logger::Type::Error);\n return false;\n }\n\n int currentSize = static_cast(expectedSize);\n std::vector byteArray(expectedSize / sizeof(unsigned char));\n z_stream stream;\n stream.zalloc = Z_NULL;\n stream.zfree = Z_NULL;\n stream.opaque = Z_NULL;\n stream.next_in = (Bytef*)source;\n stream.avail_in = static_cast(inSize);\n stream.next_out = (Bytef*)byteArray.data();\n stream.avail_out = static_cast(expectedSize);\n\n //we'd prefer to use inflateInit2 but it appears\n //to be incorrect in miniz. This is fine for zlib\n //compressed data, but gzip compressed streams\n //will fail to inflate. IMO still preferable to\n //trying to build/link zlib\n if (inflateInit(&stream/*, 15 + 32*/) != Z_OK)\n {\n LOG(\"inflate init failed\", Logger::Type::Error);\n return false;\n }\n\n int result = 0;\n do\n {\n result = inflate(&stream, Z_SYNC_FLUSH);\n\n switch (result)\n {\n case Z_NEED_DICT:\n case Z_STREAM_ERROR:\n result = Z_DATA_ERROR;\n case Z_DATA_ERROR:\n Logger::log(\"If using gzip compression try using zlib instead\", Logger::Type::Info);\n case Z_MEM_ERROR:\n inflateEnd(&stream);\n Logger::log(std::to_string(result), Logger::Type::Error);\n return false;\n }\n\n if (result != Z_STREAM_END)\n {\n int oldSize = currentSize;\n currentSize *= 2;\n std::vector newArray(currentSize / sizeof(unsigned char));\n std::memcpy(newArray.data(), byteArray.data(), currentSize / 2);\n byteArray = std::move(newArray);\n\n stream.next_out = (Bytef*)(byteArray.data() + oldSize);\n stream.avail_out = oldSize;\n\n }\n } while (result != Z_STREAM_END);\n\n if (stream.avail_in != 0)\n {\n LOG(\"stream.avail_in is 0\", Logger::Type::Error);\n LOG(\"zlib decompression failed.\", Logger::Type::Error);\n return false;\n }\n\n const int outSize = currentSize - stream.avail_out;\n inflateEnd(&stream);\n\n std::vector newArray(outSize / sizeof(unsigned char));\n std::memcpy(newArray.data(), byteArray.data(), outSize);\n byteArray = std::move(newArray);\n\n //copy bytes to vector\n dest.insert(dest.begin(), byteArray.begin(), byteArray.end());\n\n return true;\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/FreeFuncs.hpp",
"content": "/*********************************************************************\nMatt Marchant 2016\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n/*********************************************************************\nbase64_decode\n\nCopyright (C) 2004-2008 René Nyffenegger\nThis source code is provided 'as-is', without any express or implied\nwarranty. In no event will the author be held liable for any damages\narising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute it\nfreely, subject to the following restrictions:\n\n1. The origin of this source code must not be misrepresented; you must not\nclaim that you wrote the original source code. If you use this source code\nin a product, an acknowledgment in the product documentation would be\nappreciated but is not required.\n\n2. Altered source versions must be plainly marked as such, and must not be\nmisrepresented as being the original source code.\n3. This notice may not be removed or altered from any source distribution.\n\nRené Nyffenegger rene.nyffenegger@adp-gmbh.ch\n*********************************************************************/\n\n#pragma once\n\n#include \"detail/Android.hpp\"\n#include \"detail/Log.hpp\"\n#include \"Types.hpp\"\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace tmx\n{\n //using inline here just to supress unused warnings on gcc\n bool decompress(const char* source, std::vector& dest, std::size_t inSize, std::size_t expectedSize);\n\n static inline std::string base64_decode(std::string const& encoded_string)\n {\n static const std::string base64_chars =\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n \"abcdefghijklmnopqrstuvwxyz\"\n \"0123456789+/\";\n\n std::function is_base64 =\n [](unsigned char c)->bool\n {\n return (isalnum(c) || (c == '+') || (c == '/'));\n };\n\n auto in_len = encoded_string.size();\n int i = 0;\n int j = 0;\n int in_ = 0;\n unsigned char char_array_4[4], char_array_3[3];\n std::string ret;\n\n while (in_len-- && (encoded_string[in_] != '=') && is_base64(encoded_string[in_]))\n {\n char_array_4[i++] = encoded_string[in_]; in_++;\n if (i == 4)\n {\n for (i = 0; i < 4; i++)\n {\n char_array_4[i] = static_cast(base64_chars.find(char_array_4[i]));\n }\n char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);\n char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);\n char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];\n\n for (i = 0; (i < 3); i++)\n {\n ret += char_array_3[i];\n }\n i = 0;\n }\n }\n\n if (i)\n {\n for (j = i; j < 4; j++)\n {\n char_array_4[j] = 0;\n }\n\n for (j = 0; j < 4; j++)\n {\n char_array_4[j] = static_cast(base64_chars.find(char_array_4[j]));\n }\n\n char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);\n char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);\n char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];\n\n for (j = 0; (j < i - 1); j++)\n {\n ret += char_array_3[j];\n }\n }\n\n return ret;\n }\n\n static inline Colour colourFromString(std::string str)\n {\n //removes preceding #\n auto result = str.find_last_of('#');\n if (result != std::string::npos)\n {\n str = str.substr(result + 1);\n }\n\n if (str.size() == 6 || str.size() == 8)\n {\n unsigned int value, r, g, b;\n unsigned int a = 255;\n std::stringstream input(str);\n input >> std::hex >> value;\n\n r = (value >> 16) & 0xff;\n g = (value >> 8) & 0xff;\n b = value & 0xff;\n\n if (str.size() == 8)\n {\n a = (value >> 24) & 0xff;\n }\n\n return{ std::uint8_t(r), std::uint8_t(g), std::uint8_t(b), std::uint8_t(a) };\n }\n Logger::log(str + \": not a valid colour string\", Logger::Type::Error);\n return{};\n }\n\n static inline std::string resolveFilePath(std::string path, const std::string& workingDir)\n {\n static const std::string match(\"../\");\n std::size_t result = path.find(match);\n std::size_t count = 0;\n while (result != std::string::npos)\n {\n count++;\n path = path.substr(result + match.size());\n result = path.find(match);\n }\n\n if (workingDir.empty()) return path;\n\n std::string outPath = workingDir;\n for (auto i = 0u; i < count; ++i)\n {\n result = outPath.find_last_of('/');\n if (result != std::string::npos)\n {\n outPath = outPath.substr(0, result);\n }\n }\n// this does only work on windows\n#ifndef __ANDROID__\n return std::move(outPath += '/' + path);\n#endif\n\n// todo: make resolveFilePath work with subfolders on\n// android - currently only the root folder is working\n\n#ifdef __ANDROID__\n\t\treturn std::move(outPath = path);\n#endif\n }\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/ImageLayer.cpp",
"content": "/*********************************************************************\nMatt Marchant 2016\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#include \"ImageLayer.hpp\"\n#include \"FreeFuncs.hpp\"\n#include \"detail/pugixml.hpp\"\n#include \"detail/Log.hpp\"\n\nusing namespace tmx;\n\nImageLayer::ImageLayer(const std::string& workingDir)\n : m_workingDir (workingDir),\n m_hasTransparency (false)\n{\n\n}\n\n//public\nvoid ImageLayer::parse(const pugi::xml_node& node, Map*)\n{\n std::string attribName = node.name();\n if (attribName != \"imagelayer\")\n {\n Logger::log(\"Node not an image layer, node skipped\", Logger::Type::Error);\n return;\n }\n\n setName(node.attribute(\"name\").as_string());\n setOpacity(node.attribute(\"opacity\").as_float(1.f));\n setVisible(node.attribute(\"visible\").as_bool(true));\n setOffset(node.attribute(\"offsetx\").as_int(), node.attribute(\"offsety\").as_int());\n setSize(node.attribute(\"width\").as_uint(), node.attribute(\"height\").as_uint());\n\n for (const auto& child : node.children())\n {\n attribName = child.name();\n if (attribName == \"image\")\n {\n attribName = child.attribute(\"source\").as_string();\n if (attribName.empty())\n {\n Logger::log(\"Image Layer has missing source property\", Logger::Type::Warning);\n return;\n }\n\n if (child.attribute(\"width\") && child.attribute(\"height\"))\n {\n \tm_imageSize.x = child.attribute(\"width\").as_uint();\n \tm_imageSize.y = child.attribute(\"height\").as_uint();\n }\n\n m_filePath = resolveFilePath(attribName, m_workingDir);\n if (child.attribute(\"trans\"))\n {\n attribName = child.attribute(\"trans\").as_string();\n m_transparencyColour = colourFromString(attribName);\n m_hasTransparency = true;\n }\n }\n else if (attribName == \"properties\")\n {\n for (const auto& p : child.children())\n {\n addProperty(p);\n }\n }\n }\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/ImageLayer.hpp",
"content": "/*********************************************************************\nMatt Marchant 2016 - 2019\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#pragma once\n\n#include \"Config.hpp\"\n#include \"Layer.hpp\"\n#include \"Types.hpp\"\n\nnamespace tmx\n{\n /*!\n \\brief Image layers contain a single image which make up that\n layer. The parser contains the fully resolved path to the image\n relative to the working directory.\n */\n class TMXLITE_EXPORT_API ImageLayer final : public Layer\n {\n public:\n explicit ImageLayer(const std::string&);\n ~ImageLayer() = default;\n\n Type getType() const override { return Layer::Type::Image; }\n void parse(const pugi::xml_node&, Map*) override;\n\n /*!\n \\brief Returns the path, relative to the working directory,\n of the image used by the image layer.\n */\n const std::string& getImagePath() const { return m_filePath; }\n /*!\n \\brief Returns the colour used by the image to represent transparent\n pixels. By default this is (0, 0, 0, 0)\n */\n const Colour& getTransparencyColour() const { return m_transparencyColour; }\n /*!\n \\brief Returns true if the image used by this layer specifically states a\n colour to use as transparency\n */\n bool hasTransparency() const { return m_hasTransparency; }\n /*!\n \\brief Returns the size of the image of the image layer in pixels.\n */\n const Vector2u& getImageSize() const { return m_imageSize; }\n\n private:\n std::string m_workingDir;\n std::string m_filePath;\n Colour m_transparencyColour;\n bool m_hasTransparency;\n Vector2u m_imageSize;\n };\n\n template <>\n inline ImageLayer& Layer::getLayerAs()\n {\n assert(getType() == Type::Image);\n return *dynamic_cast(this);\n }\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/Layer.hpp",
"content": "/*********************************************************************\nMatt Marchant 2016 - 2019\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#pragma once\n\n#include \"Config.hpp\"\n#include \"Property.hpp\"\n#include \"Types.hpp\"\n\n#include \n#include \n#include \n\nnamespace pugi\n{\n class xml_node;\n}\n\nnamespace tmx\n{\n class Map;\n class TileLayer;\n class ObjectGroup;\n class ImageLayer;\n class LayerGroup;\n /*!\n \\brief Represents a layer of a tmx format tile map.\n This is an abstract base class from which all layer\n types are derived.\n */\n class TMXLITE_EXPORT_API Layer\n {\n public:\n using Ptr = std::unique_ptr;\n\n Layer() : m_opacity(1.f), m_visible(true) {};\n virtual ~Layer() = default;\n\n /*!\n \\brief Layer type as returned by getType()\n Tile: this layer is a TileLayer type\n Object: This layer is an ObjectGroup type\n Image: This layer is an ImageLayer type\n Group: This layer is a LayerGroup type\n */\n enum class Type\n {\n Tile,\n Object,\n Image,\n Group\n };\n\n /*!\n \\brief Returns a Type value representing the concrete type.\n Use this when deciding which conrete layer type to use when\n calling the templated function getLayerAs()\n */\n virtual Type getType() const = 0;\n\n /*!\n \\brief Use this to get a reference to the concrete layer type\n which this layer points to.\n Use getType() to return the type value of this layer and determine\n if the concrete type is TileLayer, ObjectGroup, ImageLayer, or LayerGroup\n */\n template \n T& getLayerAs();\n /*{\n throw(\"Not a valid layer type\");\n return *dynamic_cast(this);\n }*/\n\n template \n const T& getLayerAs() const { return getLayerAs(); }\n\n /*!\n \\brief Attempts to parse the specific node layer type\n */\n virtual void parse(const pugi::xml_node&, Map* = nullptr) = 0;\n\n /*!\n \\brief Returns the name of the layer\n */\n const std::string& getName() const { return m_name; }\n\n /*!\n \\brief Returns the opacity value for the layer\n */\n float getOpacity() const { return m_opacity; }\n\n /*!\n \\brief Returns whether this layer is visible or not\n */\n bool getVisible() const { return m_visible; }\n\n /*!\n \\brief Returns the offset from the top left corner\n of the layer, in pixels\n */\n const Vector2i& getOffset() const { return m_offset; }\n\n /*!\n \\brief Returns the size of the layer, in pixels.\n This will be the same as the map size for fixed size maps.\n */\n const Vector2u& getSize() const { return m_size; }\n\n /*!\n \\brief Returns the list of properties of this layer\n */\n const std::vector& getProperties() const { return m_properties; }\n\n protected:\n\n void setName(const std::string& name) { m_name = name; }\n void setOpacity(float opacity) { m_opacity = opacity; }\n void setVisible(bool visible) { m_visible = visible; }\n void setOffset(std::int32_t x, std::int32_t y) { m_offset = Vector2i(x, y); }\n void setSize(std::uint32_t width, std::uint32_t height) { m_size = Vector2u(width, height); }\n void addProperty(const pugi::xml_node& node) { m_properties.emplace_back(); m_properties.back().parse(node); }\n\n private:\n std::string m_name;\n float m_opacity;\n bool m_visible;\n Vector2i m_offset;\n Vector2u m_size;\n\n std::vector m_properties;\n };\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/LayerGroup.cpp",
"content": "/*********************************************************************\nGrant Gangi 2019\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#include \"detail/pugixml.hpp\"\n#include \"LayerGroup.hpp\"\n#include \"FreeFuncs.hpp\"\n#include \"ObjectGroup.hpp\"\n#include \"ImageLayer.hpp\"\n#include \"TileLayer.hpp\"\n#include \"detail/Log.hpp\"\n\nusing namespace tmx;\n\nLayerGroup::LayerGroup(const std::string& workingDir, const Vector2u& tileCount)\n : m_workingDir(workingDir),\n m_tileCount(tileCount)\n{\n}\n\n//public\nvoid LayerGroup::parse(const pugi::xml_node& node, Map* map)\n{\n assert(map);\n std::string attribString = node.name();\n if (attribString != \"group\")\n {\n Logger::log(\"Node was not a group layer, node will be skipped.\", Logger::Type::Error);\n return;\n }\n\n setName(node.attribute(\"name\").as_string());\n setOpacity(node.attribute(\"opacity\").as_float(1.f));\n setVisible(node.attribute(\"visible\").as_bool(true));\n setOffset(node.attribute(\"offsetx\").as_int(), node.attribute(\"offsety\").as_int());\n setSize(node.attribute(\"width\").as_uint(), node.attribute(\"height\").as_uint());\n\n // parse children\n for (const auto& child : node.children())\n {\n attribString = child.name();\n if (attribString == \"properties\")\n {\n for (const auto& p : child.children())\n {\n addProperty(p);\n }\n }\n else if (attribString == \"layer\")\n {\n m_layers.emplace_back(std::make_unique(m_tileCount.x * m_tileCount.y));\n m_layers.back()->parse(child, map);\n }\n else if (attribString == \"objectgroup\")\n {\n m_layers.emplace_back(std::make_unique());\n m_layers.back()->parse(child, map);\n }\n else if (attribString == \"imagelayer\")\n {\n m_layers.emplace_back(std::make_unique(m_workingDir));\n m_layers.back()->parse(child, map);\n }\n else if (attribString == \"group\")\n {\n m_layers.emplace_back(std::make_unique(m_workingDir, m_tileCount));\n m_layers.back()->parse(child, map);\n }\n else\n {\n LOG(\"Unidentified name \" + attribString + \": node skipped\", Logger::Type::Warning);\n }\n }\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/LayerGroup.hpp",
"content": "/*********************************************************************\nGrant Gangi 2019\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#pragma once\n\n#include \"Config.hpp\"\n#include \"Layer.hpp\"\n#include \"Types.hpp\"\n\n#include \n\nnamespace tmx\n{\n /*!\n \\brief Layer groups are used to organize the layers of\n the map in a hierarchy. They can contain all other layer\n types including more layer groups to further nest layers.\n */\n class TMXLITE_EXPORT_API LayerGroup final : public Layer\n {\n public:\n\n LayerGroup(const std::string& workDir, const Vector2u& tileCount);\n ~LayerGroup() = default;\n LayerGroup(const LayerGroup&) = delete;\n const LayerGroup& operator = (const LayerGroup&) = delete;\n LayerGroup(LayerGroup&&) = default;\n LayerGroup& operator = (LayerGroup&&) = default;\n\n\n Type getType() const override { return Layer::Type::Group; }\n void parse(const pugi::xml_node&, Map*) override;\n\n /*!\n \\brief Returns a reference to the vector containing the layer data.\n Layers are pointer-to-baseclass, the concrete type of which can be\n found via Layer::getType()\n \\see Layer\n */\n const std::vector& getLayers() const { return m_layers; }\n\n private:\n\n std::vector m_layers;\n\n std::string m_workingDir;\n Vector2u m_tileCount;\n };\n\n template <>\n inline LayerGroup& Layer::getLayerAs()\n {\n assert(getType() == Type::Group);\n return *dynamic_cast(this);\n }\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/Map.cpp",
"content": "/*********************************************************************\nMatt Marchant 2016\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n\n#include \"detail/pugixml.hpp\"\n#include \"Map.hpp\"\n#include \"FreeFuncs.hpp\"\n#include \"ObjectGroup.hpp\"\n#include \"ImageLayer.hpp\"\n#include \"TileLayer.hpp\"\n#include \"LayerGroup.hpp\"\n#include \"detail/Log.hpp\"\n#include \"detail/Android.hpp\"\n\n#include \n\nusing namespace tmx;\n\nnamespace\n{\n std::string getFilePath(const std::string& path)\n {\n //TODO this doesn't actually check that there is a file at the\n //end of the path, or that it's even a valid path...\n\n static auto searchFunc = [](const char separator, const std::string& path)->std::string\n {\n std::size_t i = path.rfind(separator, path.length());\n if (i != std::string::npos)\n {\n return(path.substr(0, i + 1));\n }\n\n return \"\";\n };\n\n\n#ifdef _WIN32 //try windows formatted paths first\n std::string retVal = searchFunc('\\\\', path);\n if (!retVal.empty()) return retVal;\n#endif\n\n return searchFunc('/', path);\n }\n}\n\nMap::Map()\n : m_orientation (Orientation::None),\n m_renderOrder (RenderOrder::None),\n m_infinite (false),\n m_hexSideLength (0.f),\n m_staggerAxis (StaggerAxis::None),\n m_staggerIndex (StaggerIndex::None)\n{\n\n}\n\n//public\nbool Map::load(const std::string& path)\n{\n reset();\n\n //open the doc\n pugi::xml_document doc;\n auto result = doc.load_file(path.c_str());\n if (!result)\n {\n Logger::log(\"Failed opening \" + path, Logger::Type::Error);\n Logger::log(\"Reason: \" + std::string(result.description()), Logger::Type::Error);\n return false;\n }\n\n //make sure we have consistent path separators\n m_workingDirectory = path;\n std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\\\', '/');\n m_workingDirectory = getFilePath(m_workingDirectory);\n\n if (!m_workingDirectory.empty() &&\n m_workingDirectory.back() == '/')\n {\n m_workingDirectory.pop_back();\n }\n\n\n //find the map node and bail if it doesn't exist\n auto mapNode = doc.child(\"map\");\n if (!mapNode)\n {\n Logger::log(\"Failed opening map: \" + path + \", no map node found\", Logger::Type::Error);\n return reset();\n }\n\n return parseMapNode(mapNode);\n}\n\nbool Map::loadFromString(const std::string& data, const std::string& workingDir)\n{\n reset();\n\n //open the doc\n pugi::xml_document doc;\n auto result = doc.load_string(data.c_str());\n if (!result)\n {\n Logger::log(\"Failed opening map\", Logger::Type::Error);\n Logger::log(\"Reason: \" + std::string(result.description()), Logger::Type::Error);\n return false;\n }\n\n //make sure we have consistent path separators\n m_workingDirectory = workingDir;\n std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\\\', '/');\n m_workingDirectory = getFilePath(m_workingDirectory);\n\n if (!m_workingDirectory.empty() &&\n m_workingDirectory.back() == '/')\n {\n m_workingDirectory.pop_back();\n }\n\n //find the map node and bail if it doesn't exist\n auto mapNode = doc.child(\"map\");\n if (!mapNode)\n {\n Logger::log(\"Failed opening map: no map node found\", Logger::Type::Error);\n return reset();\n }\n\n return parseMapNode(mapNode);\n}\n\n//private\nbool Map::parseMapNode(const pugi::xml_node& mapNode)\n{\n //parse map attributes\n std::size_t pointPos = 0;\n std::string attribString = mapNode.attribute(\"version\").as_string();\n if (attribString.empty() || (pointPos = attribString.find('.')) == std::string::npos)\n {\n Logger::log(\"Invalid map version value, map not loaded.\", Logger::Type::Error);\n return reset();\n }\n\n m_version.upper = STOI(attribString.substr(0, pointPos));\n m_version.lower = STOI(attribString.substr(pointPos + 1));\n\n attribString = mapNode.attribute(\"orientation\").as_string();\n if (attribString.empty())\n {\n Logger::log(\"Missing map orientation attribute, map not loaded.\", Logger::Type::Error);\n return reset();\n }\n\n if (attribString == \"orthogonal\")\n {\n m_orientation = Orientation::Orthogonal;\n }\n else if (attribString == \"isometric\")\n {\n m_orientation = Orientation::Isometric;\n }\n else if (attribString == \"staggered\")\n {\n m_orientation = Orientation::Staggered;\n }\n else if (attribString == \"hexagonal\")\n {\n m_orientation = Orientation::Hexagonal;\n }\n else\n {\n Logger::log(attribString + \" format maps aren't supported yet, sorry! Map not loaded\", Logger::Type::Error);\n return reset();\n }\n\n attribString = mapNode.attribute(\"renderorder\").as_string();\n //this property is optional for older version of map files\n if (!attribString.empty())\n {\n if (attribString == \"right-down\")\n {\n m_renderOrder = RenderOrder::RightDown;\n }\n else if (attribString == \"right-up\")\n {\n m_renderOrder = RenderOrder::RightUp;\n }\n else if (attribString == \"left-down\")\n {\n m_renderOrder = RenderOrder::LeftDown;\n }\n else if (attribString == \"left-up\")\n {\n m_renderOrder = RenderOrder::LeftUp;\n }\n else\n {\n Logger::log(attribString + \": invalid render order. Map not loaded.\", Logger::Type::Error);\n return reset();\n }\n }\n\n if (mapNode.attribute(\"infinite\"))\n {\n m_infinite = mapNode.attribute(\"infinite\").as_int() != 0;\n }\n\n unsigned width = mapNode.attribute(\"width\").as_int();\n unsigned height = mapNode.attribute(\"height\").as_int();\n if (width && height)\n {\n m_tileCount = { width, height };\n }\n else\n {\n Logger::log(\"Invalid map tile count, map not loaded\", Logger::Type::Error);\n return reset();\n }\n\n width = mapNode.attribute(\"tilewidth\").as_int();\n height = mapNode.attribute(\"tileheight\").as_int();\n if (width && height)\n {\n m_tileSize = { width, height };\n }\n else\n {\n Logger::log(\"Invalid tile size, map not loaded\", Logger::Type::Error);\n return reset();\n }\n\n m_hexSideLength = mapNode.attribute(\"hexsidelength\").as_float();\n if (m_orientation == Orientation::Hexagonal && m_hexSideLength <= 0)\n {\n Logger::log(\"Invalid he side length found, map not loaded\", Logger::Type::Error);\n return reset();\n }\n\n attribString = mapNode.attribute(\"staggeraxis\").as_string();\n if (attribString == \"x\")\n {\n m_staggerAxis = StaggerAxis::X;\n }\n else if (attribString == \"y\")\n {\n m_staggerAxis = StaggerAxis::Y;\n }\n if ((m_orientation == Orientation::Staggered || m_orientation == Orientation::Hexagonal)\n && m_staggerAxis == StaggerAxis::None)\n {\n Logger::log(\"Map missing stagger axis property. Map not loaded.\", Logger::Type::Error);\n return reset();\n }\n\n attribString = mapNode.attribute(\"staggerindex\").as_string();\n if (attribString == \"odd\")\n {\n m_staggerIndex = StaggerIndex::Odd;\n }\n else if (attribString == \"even\")\n {\n m_staggerIndex = StaggerIndex::Even;\n }\n if ((m_orientation == Orientation::Staggered || m_orientation == Orientation::Hexagonal)\n && m_staggerIndex == StaggerIndex::None)\n {\n Logger::log(\"Map missing stagger index property. Map not loaded.\", Logger::Type::Error);\n return reset();\n }\n\n\n //colour property is optional\n attribString = mapNode.attribute(\"backgroundcolor\").as_string();\n if (!attribString.empty())\n {\n m_backgroundColour = colourFromString(attribString);\n }\n\n //TODO do we need next object ID? technically we won't be creating\n //new objects outside of the scene in xygine.\n\n //parse all child nodes\n for (const auto& node : mapNode.children())\n {\n std::string name = node.name();\n if (name == \"tileset\")\n {\n m_tilesets.emplace_back(m_workingDirectory);\n m_tilesets.back().parse(node, this);\n }\n else if (name == \"layer\")\n {\n m_layers.emplace_back(std::make_unique(m_tileCount.x * m_tileCount.y));\n m_layers.back()->parse(node);\n }\n else if (name == \"objectgroup\")\n {\n m_layers.emplace_back(std::make_unique());\n m_layers.back()->parse(node, this);\n }\n else if (name == \"imagelayer\")\n {\n m_layers.emplace_back(std::make_unique(m_workingDirectory));\n m_layers.back()->parse(node, this);\n }\n else if (name == \"properties\")\n {\n const auto& children = node.children();\n for (const auto& child : children)\n {\n m_properties.emplace_back();\n m_properties.back().parse(child);\n }\n }\n else if (name == \"group\")\n {\n m_layers.emplace_back(std::make_unique(m_workingDirectory, m_tileCount));\n m_layers.back()->parse(node, this);\n }\n else\n {\n LOG(\"Unidentified name \" + name + \": node skipped\", Logger::Type::Warning);\n }\n }\n // fill animated tiles for easier lookup into map\n for(const auto& ts : m_tilesets)\n {\n for(const auto& tile : ts.getTiles())\n {\n if (!tile.animation.frames.empty())\n {\n m_animTiles[tile.ID + ts.getFirstGID()] = tile;\n }\n }\n }\n\n return true;\n}\n\nbool Map::reset()\n{\n m_orientation = Orientation::None;\n m_renderOrder = RenderOrder::None;\n m_tileCount = { 0u, 0u };\n m_tileSize = { 0u, 0u };\n m_hexSideLength = 0.f;\n m_staggerAxis = StaggerAxis::None;\n m_staggerIndex = StaggerIndex::None;\n m_backgroundColour = {};\n m_workingDirectory = \"\";\n\n m_tilesets.clear();\n m_layers.clear();\n m_properties.clear();\n\n m_templateObjects.clear();\n m_templateTilesets.clear();\n\n return false;\n}\n"
},
{
"path": "app/src/main/cpp/isEngine/ext_lib/TMXLite/Map.hpp",
"content": "/*********************************************************************\nMatt Marchant 2016\nhttp://trederia.blogspot.com\n\ntmxlite - Zlib license.\n\nThis software is provided 'as-is', without any express or\nimplied warranty. In no event will the authors be held\nliable for any damages arising from the use of this software.\n\nPermission is granted to anyone to use this software for any purpose,\nincluding commercial applications, and to alter it and redistribute\nit freely, subject to the following restrictions:\n\n1. The origin of this software must not be misrepresented;\nyou must not claim that you wrote the original software.\nIf you use this software in a product, an acknowledgment\nin the product documentation would be appreciated but\nis not required.\n\n2. Altered source versions must be plainly marked as such,\nand must not be misrepresented as being the original software.\n\n3. This notice may not be removed or altered from any\nsource distribution.\n*********************************************************************/\n\n#pragma once\n\n#include \"Tileset.hpp\"\n#include \"Layer.hpp\"\n#include \"Property.hpp\"\n#include \"Types.hpp\"\n#include \"Object.hpp\"\n\n#include \n#include \n#include \n#include \n\nnamespace tmx\n{\n /*!\n \\brief Holds the xml version of the loaded map\n */\n struct TMXLITE_EXPORT_API Version\n {\n //major/minor are apparently reserved by gcc\n std::uint16_t upper;\n std::uint16_t lower;\n Version(std::uint16_t maj = 0, std::uint16_t min = 0)\n : upper(maj), lower(min) {}\n };\n\n enum class Orientation\n {\n Orthogonal,\n Isometric,\n Staggered,\n Hexagonal,\n None\n };\n\n enum class RenderOrder\n {\n RightDown,\n RightUp,\n LeftDown,\n LeftUp,\n None\n };\n\n enum class StaggerAxis\n {\n X, Y, None\n };\n\n enum class StaggerIndex\n {\n Even, Odd, None\n };\n\n /*!\n \\brief Parser for TMX format tile maps.\n This class can be used to parse the XML format tile maps created\n with the Tiled map editor, providing an interface to create drawable and\n physics objects. Typical usage would be to create an instance of this\n class before calling load() providing a path to the *.tmx file to be\n loaded. Then layers or objects can be requested from the Map class\n to be interpreted as needed.\n */\n class TMXLITE_EXPORT_API Map final\n {\n public:\n\n Map();\n ~Map() = default;\n Map(const Map&) = delete;\n Map& operator = (const Map&) = delete;\n Map(Map&&) = default;\n Map& operator = (Map&&) = default;\n\n /*!\n \\brief Attempts to parse the tilemap at the given location.\n \\param std::string Path to map file to try to parse\n \\returns true if map was parsed successfully else returns false.\n In debug mode this will attempt to log any errors to the console.\n */\n bool load(const std::string&);\n\n /*!\n \\brief Loads a map from a document stored in a string\n \\param data A std::string containing the map data to load\n \\param workingDir A std::string containing the working directory\n in which to find assets such as tile sets or images\n \\returns true if successful, else false\n */\n bool loadFromString(const std::string& data, const std::string& workingDir);\n\n /*!\n \\brief Returns the version of the tile map last parsed.\n If no tile map has yet been parsed the version will read 0, 0\n */\n const Version& getVersion() const { return m_version; }\n /*!\n \\brief Returns the orientation of the map if one is loaded,\n else returns None\n */\n Orientation getOrientation() const { return m_orientation; }\n /*!\n \\brief Returns the RenderOrder of the map if one is loaded,\n else returns None\n */\n RenderOrder getRenderOrder() const { return m_renderOrder; }\n /*!\n \\brief Returns the tile count of the map in the X and Y directions\n */\n const Vector2u& getTileCount() const { return m_tileCount; }\n /*!\n \\brief Returns the size of the tile grid in this map.\n Actual tile sizes may vary and will be extended / shrunk about\n the bottom left corner of the tile.\n */\n const Vector2u& getTileSize() const { return m_tileSize; }\n /*!\n \\brief Returns the bounds of the map\n */\n FloatRect getBounds() const { return FloatRect(0.f, 0.f, static_cast(m_tileCount.x * m_tileSize.x), static_cast(m_tileCount.y * m_tileSize.y)); }\n /*!\n \\brief Returns the length of an edge of a tile if a Hexagonal\n map is loaded.\n The length returned is in pixels of the straight edge running\n along the axis returned by getStaggerAxis(). If no map is loaded\n or the loaded map is not of Hexagonal orientation this function\n returns 0.f\n */\n float getHexSideLength() const { return m_hexSideLength; }\n /*!\n \\brief Stagger axis of the map.\n If either a Staggered or Hexagonal tile map is loaded this returns\n which axis the map is staggered along, else returns None.\n */\n StaggerAxis getStaggerAxis() const { return m_staggerAxis; }\n /*!\n \\brief Stagger Index of the loaded map.\n If a Staggered or Hexagonal map is loaded this returns whether\n the even or odd rows of tiles are staggered, otherwise it returns None.\n */\n StaggerIndex getStaggerIndex() const { return m_staggerIndex; }\n /*!\n \\brief Returns the background colour of the map.\n */\n const Colour& getBackgroundColour() const { return m_backgroundColour; }\n /*!\n \\brief Returns a reference to the vector of tile sets used by the map\n */\n const std::vector& getTilesets() const { return m_tilesets; }\n /*!\n \\brief Returns a reference to the vector containing the layer data.\n Layers are pointer-to-baseclass, the concrete type of which can be\n found via Layer::getType()\n \\see Layer\n */\n const std::vector& getLayers() const { return m_layers; }\n /*!\n \\brief Returns a vector of Property objects loaded by the map\n */\n const std::vector