├── .gitignore ├── COPYING ├── Cargo.lock ├── Cargo.toml ├── README.md ├── src ├── battle.rs ├── dice.rs ├── main.rs └── zalgo.rs └── translate.py /.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | table.txt 3 | markov.txt 4 | nohup.out 5 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /Cargo.lock: -------------------------------------------------------------------------------- 1 | [root] 2 | name = "dice_bot" 3 | version = "0.0.1" 4 | dependencies = [ 5 | "markov 0.0.19 (git+https://github.com/aatxe/markov.git)", 6 | "rstox 0.0.1 (git+https://github.com/suhr/rstox.git?branch=audio)", 7 | "time 0.1.16 (registry+https://github.com/rust-lang/crates.io-index)", 8 | ] 9 | 10 | [[package]] 11 | name = "gcc" 12 | version = "0.1.7" 13 | source = "registry+https://github.com/rust-lang/crates.io-index" 14 | 15 | [[package]] 16 | name = "libc" 17 | version = "0.1.2" 18 | source = "registry+https://github.com/rust-lang/crates.io-index" 19 | 20 | [[package]] 21 | name = "log" 22 | version = "0.2.2" 23 | source = "registry+https://github.com/rust-lang/crates.io-index" 24 | 25 | [[package]] 26 | name = "markov" 27 | version = "0.0.19" 28 | source = "git+https://github.com/aatxe/markov.git#da46abe5297af8cd24be7a51f9d59f4ee144b6ef" 29 | dependencies = [ 30 | "rand 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)", 31 | "rustc-serialize 0.2.12 (registry+https://github.com/rust-lang/crates.io-index)", 32 | ] 33 | 34 | [[package]] 35 | name = "rand" 36 | version = "0.1.2" 37 | source = "registry+https://github.com/rust-lang/crates.io-index" 38 | dependencies = [ 39 | "libc 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)", 40 | "log 0.2.2 (registry+https://github.com/rust-lang/crates.io-index)", 41 | ] 42 | 43 | [[package]] 44 | name = "rstox" 45 | version = "0.0.1" 46 | source = "git+https://github.com/suhr/rstox.git?branch=audio#9e2632b51041e3f1956333323278d8a70bda80e8" 47 | 48 | [[package]] 49 | name = "rustc-serialize" 50 | version = "0.2.12" 51 | source = "registry+https://github.com/rust-lang/crates.io-index" 52 | 53 | [[package]] 54 | name = "time" 55 | version = "0.1.16" 56 | source = "registry+https://github.com/rust-lang/crates.io-index" 57 | dependencies = [ 58 | "gcc 0.1.7 (registry+https://github.com/rust-lang/crates.io-index)", 59 | "libc 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)", 60 | ] 61 | 62 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | 3 | name = "dice_bot" 4 | version = "0.0.1" 5 | authors = ["subliun "] 6 | 7 | [dependencies.rstox] 8 | 9 | git = "https://github.com/suhr/rstox.git" 10 | branch = "audio" 11 | 12 | [dependencies.markov] 13 | 14 | git = "https://github.com/aatxe/markov.git" 15 | 16 | [dependencies] 17 | time = "*" 18 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | This is a bot for tox groupchats. It does very little, and is very bloated. 2 | I'm so sorry for this code. 3 | 4 | # Installation 5 | Installation is fairly simple. This bot will only work on Linux. 6 | 7 | 1. Install rust: 8 | `curl -s https://static.rust-lang.org/rustup.sh | sudo sh` 9 | 2. Make with `cargo build` 10 | 3. Run with `./target/dice_bot` 11 | 4. Re-evaluate your life and question why you downloaded this bot. 12 | -------------------------------------------------------------------------------- /src/battle.rs: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2015 subliun 3 | All Rights Reserved. 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | */ 18 | 19 | use tox::core::*; 20 | use std::rand; 21 | 22 | pub struct Battle { 23 | active: bool, 24 | people: Vec, 25 | pub duration: u32, 26 | } 27 | 28 | impl Battle { 29 | pub fn new() -> Battle { 30 | let mut people: Vec = vec!(); 31 | return Battle { active: false, people: people, duration: 60 } 32 | } 33 | 34 | pub fn start_battle(&mut self, tox: &mut Tox, group_id: i32, people_names: Vec) { 35 | for name in people_names.iter() { 36 | self.people.push(Person::new(name.clone(), 20)); 37 | } 38 | tox.group_message_send(group_id, &format!("A battle has begun! It will go for {} seconds. Fight!", self.duration)); 39 | } 40 | 41 | pub fn get_person_by_name(&mut self, name: String) -> Option<&mut Person> { 42 | for person in self.people.iter_mut() { 43 | if person.name == name { 44 | return Some(person) 45 | } 46 | } 47 | 48 | return None 49 | } 50 | 51 | pub fn get_attack_by_name(name: String) -> Option { 52 | for attack in Battle::get_attacks().into_iter() { 53 | if attack.name == name { 54 | return Some(attack) 55 | } 56 | } 57 | 58 | return None 59 | } 60 | 61 | fn get_attacks() -> Vec { 62 | vec![ 63 | Attack { name: "punch".to_string(), damage_low: 2, damage_high: 5, cooldown: 5 } 64 | ] 65 | } 66 | 67 | pub fn end_battle(&mut self) { 68 | self.active = false; 69 | self.people.clear(); 70 | } 71 | } 72 | 73 | pub struct Person { 74 | name: String, 75 | health: i32, 76 | max_health: i32, 77 | curr_cooldown_time: i32, 78 | } 79 | 80 | impl Person { 81 | fn new(name: String, max_health: i32) -> Person { 82 | Person { name: name, health: max_health, max_health: max_health, curr_cooldown_time: 5 } 83 | } 84 | 85 | fn damage(&mut self, amount: i32) { 86 | self.health -= amount; 87 | if self.health < 0 { 88 | self.health = 0; 89 | } 90 | } 91 | 92 | fn heal(&mut self, amount: i32) { 93 | self.health += amount; 94 | if self.health > self.max_health { 95 | self.health = self.max_health; 96 | } 97 | } 98 | } 99 | 100 | struct Attack { 101 | name: String, 102 | damage_low: i32, 103 | damage_high: i32, 104 | cooldown: i32, 105 | } 106 | 107 | fn random_range(low: u32, high: u32) -> u32 { 108 | (rand::random::() % (high - low)) + low 109 | } 110 | -------------------------------------------------------------------------------- /src/dice.rs: -------------------------------------------------------------------------------- 1 | use std::rand; 2 | 3 | pub fn get_response_flip(user_name: String) -> String { 4 | user_name + "'s coin landed on " + if rand::random::() == true { "heads." } else { "tails." } 5 | } 6 | 7 | pub fn get_response_dice_roll(message: &str, user_name: String) -> String { 8 | let param = if message == "" { "6" } else { message }; 9 | 10 | match param { 11 | "joint" => return "smoke weed everyday".to_string(), 12 | "rick" => return "never gonna give you up".to_string(), 13 | _ => { }, 14 | } 15 | 16 | if param.contains(" 0") || param.contains("d0") { 17 | return "Error Dividing By Cucumber. Reinstall Universe And Try Again.".to_string(); 18 | } 19 | 20 | let mut roll_result = None; 21 | let times; 22 | let roll_range; 23 | if param.contains("d") { 24 | let d_location = param.find('d').unwrap(); 25 | times = param.slice_to(d_location).replace("d", "").parse::().unwrap_or(1); 26 | if times > 500 { 27 | return "Invalid request. You tried to roll too many times. My robot arms can only take so much. ;_;'".to_string() 28 | } 29 | roll_range = param.slice_from(d_location).replace("d", "").parse::(); 30 | } else { 31 | times = 1; 32 | roll_range = param.parse::(); 33 | } 34 | 35 | let mut roll_sum = 0; 36 | let mut result_builder = String::new(); 37 | if roll_range.clone().is_ok() && roll_range.clone().unwrap() > 0 { 38 | for i in range(0, times) { 39 | if i != 0 { result_builder.push_str(", ") }; 40 | if i == times - 1 && times > 1 { result_builder.push_str("and "); } 41 | let roll = roll_dice(roll_range.clone().unwrap()); 42 | roll_sum += roll; 43 | result_builder.push_str(add_formatting(roll).as_slice()); 44 | } 45 | roll_result = Some(result_builder); 46 | } 47 | 48 | if roll_result == None { 49 | on_invalid_input(user_name) 50 | } else { 51 | if times == 1 { 52 | user_name + " rolled " + roll_result.unwrap().as_slice() 53 | } else { 54 | user_name + " rolled a total of " + roll_sum.to_string().as_slice() + " with rolls of " + roll_result.unwrap().as_slice() 55 | } 56 | } 57 | } 58 | 59 | fn on_invalid_input(user_name: String) -> String { 60 | match &*user_name { 61 | "{☯}S☠ǚll{☣}" => "Invalid request MORON. Please use your GAY head to type non-fucking-negative numbers.", 62 | "Candy Gumdrop" => "Invalid request GORGEOUS. Please use your BEAUTIFUL head to type non-fucking-negative numbers.", 63 | _ => "Invalid request. Please use a non-negative number between 2 and 2^64.", 64 | }.to_string() 65 | } 66 | 67 | fn roll_dice(roll_range: u64) -> u64 { 68 | ((rand::random::() % roll_range) + 1) 69 | } 70 | 71 | fn add_formatting(roll: u64) -> String { 72 | let die_face: String = match get_die_face(roll) { 73 | Some(face) => " ".to_string() + face.to_string().as_slice(), 74 | None => "".to_string(), 75 | }; 76 | 77 | roll.to_string() + die_face.as_slice() 78 | } 79 | 80 | fn get_die_face(number: u64) -> Option { 81 | match number { 82 | 1 => Some('⚀'), 83 | 2 => Some('⚁'), 84 | 3 => Some('⚂'), 85 | 4 => Some('⚃'), 86 | 5 => Some('⚄'), 87 | 6 => Some('⚅'), 88 | _ => None 89 | } 90 | } 91 | 92 | 93 | pub fn chance() -> String { 94 | (rand::random::() % (100 + 1)).to_string() + "%" 95 | } 96 | -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2015 subliun 3 | All Rights Reserved. 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | */ 18 | 19 | #![feature(box_syntax)] 20 | 21 | extern crate "rstox" as tox; 22 | extern crate markov; 23 | extern crate time; 24 | 25 | use tox::core::*; 26 | use tox::av::*; 27 | use markov::Chain; 28 | use std::rand; 29 | 30 | use std::slice::SliceExt; 31 | use std::sync::mpsc::{Select}; 32 | use std::old_io::timer::{self, Timer}; 33 | use std::time::Duration; 34 | 35 | mod battle; 36 | mod dice; 37 | mod zalgo; 38 | 39 | static BOOTSTRAP_IP: &'static str = "192.254.75.102"; 40 | static BOOTSTRAP_PORT: u16 = 33445; 41 | static BOOTSTRAP_KEY: &'static str = 42 | "951C88B7E75C867418ACDB5D273821372BB5BD652740BCDF623A4FA293E75D2F"; 43 | static GROUPCHAT_ADDR: &'static str = 44 | "56A1ADE4B65B86BCD51CC73E2CD4E542179F47959FE3E0E21B4B0ACDADE51855D34D34D37CB5"; 45 | static BOT_NAME: &'static str = "DiceBot"; 46 | static MARKOV_NAME: &'static str = "iranjontu"; 47 | static MARKOV_RANDOM_CHAT_TIME: f64 = 1500f64; 48 | 49 | // TODO: ad-hoc. Remove when rstox implements message splitting. 50 | pub fn split_message(mut m: &str) -> Vec<&str> { 51 | let mut ret = vec!(); 52 | let mut last_whitespace = false; 53 | while m.len() > MAX_MESSAGE_LENGTH { 54 | let mut end = 0; 55 | for (i, c) in m.char_indices() { 56 | if c.is_whitespace() { 57 | if !last_whitespace { 58 | last_whitespace = true; 59 | end = i; 60 | } 61 | } else { 62 | last_whitespace = false; 63 | } 64 | if i + c.len_utf8() > MAX_MESSAGE_LENGTH { 65 | if end > 0 { 66 | ret.push(&m[..end]); 67 | m = &m[(end+m.char_at(end).len_utf8())..]; 68 | } else { 69 | ret.push(&m[..i]); 70 | m = &m[i..]; 71 | } 72 | break; 73 | } 74 | } 75 | } 76 | if m.len() > 0 { 77 | ret.push(m); 78 | } 79 | ret 80 | } 81 | 82 | 83 | // consider incapsulating this into a separate entity 84 | fn do_msg(tox: &mut Tox, battle: &mut battle::Battle, chain: &mut Chain, group: i32, peer: i32, msg: String, last_message: String) { 85 | let mut mit = msg.splitn(1, ' '); 86 | match mit.next().unwrap() { 87 | "^diceid" => { 88 | //tox.group_message_send(group, "My Tox ID is: " + tox.get_address().as_slice()); 89 | }, 90 | "^dice" | "^roll" => { 91 | let user_name = tox.group_peername(group, peer).unwrap(); 92 | let roll = dice::get_response_dice_roll(mit.next().unwrap_or(""), user_name); 93 | // TODO: add a `split_send` function 94 | for reply in split_message(roll.as_slice()).iter() { 95 | tox.group_message_send(group, reply); 96 | timer::sleep(Duration::milliseconds(500)); 97 | } 98 | }, 99 | "^flip" => { 100 | let user_name = tox.group_peername(group, peer).unwrap(); 101 | tox.group_message_send(group, &dice::get_response_flip(user_name)); 102 | }, 103 | "^chance" => { 104 | tox.group_message_send(group, ("There is a ".to_string() + dice::chance().as_slice() + " chance.".as_slice()).as_slice()); 105 | }, 106 | "^zalgo" => { 107 | let zalgo = zalgo::make_zalgo(mit.next().unwrap_or("").trim().to_string()); 108 | for reply in split_message(zalgo.as_slice()).iter() { 109 | tox.group_message_send(group, reply); 110 | timer::sleep(Duration::milliseconds(200)); 111 | } 112 | }, 113 | "^question" => { 114 | tox.group_message_send(group, &question::retrieve_answer(mit.next().unwrap_or("").trim().to_string())); 115 | }, 116 | "^fight" => { 117 | tox.group_message_send(group, &fight::get_response_fight(mit.next().unwrap_or("").trim().to_string())); 118 | }, 119 | "^endchat" => { 120 | tox.set_name("DiceBot").unwrap(); 121 | }, 122 | "^chat" => { 123 | tox.set_name(MARKOV_NAME).unwrap(); 124 | tox.group_message_send(group, &chain.generate_str()); 125 | }, 126 | "^translate" | "^tr" => { 127 | let mut new_iter = mit.next().unwrap().splitn(1, ' '); 128 | let lang = new_iter.next().unwrap_or(""); 129 | let mut to_translate = new_iter.next().unwrap_or(""); 130 | if to_translate == "^" { 131 | to_translate = last_message.as_slice(); 132 | } 133 | let result = &translate::get_response_translate(to_translate.to_string(), lang.to_string()); 134 | tox.group_message_send(group, result.trim()); 135 | }, 136 | "^remember" => { 137 | let result = remember::remember_assoc(mit.next().unwrap_or("").to_string()); 138 | if result != "" { 139 | tox.group_message_send(group, &result); 140 | } 141 | }, 142 | _ if msg.starts_with("^") => { 143 | let result = remember::retrieve_assoc(msg.replace("^", "")); 144 | if result != None { 145 | tox.group_message_send(group, &result.unwrap()); 146 | } 147 | }, 148 | _ => {}, 149 | } 150 | } 151 | 152 | fn main() { 153 | let (tox_cell, mut av) = ToxAv::new(Tox::new(ToxOptions::new()), 1); 154 | let gr_audio = av.group_audio(box |_, _| {}); 155 | 156 | let mut tox = tox_cell.borrow_mut(); 157 | tox.set_name(BOT_NAME).unwrap(); 158 | 159 | let bootstrap_key = BOOTSTRAP_KEY.parse().unwrap(); 160 | tox.bootstrap_from_address(BOOTSTRAP_IP.to_string(), BOOTSTRAP_PORT, 161 | bootstrap_key).unwrap(); 162 | 163 | let groupchat_addr = GROUPCHAT_ADDR.parse().unwrap(); 164 | let groupbot_id = tox.add_friend(groupchat_addr, "Down with groupbot! Glory to Ukraine!").ok().unwrap(); 165 | let mut group_num = 0; 166 | let mut last_message: String = String::new(); 167 | let mut time_since_last_markov_message = time::precise_time_s(); 168 | 169 | 170 | println!("My address is: {}", tox.get_address()); 171 | 172 | let mut battle = battle::Battle::new(); 173 | //let mut battle_timer = None; 174 | 175 | let mut chain = Chain::for_strings(); 176 | chain.feed_file(&Path::new("markov.txt")); 177 | 178 | loop { 179 | timer::sleep(std::time::duration::Duration::milliseconds(50)); 180 | 181 | if time::precise_time_s() - time_since_last_markov_message > MARKOV_RANDOM_CHAT_TIME { 182 | if rand::random::() % 2000 == 1 { 183 | tox.set_name(MARKOV_NAME).unwrap(); 184 | tox.group_message_send(group_num, &chain.generate_str()); 185 | time_since_last_markov_message = time::precise_time_s(); 186 | } 187 | } 188 | 189 | for ev in tox.iter() { 190 | match ev { 191 | StatusMessage(id, _) if id == groupbot_id => { 192 | if tox.count_chatlist() < 1 { 193 | tox.send_message(groupbot_id, "invite").unwrap(); 194 | println!("connected to groupbot"); 195 | } 196 | }, 197 | 198 | FriendRequest(friend_id, msg) => { 199 | tox.add_friend_norequest(*friend_id); 200 | }, 201 | 202 | GroupInvite(id, kind, data) => { 203 | println!("GroupInvite(_, {:?}, _) ", kind); 204 | match kind { 205 | GroupchatType::Text => tox.join_groupchat(id, &data).unwrap(), 206 | GroupchatType::Av => gr_audio.join_groupchat(&mut tox, id, &data).unwrap(), 207 | }; 208 | }, 209 | 210 | GroupMessage(group, peer, msg) => { 211 | if tox.group_peername(group, peer).unwrap() == tox.get_self_name().unwrap() { 212 | last_message = msg.clone(); 213 | return 214 | } 215 | 216 | println!("{}: {}", tox.group_peername(group, peer).unwrap(), msg); 217 | group_num = group; 218 | 219 | if msg.starts_with("^") && !msg.starts_with("^chat") { 220 | tox.set_name(BOT_NAME).unwrap(); 221 | } 222 | 223 | if !msg.starts_with("^") && msg.len() < 600 && !msg.trim().is_empty() { 224 | let mut clean_message = msg.clone(); 225 | for name in tox.group_get_names(group).unwrap().into_iter() { 226 | clean_message = clean_message.replace((name.unwrap().trim().to_string() + ":").as_slice(), ""); 227 | } 228 | chain.feed_str(clean_message.trim().as_slice()); 229 | } 230 | 231 | if msg.contains(MARKOV_NAME) { 232 | tox.set_name(MARKOV_NAME).unwrap(); 233 | tox.group_message_send(group, &chain.generate_str()); 234 | } else { 235 | do_msg(&mut tox, &mut battle, &mut chain, group, peer, msg.clone(), last_message); 236 | } 237 | 238 | last_message = msg.clone(); 239 | }, 240 | 241 | _ => { } 242 | } 243 | } 244 | tox.wait(); 245 | } 246 | } 247 | 248 | mod fight { 249 | use std::rand; 250 | use std::rand::{thread_rng, Rng}; 251 | use std::ascii::AsciiExt; 252 | 253 | pub fn get_response_fight(msg: String) -> String { 254 | let message = msg.to_ascii_lowercase().replace(".", "").to_string(); 255 | if message.contains(" me") { return "m8".to_string() } 256 | if !message.contains(" vs ") { return "That's not a fight! This is a fight: ^fight person1 vs person2".to_string() } 257 | 258 | let winner: &str; 259 | let mut extra_message = ""; 260 | if message.contains("qtox") { 261 | winner = "qtox"; 262 | extra_message = "qTox is better."; 263 | } else if message.contains("subliun") { 264 | winner = "subliun"; 265 | extra_message = "(subliun always wins)"; 266 | } else { 267 | let mut fighters: Vec<&str> = vec!(); 268 | for fighter in message.split_str(" vs ") { 269 | fighters.push(fighter); 270 | } 271 | winner = *thread_rng().choose(fighters.as_slice()).unwrap_or(&"A failure (that's you)"); 272 | } 273 | 274 | winner.to_string() + " won the fight! " + extra_message 275 | } 276 | } 277 | 278 | mod question { 279 | use std::rand; 280 | use std::ascii::AsciiExt; 281 | 282 | pub fn retrieve_answer(question: String) -> String { 283 | let question_words = ["do", "did", "does", "am", "is", "are", "has", 284 | "have", "was", "were", "will", "can", 285 | "could", "shall", "should"]; 286 | let mut good_question = false; 287 | for word in question_words.iter() { 288 | if question.as_slice().to_ascii_lowercase().to_string().starts_with(*word) { 289 | good_question = true; 290 | break; 291 | } 292 | } 293 | 294 | if !good_question { return "That's not a good question.".to_string() } 295 | 296 | match rand::random::() % 4 { 297 | 0 => "Yes.", 298 | 1 => "No.", 299 | 2 => "Maybe.", 300 | _ => "I cannot say." 301 | }.to_string() 302 | } 303 | } 304 | 305 | mod remember { 306 | use std::old_io::*; 307 | use std::old_io::fs::PathExtensions; 308 | 309 | static filename: &'static str = "table.txt"; 310 | 311 | pub fn remember_assoc(message: String) -> String { 312 | let processed_message = message.replace("\n", "").replace("^", "").trim().to_string() + "\n"; 313 | let path = Path::new(filename); 314 | 315 | let mut file; 316 | if path.exists() { 317 | file = File::open_mode(&path, Append, Write) 318 | } else { 319 | file = File::open_mode(&path, Truncate, Write) 320 | } 321 | 322 | if !processed_message.contains(":") { 323 | return "Error. Could not find : in remember command.".to_string() 324 | } 325 | 326 | file.write(processed_message.into_bytes().as_slice()); 327 | return String::new() 328 | } 329 | 330 | pub fn retrieve_assoc(message: String) -> Option { 331 | let file; 332 | let path = Path::new(filename); 333 | 334 | if path.exists() { 335 | file = File::open(&path); 336 | } else { 337 | return None 338 | } 339 | 340 | if file.is_err() { return None } 341 | 342 | let mut result = None; 343 | for m_line in BufferedReader::new(file.unwrap()).lines() { 344 | if m_line.is_err() { break; } 345 | let line = m_line.unwrap(); 346 | if line.splitn(1, ':').nth(0).unwrap() == message { 347 | result = Some(line.splitn(1, ':').nth(1).unwrap().replace("\n", "").to_string()); 348 | } 349 | } 350 | 351 | return result 352 | } 353 | } 354 | 355 | mod translate { 356 | use std::old_io::Command; 357 | 358 | pub fn get_response_translate(phrase: String, to_language: String) -> String { 359 | let mut result: String = String::new(); 360 | for sentence in phrase.split('.') { 361 | let mut process = match Command::new("python").arg("translate.py").arg("-t").arg(to_language.clone()).arg(sentence).spawn() { 362 | Ok(p) => p, 363 | Err(e) => return "Error: translation failed. Did you input the right args?".to_string(), 364 | }; 365 | result = result + String::from_utf8(process.stdout.as_mut().unwrap().read_to_end().unwrap()).unwrap().as_slice(); 366 | } 367 | 368 | return result; 369 | } 370 | } 371 | /* vim: set ts=2 sw=2 expandtab ai: */ 372 | -------------------------------------------------------------------------------- /src/zalgo.rs: -------------------------------------------------------------------------------- 1 | use std::rand; 2 | use std::rand::{thread_rng, Rng}; 3 | 4 | static ZALGO_CHARS: [char; 113] = [ 5 | '\u{30d}', /* ̍ */ '\u{30e}', /* ÌŽ */ '\u{304}', /* Ì„ */ '\u{305}', /* Ì… */ 6 | '\u{33f}', /* Ì¿ */ '\u{311}', /* Ì‘ */ '\u{306}', /* ̆ */ '\u{310}', /* ̐ */ 7 | '\u{352}', /* Í’ */ '\u{357}', /* Í— */ '\u{351}', /* Í‘ */ '\u{307}', /* ̇ */ 8 | '\u{308}', /* ̈ */ '\u{30a}', /* ÌŠ */ '\u{342}', /* Í‚ */ '\u{343}', /* Ì“ */ 9 | '\u{344}', /* ̈́ */ '\u{34a}', /* ÍŠ */ '\u{34b}', /* Í‹ */ '\u{34c}', /* ÍŒ */ 10 | '\u{303}', /* ̃ */ '\u{302}', /* Ì‚ */ '\u{30c}', /* ÌŒ */ '\u{350}', /* ͐ */ 11 | '\u{300}', /* Ì€ */ '\u{301}', /* ́ */ '\u{30b}', /* Ì‹ */ '\u{30f}', /* ̏ */ 12 | '\u{312}', /* Ì’ */ '\u{313}', /* Ì“ */ '\u{314}', /* Ì” */ '\u{33d}', /* ̽ */ 13 | '\u{309}', /* ̉ */ '\u{363}', /* Í£ */ '\u{364}', /* ͤ */ '\u{365}', /* Í¥ */ 14 | '\u{366}', /* ͦ */ '\u{367}', /* ͧ */ '\u{368}', /* ͨ */ '\u{369}', /* Í© */ 15 | '\u{36a}', /* ͪ */ '\u{36b}', /* Í« */ '\u{36c}', /* ͬ */ '\u{36d}', /* Í­ */ 16 | '\u{36e}', /* Í® */ '\u{36f}', /* ͯ */ '\u{33e}', /* ̾ */ '\u{35b}', /* Í› */ 17 | '\u{346}', /* ͆ */ '\u{31a}', /* Ìš */ 18 | '\u{316}', /* Ì– */ '\u{317}', /* Ì— */ '\u{318}', /* ̘ */ '\u{319}', /* Ì™ */ 19 | '\u{31c}', /* Ìœ */ '\u{31d}', /* ̝ */ '\u{31e}', /* Ìž */ '\u{31f}', /* ÌŸ */ 20 | '\u{320}', /* Ì */ '\u{324}', /* ̤ */ '\u{325}', /* Ì¥ */ '\u{326}', /* ̦ */ 21 | '\u{329}', /* Ì© */ '\u{32a}', /* ̪ */ '\u{32b}', /* Ì« */ '\u{32c}', /* ̬ */ 22 | '\u{32d}', /* Ì­ */ '\u{32e}', /* Ì® */ '\u{32f}', /* ̯ */ '\u{330}', /* Ì° */ 23 | '\u{331}', /* ̱ */ '\u{332}', /* ̲ */ '\u{333}', /* ̳ */ '\u{339}', /* ̹ */ 24 | '\u{33a}', /* ̺ */ '\u{33b}', /* Ì» */ '\u{33c}', /* ̼ */ '\u{345}', /* Í… */ 25 | '\u{347}', /* ͇ */ '\u{348}', /* ͈ */ '\u{349}', /* ͉ */ '\u{34d}', /* ͍ */ 26 | '\u{34e}', /* ÍŽ */ '\u{353}', /* Í“ */ '\u{354}', /* Í” */ '\u{355}', /* Í• */ 27 | '\u{356}', /* Í– */ '\u{359}', /* Í™ */ '\u{35a}', /* Íš */ '\u{323}', /* Ì£ */ 28 | '\u{315}', /* Ì• */ '\u{31b}', /* Ì› */ '\u{340}', /* Ì€ */ '\u{341}', /* ́ */ 29 | '\u{358}', /* ͘ */ '\u{321}', /* Ì¡ */ '\u{322}', /* Ì¢ */ '\u{327}', /* ̧ */ 30 | '\u{328}', /* ̨ */ '\u{334}', /* Ì´ */ '\u{335}', /* ̵ */ '\u{336}', /* ̶ */ 31 | '\u{34f}', /* ͏ */ '\u{35c}', /* Íœ */ '\u{35d}', /* ͝ */ '\u{35e}', /* Íž */ 32 | '\u{35f}', /* ÍŸ */ '\u{360}', /* Í */ '\u{362}', /* Í¢ */ '\u{338}', /* ̸ */ 33 | '\u{337}', /* Ì· */ '\u{361}', /* Í¡ */ '\u{489}' /* Ò‰_ */ 34 | ]; 35 | 36 | pub fn make_zalgo(input: String) -> String { 37 | let mut result: String = String::new(); 38 | for character in input.chars() { 39 | result.push_str(character.to_string().as_slice()); 40 | 41 | if character == ' ' { 42 | continue; 43 | } 44 | 45 | for _ in range(0, 5 + (rand::random::() % 10)) { 46 | result.push_str(thread_rng().choose(&ZALGO_CHARS).unwrap().to_string().as_slice()); 47 | } 48 | } 49 | 50 | result 51 | } 52 | -------------------------------------------------------------------------------- /translate.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | # ---------------------------------------------------------------------------- 3 | # "THE BEER-WARE LICENSE" (Revision 42): 4 | # wrote this file. As long as you retain this notice you 5 | # can do whatever you want with this stuff. If we meet some day, and you think 6 | # this stuff is worth it, you can buy me a beer in return to Terry Yin. 7 | # 8 | # The idea of this is borrowed from 's brilliant work 9 | # https://github.com/soimort/google-translate-cli 10 | # He uses "THE BEER-WARE LICENSE". That's why I use it too. So you can buy him a 11 | # beer too. 12 | # ---------------------------------------------------------------------------- 13 | ''' 14 | This is a simple, yet powerful command line translator with google translate 15 | behind it. You can also use it as a Python module in your code. 16 | ''' 17 | import re 18 | import json 19 | from textwrap import wrap 20 | try: 21 | import urllib2 as request 22 | from urllib import quote 23 | except: 24 | from urllib import request 25 | from urllib.parse import quote 26 | 27 | class Translator: 28 | def __init__(self, to_lang, from_lang='auto'): 29 | self.from_lang = from_lang 30 | self.to_lang = to_lang 31 | 32 | def translate(self, source): 33 | self.source_list = wrap(source, 1000, replace_whitespace=False) 34 | return ' '.join(self._get_translation_from_google(s) for s in self.source_list) 35 | 36 | def _get_translation_from_google(self, source): 37 | json5 = self._get_json5_from_google(source) 38 | return json.loads(json5)['sentences'][0]['trans'] 39 | 40 | def _get_json5_from_google(self, source): 41 | escaped_source = quote(source, '') 42 | headers = {'User-Agent': 'Mozilla/5.0 (Macintosh; Intel Mac OS X 10_6_8) AppleWebKit/535.19 (KHTML, like Gecko) Chrome/18.0.1025.168 Safari/535.19'} 43 | req = request.Request( 44 | url="http://translate.google.com/translate_a/t?client=p&ie=UTF-8&oe=UTF-8" 45 | +"&sl=%s&tl=%s&text=%s" % (self.from_lang, self.to_lang, escaped_source) 46 | , headers = headers) 47 | r = request.urlopen(req) 48 | return r.read().decode('utf-8') 49 | 50 | def main(): 51 | import argparse 52 | import sys 53 | import locale 54 | parser = argparse.ArgumentParser(description=__doc__) 55 | parser.add_argument('texts', metavar='text', nargs='+', 56 | help='a string to translate(use "" when it\'s a sentence)') 57 | parser.add_argument('-t', '--to', dest='to_lang', type=str, default='zh', 58 | help='To language (e.g. zh, zh-TW, en, ja, ko). Default is zh.') 59 | parser.add_argument('-f', '--from', dest='from_lang', type=str, default='auto', 60 | help='From language (e.g. zh, zh-TW, en, ja, ko). Default is auto.') 61 | args = parser.parse_args() 62 | translator= Translator(from_lang=args.from_lang, to_lang=args.to_lang) 63 | for text in args.texts: 64 | translation = translator.translate(text) 65 | if sys.version_info.major == 2: 66 | translation =translation.encode(locale.getpreferredencoding()) 67 | sys.stdout.write(translation) 68 | sys.stdout.write("\n") 69 | 70 | if __name__ == "__main__": 71 | main() 72 | 73 | --------------------------------------------------------------------------------