├── .gitignore ├── LICENSE └── Star array open source contract /.gitignore: -------------------------------------------------------------------------------- 1 | # Byte-compiled / optimized / DLL files 2 | __pycache__/ 3 | *.py[cod] 4 | *$py.class 5 | 6 | # C extensions 7 | *.so 8 | 9 | # Distribution / packaging 10 | .Python 11 | build/ 12 | develop-eggs/ 13 | dist/ 14 | downloads/ 15 | eggs/ 16 | .eggs/ 17 | lib/ 18 | lib64/ 19 | parts/ 20 | sdist/ 21 | var/ 22 | wheels/ 23 | share/python-wheels/ 24 | *.egg-info/ 25 | .installed.cfg 26 | *.egg 27 | MANIFEST 28 | 29 | # PyInstaller 30 | # Usually these files are written by a python script from a template 31 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 32 | *.manifest 33 | *.spec 34 | 35 | # Installer logs 36 | pip-log.txt 37 | pip-delete-this-directory.txt 38 | 39 | # Unit test / coverage reports 40 | htmlcov/ 41 | .tox/ 42 | .nox/ 43 | .coverage 44 | .coverage.* 45 | .cache 46 | nosetests.xml 47 | coverage.xml 48 | *.cover 49 | *.py,cover 50 | .hypothesis/ 51 | .pytest_cache/ 52 | cover/ 53 | 54 | # Translations 55 | *.mo 56 | *.pot 57 | 58 | # Django stuff: 59 | *.log 60 | local_settings.py 61 | db.sqlite3 62 | db.sqlite3-journal 63 | 64 | # Flask stuff: 65 | instance/ 66 | .webassets-cache 67 | 68 | # Scrapy stuff: 69 | .scrapy 70 | 71 | # Sphinx documentation 72 | docs/_build/ 73 | 74 | # PyBuilder 75 | .pybuilder/ 76 | target/ 77 | 78 | # Jupyter Notebook 79 | .ipynb_checkpoints 80 | 81 | # IPython 82 | profile_default/ 83 | ipython_config.py 84 | 85 | # pyenv 86 | # For a library or package, you might want to ignore these files since the code is 87 | # intended to run in multiple environments; otherwise, check them in: 88 | # .python-version 89 | 90 | # pipenv 91 | # According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control. 92 | # However, in case of collaboration, if having platform-specific dependencies or dependencies 93 | # having no cross-platform support, pipenv may install dependencies that don't work, or not 94 | # install all needed dependencies. 95 | #Pipfile.lock 96 | 97 | # poetry 98 | # Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control. 99 | # This is especially recommended for binary packages to ensure reproducibility, and is more 100 | # commonly ignored for libraries. 101 | # https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control 102 | #poetry.lock 103 | 104 | # pdm 105 | # Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control. 106 | #pdm.lock 107 | # pdm stores project-wide configurations in .pdm.toml, but it is recommended to not include it 108 | # in version control. 109 | # https://pdm.fming.dev/latest/usage/project/#working-with-version-control 110 | .pdm.toml 111 | .pdm-python 112 | .pdm-build/ 113 | 114 | # PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm 115 | __pypackages__/ 116 | 117 | # Celery stuff 118 | celerybeat-schedule 119 | celerybeat.pid 120 | 121 | # SageMath parsed files 122 | *.sage.py 123 | 124 | # Environments 125 | .env 126 | .venv 127 | env/ 128 | venv/ 129 | ENV/ 130 | env.bak/ 131 | venv.bak/ 132 | 133 | # Spyder project settings 134 | .spyderproject 135 | .spyproject 136 | 137 | # Rope project settings 138 | .ropeproject 139 | 140 | # mkdocs documentation 141 | /site 142 | 143 | # mypy 144 | .mypy_cache/ 145 | .dmypy.json 146 | dmypy.json 147 | 148 | # Pyre type checker 149 | .pyre/ 150 | 151 | # pytype static type analyzer 152 | .pytype/ 153 | 154 | # Cython debug symbols 155 | cython_debug/ 156 | 157 | # PyCharm 158 | # JetBrains specific template is maintained in a separate JetBrains.gitignore that can 159 | # be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore 160 | # and can be added to the global gitignore or merged into this file. For a more nuclear 161 | # option (not recommended) you can uncomment the following to ignore the entire idea folder. 162 | #.idea/ 163 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /Star array open source contract: -------------------------------------------------------------------------------- 1 | /** StarTower 2 | *Submitted for verification at BscScan.com on 2024-06-12 3 | */ 4 | 5 | //SPDX-License-Identifier: Unlicensed 6 | pragma solidity ^0.8.0; 7 | 8 | /** 9 | * @dev Provides information about the current execution context, including the 10 | * sender of the transaction and its data. While these are generally available 11 | * via msg.sender and msg.data, they should not be accessed in such a direct 12 | * manner, since when dealing with meta-transactions the account sending and 13 | * paying for execution may not be the actual sender (as far as an application 14 | * is concerned). 15 | * 16 | * This contract is only required for intermediate, library-like contracts. 17 | */ 18 | abstract contract Context { 19 | function _msgSender() internal view virtual returns (address) { 20 | return msg.sender; 21 | } 22 | 23 | function _msgData() internal view virtual returns (bytes calldata) { 24 | return msg.data; 25 | } 26 | } 27 | 28 | /** 29 | * @dev Contract module which provides a basic access control mechanism, where 30 | * there is an account (an owner) that can be granted exclusive access to 31 | * specific functions. 32 | * 33 | * By default, the owner account will be the one that deploys the contract. This 34 | * can later be changed with {transferOwnership}. 35 | * 36 | * This module is used through inheritance. It will make available the modifier 37 | * `onlyOwner`, which can be applied to your functions to restrict their use to 38 | * the owner. 39 | */ 40 | abstract contract Ownable is Context { 41 | address private _owner; 42 | 43 | event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); 44 | 45 | /** 46 | * @dev Initializes the contract setting the deployer as the initial owner. 47 | */ 48 | constructor() { 49 | _transferOwnership(_msgSender()); 50 | } 51 | 52 | /** 53 | * @dev Returns the address of the current owner. 54 | */ 55 | function owner() public view virtual returns (address) { 56 | return _owner; 57 | } 58 | 59 | /** 60 | * @dev Throws if called by any account other than the owner. 61 | */ 62 | modifier onlyOwner() { 63 | require(owner() == _msgSender(), "Ownable: caller is not the owner"); 64 | _; 65 | } 66 | 67 | /** 68 | * @dev Leaves the contract without owner. It will not be possible to call 69 | * `onlyOwner` functions anymore. Can only be called by the current owner. 70 | * 71 | * NOTE: Renouncing ownership will leave the contract without an owner, 72 | * thereby removing any functionality that is only available to the owner. 73 | */ 74 | function renounceOwnership() public virtual onlyOwner { 75 | _transferOwnership(address(0)); 76 | } 77 | 78 | /** 79 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 80 | * Can only be called by the current owner. 81 | */ 82 | function transferOwnership(address newOwner) public virtual onlyOwner { 83 | require(newOwner != address(0), "Ownable: new owner is the zero address"); 84 | _transferOwnership(newOwner); 85 | } 86 | 87 | /** 88 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 89 | * Internal function without access restriction. 90 | */ 91 | function _transferOwnership(address newOwner) internal virtual { 92 | address oldOwner = _owner; 93 | _owner = newOwner; 94 | emit OwnershipTransferred(oldOwner, newOwner); 95 | } 96 | } 97 | 98 | /** 99 | * @dev Collection of functions related to the address type 100 | */ 101 | library Address { 102 | /** 103 | * @dev Returns true if `account` is a contract. 104 | * 105 | * [IMPORTANT] 106 | * ==== 107 | * It is unsafe to assume that an address for which this function returns 108 | * false is an externally-owned account (EOA) and not a contract. 109 | * 110 | * Among others, `isContract` will return false for the following 111 | * types of addresses: 112 | * 113 | * - an externally-owned account 114 | * - a contract in construction 115 | * - an address where a contract will be created 116 | * - an address where a contract lived, but was destroyed 117 | * ==== 118 | * 119 | * [IMPORTANT] 120 | * ==== 121 | * You shouldn't rely on `isContract` to protect against flash loan attacks! 122 | * 123 | * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets 124 | * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract 125 | * constructor. 126 | * ==== 127 | */ 128 | function isContract(address account) internal view returns (bool) { 129 | // This method relies on extcodesize/address.code.length, which returns 0 130 | // for contracts in construction, since the code is only stored at the end 131 | // of the constructor execution. 132 | 133 | return account.code.length > 0; 134 | } 135 | 136 | /** 137 | * @dev Replacement for Solidity's `transfer`: sends `amount` wei to 138 | * `recipient`, forwarding all available gas and reverting on errors. 139 | * 140 | * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost 141 | * of certain opcodes, possibly making contracts go over the 2300 gas limit 142 | * imposed by `transfer`, making them unable to receive funds via 143 | * `transfer`. {sendValue} removes this limitation. 144 | * 145 | * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more]. 146 | * 147 | * IMPORTANT: because control is transferred to `recipient`, care must be 148 | * taken to not create reentrancy vulnerabilities. Consider using 149 | * {ReentrancyGuard} or the 150 | * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. 151 | */ 152 | function sendValue(address payable recipient, uint256 amount) internal { 153 | require(address(this).balance >= amount, "Address: insufficient balance"); 154 | 155 | (bool success, ) = recipient.call{value: amount}(""); 156 | require(success, "Address: unable to send value, recipient may have reverted"); 157 | } 158 | 159 | /** 160 | * @dev Performs a Solidity function call using a low level `call`. A 161 | * plain `call` is an unsafe replacement for a function call: use this 162 | * function instead. 163 | * 164 | * If `target` reverts with a revert reason, it is bubbled up by this 165 | * function (like regular Solidity function calls). 166 | * 167 | * Returns the raw returned data. To convert to the expected return value, 168 | * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`]. 169 | * 170 | * Requirements: 171 | * 172 | * - `target` must be a contract. 173 | * - calling `target` with `data` must not revert. 174 | * 175 | * _Available since v3.1._ 176 | */ 177 | function functionCall(address target, bytes memory data) internal returns (bytes memory) { 178 | return functionCall(target, data, "Address: low-level call failed"); 179 | } 180 | 181 | /** 182 | * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with 183 | * `errorMessage` as a fallback revert reason when `target` reverts. 184 | * 185 | * _Available since v3.1._ 186 | */ 187 | function functionCall( 188 | address target, 189 | bytes memory data, 190 | string memory errorMessage 191 | ) internal returns (bytes memory) { 192 | return functionCallWithValue(target, data, 0, errorMessage); 193 | } 194 | 195 | /** 196 | * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], 197 | * but also transferring `value` wei to `target`. 198 | * 199 | * Requirements: 200 | * 201 | * - the calling contract must have an ETH balance of at least `value`. 202 | * - the called Solidity function must be `payable`. 203 | * 204 | * _Available since v3.1._ 205 | */ 206 | function functionCallWithValue( 207 | address target, 208 | bytes memory data, 209 | uint256 value 210 | ) internal returns (bytes memory) { 211 | return functionCallWithValue(target, data, value, "Address: low-level call with value failed"); 212 | } 213 | 214 | /** 215 | * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but 216 | * with `errorMessage` as a fallback revert reason when `target` reverts. 217 | * 218 | * _Available since v3.1._ 219 | */ 220 | function functionCallWithValue( 221 | address target, 222 | bytes memory data, 223 | uint256 value, 224 | string memory errorMessage 225 | ) internal returns (bytes memory) { 226 | require(address(this).balance >= value, "Address: insufficient balance for call"); 227 | require(isContract(target), "Address: call to non-contract"); 228 | 229 | (bool success, bytes memory returndata) = target.call{value: value}(data); 230 | return verifyCallResult(success, returndata, errorMessage); 231 | } 232 | 233 | /** 234 | * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], 235 | * but performing a static call. 236 | * 237 | * _Available since v3.3._ 238 | */ 239 | function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) { 240 | return functionStaticCall(target, data, "Address: low-level static call failed"); 241 | } 242 | 243 | /** 244 | * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`], 245 | * but performing a static call. 246 | * 247 | * _Available since v3.3._ 248 | */ 249 | function functionStaticCall( 250 | address target, 251 | bytes memory data, 252 | string memory errorMessage 253 | ) internal view returns (bytes memory) { 254 | require(isContract(target), "Address: static call to non-contract"); 255 | 256 | (bool success, bytes memory returndata) = target.staticcall(data); 257 | return verifyCallResult(success, returndata, errorMessage); 258 | } 259 | 260 | /** 261 | * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], 262 | * but performing a delegate call. 263 | * 264 | * _Available since v3.4._ 265 | */ 266 | function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) { 267 | return functionDelegateCall(target, data, "Address: low-level delegate call failed"); 268 | } 269 | 270 | /** 271 | * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`], 272 | * but performing a delegate call. 273 | * 274 | * _Available since v3.4._ 275 | */ 276 | function functionDelegateCall( 277 | address target, 278 | bytes memory data, 279 | string memory errorMessage 280 | ) internal returns (bytes memory) { 281 | require(isContract(target), "Address: delegate call to non-contract"); 282 | 283 | (bool success, bytes memory returndata) = target.delegatecall(data); 284 | return verifyCallResult(success, returndata, errorMessage); 285 | } 286 | 287 | /** 288 | * @dev Tool to verifies that a low level call was successful, and revert if it wasn't, either by bubbling the 289 | * revert reason using the provided one. 290 | * 291 | * _Available since v4.3._ 292 | */ 293 | function verifyCallResult( 294 | bool success, 295 | bytes memory returndata, 296 | string memory errorMessage 297 | ) internal pure returns (bytes memory) { 298 | if (success) { 299 | return returndata; 300 | } else { 301 | // Look for revert reason and bubble it up if present 302 | if (returndata.length > 0) { 303 | // The easiest way to bubble the revert reason is using memory via assembly 304 | 305 | assembly { 306 | let returndata_size := mload(returndata) 307 | revert(add(32, returndata), returndata_size) 308 | } 309 | } else { 310 | revert(errorMessage); 311 | } 312 | } 313 | } 314 | } 315 | 316 | /** 317 | * @dev Wrappers over Solidity's arithmetic operations. 318 | * 319 | * NOTE: `SafeMath` is generally not needed starting with Solidity 0.8, since the compiler 320 | * now has built in overflow checking. 321 | */ 322 | library SafeMath { 323 | /** 324 | * @dev Returns the addition of two unsigned integers, with an overflow flag. 325 | * 326 | * _Available since v3.4._ 327 | */ 328 | function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) { 329 | unchecked { 330 | uint256 c = a + b; 331 | if (c < a) return (false, 0); 332 | return (true, c); 333 | } 334 | } 335 | 336 | /** 337 | * @dev Returns the subtraction of two unsigned integers, with an overflow flag. 338 | * 339 | * _Available since v3.4._ 340 | */ 341 | function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) { 342 | unchecked { 343 | if (b > a) return (false, 0); 344 | return (true, a - b); 345 | } 346 | } 347 | 348 | /** 349 | * @dev Returns the multiplication of two unsigned integers, with an overflow flag. 350 | * 351 | * _Available since v3.4._ 352 | */ 353 | function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) { 354 | unchecked { 355 | // Gas optimization: this is cheaper than requiring 'a' not being zero, but the 356 | // benefit is lost if 'b' is also tested. 357 | // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522 358 | if (a == 0) return (true, 0); 359 | uint256 c = a * b; 360 | if (c / a != b) return (false, 0); 361 | return (true, c); 362 | } 363 | } 364 | 365 | /** 366 | * @dev Returns the division of two unsigned integers, with a division by zero flag. 367 | * 368 | * _Available since v3.4._ 369 | */ 370 | function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) { 371 | unchecked { 372 | if (b == 0) return (false, 0); 373 | return (true, a / b); 374 | } 375 | } 376 | 377 | /** 378 | * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag. 379 | * 380 | * _Available since v3.4._ 381 | */ 382 | function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) { 383 | unchecked { 384 | if (b == 0) return (false, 0); 385 | return (true, a % b); 386 | } 387 | } 388 | 389 | /** 390 | * @dev Returns the addition of two unsigned integers, reverting on 391 | * overflow. 392 | * 393 | * Counterpart to Solidity's `+` operator. 394 | * 395 | * Requirements: 396 | * 397 | * - Addition cannot overflow. 398 | */ 399 | function add(uint256 a, uint256 b) internal pure returns (uint256) { 400 | return a + b; 401 | } 402 | 403 | /** 404 | * @dev Returns the subtraction of two unsigned integers, reverting on 405 | * overflow (when the result is negative). 406 | * 407 | * Counterpart to Solidity's `-` operator. 408 | * 409 | * Requirements: 410 | * 411 | * - Subtraction cannot overflow. 412 | */ 413 | function sub(uint256 a, uint256 b) internal pure returns (uint256) { 414 | return a - b; 415 | } 416 | 417 | /** 418 | * @dev Returns the multiplication of two unsigned integers, reverting on 419 | * overflow. 420 | * 421 | * Counterpart to Solidity's `*` operator. 422 | * 423 | * Requirements: 424 | * 425 | * - Multiplication cannot overflow. 426 | */ 427 | function mul(uint256 a, uint256 b) internal pure returns (uint256) { 428 | return a * b; 429 | } 430 | 431 | /** 432 | * @dev Returns the integer division of two unsigned integers, reverting on 433 | * division by zero. The result is rounded towards zero. 434 | * 435 | * Counterpart to Solidity's `/` operator. 436 | * 437 | * Requirements: 438 | * 439 | * - The divisor cannot be zero. 440 | */ 441 | function div(uint256 a, uint256 b) internal pure returns (uint256) { 442 | return a / b; 443 | } 444 | 445 | /** 446 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 447 | * reverting when dividing by zero. 448 | * 449 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 450 | * opcode (which leaves remaining gas untouched) while Solidity uses an 451 | * invalid opcode to revert (consuming all remaining gas). 452 | * 453 | * Requirements: 454 | * 455 | * - The divisor cannot be zero. 456 | */ 457 | function mod(uint256 a, uint256 b) internal pure returns (uint256) { 458 | return a % b; 459 | } 460 | 461 | /** 462 | * @dev Returns the subtraction of two unsigned integers, reverting with custom message on 463 | * overflow (when the result is negative). 464 | * 465 | * CAUTION: This function is deprecated because it requires allocating memory for the error 466 | * message unnecessarily. For custom revert reasons use {trySub}. 467 | * 468 | * Counterpart to Solidity's `-` operator. 469 | * 470 | * Requirements: 471 | * 472 | * - Subtraction cannot overflow. 473 | */ 474 | function sub( 475 | uint256 a, 476 | uint256 b, 477 | string memory errorMessage 478 | ) internal pure returns (uint256) { 479 | unchecked { 480 | require(b <= a, errorMessage); 481 | return a - b; 482 | } 483 | } 484 | 485 | /** 486 | * @dev Returns the integer division of two unsigned integers, reverting with custom message on 487 | * division by zero. The result is rounded towards zero. 488 | * 489 | * Counterpart to Solidity's `/` operator. Note: this function uses a 490 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 491 | * uses an invalid opcode to revert (consuming all remaining gas). 492 | * 493 | * Requirements: 494 | * 495 | * - The divisor cannot be zero. 496 | */ 497 | function div( 498 | uint256 a, 499 | uint256 b, 500 | string memory errorMessage 501 | ) internal pure returns (uint256) { 502 | unchecked { 503 | require(b > 0, errorMessage); 504 | return a / b; 505 | } 506 | } 507 | 508 | /** 509 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 510 | * reverting with custom message when dividing by zero. 511 | * 512 | * CAUTION: This function is deprecated because it requires allocating memory for the error 513 | * message unnecessarily. For custom revert reasons use {tryMod}. 514 | * 515 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 516 | * opcode (which leaves remaining gas untouched) while Solidity uses an 517 | * invalid opcode to revert (consuming all remaining gas). 518 | * 519 | * Requirements: 520 | * 521 | * - The divisor cannot be zero. 522 | */ 523 | function mod( 524 | uint256 a, 525 | uint256 b, 526 | string memory errorMessage 527 | ) internal pure returns (uint256) { 528 | unchecked { 529 | require(b > 0, errorMessage); 530 | return a % b; 531 | } 532 | } 533 | } 534 | 535 | library SafeMathInt { 536 | function mul(int256 a, int256 b) internal pure returns (int256) { 537 | // Prevent overflow when multiplying INT256_MIN with -1 538 | // https://github.com/RequestNetwork/requestNetwork/issues/43 539 | require(!(a == - 2**255 && b == -1) && !(b == - 2**255 && a == -1)); 540 | 541 | int256 c = a * b; 542 | require((b == 0) || (c / b == a)); 543 | return c; 544 | } 545 | 546 | function div(int256 a, int256 b) internal pure returns (int256) { 547 | // Prevent overflow when dividing INT256_MIN by -1 548 | // https://github.com/RequestNetwork/requestNetwork/issues/43 549 | require(!(a == - 2**255 && b == -1) && (b > 0)); 550 | 551 | return a / b; 552 | } 553 | 554 | function sub(int256 a, int256 b) internal pure returns (int256) { 555 | require((b >= 0 && a - b <= a) || (b < 0 && a - b > a)); 556 | 557 | return a - b; 558 | } 559 | 560 | function add(int256 a, int256 b) internal pure returns (int256) { 561 | int256 c = a + b; 562 | require((b >= 0 && c >= a) || (b < 0 && c < a)); 563 | return c; 564 | } 565 | 566 | function toUint256Safe(int256 a) internal pure returns (uint256) { 567 | require(a >= 0); 568 | return uint256(a); 569 | } 570 | } 571 | 572 | /** 573 | * @dev Interface of the ERC20 standard as defined in the EIP. 574 | */ 575 | interface IERC20 { 576 | /** 577 | * @dev Emitted when `value` tokens are moved from one account (`from`) to 578 | * another (`to`). 579 | * 580 | * Note that `value` may be zero. 581 | */ 582 | event Transfer(address indexed from, address indexed to, uint256 value); 583 | 584 | /** 585 | * @dev Emitted when the allowance of a `spender` for an `owner` is set by 586 | * a call to {approve}. `value` is the new allowance. 587 | */ 588 | event Approval(address indexed owner, address indexed spender, uint256 value); 589 | 590 | /** 591 | * @dev Returns the amount of tokens in existence. 592 | */ 593 | function totalSupply() external view returns (uint256); 594 | 595 | /** 596 | * @dev Returns the amount of tokens owned by `account`. 597 | */ 598 | function balanceOf(address account) external view returns (uint256); 599 | 600 | /** 601 | * @dev Moves `amount` tokens from the caller's account to `to`. 602 | * 603 | * Returns a boolean value indicating whether the operation succeeded. 604 | * 605 | * Emits a {Transfer} event. 606 | */ 607 | function transfer(address to, uint256 amount) external returns (bool); 608 | 609 | /** 610 | * @dev Returns the remaining number of tokens that `spender` will be 611 | * allowed to spend on behalf of `owner` through {transferFrom}. This is 612 | * zero by default. 613 | * 614 | * This value changes when {approve} or {transferFrom} are called. 615 | */ 616 | function allowance(address owner, address spender) external view returns (uint256); 617 | 618 | /** 619 | * @dev Sets `amount` as the allowance of `spender` over the caller's tokens. 620 | * 621 | * Returns a boolean value indicating whether the operation succeeded. 622 | * 623 | * IMPORTANT: Beware that changing an allowance with this method brings the risk 624 | * that someone may use both the old and the new allowance by unfortunate 625 | * transaction ordering. One possible solution to mitigate this race 626 | * condition is to first reduce the spender's allowance to 0 and set the 627 | * desired value afterwards: 628 | * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 629 | * 630 | * Emits an {Approval} event. 631 | */ 632 | function approve(address spender, uint256 amount) external returns (bool); 633 | 634 | /** 635 | * @dev Moves `amount` tokens from `from` to `to` using the 636 | * allowance mechanism. `amount` is then deducted from the caller's 637 | * allowance. 638 | * 639 | * Returns a boolean value indicating whether the operation succeeded. 640 | * 641 | * Emits a {Transfer} event. 642 | */ 643 | function transferFrom( 644 | address from, 645 | address to, 646 | uint256 amount 647 | ) external returns (bool); 648 | } 649 | 650 | interface IRelation { 651 | function getInviter(address account) external view returns(address); 652 | function getMyTeam(address account) external view returns(address[] memory); 653 | } 654 | 655 | interface IStakePool { 656 | function sendReward(address account, uint256 amount) external ; 657 | } 658 | 659 | contract Main is Ownable { 660 | using SafeMath for uint256; 661 | using Address for address; 662 | 663 | address public relShipAddress; 664 | address public fundAddress; 665 | 666 | address public topAddress; 667 | 668 | IERC20 public AToken; 669 | IERC20 public USDTToken; 670 | 671 | struct Log { 672 | uint8 types; // 1 recommend 2 team reward 3 extract 673 | uint256 timestamp; 674 | uint256 quantity; 675 | address from; 676 | string desc; 677 | } 678 | mapping(address => Log[]) accountLogs; 679 | 680 | enum TYPES{ 681 | LEVEL_ONE, 682 | LEVEL_TWO, 683 | LEVEL_THREE, 684 | LEVEL_FOUR, 685 | LEVEL_FIVE, 686 | LEVEL_SIX, 687 | LEVEL_SEVEN 688 | } 689 | 690 | mapping (TYPES => uint256) public joinRequiredAmount; 691 | mapping (uint8 => uint256) public distributeRate; 692 | 693 | uint256 public id = 1; 694 | struct USERINFO { 695 | uint256 oId; 696 | address account; 697 | uint256 amount; 698 | address relSuperior; 699 | address superior; 700 | address[] referrals; 701 | uint256 mintAmount; 702 | uint256 mintPaidAmount; 703 | uint256 lastUpdateMintTime; 704 | uint256 startTime; 705 | } 706 | mapping (address => mapping (TYPES => USERINFO[])) accountInfos; 707 | mapping (uint256 => mapping (address => uint256)) public referralsIndex; 708 | 709 | uint256 public mintMultiple = 1; 710 | uint256 public mintPeriod = 150 days; 711 | 712 | uint256 internal withdrawalRate = 10; 713 | uint256 internal sidewaysRate = 25; 714 | uint256 internal layer = 100; 715 | uint256 internal totalLevelRatio = 35; 716 | 717 | uint256 internal level7RequiredAmount = 1000000 * 10 ** 18; 718 | uint256 internal level7Ratio = 35; 719 | uint256 internal level6RequiredAmount = 80000 * 10 ** 18; 720 | uint256 internal level6Ratio = 30; 721 | uint256 internal level5RequiredAmount = 60000 * 10 ** 18; 722 | uint256 internal level5Ratio = 25; 723 | uint256 internal level4RequiredAmount = 40000 * 10 ** 18; 724 | uint256 internal level4Ratio = 20; 725 | uint256 internal level3RequiredAmount = 20000 * 10 ** 18; 726 | uint256 internal level3Ratio = 15; 727 | uint256 internal level2RequiredInviter = 3; 728 | uint256 internal level2Ratio = 10; 729 | 730 | mapping (address => uint256) public accountAchievement; 731 | mapping (address => uint256) public teamAchievement; 732 | 733 | mapping (uint8 => mapping(address => bool)) public levelInit; 734 | 735 | address[] timeAxisAccount; 736 | mapping (address => uint256) public timeAxisIndex; 737 | mapping (address => uint256) public timeAxisReward; 738 | 739 | event Widthdrawal(address indexed account, uint256 amount); 740 | event GetTimeAxisReard(address indexed account, uint256 amount); 741 | event ClaimMintReward(address indexed account, uint256 mintAmount); 742 | event Deposit(address indexed account, uint256 depositeAmount); 743 | 744 | constructor( 745 | address _relShipAddress, 746 | address _AToken, 747 | address _USDTToken 748 | ) { 749 | relShipAddress = _relShipAddress; 750 | AToken = IERC20(_AToken); 751 | USDTToken = IERC20(_USDTToken); 752 | 753 | distributeRate[0] = 200; 754 | distributeRate[1] = 200; 755 | distributeRate[2] = 350; 756 | distributeRate[3] = 50; 757 | distributeRate[4] = 150; 758 | distributeRate[5] = 50; 759 | 760 | joinRequiredAmount[TYPES.LEVEL_ONE] = 15 * 10 ** 18; 761 | joinRequiredAmount[TYPES.LEVEL_TWO] = 30 * 10 ** 18; 762 | joinRequiredAmount[TYPES.LEVEL_THREE] = 45 * 10 ** 18; 763 | joinRequiredAmount[TYPES.LEVEL_FOUR] = 60 * 10 ** 18; 764 | joinRequiredAmount[TYPES.LEVEL_FIVE] = 75 * 10 ** 18; 765 | joinRequiredAmount[TYPES.LEVEL_SIX] = 90 * 10 ** 18; 766 | joinRequiredAmount[TYPES.LEVEL_SEVEN] = 105 * 10 ** 18; 767 | } 768 | 769 | function initLevelData(uint8 level, address[] memory accounts, bool isLevel) external onlyOwner { 770 | uint256 count = accounts.length; 771 | for(uint i = 0; i < count; i++) { 772 | levelInit[level][accounts[i]] = isLevel; 773 | } 774 | } 775 | 776 | function setWithdrawalRate(uint256 _withdrawalRate) external onlyOwner { 777 | withdrawalRate =_withdrawalRate; 778 | } 779 | 780 | function setRelShipAddress(address _relShipAddress) external onlyOwner { 781 | relShipAddress = _relShipAddress; 782 | } 783 | 784 | function setFundAddress(address _fundAddress) external onlyOwner { 785 | fundAddress = _fundAddress; 786 | } 787 | 788 | function setDistributeRate(uint8 _index, uint256 _amount) external onlyOwner { 789 | distributeRate[_index] = _amount; 790 | } 791 | 792 | function setTopAddress(address _top) external onlyOwner { 793 | topAddress = _top; 794 | address[] memory addr; 795 | for(uint256 i = 0; i < 7; i++) { 796 | USERINFO[] storage accInfo = accountInfos[topAddress][TYPES(i)]; 797 | accInfo.push(USERINFO( 798 | id, 799 | _top, 800 | 0, 801 | address(0), 802 | address(0), 803 | addr, 804 | 0, 805 | 0, 806 | block.timestamp, 807 | block.timestamp 808 | )); 809 | id++; 810 | } 811 | } 812 | 813 | function setLevelRatio( 814 | uint256 lv2Ratio, 815 | uint256 lv3Ratio, 816 | uint256 lv4Ratio, 817 | uint256 lv5Ratio, 818 | uint256 lv6Ratio 819 | ) external onlyOwner { 820 | level2Ratio = lv2Ratio; 821 | level3Ratio = lv3Ratio; 822 | level4Ratio = lv4Ratio; 823 | level5Ratio = lv5Ratio; 824 | level6Ratio = lv6Ratio; 825 | } 826 | 827 | function setLevelRequiredAount( 828 | uint256 level2Amount, 829 | uint256 level3Amount, 830 | uint256 level4Amount, 831 | uint256 level5Amount, 832 | uint256 level6Amount, 833 | uint256 level7Amount 834 | ) external onlyOwner { 835 | level2RequiredInviter = level2Amount; 836 | level3RequiredAmount = level3Amount; 837 | level4RequiredAmount = level4Amount; 838 | level5RequiredAmount = level5Amount; 839 | level6RequiredAmount = level6Amount; 840 | level7RequiredAmount = level7Amount; 841 | } 842 | 843 | function invest(address token, address account, uint256 amount) external onlyOwner { 844 | 845 | IERC20(token).transfer(account, amount); 846 | } 847 | 848 | function addAccountLogs(address account, uint8 types, uint256 quantity, string memory desc) private { 849 | Log memory log = Log(types, block.timestamp, quantity, msg.sender, desc); 850 | accountLogs[account].push(log); 851 | } 852 | 853 | function claimTimeAxisReward() public { 854 | require(timeAxisReward[msg.sender] > 0, "No reward claim"); 855 | uint256 reward = timeAxisReward[msg.sender]; 856 | require(USDTToken.balanceOf(address(this)) >= reward, "Insufficient rewards"); 857 | timeAxisReward[msg.sender] = 0; 858 | USDTToken.transfer(msg.sender, reward); 859 | addAccountLogs(msg.sender, 3, reward, "1"); 860 | emit GetTimeAxisReard(msg.sender, reward); 861 | } 862 | 863 | function join(TYPES _typs) public { 864 | require(uint8(_typs) < 7, "Type error"); 865 | address superior = IRelation(relShipAddress).getInviter(msg.sender); 866 | require(superior != address(0), "Please bind to the superior first"); 867 | if(uint8(_typs) > 0) { 868 | uint8 preType = uint8(_typs) - 1; 869 | require(accountInfos[msg.sender][TYPES(preType)].length > 0, "Please participate in the front row first"); 870 | } 871 | address relSuperior = superior; 872 | uint256 joinAmount = joinRequiredAmount[_typs]; 873 | USERINFO[] storage accInfo = accountInfos[msg.sender][_typs]; 874 | uint256 mintAmount; 875 | uint256 realIndex; 876 | if(accInfo.length <= 0) { 877 | mintAmount = joinAmount * mintMultiple; 878 | realIndex = 0; 879 | } else { 880 | require(checkTeam(msg.sender, _typs), "Incomplete"); 881 | realIndex = accInfo.length; 882 | } 883 | 884 | USDTToken.transferFrom(msg.sender, address(this), joinAmount); 885 | USERINFO[] storage superiorInfo = accountInfos[superior][_typs]; 886 | uint256 superLen = superiorInfo.length; 887 | 888 | if (superLen > 0 && superiorInfo[superLen.sub(1)].referrals.length < 2) { 889 | superiorInfo[superLen.sub(1)].referrals.push(msg.sender); 890 | referralsIndex[superiorInfo[superLen.sub(1)].oId][msg.sender] = realIndex; 891 | } else { 892 | address newSponsor = findNextAvailableSuperior(superior, _typs); 893 | USERINFO[] storage newSponsorInfo = accountInfos[newSponsor][_typs]; 894 | superLen = newSponsorInfo.length; 895 | uint256 superIndex = superLen > 0 ? superLen.sub(1) : 0; 896 | newSponsorInfo[superIndex].referrals.push(msg.sender); 897 | referralsIndex[newSponsorInfo[superIndex].oId][msg.sender] = realIndex; 898 | superior = newSponsor; 899 | } 900 | 901 | address[] memory addr; 902 | accInfo.push(USERINFO( 903 | id, 904 | msg.sender, 905 | joinAmount, 906 | relSuperior, 907 | superior, 908 | addr, 909 | mintAmount, 910 | 0, 911 | block.timestamp, 912 | block.timestamp 913 | )); 914 | 915 | id++; 916 | caculateInvest(msg.sender, superior, joinAmount, _typs, superLen); 917 | } 918 | 919 | function caculateInvest(address account, address superior, uint256 joinAmount, TYPES _typs, uint256 superLen) internal { 920 | ( 921 | uint256 level1Amount, 922 | uint256 level2Amount, 923 | uint256 teamReward, 924 | uint256 sidewaysReward, 925 | uint256 fundAmount, 926 | uint256 timeAxisAmount 927 | ) = calculateDistributeAmount(joinAmount); 928 | if(superior != address(0)) { 929 | withdrawal(superior, level1Amount); 930 | addAccountLogs(superior, 1, level1Amount, "1"); 931 | } else { 932 | USDTToken.transfer(fundAddress, level1Amount); 933 | } 934 | if(superLen > 0) { 935 | address level2Superior = accountInfos[superior][_typs][superLen.sub(1)].superior; 936 | if(level2Superior != address(0)) { 937 | withdrawal(level2Superior, level2Amount); 938 | addAccountLogs(level2Superior, 1, level2Amount, "2"); 939 | } else { 940 | USDTToken.transfer(fundAddress, level2Amount); 941 | } 942 | } else { 943 | USDTToken.transfer(fundAddress, level2Amount); 944 | } 945 | 946 | //Achievement 947 | addAccountAchievement(account, joinAmount); 948 | uint256 totalGrantReward = differentialDivedent(account, joinAmount); 949 | if(teamReward > totalGrantReward) { 950 | USDTToken.transfer(fundAddress, teamReward.sub(totalGrantReward)); 951 | } 952 | address ownerAccount = account; 953 | uint256 realSideways = sidewaysDistribute(ownerAccount, joinAmount); 954 | if(sidewaysReward > realSideways) { 955 | USDTToken.transfer(fundAddress, sidewaysReward.sub(realSideways)); 956 | } 957 | 958 | USDTToken.transfer(fundAddress, fundAmount); 959 | //time axis 960 | uint256 totalBalance = timeAxisAmount; 961 | uint256 timeReward; 962 | if(timeAxisIndex[ownerAccount] <= 0) { 963 | uint256 totalSuperiors = timeAxisAccount.length > 100 ? 100 : timeAxisAccount.length; 964 | if(totalSuperiors > 0 && totalBalance > 0) { 965 | timeReward = totalBalance.div(totalSuperiors); 966 | for(uint256 i = timeAxisAccount.length; i > timeAxisAccount.length.sub(totalSuperiors); i--) { 967 | timeAxisReward[timeAxisAccount[i.sub(1)]] = timeAxisReward[timeAxisAccount[i.sub(1)]].add(timeReward); 968 | } 969 | } 970 | timeAxisAccount.push(ownerAccount); 971 | timeAxisIndex[ownerAccount] = timeAxisAccount.length; 972 | } else { 973 | uint256 accountIndex = timeAxisIndex[ownerAccount]; 974 | uint256 beforeAccount = accountIndex > 100 ? 100 : accountIndex.sub(1); 975 | uint256 afterAccount = timeAxisAccount.length >= accountIndex.add(100) ? 100 : timeAxisAccount.length.sub(accountIndex); 976 | if(totalBalance > 0 && beforeAccount.add(afterAccount) > 0) { 977 | timeReward = totalBalance.div(beforeAccount.add(afterAccount)); 978 | if(beforeAccount > 0) { 979 | for(uint256 i = accountIndex.sub(1); i > accountIndex.sub(beforeAccount.add(1)); i--) { 980 | timeAxisReward[timeAxisAccount[i.sub(1)]] = timeAxisReward[timeAxisAccount[i.sub(1)]].add(timeReward); 981 | } 982 | } 983 | if(afterAccount > 0) { 984 | for(uint256 j = accountIndex.sub(1); j < accountIndex.add(afterAccount).sub(1); j++) { 985 | timeAxisReward[timeAxisAccount[j.add(1)]] = timeAxisReward[timeAxisAccount[j.add(1)]].add(timeReward); 986 | } 987 | } 988 | } else { 989 | 990 | } 991 | } 992 | } 993 | 994 | function withdrawal(address account, uint256 amount) internal { 995 | uint256 withdrawFee = amount.mul(withdrawalRate).div(100); 996 | uint256 realWithdrawal = amount.sub(withdrawFee); 997 | USDTToken.transfer(fundAddress,withdrawFee ); 998 | USDTToken.transfer(account, realWithdrawal); 999 | emit Widthdrawal(account, realWithdrawal); 1000 | } 1001 | 1002 | function sidewaysDistribute(address account, uint256 amount) internal returns(uint256) { 1003 | address superior = IRelation(relShipAddress).getInviter(account); 1004 | uint256 accountLevel = getAccountGrade(superior); 1005 | uint256 iniLoop = 0; 1006 | uint256 effectLevel; 1007 | uint256 realReward; 1008 | superior = IRelation(relShipAddress).getInviter(superior); 1009 | while(superior != address(0)) { 1010 | uint256 superiorLevel = getAccountGrade(superior); 1011 | if(superiorLevel == accountLevel) { 1012 | uint256 reward = amount.mul(sidewaysRate).div(1000); 1013 | withdrawal(superior, reward); 1014 | addAccountLogs(superior, 2, reward, "8"); 1015 | realReward = realReward.add(reward); 1016 | effectLevel++; 1017 | } 1018 | if(effectLevel >= 2) { 1019 | break; 1020 | } 1021 | iniLoop++; 1022 | if(iniLoop >= layer) { 1023 | break; 1024 | } 1025 | superior = IRelation(relShipAddress).getInviter(superior); 1026 | } 1027 | return realReward; 1028 | } 1029 | 1030 | function getAccountInfos(address account, TYPES _typs) public view returns(USERINFO[] memory) { 1031 | USERINFO[] memory accountInfo = accountInfos[account][_typs]; 1032 | return accountInfo; 1033 | } 1034 | 1035 | function checkTeam(address account, TYPES _typs) public view returns(bool) { 1036 | USERINFO[] memory accountInfo = accountInfos[account][_typs]; 1037 | uint256 accountLen = accountInfo.length; 1038 | if(accountLen <= 0) { 1039 | return false; 1040 | } 1041 | uint256 times = accountInfo[accountLen.sub(1)].referrals.length; 1042 | for (uint i = 0; i < accountInfo[accountLen.sub(1)].referrals.length; i++) { 1043 | address refers = accountInfo[accountLen.sub(1)].referrals[i]; 1044 | uint256 index = referralsIndex[accountInfo[accountLen.sub(1)].oId][refers]; 1045 | times = times.add(accountInfos[refers][_typs][index].referrals.length); 1046 | } 1047 | if(times == 6) { 1048 | return true; 1049 | } 1050 | return false; 1051 | } 1052 | 1053 | function findNextAvailableSuperior(address parent, TYPES _types) internal view returns (address) { 1054 | if(parent == topAddress) { 1055 | return topAddress; 1056 | } 1057 | // (,uint256 index) = getAccountLenAndIndex(parent, _types); 1058 | USERINFO[] memory accountInfo = accountInfos[parent][_types]; 1059 | uint256 accountLen = accountInfo.length; 1060 | if(accountLen <= 0) { 1061 | // 1062 | address relSuperior = IRelation(relShipAddress).getInviter(parent); 1063 | if(relSuperior == topAddress) { 1064 | return topAddress; 1065 | } 1066 | return findNextAvailableSuperior(relSuperior, _types); 1067 | } 1068 | if (accountInfo[accountLen.sub(1)].referrals.length > 0) { 1069 | for (uint i = 0; i < accountInfo[accountLen.sub(1)].referrals.length; i++) { 1070 | address referral = accountInfo[accountLen.sub(1)].referrals[i]; 1071 | uint256 rIndex = referralsIndex[accountInfo[accountLen.sub(1)].oId][referral]; 1072 | if (accountInfos[referral][_types][rIndex].referrals.length < 2) { 1073 | return referral; 1074 | } 1075 | } 1076 | } 1077 | return findNextAvailableSuperior(accountInfo[accountLen.sub(1)].superior, _types); 1078 | } 1079 | 1080 | 1081 | function calculateDistributeAmount(uint256 amount) 1082 | internal 1083 | view 1084 | returns( 1085 | uint256 level1Amount, 1086 | uint256 level2Amount, 1087 | uint256 teamReward, 1088 | uint256 sidewaysReward, 1089 | uint256 fundAmount, 1090 | uint256 timeAxisAmount 1091 | ) { 1092 | level1Amount = amount.mul(distributeRate[0]).div(1000); 1093 | level2Amount = amount.mul(distributeRate[1]).div(1000); 1094 | teamReward = amount.mul(distributeRate[2]).div(1000); 1095 | sidewaysReward = amount.mul(distributeRate[3]).div(1000); 1096 | fundAmount = amount.mul(distributeRate[4]).div(1000); 1097 | timeAxisAmount = amount.mul(distributeRate[5]).div(1000); 1098 | } 1099 | 1100 | function addAccountAchievement(address account, uint256 amount) internal { 1101 | accountAchievement[account] = accountAchievement[account].add(amount); 1102 | achievement(account, amount); 1103 | } 1104 | 1105 | function achievement(address account, uint256 amount) private { 1106 | teamAchievement[account] = teamAchievement[account].add(amount); 1107 | address superior = IRelation(relShipAddress).getInviter(account); 1108 | uint256 curLoop = 0; 1109 | while(superior != address(0)) { 1110 | if (accountAchievement[superior] > 0) { 1111 | teamAchievement[superior] = teamAchievement[superior].add(amount); 1112 | } 1113 | superior = IRelation(relShipAddress).getInviter(superior); 1114 | curLoop++; 1115 | if(curLoop >= layer) { 1116 | break; 1117 | } 1118 | } 1119 | } 1120 | 1121 | function differentialDivedent(address account, uint256 amount) private returns(uint256) { 1122 | uint256 totalRatio; 1123 | uint256 totalRewardAmount; 1124 | uint256 dloop = 0; 1125 | address superior = IRelation(relShipAddress).getInviter(account); 1126 | while(superior != address(0)) { 1127 | uint256 rewardMaticAmount = 0; 1128 | uint256 accountLevel = getAccountGrade(superior); 1129 | uint256 currAccountAchievement = accountAchievement[superior]; 1130 | string memory typeLevel; 1131 | if(accountLevel >= 7 && level7Ratio > totalRatio && currAccountAchievement > 0) { 1132 | rewardMaticAmount = amount.mul(level7Ratio.sub(totalRatio)).div(100); 1133 | totalRatio = totalRatio.add(level7Ratio.sub(totalRatio)); 1134 | typeLevel = "7"; 1135 | } else if(accountLevel >= 6 && level6Ratio > totalRatio && currAccountAchievement > 0) { 1136 | rewardMaticAmount = amount.mul(level6Ratio.sub(totalRatio)).div(100); 1137 | totalRatio = totalRatio.add(level6Ratio.sub(totalRatio)); 1138 | typeLevel = "6"; 1139 | } else if(accountLevel >= 5 && level5Ratio > totalRatio && currAccountAchievement > 0) { 1140 | rewardMaticAmount = amount.mul(level5Ratio.sub(totalRatio)).div(100); 1141 | totalRatio = totalRatio.add(level5Ratio.sub(totalRatio)); 1142 | typeLevel = "5"; 1143 | } else if(accountLevel >= 4 && level4Ratio > totalRatio && currAccountAchievement > 0) { 1144 | rewardMaticAmount = amount.mul(level4Ratio.sub(totalRatio)).div(100); 1145 | totalRatio = totalRatio.add(level4Ratio.sub(totalRatio)); 1146 | typeLevel = "4"; 1147 | } else if(accountLevel >= 3 && level3Ratio > totalRatio && currAccountAchievement > 0) { 1148 | rewardMaticAmount = amount.mul(level3Ratio.sub(totalRatio)).div(100); 1149 | totalRatio = totalRatio.add(level3Ratio.sub(totalRatio)); 1150 | typeLevel = "3"; 1151 | } else if(accountLevel >= 2 && level2Ratio > totalRatio && currAccountAchievement > 0) { 1152 | rewardMaticAmount = amount.mul(level2Ratio.sub(totalRatio)).div(100); 1153 | totalRatio = totalRatio.add(level2Ratio.sub(totalRatio)); 1154 | typeLevel = "2"; 1155 | } 1156 | if(rewardMaticAmount > 0) { 1157 | withdrawal(superior, rewardMaticAmount); 1158 | addAccountLogs(superior, 2, rewardMaticAmount, typeLevel); 1159 | totalRewardAmount = totalRewardAmount.add(rewardMaticAmount); 1160 | } 1161 | dloop++; 1162 | if(totalRatio >= totalLevelRatio || dloop >= layer) { 1163 | break; 1164 | } 1165 | superior = IRelation(relShipAddress).getInviter(superior); 1166 | } 1167 | return totalRewardAmount; 1168 | } 1169 | 1170 | function claimMintReward(TYPES _types) public { 1171 | uint256 totalMint; 1172 | USERINFO[] storage accInfo = accountInfos[msg.sender][_types]; 1173 | require(accInfo.length >= 1, "Insufficient conditions"); 1174 | uint256 currentTime; 1175 | if (accInfo.length == 1) { 1176 | currentTime = block.timestamp; 1177 | } else { 1178 | currentTime = accInfo[1].startTime; 1179 | } 1180 | if(accInfo[0].mintAmount > 0 && accInfo[0].mintAmount > accInfo[0].mintPaidAmount) { 1181 | uint256 temEarn = currentTime.sub(accInfo[0].lastUpdateMintTime).mul(accInfo[0].mintAmount.div(mintPeriod)); 1182 | if(accInfo[0].mintPaidAmount.add(temEarn) > accInfo[0].mintAmount) { 1183 | temEarn = accInfo[0].mintAmount.sub(accInfo[0].mintPaidAmount); 1184 | } 1185 | accInfo[0].mintPaidAmount = accInfo[0].mintPaidAmount.add(temEarn); 1186 | totalMint = totalMint.add(temEarn); 1187 | } 1188 | accInfo[0].lastUpdateMintTime = currentTime; 1189 | if(totalMint > 0) { 1190 | AToken.transfer(msg.sender, totalMint); 1191 | addAccountLogs(msg.sender, 3, totalMint, "2"); 1192 | } 1193 | emit ClaimMintReward(msg.sender, totalMint); 1194 | } 1195 | 1196 | //==================== view ================================ 1197 | function getReferrals( 1198 | address sponsor, 1199 | TYPES _types, 1200 | uint256 index 1201 | ) external view returns (USERINFO[] memory) { 1202 | USERINFO[] memory accInfo = accountInfos[sponsor][_types]; 1203 | if(accInfo.length <= 0) return new USERINFO[](0); 1204 | uint count = accInfo[index].referrals.length; 1205 | USERINFO[] memory res = new USERINFO[](count); 1206 | for (uint i = 0; i < count; i++) { 1207 | address referral = accInfo[index].referrals[i]; 1208 | uint256 rIndex = referralsIndex[accInfo[index].oId][referral]; 1209 | res[i] = accountInfos[referral][_types][rIndex]; 1210 | } 1211 | return res; 1212 | } 1213 | 1214 | function getMintByItem(address account, TYPES _types) public view returns(USERINFO memory _accInfo) { 1215 | USERINFO[] memory accInfo = accountInfos[account][_types]; 1216 | if(accInfo.length > 0) { 1217 | _accInfo = accInfo[0]; 1218 | } 1219 | } 1220 | 1221 | function getMintByItemEarn(address account, TYPES _types) public view returns(uint256) { 1222 | USERINFO[] memory accInfo = accountInfos[account][_types]; 1223 | if(accInfo.length <= 0) { 1224 | return 0; 1225 | } 1226 | uint256 currentTime; 1227 | if(accInfo.length == 1) { 1228 | currentTime = block.timestamp; 1229 | } else { 1230 | currentTime = accInfo[1].startTime; 1231 | } 1232 | if(accInfo[0].mintAmount > 0 && accInfo[0].mintAmount > accInfo[0].mintPaidAmount) { 1233 | uint256 temEarn = currentTime.sub(accInfo[0].lastUpdateMintTime).mul(accInfo[0].mintAmount.div(mintPeriod)); 1234 | return temEarn; 1235 | } 1236 | return 0; 1237 | } 1238 | 1239 | function getAchievementInfo(address account) public view returns(uint256 _largeDistrict, uint256 _totalSmallDistrict) { 1240 | address[] memory team = IRelation(relShipAddress).getMyTeam(account); 1241 | uint256[] memory temArr = new uint256[](team.length); 1242 | uint256 _samllDistrict; 1243 | uint256 _totalDistrict; 1244 | for(uint256 i = 0; i < team.length; i++) { 1245 | temArr[i] = teamAchievement[team[i]]; 1246 | _totalDistrict = _totalDistrict.add(temArr[i]); 1247 | if(temArr[i] > _samllDistrict) { 1248 | _samllDistrict = temArr[i]; 1249 | } 1250 | if(temArr[i] > _largeDistrict) { 1251 | _samllDistrict = _largeDistrict; 1252 | _largeDistrict = temArr[i]; 1253 | } 1254 | } 1255 | _totalSmallDistrict = _totalDistrict.sub(_largeDistrict); 1256 | } 1257 | 1258 | function getAccountGrade(address account) public view returns(uint8) { 1259 | (,uint256 _totalSmallDistrict) = getAchievementInfo(account); 1260 | address[] memory team = IRelation(relShipAddress).getMyTeam(account); 1261 | uint256 effective = 0; 1262 | if (team.length > 0) { 1263 | for(uint256 i = 0; i < team.length; i++) { 1264 | address lower = team[i]; 1265 | if(accountAchievement[lower] > 0) { 1266 | effective++; 1267 | } 1268 | } 1269 | } 1270 | if(_totalSmallDistrict >= level7RequiredAmount || levelInit[7][account]) { 1271 | return 7; 1272 | } else if(_totalSmallDistrict >= level6RequiredAmount || levelInit[6][account]) { 1273 | return 6; 1274 | } else if(_totalSmallDistrict >= level5RequiredAmount || levelInit[5][account]) { 1275 | return 5; 1276 | } else if(_totalSmallDistrict >= level4RequiredAmount || levelInit[4][account]) { 1277 | return 4; 1278 | } else if(teamAchievement[account] >= level3RequiredAmount || levelInit[3][account]) { 1279 | return 3; 1280 | } else if(effective >= level2RequiredInviter || levelInit[2][account]) { 1281 | return 2; 1282 | } else { 1283 | return 1; 1284 | } 1285 | } 1286 | 1287 | function getAccountLogs(address account, uint256 quantity) public view returns(Log[] memory logList) { 1288 | uint256 arrItem = accountLogs[account].length > quantity ? quantity : accountLogs[account].length; 1289 | logList = new Log[](arrItem); 1290 | uint256 floor = accountLogs[account].length.sub(arrItem); 1291 | uint256 index = 0; 1292 | for(uint256 i = floor; i < accountLogs[account].length; i++) { 1293 | logList[index] = accountLogs[account][i]; 1294 | index++; 1295 | } 1296 | } 1297 | } 1298 | --------------------------------------------------------------------------------