├── .appveyor.yml ├── .clang-format ├── .gitmodules ├── CMakeLists.txt ├── CONCEPT.md ├── CONTRIBUTING.md ├── EasyInstall.ps1 ├── LICENSE ├── README.md ├── assets └── splashscreen.txt ├── easy_install.sh ├── gen_data.py ├── requirements.txt └── src ├── anim.cpp ├── anim.hpp ├── main.cpp ├── models.cpp ├── models.hpp ├── utils.cpp └── utils.hpp /.appveyor.yml: -------------------------------------------------------------------------------- 1 | version: "1.0.0-{build}" 2 | environment: 3 | global: 4 | APP_VERSION: "1.0.0" 5 | matrix: 6 | - job_name: Windows x64 7 | appveyor_build_worker_image: Visual Studio 2019 8 | - job_name: Linux x64 9 | appveyor_build_worker_image: Ubuntu 10 | configuration: 11 | - Release 12 | before_build: 13 | - cmd: cmake -G "Visual Studio 16 2019" . -B out 14 | - sh: cmake -G Ninja . -B out -DCMAKE_C_COMPILER=clang -DCMAKE_CXX_COMPILER=clang++ -DCMAKE_BUILD_TYPE=$CONFIGURATION || exit 1 15 | for: 16 | - matrix: 17 | only: 18 | - job_name: Windows x64 19 | build: 20 | project: out/pkmn.sln 21 | parallel: true 22 | verbosity: minimal 23 | - matrix: 24 | only: 25 | - job_name: Linux x64 26 | build_script: 27 | - sh: echo "== Building Linux $CONFIGURATION $APP_VERSION ==" && ninja -v -C out || exit 1 28 | test_script: | 29 | cd out 30 | ctest || exit 1 31 | matrix: 32 | fast_finish: true 33 | skip_branch_with_pr: true -------------------------------------------------------------------------------- /.clang-format: -------------------------------------------------------------------------------- 1 | --- 2 | Language: Cpp 3 | BasedOnStyle: LLVM 4 | AlwaysBreakTemplateDeclarations: Yes 5 | BreakBeforeBraces: Allman 6 | ColumnLimit: 160 7 | SpaceAfterTemplateKeyword: true 8 | Standard: c++17 9 | TabWidth: 4 10 | IndentWidth: 4 11 | UseTab: Always 12 | AllowAllArgumentsOnNextLine: false 13 | AllowShortFunctionsOnASingleLine: false 14 | SortIncludes: true 15 | IncludeCategories: 16 | # Headers in <> without extension. 17 | - Regex: '<([A-Za-z0-9\/-_])+>' 18 | Priority: 1 19 | # Headers in <> with .h extension. 20 | - Regex: '<([A-Za-z0-9\/-_])+\.h>' 21 | Priority: 10 22 | # Headers in <> with .hpp extension. 23 | - Regex: '<([A-Za-z0-9\/-_])+\.hpp>' 24 | Priority: 20 25 | PointerAlignment: Left -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "libs/djson"] 2 | path = libs/djson 3 | url = https://github.com/karnkaul/djson 4 | [submodule "libs/include/str_format"] 5 | path = libs/include/str_format 6 | url = https://github.com/karnkaul/str-format 7 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.18 FATAL_ERROR) 2 | 3 | function(update_git_submodules MSG_TYPE) 4 | message(STATUS "Updating git submodules...") 5 | execute_process(COMMAND ${GIT_EXECUTABLE} submodule update --init --recursive 6 | WORKING_DIRECTORY "${CMAKE_CURRENT_SOURCE_DIR}" 7 | RESULT_VARIABLE UPDATE_SUBMODULES_RESULT 8 | ) 9 | if(NOT UPDATE_SUBMODULES_RESULT EQUAL "0") 10 | message(${MSG_TYPE} "git submodule update failed!") 11 | endif() 12 | endfunction() 13 | 14 | set(CMAKE_CXX_STANDARD 17) 15 | set(CMAKE_CXX_STANDARD_REQUIRED ON) 16 | set(CMAKE_CXX_EXTENSIONS OFF) 17 | set(CMAKE_BUILD_TYPE "Debug" CACHE STRING "") 18 | set(APP_VERSION "1.0.0" CACHE STRING "Application Version" FORCE) 19 | project(pkmn VERSION ${APP_VERSION}) 20 | 21 | find_package(Git QUIET) 22 | if(GIT_FOUND AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/.git") 23 | option(PKMN_GIT_UPDATE_SUBMODULES "Init/Update submodules during generation" ON) 24 | if(PKMN_GIT_UPDATE_SUBMODULES) 25 | update_git_submodules(FATAL_ERROR) 26 | endif() 27 | endif() 28 | 29 | file(GLOB_RECURSE SOURCES CONFIGURE_DEPENDS "${CMAKE_CURRENT_SOURCE_DIR}/src/*.*pp") 30 | 31 | # Libraries 32 | add_subdirectory(libs/djson) 33 | 34 | add_executable(${PROJECT_NAME} ${SOURCES}) 35 | target_include_directories(${PROJECT_NAME} PRIVATE libs/include) 36 | 37 | if(CMAKE_CXX_COMPILER_ID STREQUAL Clang OR CMAKE_CXX_COMPILER_ID STREQUAL GNU) 38 | target_compile_options(${PROJECT_NAME} PRIVATE -Wall -Wextra $<$>:-Werror>) 39 | endif() 40 | 41 | if(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC") 42 | target_compile_options(${PROJECT_NAME} PRIVATE $<$>:/WX>) 43 | set_property(DIRECTORY ${CMAKE_SOURCE_DIR} PROPERTY VS_STARTUP_PROJECT ${PROJECT_NAME}) 44 | endif() 45 | 46 | target_link_libraries(${PROJECT_NAME} PUBLIC djson::djson) 47 | -------------------------------------------------------------------------------- /CONCEPT.md: -------------------------------------------------------------------------------- 1 | # PKMN 2 | 3 | The purpose of this document is to outline the project goals and user requirements. 4 | Not everything described here needs to be implemented, and you may also add new 5 | features you don't find here. However, it is recommended to add the core mechanics 6 | first, and minor details later to polish the finished project. 7 | 8 | ## Intro 9 | 10 | PKMN is intended to be a turn-based CLI fighting game based on the original pokemon 11 | franchise. The scope of the project is narrowed down to a 1vs1 encounter between 12 | the player and an AI. Before the game starts, the user should be able to pick a 13 | pokemon and select the level of difficulty. 14 | 15 | ![reference image](https://i.ytimg.com/vi/xKy1e4uUe7Q/hqdefault.jpg) 16 | 17 | --- 18 | 19 | ## Concept 20 | 21 | ### Models 22 | 23 | For reasons of consistency, this game will use the same terminology as the original 24 | game that you should keep in mind when you create these structures. 25 | 26 | #### Move 27 | 28 | A `move` in pokemon is a general term that describes in-battle actions which can 29 | either change 30 | 31 | - one's `hp` 32 | - the enemy's `hp` 33 | - one's `status` 34 | - then enemy's `status` 35 | - a combination of any of those, but never more than 2 at the same time 36 | 37 | There're a few more things one could consider, but for this project these parameters 38 | should suffice. In addition to that, each `move` has a `accuracy` between `30%` and 39 | `100%`. Stronger moves are less likely to succeed, and vice versa. 40 | 41 | #### Pokemon 42 | 43 | - `name` 44 | - `level` (between `1` and `100`) 45 | - `hp` (short for hit points [[1](#hp)]) 46 | - `status` (poison, sleep, etc.) 47 | - `moveset` (collection of all moves, at most 4) 48 | 49 | In the early stages, pokemon don't know many moves. To replicate that, choose at 50 | random 51 | 52 | - 1 move if `level<5` 53 | - 2 moves if `level<10` 54 | - 3 moves if `level<20` 55 | - else 4 56 | 57 | An important method of this struct will be `select_move` which will take a user 58 | input and invoke the selected move. 59 | 60 | ### UI 61 | 62 | One of the major challenges while developing this game will be the fact that it's 63 | not trivial to draw images in a terminal. For the sake of simplicity, convert the 64 | original sprites [[2](#sprites)] into ASCII characters based on density. Because 65 | of space limitations (small ASCII images generally look like a ball of 66 | characters), use ANSI escape codes to color each "pixel" accordingly [[3](#ansii)]. 67 | 68 | ### Animations 69 | 70 | While not mandatory, it would be interesting to explore how to embed animations 71 | into the game. Here are a few ideas from which you can draw inspiration: 72 | 73 | - when the battle starts, fade in both characters 74 | - the healthbar could change its state slowly rather than instantly 75 | - the pokemon could move a little up and down when they take damage 76 | - add text from the original game to annotate the players actions (e.g. *It's 77 | super effective!* when a pokemon receives critical damage) 78 | 79 | ### Fight Mechanism 80 | 81 | Because this will be a turn-based fighting game, there will be a main event loop 82 | that terminates when one of the two pokemon's life points were reduced to zero. 83 | Because the player can initially set the level of difficulty, the following 84 | parameters should be taken into account: 85 | 86 | - add a transition to indicate the start of a battle [[4](#trans)] 87 | - difference in level between both pokemons 88 | - setting a stronger move set 89 | - likelihood in with which moves succeed 90 | - how much health an enemy can restore with a berry (if any) 91 | 92 | --- 93 | 94 | ## System Requirements 95 | 96 | The game will be developed with os-independent dependencies in C++17. For starters 97 | work without any external dependencies. This is not a hard rule, and may change in 98 | the future if deemed necessary. 99 | 100 | ## References 101 | 102 | - [1] In the original game the HP of a pokemon was influenced by 103 | various factors. For the sake of simplicity, assume for all pokemon that `hp=2*level*random_range(0.8,1.2)` 104 | - [2] 105 | - [3] 106 | - [4] 107 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | # Guidelines for Contributors 2 | 3 | ## Coding Conventions 4 | 5 | This code base will have a pre-made `.clang-format` to take care of most formatting 6 | issues automatically. Use `snake_case` for function and variable names, and 7 | `CamelCase` for classes, structs, and so on. 8 | 9 | ## Branching Policy 10 | 11 | Create a new topic branch based of `integration`, and raise PRs against this branch 12 | back once you're done with your work. Your code will be reviewed before a merge can 13 | be confirmed. After a while, `integration` merges into `master`, marking a new 14 | and thoroughly tested release. 15 | 16 | ```bash 17 | master 18 | | 19 | \ ____ integration 20 | | 21 | |\ ____ pokemon 22 | | 23 | |\ ____ ui 24 | | 25 | \ _____ api 26 | ``` 27 | -------------------------------------------------------------------------------- /EasyInstall.ps1: -------------------------------------------------------------------------------- 1 | Write-Host -ForegroundColor Yellow "+++ PKMN Asset Builder +++" 2 | 3 | Write-Host "`nAccording to the National Pok\u00e9mon Index, the first 151 entries served in Generation I." 4 | Write-Host "You may use any of these numbers to create new asset files to play this game.`n" 5 | 6 | $ID1 = Read-Host "Pokemon ID #1" 7 | $ID2 = Read-Host "Pokemon ID #2" 8 | 9 | if ( -not (Test-Path -Path "venv" -PathType Container) ) 10 | { 11 | Write-Host -ForegroundColor Yellow "Creating a new virtual environment . . ." 12 | python -m venv venv/ 13 | .\venv\Scripts\Activate.ps1 14 | Write-Host "Installing dependencies . . ." 15 | python -m pip install --upgrade pip 16 | python -m pip install -r requirements.txt --only-binary all 17 | } 18 | else 19 | { 20 | .\venv\Scripts\Activate.ps1 21 | } 22 | 23 | python gen_data.py --verbose make --id $ID1 $ID2 24 | python gen_data.py manifest 25 | 26 | Write-Host -ForegroundColor Yellow "Done!" 27 | 28 | deactivate # virtual environment -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 |

PKMN

2 | 3 |

4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 |

23 | 24 | ## For Users: Playing the Game 25 | 26 | Go to [Releases](https://github.com/cpp-gamedev/pkmn/releases) and download the 27 | latest version of `pkmn-x64-linux-windows-v1.0.0-*.zip`. Unzip this directory, then 28 | 29 | - run `easy_install.sh` (Linux) 30 | - run `EasyInstall.ps1` (Windows) 31 | 32 | to configure the game. This process may take a minute or two depending on your 33 | internet connection. After that, run the `pkmn` binary (`pkmn.exe` on Windows) 34 | to start the game. The game takes up quite a bit of vertical space, so you may 35 | want to adjust the size of your terminal. 36 | 37 | ## For Developers: Build & Debug the Game 38 | 39 | Initialize and update all submodules after you have cloned this repository: 40 | 41 | ```bash 42 | git submodule update --init --recursive 43 | ``` 44 | 45 | For python specifically, you may need to install `python3-venv` to create virtual 46 | environments on Linux. 47 | 48 | ### Generating new Pokemon 49 | 50 | If this is your first time using a python script, use 51 | 52 | ```bash 53 | python -m venv venv/ 54 | source venv/bin/activate 55 | python -m pip install --upgrade pip 56 | pip install -r requirements.txt --only-binary all 57 | ``` 58 | 59 | to install the dependencies in a virtual environment. On Windows, you need to use 60 | `.\venv\Scripts\Activate.ps1` to activate a virtual environment. Note that this script 61 | assumes that it is being run from the project's root directory. You need to create 62 | at least two new pkmn file sets before you can start playing this game: 63 | 64 | ```bash 65 | # creates two new pkmns (bulbasaur and charmander) 66 | python gen_data.py --verbose make --id 1 4 67 | # creates a manifest.json 68 | python gen_data.py manifest 69 | ``` 70 | 71 | In case of doubt, use 72 | 73 | ```bash 74 | python gen_data.py --help 75 | ``` 76 | 77 | to get more help. 78 | 79 | ### On Visual Studio (Windows) 80 | 81 | Navigate to `Project` and select `Generate Cache for pkmn`. Set `Current Document (main.cpp)` 82 | to start debugging this project (`F5`). 83 | 84 | ### On Visual Studio Code (Linux) 85 | 86 | Useful links for first timers: 87 | 88 | - 89 | - 90 | -------------------------------------------------------------------------------- /assets/splashscreen.txt: -------------------------------------------------------------------------------- 1 | ,'\ 2 | _.----. ____ ,' _\ ___ ___ ____ 3 | _,-' `. | | /`. \,-' | \ / | | \ |`. 4 | \ __ \ '-. | / `. ___ | \/ | '-. \ | | 5 | \. \ \ | __ | |/ ,','_ `. | | __ | \| | 6 | \ \/ /,' _`.| ,' / / / / | ,' _`.| | | 7 | \ ,-'/ / \ ,' | \/ / ,`.| / / \ | | 8 | \ \ | \_/ | `-. \ `' /| | || \_/ | |\ | 9 | \ \ \ / `-.`.___,-' | |\ /| \ / | | | 10 | \ \ `.__,'| |`-._ `| |__| \/ | `.__,'| | | | 11 | \_.-' |__| `-._ | '-.| '-.| | | 12 | `' '-._| -------------------------------------------------------------------------------- /easy_install.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | echo "+++ PKMN Asset Builder +++" 4 | 5 | echo -e "\nAccording to the National Pok\u00e9mon Index, the first 151 entries served in Generation I." 6 | echo -e "You may use any of these numbers to create new asset files to play this game.\n" 7 | 8 | echo -n "Pokemon ID #1: " 9 | read id1 10 | 11 | echo -n "Pokemon ID #2: " 12 | read id2 13 | 14 | if [[ ! -d "venv/" ]]; then 15 | echo "Creating a new virtual environment . . ." 16 | python3 -m venv venv/ 17 | source venv/bin/activate 18 | echo "Installing dependencies . . ." 19 | python3 -m pip install --upgrade pip 20 | python3 -m pip install -r requirements.txt --only-binary all 21 | else 22 | source venv/bin/activate 23 | fi 24 | 25 | python3 gen_data.py --verbose make --id $id1 $id2 26 | python3 gen_data.py manifest 27 | 28 | echo "Done!" 29 | 30 | deactivate # virtual environment 31 | -------------------------------------------------------------------------------- /gen_data.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | """ 4 | PKMN Utility Tool (C) hentai-chan 5 | 6 | Description 7 | ----------- 8 | This script uses the Pokemon API to create a JSON file and an ASCII sprite for the 9 | pkmn game. Run it from the root directory of the project and ensure that all dependencies 10 | are installed. 11 | 12 | Usage 13 | ----- 14 | 15 | 1. creates two new pkmns (bulbasaur and charmander) 16 | >> python gen_data.py --verbose make --id 1 4 17 | 18 | 2. creates a manifest.json 19 | >> python gen_data.py manifest 20 | """ 21 | 22 | import argparse 23 | import json 24 | from collections import Counter 25 | from pathlib import Path 26 | from pprint import pprint 27 | from random import randint, random 28 | from typing import List 29 | from urllib.parse import urljoin 30 | from itertools import chain 31 | 32 | import colorama 33 | import requests 34 | from colorama import Fore, Style 35 | from PIL import Image, ImageOps 36 | from rich.console import Console 37 | from rich.progress import track 38 | 39 | #region global variables 40 | 41 | __version__ = "0.0.1" 42 | 43 | def setup() -> List[Path]: 44 | assets = [Path('assets/'), Path('assets/textures'), Path('assets/data')] 45 | for dir in assets: 46 | dir.mkdir(parents=True, exist_ok=True) 47 | return assets 48 | 49 | ASSETS, TEXTURES, DATA = setup() 50 | BASE_API = "https://pokeapi.co/api/v2/pokemon/" 51 | SPRITE_API = "https://pokeres.bastionbot.org/images/pokemon/" 52 | CONSOLE = Console() 53 | 54 | #endregion 55 | 56 | #region image processing 57 | 58 | CHARS = [' ', '.', 'o', 'v', '@', '#', 'W'] 59 | 60 | def resize_image(img: Image, new_width=20) -> Image: 61 | width, height = img.size 62 | aspect_ratio = height / float(width) 63 | return img.resize((new_width, int(aspect_ratio * new_width)), Image.BILINEAR) 64 | 65 | def detect_color(c: str, r:int, g:int, b:int) -> str: 66 | # thresholds were determined experimentally 67 | if sum([r, g, b]) > 550: 68 | return ''.join((Fore.WHITE, c, Style.RESET_ALL)) 69 | elif r + g > 250 and b < 100: 70 | return ''.join((Fore.YELLOW, c, Style.RESET_ALL)) 71 | elif r + b > 250 and g < 100: 72 | return ''.join((Fore.MAGENTA, c, Style.RESET_ALL)) 73 | elif g + b > 250 and r < 100: 74 | return ''.join((Fore.CYAN, c, Style.RESET_ALL)) 75 | elif max(r, g, b) == r: 76 | return ''.join((Fore.RED, c, Style.RESET_ALL)) 77 | elif max(r, g, b) == g: 78 | return ''.join((Fore.GREEN, c, Style.RESET_ALL)) 79 | else: 80 | return ''.join((Fore.BLUE, c, Style.RESET_ALL)) 81 | 82 | def img2ascii(image, width=20, mirror_image=False) -> List[str]: 83 | image = resize_image(image, new_width=width).convert('RGB') 84 | 85 | if mirror_image: 86 | image = ImageOps.mirror(image) 87 | 88 | data = image.load() 89 | 90 | ascii_art = [] 91 | for w in range(width): 92 | for h in (height:=range(width)): 93 | r, g, b = data[h, w] 94 | char = int(r/3 + g/3 + b/3) 95 | ascii_art.append(detect_color(CHARS[int(char * len(CHARS) // 256)], r, g, b)) 96 | ascii_art.append('\n') 97 | return ascii_art 98 | 99 | #endregion 100 | 101 | def req_pkmn_data(id_: int, verbose: bool) -> None: 102 | result = None 103 | 104 | # result is stored in assets/{id}.json 105 | with CONSOLE.status('Making initial request . . .', spinner='dots3') as _: 106 | response = requests.get(urljoin(BASE_API, str(id_))).json() 107 | level = randint(30, 60) 108 | result = { 109 | 'id': response['id'], 110 | 'name': response['name'], 111 | 'level': level, 112 | 'hp': int(2 * level * (0.8 + 0.4 * random())), 113 | 'atk': 100, 114 | 'def': 100, 115 | } 116 | 117 | moves = {} 118 | endpoints = [move['move']['url'] for move in response['moves']] 119 | for index, endpoint in track(enumerate(endpoints), "Sending Requests", total=len(endpoints), transient=True): 120 | move_response = requests.get(endpoint).json() 121 | unescape = lambda text: text.replace('\u00e9','e').replace('\u2019', "'").replace('\n',' ').replace('\u00ad', '-') 122 | moves[index] = { 123 | 'name': move_response['names'][7]['name'], 124 | 'accuracy': int(move_response['accuracy']) if move_response['accuracy'] is not None else None, 125 | 'effect_changes': move_response['effect_changes'] if len(move_response['effect_changes']) > 0 else [None], 126 | 'effect_chance': int(move_response['effect_chance']) if move_response['effect_chance'] is not None else None, 127 | 'power': int(move_response['power']) if move_response['power'] is not None else None, 128 | 'flavor_text_entries': [unescape(entry['flavor_text']) for entry in move_response['flavor_text_entries'] if entry['language']['name'] == 'en'] 129 | } 130 | result['moves'] = moves 131 | 132 | data = DATA.joinpath(f"{result['id']}.json") 133 | 134 | with open(data, mode='w', encoding='utf-8') as file_handler: 135 | json.dump(result, file_handler) 136 | 137 | if verbose: 138 | pprint(result) 139 | 140 | print(f"{Fore.YELLOW}Created {str(data)!r}{Style.RESET_ALL}") 141 | 142 | def gen_sprite(id_: int, mirror: bool, verbose: bool) -> None: 143 | colorama.init(autoreset=False) 144 | 145 | with CONSOLE.status('Creating new ASCII image . . .', spinner='dots3') as _: 146 | filename = f"{id_}.png" 147 | image_path = ASSETS.joinpath(filename) 148 | response = requests.get(urljoin(SPRITE_API, filename), stream=True) 149 | with open(image_path, mode='wb') as file_handler: 150 | for chunk in response.iter_content(1024): 151 | file_handler.write(chunk) 152 | 153 | ascii_art = img2ascii(Image.open(image_path), width=20, mirror_image=mirror) 154 | 155 | sprite = TEXTURES.joinpath(f"{id_}.txt") 156 | 157 | with open(sprite, mode='w', encoding='utf-8') as file_handler: 158 | file_handler.writelines(ascii_art) 159 | 160 | image_path.unlink(missing_ok=True) 161 | 162 | if verbose: 163 | print(f"\n{''.join(ascii_art)}") 164 | 165 | print(f"{Fore.YELLOW}Created {str(sprite)!r}{Style.RESET_ALL}") 166 | 167 | def check_manifest(verbose: bool) -> None: 168 | extensions = ['.txt', '.json'] 169 | 170 | files = list(filter( 171 | lambda file: file.suffix in extensions and file.stem.isnumeric(), 172 | [file for file in chain(DATA.glob(r'**/*'), TEXTURES.glob(r'**/*'))] 173 | )) 174 | 175 | ids = list(map(lambda file: int(file.stem), files)) 176 | duplicates = [id_ for id_, count in Counter(ids).items() if count > 1] 177 | 178 | manifest = { 179 | 'files': list(map(str, files)), 180 | 'duplicates': duplicates, 181 | 'game_ready': len(duplicates) >= 2, 182 | } 183 | 184 | with open("manifest.json", mode='w', encoding='utf-8') as file_handler: 185 | json.dump(manifest, file_handler) 186 | 187 | if verbose: pprint(manifest) 188 | 189 | def main(): 190 | parser = argparse.ArgumentParser() 191 | 192 | parser.add_argument('--version', action='version', version=f"%(prog)s {__version__}") 193 | parser.add_argument('--verbose', action='store_true', help="increase output verbosity") 194 | 195 | subparser = parser.add_subparsers(dest='command') 196 | 197 | make_parser = subparser.add_parser('make', help="create new pkmn data") 198 | make_parser.add_argument('--id', type=int, nargs='+', required=True, help="one or more pokemon id") 199 | make_parser.add_argument('--mirror', action='store_true', help="mirror sprite") 200 | 201 | manifest_parser = subparser.add_parser('manifest', help="validate manifest") 202 | 203 | args = parser.parse_args() 204 | 205 | if args.command == 'make': 206 | for id_ in args.id: 207 | req_pkmn_data(id_, verbose=False) 208 | gen_sprite(id_, args.mirror, verbose=False) 209 | elif args.command == 'manifest': 210 | check_manifest(args.verbose) 211 | else: 212 | raise NotImplementedError() 213 | 214 | 215 | if __name__ == '__main__': 216 | main() 217 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | colorama==0.4.4 2 | pillow==8.2.0 3 | requests==2.25.1 4 | rich==10.2.2 5 | -------------------------------------------------------------------------------- /src/anim.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include 4 | 5 | #include "models.hpp" 6 | #include "utils.hpp" 7 | 8 | namespace anim 9 | { 10 | std::vector gen_healthbar(const models::Pokemon& pkmn) 11 | { 12 | /* 13 | * bulbasaur :L30 // label 14 | * HP [********* ] // progressbar 15 | * 58 / 60 // hitpoints 16 | */ 17 | std::string label = kt::format_str("{} :L{}", pkmn.name, pkmn.level); 18 | std::size_t max_width = pkmn.name.length() > 10 ? label.length() : 15; 19 | 20 | label = std::string(max_width - label.length(), ' ').append(label); 21 | 22 | double linear_map = (10.0 / pkmn.max_hp) * pkmn.hp; 23 | int hp_scaled = (0 < linear_map && linear_map < 1) ? 1 : std::floor(linear_map); 24 | 25 | std::string stars = std::string(hp_scaled, '*'); 26 | stars = stars.append(std::string(10 - hp_scaled, ' ')); 27 | utils::Color star_color = (hp_scaled >= 5) ? utils::Color::GREEN : (3 < hp_scaled && hp_scaled < 5) ? utils::Color::YELLOW : utils::Color::RED; 28 | std::string progressbar = kt::format_str("HP [{}]", style(stars, star_color)); 29 | progressbar = std::string(max_width - 15, ' ').append(progressbar); 30 | 31 | std::string hitpoints = kt::format_str("{} / {}", pkmn.hp, pkmn.max_hp); 32 | hitpoints = std::string(max_width - hitpoints.length(), ' ').append(hitpoints); 33 | 34 | return {label, progressbar, hitpoints}; 35 | } 36 | 37 | void print_splash_screen(const std::filesystem::path& assets_dir) 38 | { 39 | auto logo = utils::read_file(assets_dir / "splashscreen.txt"); 40 | std::cout << utils::style(std::accumulate(logo.begin(), logo.end(), std::string("")), utils::Color::YELLOW) << '\n'; 41 | 42 | std::cout << '\n' << std::setfill(' ') << std::setw(19); 43 | 44 | utils::delayed_print("copyright (c) 2021 cpp-gamedev", std::chrono::milliseconds{50}); 45 | } 46 | 47 | void print_move_table(const models::Pokemon& pkmn) 48 | { 49 | // +----------------------------------------------------------+ 50 | // | MOVE POWER ACCURACY | 51 | // | 1. move1 100 90 | 52 | // | first move description | 53 | // | 2. move2 90 50 | 54 | // | second move description | 55 | // | 3. move3 120 10 | 56 | // | third move description | 57 | // | 4. move4 30 70 | 58 | // | fourth move description | 59 | // +----------------------------------------------------------+ 60 | 61 | constexpr int width = 60; 62 | utils::Color border_color = utils::Color::YELLOW; 63 | std::string border = utils::style(std::string("|"), border_color); 64 | std::string horizontal_line = utils::style(std::string("+").append(std::string(width - 2, '-')).append("+"), border_color); 65 | 66 | std::cout << horizontal_line << '\n'; 67 | std::cout << border << std::string(4, ' ') << "MOVE" << std::string(32, ' ') << "POWER" << std::string(4, ' ') << "ACCURACY" << ' ' << border << '\n'; 68 | 69 | for (std::size_t i = 0; i < pkmn.move_set.size(); ++i) 70 | { 71 | // move name, power and accuracy 72 | std::string name = kt::format_str("{}. {}", i + 1, pkmn.move_set[i].name); 73 | std::cout << border << ' ' << utils::style(name, utils::Color::GREEN) << std::setfill(' ') << std::setw(width - 7 - name.length()) 74 | << utils::style(std::to_string(pkmn.move_set[i].power), utils::Color::RED) << std::setfill(' ') << std::setw(21) 75 | << utils::style(std::to_string(pkmn.move_set[i].accuracy), utils::Color::CYAN) << ' ' << border << '\n'; 76 | // flavor text 77 | std::cout << border << std::string(4, ' ') << pkmn.move_set[i].flavor_text << std::setfill(' ') << std::setw(width + 4 - pkmn.move_set[i].flavor_text.length()) 78 | << border << '\n'; 79 | } 80 | 81 | std::cout << horizontal_line << '\n'; 82 | } 83 | 84 | std::array load_main_menu(const utils::Manifest& manifest) 85 | { 86 | // 1. set difficulty 87 | int selection{utils::validate_user_input({"easy", "moderate", "hard"}, "(1/2) SET DIFFICULTY")}; 88 | auto difficulty = (selection == 1) ? models::Difficulty::EASY : (selection == 2) ? models::Difficulty::MODERATE : models::Difficulty::HARD; 89 | 90 | // 2. instantiate all available pokemons 91 | std::vector pkmns{}; 92 | pkmns.reserve(manifest.duplicates.size()); 93 | std::for_each(manifest.duplicates.begin(), manifest.duplicates.end(), 94 | [&manifest, &pkmns, &difficulty](int id) { pkmns.push_back(models::Pokemon(id, manifest.asset_dir, difficulty)); }); 95 | 96 | // 3. select pokemon 97 | std::vector names{}; 98 | names.reserve(pkmns.size()); 99 | std::for_each(pkmns.begin(), pkmns.end(), [&names](models::Pokemon& pkmn) { names.push_back(pkmn.name); }); 100 | selection = utils::validate_user_input(names, "(2/2) CHOOSE A POKEMON"); 101 | models::Pokemon player = pkmns[selection - 1]; 102 | 103 | // 4. remove selection from pkmns, so that player won't fight against his doppelganger 104 | pkmns.erase(std::remove_if(pkmns.begin(), pkmns.end(), [player](models::Pokemon pkmn) { return player.id == pkmn.id; }), pkmns.end()); 105 | return {player, pkmns.size() > 1 ? utils::random_choice(pkmns) : pkmns[0]}; 106 | } 107 | 108 | int print_frame(const models::Pokemon& pkmn1, const models::Pokemon& pkmn2) 109 | { 110 | std::string healthbars{}; 111 | std::string sprites{}; 112 | 113 | std::vector healthbar1 = gen_healthbar(pkmn1); 114 | std::vector healthbar2 = gen_healthbar(pkmn2); 115 | 116 | std::size_t padding = healthbar1[0].length() + healthbar2[0].length(); 117 | 118 | if (padding > 30) 119 | padding -= 2 * (padding - 30); 120 | 121 | // gather healthbars 122 | for (std::size_t i = 0; i < 3; i++) 123 | healthbars.append(healthbar1[i]).append(std::string(padding, ' ')).append(healthbar2[i]).append("\n"); 124 | 125 | // gather sprites 126 | for (std::size_t i = 0; i < 20; i++) 127 | { 128 | std::string tmp = pkmn1.sprite[i]; // strip new line 129 | tmp.erase(std::remove(tmp.begin(), tmp.end(), '\n'), tmp.end()); 130 | sprites.append(tmp).append(std::string(20, ' ')).append(pkmn2.sprite[i]); 131 | } 132 | 133 | int answer{}; 134 | std::vector choices(pkmn1.move_set.size()); 135 | std::iota(choices.begin(), choices.end(), 1); 136 | 137 | // read and return user-selected move 138 | while (std::find(choices.begin(), choices.end(), answer) == choices.end()) 139 | { 140 | utils::clear_screen(); 141 | std::cout << healthbars; 142 | std::cout << sprites; 143 | print_move_table(pkmn1); 144 | answer = utils::get_user_input(">>> "); 145 | std::cin.clear(); 146 | std::cin.ignore(utils::str_max, '\n'); 147 | } 148 | 149 | return answer; 150 | } 151 | } // namespace anim 152 | -------------------------------------------------------------------------------- /src/anim.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | #include "models.hpp" 8 | 9 | namespace anim 10 | { 11 | std::vector gen_healthbar(const models::Pokemon& pkmn); 12 | 13 | void print_splash_screen(const std::filesystem::path& assets_dir); 14 | 15 | void print_move_table(const models::Pokemon& pkmn); 16 | 17 | std::array load_main_menu(const utils::Manifest& manifest); 18 | 19 | int print_frame(const models::Pokemon& pkmn1, const models::Pokemon& pkmn2); 20 | } // namespace anim 21 | -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | #include "anim.hpp" 2 | #include "models.hpp" 3 | #include "utils.hpp" 4 | 5 | using namespace std::chrono_literals; 6 | 7 | using namespace anim; 8 | using namespace models; 9 | using namespace utils; 10 | 11 | int main() 12 | { 13 | const auto assets_dir = find_upwards("assets"); 14 | Manifest manifest = check_manifest(assets_dir.parent_path() / "manifest.json"); 15 | 16 | if (std::filesystem::exists(assets_dir) && manifest.game_ready) 17 | { 18 | print_splash_screen(assets_dir); 19 | clear_screen(); 20 | 21 | auto pkmns = load_main_menu(manifest); 22 | auto& [player, ai] = pkmns; 23 | 24 | while (player.hp > 0 && ai.hp > 0) 25 | { 26 | clear_screen(); 27 | player.make_move(ai, print_frame(player, ai)); 28 | 29 | if (ai.hp > 0) 30 | { 31 | sleep(1000ms); 32 | ai.make_move(player, random_range(1, 4)); 33 | } 34 | } 35 | 36 | std::cout << '\n'; 37 | delayed_print((ai.hp == 0) ? "You Won :)" : "You Lost :(", 50ms); 38 | 39 | return EXIT_SUCCESS; 40 | } 41 | else 42 | { 43 | std::cerr << "Error: The assets directory is in an invalid state. Consult the README for further instructions." << '\n'; 44 | return EXIT_FAILURE; 45 | } 46 | } -------------------------------------------------------------------------------- /src/models.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #include "models.hpp" 5 | #include "utils.hpp" 6 | 7 | 8 | namespace models 9 | { 10 | std::vector Pokemon::read_asset(std::string ext) 11 | { 12 | return utils::read_file(assets_dir / ((ext == "txt") ? "textures" : "data") / kt::format_str("{}.{}", std::to_string(this->id), ext)); 13 | } 14 | 15 | void Pokemon::configure_move_set() 16 | { 17 | this->move_set = utils::random_choices(this->all_moves, 3); 18 | // ensure that at least one move within the move set will be able to deal damage 19 | auto iterator = std::find_if(this->all_moves.begin(), this->all_moves.end(), [&](const Move& move) { return move.power > 0; }); 20 | if (iterator != this->all_moves.end()) 21 | { 22 | this->move_set.push_back(*iterator); 23 | } 24 | 25 | 26 | for (Move& move : this->move_set) 27 | { 28 | // NOTE: flavor_text can never be longer than 54 chars, or else it breaks the table formatting in print_move_table @anim.cpp 29 | 30 | if (move.power > 0 && move.accuracy > 0) 31 | { 32 | move.type = MoveType::ATTACK; 33 | move.accuracy = utils::random_range(this->difficulty == Difficulty::EASY ? 5 : (this->difficulty == Difficulty::MODERATE) ? 6 : 7, 10) * 10; 34 | move.power += this->difficulty == Difficulty::EASY ? -20 : (this->difficulty == Difficulty::MODERATE) ? 0 : 20; 35 | move.power = abs(move.power); 36 | move.flavor_text = kt::format_str("{} deals {} points in damage.", move.name, move.power); 37 | } 38 | else if (move.accuracy == 0) 39 | { 40 | move.type = utils::random_choice(std::vector{MoveType::BOOST_ATK, MoveType::BOOST_DEF}); 41 | move.accuracy = 100; 42 | move.power = (this->difficulty <= Difficulty::MODERATE) ? 10 : 20; 43 | move.flavor_text = kt::format_str("Boost your {} by {}%.", move.type == MoveType::BOOST_ATK ? "ATK" : "DEF", move.power); 44 | } 45 | else 46 | { 47 | move.type = MoveType::HEAL; 48 | move.accuracy = 100; 49 | move.power = utils::random_range(2, 5) * 10; 50 | move.flavor_text = kt::format_str("Increase your HP by {} points.", move.power); 51 | } 52 | } 53 | } 54 | 55 | Pokemon::Pokemon(int id, std::filesystem::path assets_dir, Difficulty difficulty) : assets_dir{assets_dir}, id{id}, difficulty{difficulty} 56 | { 57 | // base level ranges 58 | constexpr int min = 15; 59 | constexpr int max = 33; 60 | 61 | this->sprite = read_asset("txt"); 62 | auto lines = read_asset("json"); 63 | this->json_str = std::accumulate(lines.begin(), lines.end(), std::string("")); 64 | dj::json_t json; 65 | if (json.read(this->json_str) && json.is_object()) 66 | { 67 | this->id = id; 68 | this->name = json["name"].as(); 69 | this->level = utils::random_range(max * static_cast(difficulty) - min, max * static_cast(difficulty)); 70 | this->hp = 2 * this->level * utils::random_range(0.8, 1.2); 71 | this->max_hp = this->hp; 72 | this->atk = json["atk"].as(); 73 | this->def = json["def"].as(); 74 | 75 | if (auto moves = json.find("moves")) 76 | { 77 | for (auto const& [num, m] : moves->as()) 78 | { 79 | dj::json_t& move = *m; 80 | 81 | // clang-format off 82 | this->all_moves.push_back( 83 | Move{ 84 | move["name"].as(), 85 | MoveType::NONE, move["accuracy"].as(), 86 | move["effect_chance"].as(), 87 | move["power"].as(), 88 | utils::random_choice(move["flavor_text_entries"].as>()) 89 | } 90 | ); 91 | // clang-format on 92 | } 93 | } 94 | this->configure_move_set(); 95 | } 96 | } 97 | 98 | void Pokemon::make_move(Pokemon& pkmn, std::size_t index) 99 | { 100 | std::string msg{}; 101 | const Move& move = this->move_set[index - 1]; 102 | 103 | switch (move.type) 104 | { 105 | case MoveType::ATTACK: 106 | if (utils::random_range(0, 100) <= move.accuracy) 107 | { 108 | int damage = std::ceil(move.power * (this->atk * 100) / (100 * pkmn.def)); 109 | pkmn.hp -= damage; 110 | pkmn.hp = (pkmn.hp < 0) ? 0 : pkmn.hp; 111 | msg = kt::format_str("{} uses {}! and inflicts {} points in damage!", this->name, move.name, damage); 112 | } 113 | else 114 | { 115 | msg = kt::format_str("{} uses {}! The ATTACK missed its target!", this->name, move.name); 116 | } 117 | break; 118 | case MoveType::HEAL: 119 | this->hp += move.power; 120 | this->hp = (this->hp > this->max_hp) ? this->max_hp : this->hp; 121 | msg = kt::format_str("{} increased its HP by {} points", this->name, move.power); 122 | break; 123 | case MoveType::BOOST_ATK: 124 | this->atk += move.power; 125 | msg = kt::format_str("{} increased its ATTACK by {}%!", this->name, move.power); 126 | break; 127 | case MoveType::BOOST_DEF: 128 | this->def += move.power; 129 | msg = kt::format_str("{} increased its DEFENSE by {}%!", this->name, move.power); 130 | break; 131 | default: 132 | break; 133 | } 134 | 135 | utils::delayed_print(msg, std::chrono::milliseconds{25}); 136 | } 137 | } // namespace models 138 | -------------------------------------------------------------------------------- /src/models.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | 6 | #include "utils.hpp" 7 | 8 | namespace models 9 | { 10 | enum class MoveType 11 | { 12 | NONE, 13 | ATTACK, 14 | HEAL, 15 | BOOST_ATK, 16 | BOOST_DEF 17 | }; 18 | 19 | struct Move 20 | { 21 | std::string name{}; 22 | MoveType type{MoveType::NONE}; 23 | int accuracy{}; 24 | int power{}; 25 | int effect_chance{}; 26 | std::string flavor_text{}; 27 | Move() = default; 28 | }; 29 | 30 | enum class Difficulty 31 | { 32 | NONE, 33 | EASY, 34 | MODERATE, 35 | HARD 36 | }; 37 | 38 | struct Pokemon 39 | { 40 | private: 41 | std::vector read_asset(std::string ext); 42 | void configure_move_set(); 43 | 44 | std::string json_str{}; 45 | std::vector all_moves{}; 46 | 47 | public: 48 | std::filesystem::path assets_dir{}; 49 | std::vector sprite{}; 50 | int id{}; 51 | std::string name{}; 52 | int level{}; 53 | int hp{}; 54 | int max_hp{}; 55 | int atk{}; 56 | int def{}; 57 | std::vector move_set{}; 58 | Difficulty difficulty{}; 59 | 60 | Pokemon(int id, std::filesystem::path assets_dir, Difficulty difficulty = Difficulty::MODERATE); 61 | 62 | void make_move(Pokemon& pkmn, std::size_t index); 63 | }; 64 | } // namespace models 65 | -------------------------------------------------------------------------------- /src/utils.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #include 5 | #include 6 | 7 | #include "utils.hpp" 8 | 9 | namespace utils 10 | { 11 | void clear_screen() 12 | { 13 | std::cout << "\033[2J\033[1;1H"; 14 | } 15 | 16 | void sleep(std::chrono::milliseconds ms) 17 | { 18 | std::this_thread::sleep_for(ms); 19 | } 20 | 21 | void delayed_print(std::string_view msg, std::chrono::milliseconds ms) 22 | { 23 | for (char c : msg) 24 | { 25 | std::cout << c << std::flush; 26 | sleep(ms); 27 | } 28 | 29 | std::cout << '\n'; 30 | } 31 | 32 | std::string style(std::string text, Color fore, Color back) 33 | { 34 | // add fore and background ground color to text 35 | std::string ansi_text = kt::format_str("\x1B[3{}m", static_cast(fore)); 36 | 37 | if (back != Color::BLACK) 38 | { 39 | ansi_text.append(kt::format_str("\x1B[4{}m", static_cast(back))); 40 | } 41 | 42 | return ansi_text.append(kt::format_str("{}\033[0m", text)); 43 | } 44 | 45 | void upper(std::string& str) 46 | { 47 | std::transform(str.begin(), str.end(), str.begin(), [](unsigned char c) { return toupper(c); }); 48 | } 49 | 50 | void lower(std::string& str) 51 | { 52 | std::transform(str.begin(), str.end(), str.begin(), [](unsigned char c) { return tolower(c); }); 53 | } 54 | 55 | std::filesystem::path find_upwards(std::string dir_name, int max_depth) 56 | { 57 | auto path = std::filesystem::current_path() / dir_name; 58 | 59 | while (!std::filesystem::exists(path) && max_depth > 0) 60 | { 61 | max_depth -= 1; 62 | path = path.parent_path().parent_path() / path.stem(); 63 | } 64 | 65 | return (max_depth > 0) ? path : std::filesystem::path(); 66 | } 67 | 68 | std::vector read_file(const std::filesystem::path& path) 69 | { 70 | std::string line{}; 71 | std::vector lines{}; 72 | std::ifstream file{path.string()}; 73 | 74 | if (std::filesystem::exists(path)) 75 | { 76 | while (getline(file, line)) 77 | { 78 | lines.push_back(line + '\n'); 79 | } 80 | } 81 | else 82 | { 83 | std::cerr << "File not found: " << path.string() << '\n'; 84 | } 85 | 86 | return lines; 87 | } 88 | 89 | void print_enum_table(const std::vector& table, const std::string& header) 90 | { 91 | // +----------------------------------------------------------+ 92 | // | HEADER | 93 | // | 1. table[0] | 94 | // | 2. table[1] | 95 | // | 3. table[2] | 96 | // +----------------------------------------------------------+ 97 | 98 | constexpr int width = 60; 99 | utils::Color border_color = Color::YELLOW; 100 | std::string border = utils::style(std::string("|"), border_color); 101 | std::string horizontal_line = utils::style(std::string("+").append(std::string(width - 2, '-')).append("+"), border_color); 102 | 103 | std::cout << horizontal_line << '\n'; 104 | std::cout << border << kt::format_str(" {}{}", header, std::string(width - 3 - header.length(), ' ')) << border << '\n'; 105 | 106 | // clang-format off 107 | auto padded_string = [](int i, std::string str, std::string limits) { 108 | return kt::format_str("{} {}. {}{}{}", limits, i, str, std::string(54 - str.length(), ' '), limits); 109 | }; 110 | // clang-format on 111 | 112 | for (std::size_t i = 0; i < table.size(); ++i) 113 | { 114 | std::cout << padded_string(i + 1, table[i], border) << '\n'; 115 | } 116 | 117 | std::cout << horizontal_line << '\n'; 118 | } 119 | 120 | int validate_user_input(std::vector table, std::string header) 121 | { 122 | int answer{}; 123 | std::vector choices(table.size()); 124 | std::iota(choices.begin(), choices.end(), 1); 125 | 126 | while (std::find(choices.begin(), choices.end(), answer) == choices.end()) 127 | { 128 | clear_screen(); 129 | print_enum_table(table, header); 130 | answer = get_user_input(">>> "); 131 | std::cin.clear(); 132 | std::cin.ignore(str_max, '\n'); 133 | } 134 | 135 | return answer; 136 | } 137 | 138 | Manifest check_manifest(const std::filesystem::path& path) 139 | { 140 | Manifest manifest{}; 141 | 142 | if (std::filesystem::exists(path)) 143 | { 144 | auto const file = read_file(path); 145 | auto const str = std::accumulate(file.begin(), file.end(), std::string("")); 146 | dj::json_t json; 147 | if (json.read(str) && json.is_object()) 148 | { 149 | manifest.game_ready = json["game_ready"].as(); 150 | manifest.duplicates = json["duplicates"].as>(); 151 | manifest.files = json["files"].as>(); 152 | manifest.asset_dir = path.parent_path() / "assets"; 153 | } 154 | } 155 | else 156 | { 157 | std::cerr << "File not found: " << path.string() << '\n'; 158 | } 159 | 160 | return manifest; 161 | } 162 | } // namespace utils 163 | -------------------------------------------------------------------------------- /src/utils.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | namespace utils 13 | { 14 | static constexpr long long str_max{std::numeric_limits::max()}; 15 | /// 16 | /// \brief Return a random value in range of [min, max] 17 | /// 18 | template 19 | T random_range(T min, T max) 20 | { 21 | // in range of [min, max] 22 | static std::default_random_engine eng{std::random_device{}()}; 23 | if constexpr (std::is_integral_v) 24 | { 25 | std::uniform_int_distribution dist(min, max); 26 | return dist(eng); 27 | } 28 | else 29 | { 30 | std::uniform_real_distribution dist(min, max); 31 | return dist(eng); 32 | } 33 | } 34 | 35 | /// 36 | /// \brief Return k random values in range of [min, max] (with repitition) 37 | /// 38 | template 39 | std::vector random_ranges(T min, T max, U k) 40 | { 41 | std::vector vector(k); 42 | std::generate(vector.begin(), vector.end(), [min, max]() { return random_range(min, max); }); 43 | return vector; 44 | } 45 | 46 | /// 47 | /// \brief Return a random element from vector 48 | /// 49 | template 50 | T random_choice(const std::vector& vector) 51 | { 52 | return vector[random_range(0, vector.size() - 1)]; 53 | } 54 | 55 | /// 56 | /// \brief Return k random elements from vector (with repitition) 57 | /// 58 | template 59 | std::vector random_choices(const std::vector& vector, U k) 60 | { 61 | std::vector choices(k); 62 | std::generate(choices.begin(), choices.end(), [&]() { return random_choice(vector); }); 63 | return choices; 64 | } 65 | 66 | template 67 | T get_user_input(std::string prompt) 68 | { 69 | std::cout << prompt; 70 | T input{}; 71 | std::cin >> input; 72 | return input; 73 | } 74 | 75 | void clear_screen(); 76 | 77 | void sleep(std::chrono::milliseconds ms); 78 | 79 | void delayed_print(std::string_view msg, std::chrono::milliseconds ms); 80 | 81 | enum class Color 82 | { 83 | BLACK, 84 | RED, 85 | GREEN, 86 | YELLOW, 87 | BLUE, 88 | MAGENTA, 89 | CYAN, 90 | WHITE 91 | }; 92 | 93 | std::string style(std::string text, Color fore, Color back = Color::BLACK); 94 | 95 | void upper(std::string& str); 96 | 97 | void lower(std::string& str); 98 | 99 | std::filesystem::path find_upwards(std::string dir_name, int max_depth = 10); 100 | 101 | std::vector read_file(const std::filesystem::path& path); 102 | 103 | void print_enum_table(const std::vector& table, const std::string& header); 104 | 105 | int validate_user_input(std::vector table, std::string header); 106 | 107 | struct Manifest 108 | { 109 | Manifest() = default; 110 | std::vector files{}; 111 | std::vector duplicates{}; 112 | bool game_ready{}; 113 | std::filesystem::path asset_dir{}; 114 | }; 115 | 116 | Manifest check_manifest(const std::filesystem::path& path); 117 | } // namespace utils 118 | --------------------------------------------------------------------------------