├── .github └── workflows │ └── release.yml ├── .gitignore ├── .jshintrc ├── .vscode └── settings.json ├── CHANGELOG.md ├── LICENSE ├── README.md ├── RELEASE.md ├── chroma.min.js ├── info.txt ├── main.js └── tsconfig.json /.github/workflows/release.yml: -------------------------------------------------------------------------------- 1 | name: Releases 2 | 3 | on: 4 | push: 5 | tags: 6 | - '*' 7 | 8 | jobs: 9 | build: 10 | runs-on: ubuntu-latest 11 | steps: 12 | - run: echo "🎉 The job was automatically triggered by a ${{ github.event_name }} event." 13 | - run: echo "🐧 This job is now running on a ${{ runner.os }} server hosted by GitHub!" 14 | - run: echo "🔎 The name of your branch is ${{ github.ref }} and your repository is ${{ github.repository }}." 15 | - name: Check out repository code 16 | uses: actions/checkout@v2 17 | - name: Set env 18 | run: echo "RELEASE_VERSION=${GITHUB_REF#refs/*/}" >> $GITHUB_ENV 19 | - run: mkdir BestDealHelper 20 | - run: cp -v CHANGELOG.md info.txt main.js chroma.min.js BestDealHelper/ 21 | - run: touch BestDealHelper/Ver_${RELEASE_VERSION} 22 | - run: zip -r BestDealHelper-${RELEASE_VERSION}.zip BestDealHelper 23 | - uses: ncipollo/release-action@v1 24 | with: 25 | name: Release ${{ env.RELEASE_VERSION }} 26 | bodyFile: "RELEASE.md" 27 | artifacts: BestDealHelper-${{ env.RELEASE_VERSION }}.zip 28 | token: ${{ secrets.GITHUB_TOKEN }} -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | /.idea -------------------------------------------------------------------------------- /.jshintrc: -------------------------------------------------------------------------------- 1 | { 2 | "esversion": 9 3 | } -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "cSpell.words": [ 3 | "Achievs", 4 | "brainsweep", 5 | "CCSE", 6 | "dname", 7 | "esversion", 8 | "Grandmapocalypse", 9 | "Idleverse", 10 | "Idleverses", 11 | "Mult", 12 | "Precup", 13 | "unbuffed" 14 | ], 15 | "files.exclude": { 16 | "chroma.min.js": true, 17 | } 18 | } -------------------------------------------------------------------------------- /CHANGELOG.md: -------------------------------------------------------------------------------- 1 | # Changelog 2 | All notable changes to this project will be documented in this file. 3 | 4 | The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/). 5 | 6 | ## [2048.13] - 2024.09.30 7 | - Change Mod Display name as "Cookie Profit Predictor" 8 | 9 | ## [2048.12] - 2024.03.22 10 | - Fix auto buy sell out buildings when sell mode is on 11 | 12 | ## [2048.11] - 2024.03.18 13 | ### Feature 14 | - Add auto buy feature to buy the best deal automatically 15 | 16 | ## [2048.10] - 2023.01.18 17 | ### Fix 18 | - Fix broken Sort Grandmapocalypse switch 19 | 20 | ## [2048.09] - 2023.01.13 21 | ### Improve 22 | - Use cookiesPsRaw when calculating banking cookies, in order to get a stable cookie banking target. 23 | ### Fix 24 | - Correct the banking CpS about `Lucky!`, `Cookie chain` and `Get Lucky upgrade` 25 | 26 | ## [2048.08] - 2022.10.15 27 | ### Improve 28 | - UI improvements 29 | ### Fix 30 | - Remove Idleverse toggle button (not useful in game) 31 | 32 | ## [2048.07] - 2022.09.10 33 | ### Improve 34 | - UI improvements 35 | 36 | ## [2048.06] - 2022.09.03 37 | ### New 38 | - Force lock banking items 39 | ### Fix 40 | - calculate waiting time based on raw CPS rather then buffed CPS 41 | 42 | ## [2048.05] - 2022.09.02 43 | ### Improve 44 | - Classic menu theme 45 | 46 | ## [2048.04] - 2022.08.30 47 | ### Add 48 | - Changeable update interval in milliseconds 49 | 50 | ## [2048.03] - 2022.08.08 51 | ### Add 52 | - New config to set Backing target (cookie in seconds) 53 | - Increase text contrast 54 | 55 | ## [2048.02] - 2022.07.01 56 | ### Fix 57 | - The calculation of rainbow deals does not take into account multiple purchases 58 | 59 | ## [2048.01] - 2022.06.03 60 | ### Fix 61 | - Freeze at Game version 2.048 62 | 63 | ## [2043.10] - 2022.04.24 64 | ### New 65 | - Add month as waiting time unit 66 | - Add switch for Sort/Ignore upgrades that cause Grandmapocalypse 67 | ### Change 68 | - Refactoring code, break down main function 69 | 70 | ## [2043.09] - 2022.04.09 71 | ### Fixed 72 | - Fix bug with tiered upgrades -- thanks Michael Precup 73 | 74 | ## [2043.08] - 2022.03.12 75 | ### Added 76 | - Allow change color in settings page 77 | 78 | ## [2043.07] - 2022.02.13 79 | ### Update 80 | - Improve the calculation of the best deal helper 81 | 82 | ## [2043.06] - 2022.01.31 83 | ### Added 84 | - Excluding Idleverses (togglable) 85 | 86 | ## [2043.05] - 2022.01.09 87 | ### Changed 88 | - Rewrite buying chain calculation based on accumulated waiting time instead of accumulated price 89 | - Use VS code ts-check and fix typing errors 90 | 91 | ## [2043.04] - 2022.01.07 92 | ### Fixed 93 | - game hangs 0.x second after each buying 94 | 95 | ## [2043.03] - 2022.01.03 96 | ### Fixed 97 | - CPS glitch #1 98 | 99 | ## [2043.02] - 2021.12.21 100 | ### Fixed 101 | - Loading error with Steam Workshop version 102 | 103 | ## [2043.01] - 2021.12.21 104 | ### Changed 105 | - Publish to Steam Workshop 106 | 107 | ## [2042.14] - 2021.09.25 108 | ### Changed 109 | - Change: fix overestimated waiting time. the score is weighted too much on avoiding waiting, thus it increases quickly when deals are getting affordable; All good things are worth waiting for and worth fighting for. 110 | 111 | ## [2042.13] - 2021.09.22 112 | ### Added 113 | - Add: `cpsAcceleration` now consider multiple buying until next tier upgrade. 114 | - Add: button to ignore Wizard Tower. 115 | 116 | ## [2042.12] - 2021.09.21 117 | ### Added 118 | - Auto increase decimalPlaces for small number. 119 | 120 | ### Changed 121 | - Change: rollback the algorithm about deltaTime. 122 | - Improve: tweak layout of buildings. 123 | 124 | ### Fixed 125 | - Fix: sort tech upgrades in their own list. 126 | - Fix: skip sorting vaulted upgrades. 127 | 128 | ## [2042.11] - 2021.09.19 129 | ### Added 130 | - Add: Highlight pre-deal that can advance best-deal waiting time. 131 | - Add: Waiting time for deals. 132 | 133 | ### Changed 134 | - Change: calc deltaTime from price / deltaCps 135 | 136 | ## [2042.10] - 2021.09.19 137 | ### Fixed 138 | - Ignore toggle type upgrades 139 | 140 | ## [2042.9] - 2021.09.18 141 | ### Changed 142 | - Suppress notation on 0% upgrades. 143 | - Avoid sorting upgrades in toggle pool. 144 | 145 | ### Fixed 146 | - Fix errors afters ascend. 147 | - Fix that best deals do not show in blue if multiple deals have same ratio. 148 | - Fix errors with Mile Selector. 149 | - Fix 0% rate updates are included in normalizing process. 150 | 151 | ## [2042.8] - 2021.09.18 152 | ### Fixed 153 | - Fix "raw cookies per second" get changed incorrect. However, this Mod cannot detect whether your stat is correct or incorrectly; Please export your save, visit https://coderpatsy.bitbucket.io/cookies/editor.html, change `Highest raw CpS` to 0 and import modified save back to fix the value. 154 | 155 | ### Changed 156 | - Grandmapocalypse related upgrades are set to 0%, including "One mind", "Communal brainsweep", "Elder pact". 157 | 158 | 159 | ## [2042.7] - 2021.09.18 160 | ### Added 161 | - Include upgrades now! 162 | 163 | ### Changed 164 | - Improve: change The metric of deal quality from `Price–PerBuildingCPS ratio` to `cpsAcceleration ratio`, in order to gain most cps in the shortest time. 165 | - Improve: hue for notations. 166 | 167 | ## [2042.6] - 2021.09.15 168 | ### Fixed 169 | - Loading error about CCSE init 170 | 171 | ## [2042.5] - 2021.09.15 172 | ### Added 173 | - Colors! 174 | 175 | ### Changed 176 | - Improve efficiency of sorting buildings. Only sort them if the order has changed. 177 | 178 | ## [2042.4] - 2021.09.13 179 | ### Fixed 180 | - Normalized notation cause price flickering 181 | 182 | ## [2042.3] - 2021.09.13 183 | ### Added 184 | - Button to toggle sorting buildings. 185 | 186 | ### Changed 187 | - Require CCSE now. 188 | 189 | ## [2042.2] - 2021.09.12 190 | ### Fixed 191 | - Normalized notation does not show after enter/leave Frenzy. 192 | 193 | ## [2042.1] - 2021.09.11 194 | ### Added 195 | - Sort buildings by gained CPS / price per building. 196 | - Show normalized notation of `gained CPS / price` of buildings for comparing. 197 | -------------------------------------------------------------------------------- /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 | Just like Laplace's demon, but instead of predicting the universe, it’s all about cookies! — The Cookie Profit Predictor mod introduces a suite of strategic tools designed to optimize your resource management and decision-making: 2 | 3 | # Payback Efficiency Indicator 4 | This feature shows how quickly you'll earn back your investment in Cookies Per Second (CPS). It's essential for maximizing your gameplay. 5 | 6 | * **Tier Upgrade Path Planning**: Helps you figure out the benefits of buying multiple buildings to reach the next tier upgrade, improving your payback efficiency. 7 | 8 | * **Rainbow Highlighting for Interim Purchases**: Uses colors to highlight purchases that may not be the best but can speed up your progress toward more valuable long-term investments. 9 | 10 | * **Customizable Color Coding**: Adjust the colors used for efficiency indicators to match your personal style. 11 | 12 | 13 | # Item Timer 14 | Keep track of how long you need to wait before you can afford a new building or upgrade, making it easier to plan your strategy. 15 | 16 | # Banking Strategy Integration 17 | Set a target banking cookies (how many seconds based on CPS) to optimize your savings for big payouts like "Lucky!" bonuses. 18 | 19 | # Auto-Sorting by Payback Efficiency 20 | Automatically organizes buildings and upgrades by their payback efficiency, helping you prioritize the best purchases. 21 | 22 | * **Wizard Tower Exclusion Feature**: Choose not to include Wizard Towers in your efficiency calculations, allowing you to maintain specific spell intervals without disrupting your strategy. 23 | 24 | # Auto-Buy Functionality 25 | Automatically buys the most efficient item based on your current payback efficiency, streamlining your investment process. 26 | 27 | # Resources 28 | 29 | * Check out our [In-Depth Design Presentation for the Payback Efficiency Mod](https://docs.google.com/presentation/d/e/2PACX-1vTzBJulPWJ08URtZp5QLGivJpnkVb3hF7dLUSOcUoWH9Pdtxmj3jmoPwnbL71LTP2moVhr3-GTd0cdA/pub?start=false&loop=false&delayms=60000) for more details. 30 | 31 | * Report any issues [here on GitHub](https://github.com/jcppkkk/BestDealHelper/issues). 32 | 33 | * Join our community on [Discord](https://discord.gg/VxVdXDdTNW). -------------------------------------------------------------------------------- /RELEASE.md: -------------------------------------------------------------------------------- 1 | ## [2048.13] - 2024.09.30 2 | - Change Mod Display name as "Cookie Profit Predictor" -------------------------------------------------------------------------------- /chroma.min.js: -------------------------------------------------------------------------------- 1 | /** 2 | * chroma.js - JavaScript library for color conversions 3 | * 4 | * Copyright (c) 2011-2019, Gregor Aisch 5 | * All rights reserved. 6 | * 7 | * Redistribution and use in source and binary forms, with or without 8 | * modification, are permitted provided that the following conditions are met: 9 | * 10 | * 1. Redistributions of source code must retain the above copyright notice, this 11 | * list of conditions and the following disclaimer. 12 | * 13 | * 2. Redistributions in binary form must reproduce the above copyright notice, 14 | * this list of conditions and the following disclaimer in the documentation 15 | * and/or other materials provided with the distribution. 16 | * 17 | * 3. The name Gregor Aisch may not be used to endorse or promote products 18 | * derived from this software without specific prior written permission. 19 | * 20 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 21 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 23 | * DISCLAIMED. IN NO EVENT SHALL GREGOR AISCH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, 24 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 25 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY 27 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 28 | * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, 29 | * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 30 | * 31 | * ------------------------------------------------------- 32 | * 33 | * chroma.js includes colors from colorbrewer2.org, which are released under 34 | * the following license: 35 | * 36 | * Copyright (c) 2002 Cynthia Brewer, Mark Harrower, 37 | * and The Pennsylvania State University. 38 | * 39 | * Licensed under the Apache License, Version 2.0 (the "License"); 40 | * you may not use this file except in compliance with the License. 41 | * You may obtain a copy of the License at 42 | * http://www.apache.org/licenses/LICENSE-2.0 43 | * 44 | * Unless required by applicable law or agreed to in writing, 45 | * software distributed under the License is distributed on an 46 | * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 47 | * either express or implied. See the License for the specific 48 | * language governing permissions and limitations under the License. 49 | * 50 | * ------------------------------------------------------ 51 | * 52 | * Named colors are taken from X11 Color Names. 53 | * http://www.w3.org/TR/css3-color/#svg-color 54 | * 55 | * @preserve 56 | */ 57 | 58 | !function(r,e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e():"function"==typeof define&&define.amd?define(e):r.chroma=e()}(this,function(){"use strict";for(var n=function(r,e,n){return void 0===e&&(e=0),void 0===n&&(n=1),r>16,e>>8&255,255&e,1]}if(r.match(fr)){5!==r.length&&9!==r.length||(r=r.substr(1)),4===r.length&&(r=(r=r.split(""))[0]+r[0]+r[1]+r[1]+r[2]+r[2]+r[3]+r[3]);var n=parseInt(r,16);return[n>>24&255,n>>16&255,n>>8&255,Math.round((255&n)/255*100)/100]}throw new Error("unknown hex color: "+r)},ur=o.type;A.prototype.hex=function(r){return tr(this._rgb,r)},_.hex=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];return new(Function.prototype.bind.apply(A,[null].concat(r,["hex"])))},b.format.hex=or,b.autodetect.push({p:4,test:function(r){for(var e=[],n=arguments.length-1;0>16,r>>8&255,255&r,1];throw new Error("unknown num color: "+r)},xe=o.type;A.prototype.num=function(){return Me(this._rgb)},_.num=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];return new(Function.prototype.bind.apply(A,[null].concat(r,["num"])))},b.format.num=_e,b.autodetect.push({p:5,test:function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];if(1===r.length&&"number"===xe(r[0])&&0<=r[0]&&r[0]<=16777215)return"num"}});var Ae=o.unpack,Ee=o.type,Pe=Math.round;A.prototype.rgb=function(r){return void 0===r&&(r=!0),!1===r?this._rgb.slice(0,3):this._rgb.slice(0,3).map(Pe)},A.prototype.rgba=function(n){return void 0===n&&(n=!0),this._rgb.slice(0,4).map(function(r,e){return e<3?!1===n?r:Pe(r):r})},_.rgb=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];return new(Function.prototype.bind.apply(A,[null].concat(r,["rgb"])))},b.format.rgb=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];var n=Ae(r,"rgba");return void 0===n[3]&&(n[3]=1),n},b.autodetect.push({p:3,test:function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];if(r=Ae(r,"rgba"),"array"===Ee(r)&&(3===r.length||4===r.length&&"number"==Ee(r[3])&&0<=r[3]&&r[3]<=1))return"rgb"}});var Fe=Math.log,Oe=function(r){var e,n,t,a=r/100;return t=a<66?(e=255,n=-155.25485562709179-.44596950469579133*(n=a-2)+104.49216199393888*Fe(n),a<20?0:.8274096064007395*(t=a-10)-254.76935184120902+115.67994401066147*Fe(t)):(e=351.97690566805693+.114206453784165*(e=a-55)-40.25366309332127*Fe(e),n=325.4494125711974+.07943456536662342*(n=a-50)-28.0852963507957*Fe(n),255),[e,n,t,1]},je=o.unpack,Ge=Math.round,qe=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];for(var n,t=je(r,"rgb"),a=t[0],f=t[2],o=1e3,u=4e4;.4=f/a?u=n:o=n}return Ge(n)};A.prototype.temp=A.prototype.kelvin=A.prototype.temperature=function(){return qe(this._rgb)},_.temp=_.kelvin=_.temperature=function(){for(var r=[],e=arguments.length;e--;)r[e]=arguments[e];return new(Function.prototype.bind.apply(A,[null].concat(r,["temp"])))},b.format.temp=b.format.kelvin=b.format.temperature=Oe;var Le=o.type;A.prototype.alpha=function(r,e){return void 0===e&&(e=!1),void 0!==r&&"number"===Le(r)?e?(this._rgb[3]=r,this):new A([this._rgb[0],this._rgb[1],this._rgb[2],r],"rgb"):this._rgb[3]},A.prototype.clipped=function(){return this._rgb._clipped||!1},A.prototype.darken=function(r){void 0===r&&(r=1);var e=this.lab();return e[0]-=qr*r,new A(e,"lab").alpha(this.alpha(),!0)},A.prototype.brighten=function(r){return void 0===r&&(r=1),this.darken(-r)},A.prototype.darker=A.prototype.darken,A.prototype.brighter=A.prototype.brighten,A.prototype.get=function(r){var e=r.split("."),n=e[0],t=e[1],a=this[n]();if(t){var f=n.indexOf(t);if(-1=s[n];)n++;return n-1}(r)/(s.length-2):g!==p?(r-p)/(g-p):1;t=k(t),e||(t=w(t)),1!==y&&(t=nn(t,y)),t=d[0]+t*(1-d[0]-d[1]),t=Math.min(1,Math.max(0,t));var a=Math.floor(1e4*t);if(m&&v[a])n=v[a];else{if("array"===en(b))for(var f=0;f=u[e+1];)e++;var n=(r-u[e])/(u[e+1]-u[e]);return o[e]+n*(o[e+1]-o[e])})}}return l=[p,g],N},N.mode=function(r){return arguments.length?(u=r,f(),N):u},N.range=function(r,e){return a(r),N},N.out=function(r){return n=r,N},N.spread=function(r){return arguments.length?(e=r,N):e},N.correctLightness=function(r){return null==r&&(r=!0),t=r,f(),w=t?function(r){for(var e=M(0,!0).lab()[0],n=M(1,!0).lab()[0],t=nn.max&&(n.max=r),n.count+=1)}),n.domain=[n.min,n.max],n.limits=function(r,e){return Nn(n,r,e)},n},Nn=function(r,e,n){void 0===e&&(e="equal"),void 0===n&&(n=7),"array"==Y(r)&&(r=Mn(r));var t=r.min,a=r.max,f=r.values.sort(function(r,e){return r-e});if(1===n)return[t,a];var o=[];if("c"===e.substr(0,1)&&(o.push(t),o.push(a)),"e"===e.substr(0,1)){o.push(t);for(var u=1;u 0");var c=Math.LOG10E*mn(t),i=Math.LOG10E*mn(a);o.push(t);for(var l=1;l { } : LoadScript; 6 | /** 7 | * @type {function} 8 | * @param {string} id 9 | * @returns {HTMLElement} 10 | */ 11 | var l; 12 | /** 13 | * @type {function} 14 | * @param {number} number 15 | * @param {number} decimalPlaces 16 | * @returns {string} 17 | */ 18 | var Beautify = (Beautify === undefined) ? () => { } : Beautify; 19 | /** 20 | * @type {function} 21 | */ 22 | var PlaySound = (PlaySound === undefined) ? () => { } : PlaySound; 23 | 24 | /** 25 | * @typedef Building 26 | * @type {Object} 27 | * @property {DOMTokenList} classList 28 | * @property {HTMLElement} l 29 | * @property {function} buy 30 | * @property {function} isVaulted 31 | * @property {function} getPrice 32 | * @property {number} amount 33 | * @property {number} BestBuyToAmount 34 | * @property {number} BestCpsAcceleration 35 | * @property {number} BestHelperOrder 36 | * @property {number} BestHelperAmount 37 | * @property {number} BestWaitTime 38 | * @property {number} bought 39 | * @property {number} id 40 | * @property {number} locked 41 | * @property {number} price 42 | * @property {number} SingleCps 43 | * @property {number} timeToTargetCookie 44 | * @property {string} name 45 | * @property {string} dname 46 | * @property {string} type 47 | * @property {string} pool 48 | * @property {string} waitingTime 49 | * @property {Upgrade[]} tieredUpgrades 50 | */ 51 | /** 52 | * @typedef Upgrade 53 | * @type {object} 54 | * @property {HTMLElement} l 55 | * @property {function} buy 56 | * @property {function} isVaulted 57 | * @property {function} getPrice 58 | * @property {number} amount 59 | * @property {number} BestBuyToAmount 60 | * @property {number} BestCpsAcceleration 61 | * @property {number} BestHelperOrder 62 | * @property {number} BestHelperAmount 63 | * @property {number} BestWaitTime 64 | * @property {number} bought 65 | * @property {number} id 66 | * @property {number} SingleCps 67 | * @property {number} tier 68 | * @property {number} timeToTargetCookie 69 | * @property {string} name 70 | * @property {string} dname 71 | * @property {string} type 72 | * @property {string} pool 73 | * @property {string} waitingTime 74 | * @property {Upgrade[]} tieredUpgrades // not actually used 75 | * @property {Building} buildingTie 76 | */ 77 | /** 78 | * @typedef Tier 79 | * @type {Object} 80 | * @property {number} unlock 81 | */ 82 | /** 83 | * @typedef Game 84 | * @type {Object} 85 | * @property {Array} customOptionsMenu 86 | * @property {Array} Upgrades 87 | * @property {Array} customStatsMenu 88 | * @property {Building[]} ObjectsById 89 | * @property {function} CalculateGains 90 | * @property {function} ClickProduct 91 | * @property {function} Has 92 | * @property {function} Logic 93 | * @property {function} RebuildUpgrades 94 | * @property {function} RefreshStore 95 | * @property {function} registerMod 96 | * @property {function} Upgrade 97 | * @property {function} Win 98 | * @property {number} buyMode 99 | * @property {number} cookies 100 | * @property {number} cookiesPs 101 | * @property {number} cookiesPsRaw 102 | * @property {number} cookiesPsRawHighest 103 | * @property {number} globalCpsMult 104 | * @property {number} GrandmaSynergies.buildingTie.storedTotalCps 105 | * @property {number} storedCps 106 | * @property {number} unbuffedCps 107 | * @property {Object.} Objects 108 | * @property {Object.} Tiers 109 | * @property {Object[]} CpsAchievements 110 | * @property {Object} GrandmaSynergies.buildingTie 111 | * @property {String[]} GrandmaSynergies 112 | * @property {string} clickStr 113 | * @property {string} pool 114 | * @property {Upgrade[]} UpgradesById 115 | * @property {Upgrade[]} UpgradesInStore 116 | */ 117 | /** 118 | * @typedef App 119 | * @type {Object} 120 | * @property {object} mods 121 | */ 122 | /** 123 | * @typedef CCSE 124 | * @type {Object} 125 | * @property {function} AppendCollapsibleOptionsMenu 126 | * @property {function} AppendStatsVersionNumber 127 | * @property {boolean} isLoaded 128 | * @property {Object[]} postLoadHooks 129 | */ 130 | /** 131 | * @typedef SandBoxData 132 | * @type {Object} 133 | * @property {Building | Upgrade} item 134 | * @property {number} amount 135 | * @property {number} bought 136 | * @property {function} Logic 137 | * @property {function} Win 138 | * @property {number} cookiesPsRawHighest 139 | * @property {any[]} CpsAchievements 140 | */ 141 | /** 142 | * @typedef SimulateStatus 143 | * @type {Object} 144 | * @property {number} originalCookies 145 | * @property {number} currentCookies 146 | * @property {number} paidCookies 147 | * @property {number} waitTime 148 | */ 149 | 150 | /** @type {any} */ 151 | var CCSE; 152 | /** @type {App} */ 153 | var App; 154 | /** @type {Game} */ 155 | var Game; 156 | 157 | LoadScript(App.mods.BestDealHelper.dir + "/chroma.min.js"); 158 | 159 | class CookieProfitPredictor { 160 | constructor() { 161 | this.displayname = "Cookie Profit Predictor"; 162 | this.name = "Best Deal Helper"; // the original name of the mod, keep for save compatibility 163 | this.version = "2048.07"; 164 | this.isLoaded = false; 165 | this.load_chroma = false; 166 | this.tickCount = 0; 167 | this.last_cps = 0; 168 | this.Upgrades = new Map(); 169 | /** 170 | * @type {Object} 171 | */ 172 | this.default_config = { 173 | /** @type {boolean} */ 174 | enableSort: true, 175 | /** @type {boolean} */ 176 | sortGrandmapocalypse: true, 177 | /** @type {boolean} */ 178 | sortWizardTower: true, 179 | /** @type {boolean} */ 180 | autoBuy: false, 181 | /** @type {string} */ 182 | color0: "#00ffff", 183 | /** @type {string} */ 184 | color1: "#00ff00", 185 | /** @type {string} */ 186 | color7: "#ffd939", 187 | /** @type {string} */ 188 | color15: "#ff4d4d", 189 | /** @type {string} */ 190 | colorLast: "#de4dff", 191 | /** @type {boolean} */ 192 | isBanking: true, 193 | /** @type {boolean} */ 194 | bankingSeconds: true, 195 | /** @type {number} */ 196 | updateMS: 1000, 197 | }; 198 | } 199 | 200 | register() { 201 | Game.registerMod(this.name, this); 202 | } 203 | 204 | init() { 205 | // iterable Updates 206 | const buildMap = (/** @type {Upgrade[]} */ obj) => Object.keys(obj).reduce((map, key) => map.set(key, obj[key]), new Map()); 207 | this.Upgrades = buildMap(Game.UpgradesById); 208 | 209 | // UI: add Version to status page 210 | Game.customStatsMenu.push(() => { 211 | CCSE.AppendStatsVersionNumber(this.displayname, this.version); 212 | }); 213 | 214 | // UI: add menu to config page 215 | Game.customOptionsMenu.push(this.addOptionsMenu.bind(this)); 216 | 217 | // UI: patch building list layout 218 | const styleElement = document.createElement('style'); 219 | styleElement.innerHTML = ` 220 | .product .content { 221 | padding-top: 0px; 222 | } 223 | .price::before { 224 | top: 0px; 225 | } 226 | `; 227 | document.head.appendChild(styleElement); 228 | 229 | // Hook: wrap Game.RebuildUpgrades 230 | const OriginalRebuildUpgrades = Game.RebuildUpgrades; 231 | Game.RebuildUpgrades = () => { 232 | OriginalRebuildUpgrades(); 233 | this.checkUpdateUI(); 234 | }; 235 | 236 | // Hook: wrap Game.RefreshStore 237 | const OriginalRefreshStore = Game.RefreshStore; 238 | Game.RefreshStore = () => { 239 | OriginalRefreshStore(); 240 | this.checkUpdateUI(); 241 | }; 242 | 243 | // Hook: wrap Game.ClickProduct 244 | Game.ClickProduct = (/** @type {Number} */ what) => { 245 | if (!Game.ObjectsById[what].waitingTime || Game.buyMode == -1) 246 | Game.ObjectsById[what].buy(); 247 | }; 248 | 249 | // Hook: wrap Upgrade click 250 | Game.Upgrade.prototype.click2 = Game.Upgrade.prototype.click; 251 | Game.Upgrade.prototype.click = function (/** @type {any}*/e) { 252 | if (this.waitingTime && this.BestCpsAcceleration) 253 | return; 254 | else 255 | return this.click2(e); 256 | }; 257 | 258 | this.config = { ...this.default_config }; 259 | this.last_config = { ...this.default_config }; 260 | this.isLoaded = true; 261 | 262 | // call this.tick after 500ms to avoid Game not fully loaded 263 | this.tick(); 264 | } 265 | 266 | load(/** @type {string} */ str) { 267 | const config = JSON.parse(str); 268 | for (const c in config) { 269 | if (this.config.hasOwnProperty(c)) { 270 | this.config[c] = config[c]; 271 | } 272 | } 273 | this.updateUI(); 274 | } 275 | 276 | save() { 277 | return JSON.stringify(this.config); 278 | } 279 | checkUpdateUI() { 280 | if (this.last_cps !== Game.cookiesPs) { 281 | // console.log("CookieProfitPredictor cookiesPs changed"); 282 | this.last_cps = Game.cookiesPs; 283 | this.updateUI(); 284 | } else if (JSON.stringify(this.config) !== JSON.stringify(this.last_config)) { 285 | // console.log("CookieProfitPredictor config changed"); 286 | this.last_config = { ...this.config }; 287 | this.updateUI(); 288 | } else if (!document.querySelector("#productAcc0") || (l("upgrade0") && !l("upgradeAcc0"))) { 289 | // console.log("CookieProfitPredictor UI init"); 290 | this.updateUI(); 291 | } 292 | } 293 | 294 | tick() { 295 | this.tickCount++; 296 | if (this.tickCount >= 10) { 297 | // console.log("CookieProfitPredictor updateMS triggered"); 298 | this.updateUI(); 299 | } else { 300 | this.checkUpdateUI(); 301 | } 302 | setTimeout(this.tick.bind(this), this.config.updateMS / 10); 303 | } 304 | 305 | insertAfter( 306 | /** @type {any} */ newNode, 307 | /** @type {any} */ referenceNode 308 | ) { 309 | referenceNode.parentNode.insertBefore(newNode, referenceNode.nextSibling); 310 | } 311 | 312 | getBankCookies() { 313 | return this.config.isBanking * this.config.bankingSeconds * Game.cookiesPsRaw; 314 | } 315 | 316 | calcCookieTimesCost( 317 | /** @type {number} */ price, 318 | /** @type {number} */ oldCps, 319 | /** @type {SimulateStatus} */ sim 320 | ) { 321 | const bank = this.getBankCookies(); 322 | if (sim.currentCookies >= (price + bank)) { 323 | sim.paidCookies += price; 324 | sim.currentCookies -= price; 325 | } else if (sim.currentCookies < (price + bank) && sim.currentCookies >= bank) { 326 | sim.waitTime += (price + bank - sim.currentCookies) / oldCps; 327 | sim.paidCookies += sim.currentCookies - bank; 328 | sim.currentCookies = bank; 329 | } else { 330 | sim.waitTime += (price + bank - sim.currentCookies) / oldCps; 331 | sim.currentCookies = bank; 332 | } 333 | } 334 | 335 | isIgnored(/** @type {(Building|Upgrade)} */ me) { 336 | return ( 337 | (!this.config.sortGrandmapocalypse && ["One mind", "Communal brainsweep", "Elder Pact"].includes(me.name)) || 338 | (!this.config.sortWizardTower && me.name == "Wizard tower") || 339 | me.pool === "toggle" || 340 | (me.isVaulted && me.isVaulted()) 341 | ); 342 | } 343 | 344 | enterSandBox(/** @type {(Building|Upgrade)} */me) { 345 | let /** @type {SandBoxData} */ save = { 346 | item: me, 347 | amount: me.amount, 348 | bought: me.bought, 349 | Logic: Game.Logic, 350 | Win: Game.Win, 351 | cookiesPsRawHighest: Game.cookiesPsRawHighest, 352 | CpsAchievements: Game.CpsAchievements 353 | }; 354 | Game.Logic = function () { }; 355 | Game.Win = function () { }; 356 | return save; 357 | } 358 | 359 | leaveSandBox(/** @type {SandBoxData} */ save) { 360 | save.item.amount = save.amount; 361 | save.item.bought = save.bought; 362 | Game.CpsAchievements = save.CpsAchievements; 363 | Game.cookiesPsRawHighest = save.cookiesPsRawHighest; 364 | Game.Win = save.Win; 365 | Game.Logic = save.Logic; 366 | Game.CalculateGains(); 367 | } 368 | 369 | initSimData() { 370 | var /** @type {SimulateStatus} */ sim = { 371 | originalCookies: Game.cookies, 372 | currentCookies: Game.cookies, 373 | paidCookies: 0, 374 | waitTime: 0, 375 | }; 376 | return sim; 377 | } 378 | 379 | updateBestCpsAcceleration(/** @type {(Building|Upgrade)} */ me) { 380 | me.BestCpsAcceleration = 0; 381 | me.BestBuyToAmount = 0; 382 | me.BestWaitTime = Infinity; 383 | 384 | // Treat Grandmapocalypse upgrade as 0% temporary 385 | if (this.isIgnored(me) || Game.cookies === 0) return; 386 | 387 | const oldCps = Game.unbuffedCps; 388 | var /** @type {SimulateStatus} */ sim = this.initSimData(); 389 | 390 | const save = this.enterSandBox(me); 391 | 392 | if (me.type == "upgrade") { 393 | // Simulate upgrade 394 | this.calcCookieTimesCost(me.getPrice(), Game.unbuffedCps, sim); 395 | me.amount++; 396 | me.bought++; 397 | Game.CalculateGains(); 398 | me.BestWaitTime = sim.waitTime + sim.paidCookies / Game.unbuffedCps; 399 | me.BestCpsAcceleration = (Game.unbuffedCps - oldCps) / me.BestWaitTime; 400 | } else { 401 | // for buildings, find amount to unlock next tier 402 | let nextTierUpgrade = null; 403 | let amountToUnlockTier = 0; 404 | const lockedTiers = Object.values(me.tieredUpgrades).filter((e) => Game.Tiers[e.tier].unlock !== -1 && e.buildingTie.bought < Game.Tiers[e.tier].unlock); 405 | if (lockedTiers.length) { 406 | amountToUnlockTier = Game.Tiers[lockedTiers[0].tier].unlock; 407 | if (amountToUnlockTier <= me.bought + 15) { 408 | nextTierUpgrade = lockedTiers[0]; 409 | } 410 | } 411 | 412 | for (var buy = 0; buy < 50; buy++) { 413 | this.calcCookieTimesCost(me.getPrice(), Game.unbuffedCps, sim); 414 | me.amount++; 415 | me.bought++; 416 | Game.CalculateGains(); 417 | if (nextTierUpgrade && me.amount == amountToUnlockTier) { 418 | this.calcCookieTimesCost(nextTierUpgrade.getPrice(), Game.unbuffedCps, sim); 419 | nextTierUpgrade.bought = 1; 420 | Game.CalculateGains(); 421 | } 422 | const waitTime = sim.waitTime + sim.paidCookies / Game.unbuffedCps; 423 | const cpsAcceleration = (Game.unbuffedCps - oldCps) / waitTime; 424 | if (cpsAcceleration > me.BestCpsAcceleration) { 425 | me.BestCpsAcceleration = cpsAcceleration; 426 | me.BestBuyToAmount = me.amount; 427 | me.BestWaitTime = waitTime; 428 | } else if (nextTierUpgrade === null || me.amount > amountToUnlockTier) { 429 | // if get CpsAcceleration worse & no pending tier upgrade, stop trying further 430 | break; 431 | } 432 | } 433 | if (nextTierUpgrade) nextTierUpgrade.bought = 0; 434 | } 435 | this.leaveSandBox(save); 436 | } 437 | 438 | /** 439 | * If the best BestCpsAcceleration is not affordable, search pre-deals to help us get the best deal quicker. 440 | */ 441 | updateHelperOrder(/** @type {(Building | Upgrade)[]} */ all) { 442 | all.forEach(e => e.BestHelperOrder = 0); 443 | all = all.filter(e => !this.isIgnored(e)); 444 | 445 | let helperOrder = 0; 446 | let target = all[0]; 447 | 448 | while (target.getPrice() > Game.cookies) { 449 | target.timeToTargetCookie = (target.getPrice() - Game.cookies) / Game.unbuffedCps; 450 | /** @type {(Building | Upgrade)[]} */ 451 | let helpers = []; 452 | for (let e of all) { 453 | if (e !== target && e.getPrice() < target.getPrice() && e.SingleCps != 0) { 454 | helpers.push(e); 455 | } 456 | } 457 | if (!helpers.length) return; 458 | for (let me of helpers) { 459 | const save = this.enterSandBox(me); 460 | 461 | let /** @type {SimulateStatus} */ sim = this.initSimData(); 462 | 463 | me.timeToTargetCookie = Infinity; 464 | for (var buy = 1; buy < Infinity; buy++) { 465 | this.calcCookieTimesCost(me.getPrice(), Game.unbuffedCps, sim); 466 | me.amount++; 467 | me.bought++; 468 | Game.CalculateGains(); 469 | // Calculate time to target with current deal stack 470 | let simTarget = Object.assign({}, sim); 471 | this.calcCookieTimesCost(target.getPrice(), Game.unbuffedCps, simTarget); 472 | if (simTarget.waitTime >= target.timeToTargetCookie || simTarget.waitTime >= me.timeToTargetCookie) { 473 | break; 474 | } else { 475 | me.timeToTargetCookie = simTarget.waitTime; 476 | me.BestHelperAmount = me.amount; 477 | } 478 | // Skip calculate buying upgrade multiple times 479 | if (me.type == "upgrade") break; 480 | } 481 | 482 | this.leaveSandBox(save); 483 | } 484 | 485 | helpers.sort((a, b) => a.timeToTargetCookie - b.timeToTargetCookie); 486 | if (helpers[0].timeToTargetCookie >= target.timeToTargetCookie) return; 487 | helperOrder++; 488 | helpers[0].BestHelperOrder = helperOrder; 489 | target = helpers[0]; 490 | } 491 | } 492 | 493 | colorSpanInRainbow(/** @type {HTMLSpanElement} */ span) { 494 | let text = span.innerText; 495 | span.innerHTML = ""; 496 | for (let i = 0; i < text.length; i++) { 497 | let charElem = document.createElement("span"); 498 | charElem.style.color = "hsl(" + (360 * i / text.length) + ",90%,80%)"; 499 | charElem.innerHTML = text[i]; 500 | span.appendChild(charElem); 501 | } 502 | } 503 | 504 | colorSpanByValue( 505 | /** @type {HTMLSpanElement} */ span, 506 | /** @type {number} */ value 507 | ) { 508 | try { 509 | span.style.color = this.colorRender(value); 510 | } catch (e) { } 511 | } 512 | 513 | updateColorRender( 514 | /** @type {(Building|Upgrade)[]} */all 515 | ) { 516 | let cpsAccList = [...new Set(all.map(e => e.BestCpsAcceleration))].sort((a, b) => b - a); 517 | const colorGroups = [ 518 | [this.config.colorLast, cpsAccList[cpsAccList.length - 1]], 519 | [this.config.color15, cpsAccList[15]], 520 | [this.config.color7, cpsAccList[7]], 521 | [this.config.color1, cpsAccList[1]], 522 | [this.config.color0, cpsAccList[0]], 523 | ].filter(e => e[1] !== undefined); 524 | // @ts-ignore 525 | this.colorRender = chroma.scale(colorGroups.map(e => e[0])).mode("lab").domain(colorGroups.map(e => e[1])); 526 | } 527 | 528 | 529 | calcWaitingTime( 530 | /** @type {(Building|Upgrade)}*/ me 531 | ) { 532 | const bank = this.getBankCookies(); 533 | let waitCookie = me.getPrice() + bank - Game.cookies; 534 | if (waitCookie < 0) return ""; 535 | 536 | const seconds = waitCookie / Game.cookiesPs; 537 | let a = [ 538 | Math.floor(seconds / 60 / 60 / 24 / 30 / 12) + "y", 539 | Math.floor(seconds / 60 / 60 / 24 / 30 % 12) + "m", 540 | Math.floor(seconds / 60 / 60 / 24 % 30) + "d", 541 | Math.floor(seconds / 60 / 60 % 24) + "H", 542 | Math.floor(seconds / 60 % 60) + "M", 543 | Math.floor(seconds % 60) + "S"]; 544 | while (a.length && ["0y", "0m", "0d", "0H", "0M"].includes(a[0])) a.shift(); 545 | if (Math.floor(seconds / 60 / 60 / 24 / 30 / 12) > 1000) { 546 | return ">1000y"; 547 | } else { 548 | return a.slice(0, 2).join(); 549 | } 550 | } 551 | 552 | updateNotation( 553 | /** @type {(Building | Upgrade)} */ me, 554 | /** @type {number} */ avgAcc 555 | ) { 556 | me.waitingTime = this.calcWaitingTime(me); 557 | if (me.type == "upgrade") { /* Upgrade */ 558 | // @ts-ignore 559 | var inStoreId = Game.UpgradesInStore.indexOf(me); 560 | me.l = l("upgrade" + inStoreId); 561 | // initialize span tag 562 | /** @type {HTMLSpanElement} */ 563 | let span = document.querySelector("#upgradeAcc" + me.id); 564 | if (!span) { 565 | span = document.createElement("span"); 566 | span.id = "upgradeAcc" + me.id; 567 | span.style.fontWeight = "bolder"; 568 | span.style.position = "absolute"; 569 | span.style.bottom = "0px"; 570 | span.style.textShadow = "0px 2px 6px #000, 0px 1px 1px #000"; 571 | span.style.fontSize = "0.7em"; 572 | span.style.transform = "scale(1, 1.4) translate(3%, -13%)"; 573 | span.style.display = "block"; 574 | span.style.zIndex = "20"; 575 | me.l.appendChild(span); 576 | } 577 | 578 | // Text 579 | if (me.BestCpsAcceleration === 0) { 580 | span.textContent = ""; 581 | } else { 582 | span.textContent = Beautify(me.BestCpsAcceleration * 100 / avgAcc, 1) + "%"; 583 | if (me.waitingTime) { 584 | span.innerHTML = me.waitingTime + "
" + span.textContent; 585 | } 586 | if (me.waitingTime && Game.cookies >= me.getPrice()) { 587 | me.l.style.opacity = "0.6"; 588 | } else { 589 | me.l.style.removeProperty("opacity"); 590 | } 591 | if (me.BestHelperOrder) { 592 | this.colorSpanInRainbow(span); 593 | } else { 594 | this.colorSpanByValue(span, me.BestCpsAcceleration); 595 | } 596 | } 597 | 598 | } else { /* Building */ 599 | // initialize span tag 600 | /** @type {HTMLSpanElement} */ 601 | let span = document.querySelector("#productAcc" + me.id); 602 | if (!span) { 603 | span = document.createElement("span"); 604 | span.id = "productAcc" + me.id; 605 | span.style.fontWeight = "bolder"; 606 | span.style.display = "block"; 607 | span.style.filter = "contrast(1.5)"; 608 | this.insertAfter(span, l("productPrice" + me.id)); 609 | } 610 | 611 | // Text 612 | if (me.BestCpsAcceleration === 0) { 613 | span.textContent = ""; 614 | } else { 615 | // Auto increase decimalPlaces for small number 616 | let value; 617 | for (let i = 1; i < 20; i++) { 618 | value = Beautify(me.BestCpsAcceleration * 100 / avgAcc, i); 619 | if (value !== "0") { 620 | break; 621 | } 622 | } 623 | span.textContent = " 💹" + value + "%"; 624 | if (me.BestHelperOrder) { 625 | if (me.BestHelperAmount > me.amount + 1) { 626 | span.textContent += " (to " + me.BestHelperAmount + ")"; 627 | } 628 | } else if (me.BestBuyToAmount > me.amount + 1) { 629 | span.textContent += " (to " + me.BestBuyToAmount + ")"; 630 | } 631 | if (me.waitingTime) { 632 | span.textContent += " ⏳" + me.waitingTime; 633 | } 634 | if (me.waitingTime && Game.cookies >= me.getPrice()) { 635 | me.l.style.opacity = "0.6"; 636 | } else { 637 | me.l.style.removeProperty("opacity"); 638 | } 639 | if (me.BestHelperOrder) { 640 | this.colorSpanInRainbow(span); 641 | } else { 642 | this.colorSpanByValue(span, me.BestCpsAcceleration); 643 | } 644 | } 645 | } 646 | 647 | 648 | } 649 | 650 | arrayCommonInTheSameOrder( 651 | /** @type {*[]}*/ a, 652 | /** @type {*[]}*/ b 653 | ) { 654 | a = a.filter(e => b.includes(e)); 655 | b = b.filter(e => a.includes(e)); 656 | return a.every((value, index) => value === b[index]); 657 | } 658 | 659 | reorderUpgrades(/** @type {(Upgrade)[]} */ upgrades) { 660 | upgrades = upgrades.filter(e => !e.isVaulted() && e.pool !== "toggle"); 661 | let upgrades_order = upgrades.map(e => e.l.id); 662 | let upgrades_order_on_page = [...document.querySelectorAll(".upgrade")].map(e => e.id).filter(e => e !== "storeBuyAll"); 663 | 664 | // Only sort when the order is different 665 | if (this.arrayCommonInTheSameOrder(upgrades_order, upgrades_order_on_page)) 666 | return; 667 | 668 | let divTechUpgrades = document.querySelector("#techUpgrades"); 669 | let divUpgrades = document.querySelector("#upgrades"); 670 | upgrades.reverse().forEach((upgrade) => { 671 | if (upgrade.pool === "tech") 672 | divTechUpgrades.prepend(upgrade.l); 673 | else { // "" | "cookie" | "debug" | "prestige" 674 | divUpgrades.prepend(upgrade.l); 675 | } 676 | }); 677 | var buyAllBar = l("storeBuyAll"); 678 | if (buyAllBar) divUpgrades.prepend(buyAllBar); 679 | } 680 | 681 | reorderBuildings(/** @type {Building[]} */ buildings) { 682 | let buildings_order = buildings.map(e => e.l.id); 683 | let building_order_on_page = [...document.querySelectorAll(".product:not(.toggledOff)")].map(e => e.id).filter(e => e !== "storeBulk"); 684 | 685 | if (this.arrayCommonInTheSameOrder(buildings_order, building_order_on_page)) 686 | return; 687 | 688 | // Only sort when the order is different 689 | var product = document.querySelector("#products"); 690 | buildings.reverse().forEach((building) => { 691 | product.prepend(building.l); 692 | }); 693 | var bulkBar = l("storeBulk"); 694 | if (bulkBar) product.prepend(bulkBar); 695 | } 696 | 697 | updateUI() { 698 | this.tickCount = 0; 699 | // 2 locked buildings will shows on list, so they are included in the sort, too. 700 | let buildings = []; 701 | let upgrades = [...Game.UpgradesInStore]; 702 | for (let building of Game.ObjectsById) { 703 | if (!building.l.classList.contains("toggledOff")) { 704 | buildings.push(building); 705 | } 706 | } 707 | let all = [...buildings, ...upgrades]; 708 | 709 | // Calculate BestCpsAcceleration 710 | all.forEach(me => this.updateBestCpsAcceleration(me)); 711 | 712 | // Sorting by BestCpsAcceleration 713 | all.sort((a, b) => { 714 | if (a.BestCpsAcceleration === b.BestCpsAcceleration) { 715 | return 0; 716 | } 717 | return b.BestCpsAcceleration - a.BestCpsAcceleration; 718 | }); 719 | 720 | this.updateHelperOrder(all); 721 | 722 | // Build chroma color render function 723 | this.updateColorRender(all); 724 | 725 | // Normalized Notation by Mean 726 | let allAcc = all.map(e => e.BestCpsAcceleration).filter(e => e !== 0); 727 | if (allAcc.length === 0) { 728 | return; 729 | } 730 | const avg = allAcc.reduce((a, b) => a + b, 0) / allAcc.length; 731 | 732 | // Notation for upgrades & buildings 733 | all.forEach(me => this.updateNotation(me, avg)); 734 | 735 | // if there is only non-acc upgrade(s), add empty element placeholder to avoid mainLoop trigger 736 | if (!l("upgradeAcc0") && l("upgrade0")) { 737 | const spanElement = document.createElement('span'); 738 | spanElement.id = 'upgradeAcc0'; 739 | l("upgrade0").appendChild(spanElement); 740 | } 741 | 742 | // Sort upgrades & buildings (or leave them as default) 743 | if (this.config.enableSort) { 744 | var sortFunction = (a, b) => { 745 | return ( 746 | Number(!this.isIgnored(b)) - Number(!this.isIgnored(a)) || 747 | b.BestHelperOrder - a.BestHelperOrder || 748 | b.BestCpsAcceleration - a.BestCpsAcceleration 749 | ); 750 | }; 751 | all.sort(sortFunction); 752 | upgrades.sort(sortFunction); 753 | buildings.sort(sortFunction); 754 | } 755 | 756 | this.reorderUpgrades(upgrades); 757 | this.reorderBuildings(buildings); 758 | 759 | if (this.config.autoBuy && all[0].waitingTime === "" && Game.buyMode == 1) { 760 | all[0].buy(); 761 | } 762 | } 763 | 764 | 765 | getButtonID(/** @type {string} */ config) { 766 | return `CookieProfitPredictor_${config}`; 767 | } 768 | /** 769 | * 770 | * @param {string} config 771 | * @param {string} text 772 | * @returns 773 | */ 774 | toggleButton(config, text) { 775 | const name = this.getButtonID(config); 776 | const button = document.createElement("a"); 777 | button.id = name; 778 | button.classList.add("smallFancyButton", "prefButton", "option"); 779 | this.updateButtonState(config, text, button); 780 | button.addEventListener("click", () => { 781 | this.config[config] = !this.config[config]; 782 | PlaySound("snd/tick.mp3"); 783 | this.updateButtonState(config, text, button); 784 | }); 785 | return button; 786 | } 787 | 788 | updateButtonState(config, text, button) { 789 | const value = this.config[config]; 790 | button.classList.toggle("off", !value); 791 | button.textContent = `${text} ${value ? "On" : "Off"}`; 792 | // first button disable rest buttons wit opacity: 0.5 793 | const sort_dependent_configs = ["sortGrandmapocalypse", "sortWizardTower"]; 794 | if (config === "enableSort") { 795 | sort_dependent_configs.forEach((buttonId) => { 796 | const button = l(this.getButtonID(buttonId)); 797 | if (button) { 798 | button.style.opacity = (this.config[buttonId] && this.config.enableSort) ? "1" : "0.5"; 799 | } 800 | }); 801 | } 802 | if (sort_dependent_configs.includes(config)) { 803 | button.style.opacity = (value && this.config.enableSort) ? "1" : "0.5"; 804 | } 805 | } 806 | 807 | sortingDiv() { 808 | /* Sorting */ 809 | const sortingDiv = document.createElement("div"); 810 | 811 | const toggleButtons = [ 812 | { config: "enableSort", text: "Sort by payback rate" }, 813 | { config: "sortGrandmapocalypse", text: "Grandmapocalypse" }, 814 | { config: "sortWizardTower", text: Game.Objects["Wizard tower"].dname }, 815 | ]; 816 | 817 | toggleButtons.forEach((button) => { 818 | sortingDiv.appendChild(this.toggleButton(button.config, button.text)); 819 | }); 820 | 821 | return sortingDiv; 822 | } 823 | 824 | autoBuyDiv() { 825 | /* Auto Buy */ 826 | const autoBuyDiv = document.createElement("div"); 827 | autoBuyDiv.appendChild(this.toggleButton("autoBuy", "Auto buy best deal")); 828 | return autoBuyDiv; 829 | } 830 | 831 | bankingDiv() { 832 | /* Banking */ 833 | const bankingSecondsInput = document.createElement("input"); 834 | bankingSecondsInput.type = "number"; 835 | bankingSecondsInput.min = "0"; 836 | bankingSecondsInput.style.width = "6em"; 837 | bankingSecondsInput.id = "CookieProfitPredictorBankingSecondsInput"; 838 | bankingSecondsInput.value = this.config.bankingSeconds; 839 | bankingSecondsInput.onchange = bankingSecondsInput.onpaste = bankingSecondsInput.oninput = () => { 840 | bankingSecondsInput.value = bankingSecondsInput.value.replace(/[^0-9]/g, ""); 841 | this.config.bankingSeconds = parseInt(bankingSecondsInput.value); 842 | }; 843 | 844 | const bankingLabel = document.createElement("label"); 845 | bankingLabel.innerHTML = "
Items will get locked to keep at least X second of cookies in bank.
Maximum [Lucky!] payout requires 6000 CpS
Maximum [Lucky!] payout with [Get Lucky] upgrade requires 42000 CpS
Maximum [Cookie chain] payout requires 43200 CpS
Maximum [Cookie chain] payout with [Get Lucky] upgrade requires 302400 CpS"; 846 | 847 | const bankingDiv = document.createElement("div"); 848 | bankingDiv.appendChild(this.toggleButton("isBanking", "Banking cookies")); 849 | bankingDiv.appendChild(bankingSecondsInput); 850 | bankingDiv.appendChild(bankingLabel); 851 | return bankingDiv; 852 | } 853 | intervalBoxDiv() { 854 | /* Update Interval */ 855 | const updateTimeLabel = document.createElement("div"); 856 | updateTimeLabel.style.float = "left"; 857 | updateTimeLabel.innerHTML = "UI Update Interval"; 858 | 859 | const updateTimeValue = document.createElement("div"); 860 | updateTimeValue.style.float = "right"; 861 | updateTimeValue.id = "CookieProfitPredictor_UpdateMSValue"; 862 | updateTimeValue.innerHTML = this.config.updateMS + "ms"; 863 | 864 | const updateTimeSlider = document.createElement("input"); 865 | updateTimeSlider.classList.add("slider"); 866 | updateTimeSlider.id = "CookieProfitPredictor_UpdateMSSlider"; 867 | updateTimeSlider.style.clear = "both"; 868 | updateTimeSlider.type = "range"; 869 | updateTimeSlider.min = "500"; 870 | updateTimeSlider.max = "10000"; 871 | updateTimeSlider.step = "100"; 872 | updateTimeSlider.value = this.config.updateMS; 873 | updateTimeSlider.onchange = updateTimeSlider.oninput = () => { 874 | PlaySound('snd/tick.mp3'); 875 | this.config.updateMS = parseInt(updateTimeSlider.value); 876 | l("CookieProfitPredictor_UpdateMSValue").innerHTML = this.config.updateMS + "ms"; 877 | } 878 | 879 | const intervalBoxDiv = document.createElement("div"); 880 | intervalBoxDiv.classList.add("sliderBox"); 881 | intervalBoxDiv.appendChild(updateTimeLabel); 882 | intervalBoxDiv.appendChild(updateTimeValue); 883 | intervalBoxDiv.appendChild(updateTimeSlider); 884 | return intervalBoxDiv; 885 | } 886 | colorPickerDiv() { 887 | /* Color Pickers */ 888 | const colorPickerDiv = document.createElement("div"); 889 | const colorPickers = [ 890 | { config: "color0", label: "(best payback rate color)" }, 891 | { config: "color1", label: "(2nd payback rate color)" }, 892 | { config: "color7", label: "(8th payback rate color)" }, 893 | { config: "color15", label: "(16th payback rate color)" }, 894 | { config: "colorLast", label: "(worst payback rate color)" }, 895 | ]; 896 | 897 | colorPickers.forEach((picker) => { 898 | const colorPicker = document.createElement("input"); 899 | colorPicker.type = "color"; 900 | colorPicker.id = `CookieProfitPredictor${picker.config}Picker`; 901 | colorPicker.value = this.config[picker.config]; 902 | colorPicker.onchange = () => { 903 | this.config[picker.config] = colorPicker.value; 904 | }; 905 | 906 | const colorPickerLabel = document.createElement("label"); 907 | colorPickerLabel.innerHTML = picker.label; 908 | 909 | colorPickerDiv.appendChild(colorPicker); 910 | colorPickerDiv.appendChild(colorPickerLabel); 911 | colorPickerDiv.appendChild(document.createElement("br")); 912 | }); 913 | return colorPickerDiv; 914 | } 915 | 916 | /** 917 | * Adds an options menu to the game interface for the CookieProfitPredictor class. 918 | */ 919 | addOptionsMenu() { 920 | const body = document.createElement("div"); 921 | body.classList.add("listing"); 922 | body.appendChild(this.sortingDiv()); 923 | body.appendChild(document.createElement("br")); 924 | body.appendChild(this.autoBuyDiv()); 925 | body.appendChild(document.createElement("br")); 926 | body.appendChild(this.bankingDiv()); 927 | body.appendChild(document.createElement("br")); 928 | body.appendChild(this.intervalBoxDiv()); 929 | body.appendChild(document.createElement("br")); 930 | body.appendChild(document.createElement("br")); 931 | body.appendChild(this.colorPickerDiv()); 932 | CCSE.AppendCollapsibleOptionsMenu(this.displayname, body); 933 | } 934 | 935 | }; 936 | 937 | // Load mod 938 | const cookie_profit_predictor = new CookieProfitPredictor(); 939 | if (!cookie_profit_predictor.isLoaded) { 940 | if (CCSE && CCSE.isLoaded) { 941 | cookie_profit_predictor.register(); 942 | } else { 943 | if (!CCSE) { 944 | CCSE = {}; 945 | } 946 | if (!CCSE.postLoadHooks) CCSE.postLoadHooks = []; 947 | CCSE.postLoadHooks.push(() => cookie_profit_predictor.register()); 948 | } 949 | } -------------------------------------------------------------------------------- /tsconfig.json: -------------------------------------------------------------------------------- 1 | { 2 | "compilerOptions": { 3 | "target": "es2017", 4 | "outDir": "./dist", 5 | "allowJs": true, 6 | "checkJs": true, 7 | "downlevelIteration": true 8 | }, 9 | "exclude": [ 10 | "node_modules", 11 | "**/node_modules/*", 12 | "dist" 13 | ] 14 | } --------------------------------------------------------------------------------