├── .gitignore ├── Cargo.toml ├── LICENSE ├── README.md ├── data ├── DHTnodes └── masterkeys └── src ├── bot.rs ├── commands.rs ├── db.rs ├── group.rs ├── main.rs ├── trivia.rs └── util.rs /.gitignore: -------------------------------------------------------------------------------- 1 | *.lock 2 | data/masterkeys 3 | data/profile.tox 4 | data/scores.db 5 | target/ 6 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | 3 | name = "rustybot" 4 | version = "2.1.0" 5 | authors = [ "Jfreegman " ] 6 | 7 | [dependencies] 8 | lazy_static = "1.4.0" 9 | time = "0.1" 10 | rand = "0.7" 11 | byteorder = "1" 12 | ctrlc = "3.1.6" 13 | 14 | [dependencies.rstox] 15 | git = "https://github.com/JFreegman/rstox.git" 16 | #path = "../rstox" 17 | 18 | [profile.dev] 19 | debug = true 20 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # rustybot 2 | rustybot is a [Tox](https://tox.chat) groupchat trivia bot written in Rust. 3 | 4 | ## Features 5 | rustybot is capable of playing multiple games at once in any number of groups. Player statistics including total points accumulated, rounds won, and games won, are stored in a database and persist across restarts. Tox ID's are used as database keys, which means peers will always be tied to the same entry as long as their Tox ID doesn't change. 6 | 7 | She reads questions from the `data/questions` file which will need to be provided by the owner. Questions and answers must be divided by the ` character and each line must end in a \n byte. An example list can be found [here](https://gist.github.com/JFreegman/d0cc3952669059b78bf7ec2889384523). 8 | 9 | ## Usage and ownership 10 | rustybot automatically accepts friend requests and group invites. The person who invites her to the group becomes her owner for that group and may use privileged commands. Additionally, all Tox ID's contained in the `data/masterkeys` file are her permanent owners and may use privileged commands in any group. 11 | 12 | ### Non-privileged commands 13 | * `!help` - Print a list of non-privileged commands 14 | * `!hint` - Display a hint for the current question 15 | * `!source` - Link to the source code 16 | * `!score` - Print your score 17 | * `!stats` - Print the leaderboard 18 | * `!trivia` - Begin a game of trivia 19 | 20 | ### Privileged commands 21 | * `!quit` - Leave the groupchat 22 | * `!stop` - End the current trivia game 23 | * `!disable` - Disables the trivia command 24 | * `!enable` - Enables the trivia command 25 | 26 | ## Compiling and running 27 | `cargo build && cargo run` or just `cargo run` 28 | -------------------------------------------------------------------------------- /data/DHTnodes: -------------------------------------------------------------------------------- 1 | 144.217.86.39 33445 7E5668E0EE09E19F320AD47902419331FFEE147BB3606769CFBE921A2A2FD34C 2 | 46.229.52.198 33445 813C8F4187833EF0655B10F7752141A352248462A567529A38B6BBF73E979307 3 | 85.172.30.117 33445 8E7D0B859922EF569298B4D261A8CCB5FEA14FB91ED412A7603A585A25698832 4 | 78.46.73.141 33445 02807CF4F8BB8FB390CC3794BDF1E8449E9A8392C5D3F2200019DA9F1E812E46 5 | 95.31.18.227 33445 257744DBF57BE3E117FE05D145B5F806089428D4DCE4E3D0D50616AA16D9417E 6 | 116.196.77.132 33445 040326E850DDCB49B1B2D9E3E2789D425774E4C5D783A55C09A024D05D2A8A66 7 | 87.118.126.207 33445 0D303B1778CA102035DA01334E7B1855A45C3EFBC9A83B9D916FFDEBC6DD3B2E 8 | 81.169.136.229 33445 E0DB78116AC6500398DDBA2AEEF3220BB116384CAB714C5D1FCD61EA2B69D75E 9 | 205.185.115.131 53 3091C6BEB2A993F1C6300C16549FABA67098FF3D62C6D253828B531470B53D68 10 | 51.158.146.76 33445 E940D8FA9B07C1D13EA4ECF9F06B66F565F1CF61F094F60C67FDC8ADD3F4BA59 11 | 46.101.197.175 33445 CD133B521159541FB1D326DE9850F5E56A6C724B5B8E5EB5CD8D950408E95707 12 | 46.146.229.184 33445 94750E94013586CCD989233A621747E2646F08F31102339452CADCF6DC2A760A 13 | 168.138.203.178 33445 6D04D8248E553F6F0BFDDB66FBFB03977E3EE54C432D416BC2444986EF02CC17 14 | 195.201.7.101 33445 B84E865125B4EC4C368CD047C72BCE447644A2DC31EF75BD2CDA345BFD310107 15 | 5.19.249.240 38296 DA98A4C0CD7473A133E115FEA2EBDAEEA2EF4F79FD69325FC070DA4DE4BA3238 16 | -------------------------------------------------------------------------------- /data/masterkeys: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /src/bot.rs: -------------------------------------------------------------------------------- 1 | /* bot.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use time::Timespec; 24 | use rstox::core::*; 25 | use group::{GroupChat, get_group_index}; 26 | use db::*; 27 | use util::*; 28 | 29 | pub const PROFILE_DATA_PATH: &'static str = "data/profile.tox"; 30 | pub const VERSION: &'static str = "0.2.0"; 31 | pub const NAME: &'static str = "rustybot"; 32 | pub const STATUS_MESSAGE: &'static str = "Invite me to a group. !trivia starts a game of trivia, !help for other commands."; 33 | 34 | pub struct Bot<'a> { 35 | pub tox: &'a mut Tox, 36 | pub groups: Vec, 37 | pub questions: Vec, // Stores all of the trivia questions/answers 38 | pub last_connect: Timespec, 39 | pub db: DataBase, 40 | } 41 | 42 | impl<'a> Bot<'a> { 43 | pub fn new(tox: &mut Tox) -> Bot { 44 | Bot { 45 | tox: tox, 46 | groups: Vec::new(), 47 | questions: Vec::new(), 48 | last_connect: Timespec::new(0, 0), 49 | db: DataBase::new(), 50 | } 51 | } 52 | 53 | pub fn save(&self) { 54 | let data = self.tox.save(); 55 | 56 | match save_data(PROFILE_DATA_PATH, &data) { 57 | Ok(_) => (), 58 | Err(e) => println!("save_data failed: {}", e), 59 | }; 60 | } 61 | 62 | pub fn add_group(&mut self, friendnumber: u32, cookie: &Cookie) { 63 | match self.tox.join_conference(friendnumber, cookie) { 64 | Ok(groupnumber) => { 65 | let friend_pk = match self.tox.get_friend_public_key(friendnumber as u32) { 66 | Some(friend_pk) => friend_pk.to_string(), 67 | None => "BadKey".to_string(), 68 | }; 69 | 70 | self.groups.push(GroupChat::new(groupnumber, friend_pk)); 71 | let friend_name = self.tox.get_friend_name(friendnumber as u32).unwrap_or("Anonymous".to_string()); 72 | println!("Accepted group invite from {} ({})", friend_name, groupnumber); 73 | }, 74 | Err(e) => println!("Failed to join group ({:?})", e), 75 | }; 76 | } 77 | 78 | pub fn del_group(&mut self, groupnumber: u32) { 79 | let index = match get_group_index(self, groupnumber) { 80 | Some(index) => index, 81 | None => return println!("Failed to find index for groupnumber {}", groupnumber), 82 | }; 83 | 84 | self.groups.remove(index); 85 | self.tox.delete_conference(groupnumber); 86 | 87 | println!("Leaving group {}", groupnumber); 88 | 89 | self.save(); 90 | } 91 | 92 | pub fn leave_all_groups(&mut self) { 93 | for g in &self.groups { 94 | self.tox.delete_conference(g.groupnumber); 95 | } 96 | } 97 | 98 | pub fn print_info(&self) { 99 | println!("{} version {}", NAME, VERSION); 100 | println!("Name: {}", self.tox.get_name()); 101 | println!("Status message: {}", self.tox.get_status_message()); 102 | println!("Tox ID: {}", self.tox.get_address()); 103 | println!("Friends: {}", self.tox.get_friend_list().len()); 104 | } 105 | } 106 | -------------------------------------------------------------------------------- /src/commands.rs: -------------------------------------------------------------------------------- 1 | /* commands.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use std::fmt::Write; 24 | use bot::Bot; 25 | use group::{get_group_index, get_peer_public_key}; 26 | use check_privilege; 27 | 28 | // Maximum number of entries to print for the stats command 29 | const MAX_LEADERBOARD_ENTRIES: i32 = 10; 30 | 31 | lazy_static! { 32 | static ref COMMANDS: Vec = { 33 | let init = vec![ 34 | Command::new( "!disable", cmd_disable ), 35 | Command::new( "!enable", cmd_enable ), 36 | Command::new( "!help", cmd_help ), 37 | Command::new( "!hint", cmd_hint ), 38 | Command::new( "!quit", cmd_quit ), 39 | Command::new( "!score", cmd_score ), 40 | Command::new( "!source", cmd_source ), 41 | Command::new( "!stats", cmd_stats ), 42 | Command::new( "!stop", cmd_stop ), 43 | Command::new( "!trivia", cmd_trivia ), 44 | ]; 45 | 46 | init 47 | }; 48 | } 49 | 50 | struct Command { 51 | name: String, 52 | func: fn(bot: &mut Bot, groupnumber: u32, peernumber: u32), 53 | } 54 | 55 | impl Command { 56 | fn new(name: &str, func: fn(bot: &mut Bot, groupnumber: u32, peernumber: u32)) -> Command { 57 | Command { 58 | name: name.to_string(), 59 | func: func, 60 | } 61 | } 62 | 63 | fn do_command(&self, bot: &mut Bot, groupnumber: u32, peernumber: u32) { 64 | let func = self.func; 65 | func(bot, groupnumber, peernumber); 66 | } 67 | } 68 | 69 | pub fn execute(bot: &mut Bot, groupnumber: u32, peernumber: u32, command: &str) 70 | { 71 | for c in COMMANDS.iter() { 72 | if c.name == command { 73 | return c.do_command(bot, groupnumber, peernumber); 74 | } 75 | } 76 | } 77 | 78 | fn cmd_disable(bot: &mut Bot, groupnumber: u32, peernumber: u32) 79 | { 80 | if !check_privilege(bot, groupnumber, peernumber) { 81 | return; 82 | } 83 | 84 | let index = match get_group_index(bot, groupnumber) { 85 | Some(index) => index, 86 | None => return, 87 | }; 88 | 89 | bot.groups[index].disable_trivia(); 90 | bot.groups[index].send_message(bot.tox, "Trivia has been disabled"); 91 | } 92 | 93 | fn cmd_enable(bot: &mut Bot, groupnumber: u32, peernumber: u32) 94 | { 95 | if !check_privilege(bot, groupnumber, peernumber) { 96 | return; 97 | } 98 | 99 | let index = match get_group_index(bot, groupnumber) { 100 | Some(index) => index, 101 | None => return, 102 | }; 103 | 104 | bot.groups[index].send_message(bot.tox, "Trivia has been enabled."); 105 | bot.groups[index].enable_trivia(); 106 | } 107 | 108 | fn cmd_help(bot: &mut Bot, groupnumber: u32, _peernumber: u32) 109 | { 110 | let index = match get_group_index(bot, groupnumber) { 111 | Some(index) => index, 112 | None => return, 113 | }; 114 | 115 | bot.groups[index].send_message(bot.tox, "Commands: !trivia !hint !score !stats !source"); 116 | } 117 | 118 | fn cmd_hint(bot: &mut Bot, groupnumber: u32, _peernumber: u32) 119 | { 120 | let index = match get_group_index(bot, groupnumber) { 121 | Some(index) => index, 122 | None => return, 123 | }; 124 | 125 | let hint = bot.groups[index].trivia.get_hint(); 126 | let mut message = String::new(); 127 | write!(&mut message, "Hint: {}", hint).unwrap(); 128 | bot.groups[index].send_message(bot.tox, &message); 129 | } 130 | 131 | fn cmd_quit(bot: &mut Bot, groupnumber: u32, peernumber: u32) 132 | { 133 | if !check_privilege(bot, groupnumber, peernumber) { 134 | return; 135 | } 136 | 137 | let index = match get_group_index(bot, groupnumber) { 138 | Some(index) => index, 139 | None => return, 140 | }; 141 | 142 | bot.groups[index].send_message(bot.tox, "Goodbye."); 143 | bot.del_group(groupnumber); 144 | } 145 | 146 | fn cmd_score(bot: &mut Bot, groupnumber: u32, peernumber: u32) 147 | { 148 | let public_key = match get_peer_public_key(bot.tox, groupnumber, peernumber) { 149 | Some(key) => key.to_string(), 150 | None => return, 151 | }; 152 | 153 | let mut message = String::new(); 154 | 155 | match bot.db.get_entry(&public_key) { 156 | Some(stats) => write!(&mut message, "{} - Tot. points...{}, Rounds won...{}, Games won...{}", 157 | stats.nick, stats.points, stats.rounds_won, stats.games_won).unwrap(), 158 | None => write!(&mut message, "No entry found").unwrap(), 159 | } 160 | 161 | let grp_index = match get_group_index(bot, groupnumber) { 162 | Some(idx) => idx, 163 | None => return, 164 | }; 165 | 166 | bot.groups[grp_index].send_message(bot.tox, &message); 167 | } 168 | 169 | 170 | fn cmd_source(bot: &mut Bot, groupnumber: u32, _peernumber: u32) 171 | { 172 | let index = match get_group_index(bot, groupnumber) { 173 | Some(index) => index, 174 | None => return, 175 | }; 176 | 177 | bot.groups[index].send_message(bot.tox, "https://github.com/JFreegman/rustybot/"); 178 | } 179 | 180 | fn cmd_stats(bot: &mut Bot, groupnumber: u32, _peernumber: u32) 181 | { 182 | let index = match get_group_index(bot, groupnumber) { 183 | Some(index) => index, 184 | None => return, 185 | }; 186 | 187 | let entries = bot.db.get_sorted_values(); 188 | 189 | if entries.is_empty() { 190 | bot.groups[index].send_message(bot.tox, "Leaderboard is empty. Type !trivia to play!"); 191 | return; 192 | } 193 | 194 | let mut count = 1; 195 | let mut message = String::new(); 196 | write!(&mut message, "Leaderboard:\n").unwrap(); 197 | 198 | for e in entries { 199 | write!(&mut message, "{}. {} - Games won...{}, Rounds won...{}, Tot. points...{}\n", 200 | count, e.nick, e.games_won, e.rounds_won, e.points).unwrap(); 201 | 202 | if count >= MAX_LEADERBOARD_ENTRIES { 203 | break; 204 | } 205 | 206 | count += 1; 207 | } 208 | 209 | bot.groups[index].send_message(bot.tox, &message); 210 | } 211 | 212 | fn cmd_stop(bot: &mut Bot, groupnumber: u32, peernumber: u32) 213 | { 214 | let index = match get_group_index(bot, groupnumber) { 215 | Some(index) => index, 216 | None => return, 217 | }; 218 | 219 | if check_privilege(bot, groupnumber, peernumber) { 220 | bot.groups[index].abort_game(bot.tox, true); 221 | return; 222 | } 223 | 224 | match get_peer_public_key(bot.tox, groupnumber, peernumber) { 225 | Some(pk) => { 226 | if pk.to_string() == bot.groups[index].trivia.owner_key { 227 | bot.groups[index].abort_game(bot.tox, false); 228 | } 229 | }, 230 | None => { 231 | println!("cmd_stop(): Failed to fetch peer {}'s key in group {}", peernumber, groupnumber); 232 | return; 233 | } 234 | }; 235 | } 236 | 237 | fn cmd_trivia(bot: &mut Bot, groupnumber: u32, peernumber: u32) 238 | { 239 | let index = match get_group_index(bot, groupnumber) { 240 | Some(index) => index, 241 | None => return, 242 | }; 243 | 244 | let public_key = match get_peer_public_key(bot.tox, groupnumber, peernumber) { 245 | Some(pk) => pk, 246 | None => { 247 | println!("cmd_trivia(): Failed to fetch peer {}'s key in group {}", peernumber, groupnumber); 248 | return; 249 | } 250 | }; 251 | 252 | if bot.groups[index].start_trivia(bot.tox, &public_key) { 253 | bot.groups[index].send_message(bot.tox, "Trivia time!"); 254 | } 255 | } 256 | -------------------------------------------------------------------------------- /src/db.rs: -------------------------------------------------------------------------------- 1 | /* db.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use std::io::prelude::*; 24 | use std::io::BufReader; 25 | use std::collections::HashMap; 26 | use std::str::from_utf8; 27 | use util::*; 28 | use rstox::core::*; 29 | 30 | const DATABASE_PATH: &'static str = "data/scores.db"; 31 | 32 | // Fixed nick size for serialization 33 | const DB_NICK_SIZE: usize = 32; 34 | 35 | // Size of the database keys 36 | const DB_KEY_SIZE: usize = PUBLIC_KEY_SIZE * 2; 37 | 38 | // Number of bytes in a database entry in serialized form. 39 | // Key, nick length, nick, points, rounds won, games won 40 | const DB_ENTRY_FORMAT_SIZE: usize = DB_KEY_SIZE + SIZE_U32 + DB_NICK_SIZE + SIZE_U64 + SIZE_U32 + SIZE_U32; 41 | 42 | pub struct DBentry { 43 | pub nick: String, // The last nick this entry is associated with 44 | pub points: u64, 45 | pub rounds_won: u32, 46 | pub games_won: u32, 47 | } 48 | 49 | impl DBentry { 50 | /* New entries are created only when a peer wins a round */ 51 | pub fn new(points: u64, rounds_won: u32, nick: &str) -> DBentry { 52 | DBentry { 53 | nick: nick.to_string(), 54 | points: points, 55 | rounds_won: rounds_won, 56 | games_won: 0, 57 | } 58 | } 59 | } 60 | 61 | pub struct DataBase { 62 | hashmap: HashMap, 63 | } 64 | 65 | impl DataBase { 66 | pub fn new() -> DataBase { 67 | DataBase { hashmap: HashMap::new() } 68 | } 69 | 70 | pub fn set_nick(&mut self, nick: &str, key: &str) { 71 | if let Some(entry) = self.hashmap.get_mut(key) { 72 | entry.nick = nick.to_string(); 73 | } 74 | } 75 | 76 | /* 77 | * Returns a vector of all database values sorted by points in descending order. 78 | * Note: This is very inefficient for a large database but fuck it YOLO 79 | */ 80 | pub fn get_sorted_values(&self) -> Vec<&DBentry> { 81 | let mut list: Vec<&DBentry> = self.hashmap.values().collect(); 82 | list.sort_by(|a, b| a.points.cmp(&b.points).reverse()); 83 | list 84 | } 85 | 86 | /* Returns a DBentry for a given key if it exists. */ 87 | pub fn get_entry(&self, key: &str) -> Option { 88 | self.hashmap.get(key).map(|e| DBentry { nick: e.nick.to_string(), 89 | games_won: e.games_won, 90 | rounds_won: e.rounds_won, 91 | points: e.points 92 | }) 93 | } 94 | 95 | /* Updates db entry's score for key. A zero value for points and/or rounds indicates a game win. */ 96 | pub fn update_score(&mut self, nick: &str, key: &str, points: u64, rounds: u32) { 97 | if let Some(entry) = self.hashmap.get_mut(key) { 98 | if points != 0 || rounds != 0{ 99 | entry.points += points; 100 | entry.rounds_won += rounds; 101 | } else { 102 | entry.games_won += 1; 103 | } 104 | 105 | return; 106 | }; 107 | 108 | self.hashmap.insert(key.to_string(), DBentry::new(points, rounds, nick)); 109 | } 110 | 111 | pub fn save(&self) { 112 | if self.hashmap.is_empty() { 113 | return; 114 | } 115 | 116 | let mut data: Vec = Vec::new(); 117 | 118 | for (key, val) in self.hashmap.iter() { 119 | string_to_nbytes(&key, &mut data, DB_KEY_SIZE); 120 | u32_to_bytes_le(val.nick.len() as u32, &mut data); 121 | string_to_nbytes(&val.nick, &mut data, DB_NICK_SIZE); 122 | u64_to_bytes_le(val.points, &mut data); 123 | u32_to_bytes_le(val.rounds_won, &mut data); 124 | u32_to_bytes_le(val.games_won, &mut data); 125 | } 126 | 127 | match save_data(DATABASE_PATH, &data) { 128 | Ok(_) => (), 129 | Err(e) => println!("save_data failed: {}", e), 130 | } 131 | } 132 | 133 | pub fn load(&mut self) { 134 | println!("Opening: {}", DATABASE_PATH); 135 | let fp = match open_file(DATABASE_PATH, true) { 136 | Some(fp) => fp, 137 | None => return, 138 | }; 139 | 140 | let mut buf: Vec = Vec::new(); 141 | let mut reader = BufReader::new(&fp); 142 | 143 | let size = match reader.read_to_end(&mut buf) { 144 | Ok(size) => size, 145 | Err(e) => return println!("Failed to read database to buffer: {}", e), 146 | }; 147 | 148 | if size == 0 { 149 | return println!("No database to load."); 150 | } 151 | 152 | if size % DB_ENTRY_FORMAT_SIZE != 0 { 153 | return println!("Failed to load trivia database: Bad format."); 154 | } 155 | 156 | let num = size / DB_ENTRY_FORMAT_SIZE; 157 | 158 | for i in 0..num { 159 | let mut start = i * DB_ENTRY_FORMAT_SIZE; 160 | let mut end = start + DB_KEY_SIZE; 161 | let utf8_key = &buf[start..end]; 162 | 163 | // Get key 164 | let key = match from_utf8(utf8_key) { 165 | Ok(key) => key, 166 | Err(_) => continue, 167 | }; 168 | 169 | // Get nick len 170 | start = end; 171 | end = end + SIZE_U32; 172 | let nick_len = bytes_le_to_u32(&buf[start..end]) as usize; 173 | 174 | if nick_len > DB_NICK_SIZE { 175 | continue; 176 | } 177 | 178 | // Get nick 179 | start = end; 180 | end = end + nick_len; 181 | let utf8_nick = &buf[start..end]; 182 | 183 | let nick = match from_utf8(utf8_nick) { 184 | Ok(nick) => nick, 185 | Err(_) => continue, 186 | }; 187 | 188 | // Skip nick padding 189 | if nick_len < DB_NICK_SIZE { 190 | let padding = DB_NICK_SIZE - nick_len; 191 | end = end + padding; 192 | } 193 | 194 | // Get points 195 | start = end; 196 | end = end + SIZE_U64; 197 | let points = bytes_le_to_u64(&buf[start..end]); 198 | // Get rounds won 199 | start = end; 200 | end = end + SIZE_U32; 201 | let rounds_won = bytes_le_to_u32(&buf[start..end]); 202 | // Get games won 203 | start = end; 204 | end = end + SIZE_U32; 205 | let games_won = bytes_le_to_u32(&buf[start..end]); 206 | 207 | let entry = DBentry { nick: nick.to_string(), 208 | points: points, 209 | rounds_won: rounds_won, 210 | games_won: games_won 211 | }; 212 | 213 | self.hashmap.insert(key.to_string(), entry); 214 | } 215 | 216 | println!("Database loaded {} entries", num); 217 | } 218 | } 219 | -------------------------------------------------------------------------------- /src/group.rs: -------------------------------------------------------------------------------- 1 | /* group.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use time::get_time; 24 | use std::fmt::Write; 25 | use bot::Bot; 26 | use trivia::*; 27 | use db::*; 28 | use rstox::core::*; 29 | 30 | pub struct Peer { 31 | pub nick: String, 32 | pub public_key: String, 33 | pub round_score: u64, 34 | pub rounds_won: u32, 35 | } 36 | 37 | impl Peer { 38 | pub fn new(public_key: String, nick: String, round_score: u64, rounds_won: u32) -> Peer { 39 | Peer { 40 | nick: nick, 41 | public_key: public_key, 42 | round_score: round_score, 43 | rounds_won: rounds_won, 44 | } 45 | } 46 | 47 | pub fn get_nick(&self) -> String { 48 | self.nick.to_string() 49 | } 50 | 51 | pub fn update_round_score(&mut self, points: u64) { 52 | self.round_score += points; 53 | self.rounds_won += 1; 54 | } 55 | 56 | pub fn get_round_score(&self) -> u64 { 57 | self.round_score 58 | } 59 | 60 | pub fn get_rounds_won(&self) -> u32 { 61 | self.rounds_won 62 | } 63 | 64 | pub fn clear_round(&mut self) { 65 | self.round_score = 0; 66 | self.rounds_won = 0; 67 | } 68 | } 69 | 70 | pub struct GroupChat { 71 | pub groupnumber: u32, 72 | pub trivia: Trivia, 73 | pub peers: Vec, 74 | pub owner_pk: String, // Public key of the friend who invited the bot to the group 75 | } 76 | 77 | impl GroupChat { 78 | pub fn new(groupnumber: u32, public_key: String) -> GroupChat { 79 | GroupChat { 80 | groupnumber: groupnumber, 81 | trivia: Trivia::new(), 82 | peers: Vec::new(), 83 | owner_pk: public_key, 84 | } 85 | } 86 | 87 | pub fn send_message(&self, tox: &mut Tox, message: &str) { 88 | match tox.send_conference_message(self.groupnumber, MessageType::Normal, message) { 89 | Ok(_) => (), 90 | Err(e) => println!("Failed to send message to group {}: {:?}", self.groupnumber, e), 91 | }; 92 | } 93 | 94 | /* Returns true if game is started */ 95 | pub fn start_trivia(&mut self, tox: &mut Tox, owner_key: &str) -> bool { 96 | if self.trivia.running { 97 | return false; 98 | } 99 | 100 | if self.trivia.disabled { 101 | self.send_message(tox, "Trivia is disabled."); 102 | return false; 103 | } 104 | 105 | self.trivia.new_game(owner_key); 106 | true 107 | } 108 | 109 | pub fn end_trivia(&mut self, tox: &mut Tox, db: &mut DataBase) { 110 | if !self.trivia.running { 111 | return; 112 | } 113 | 114 | self.trivia.reset(); 115 | let mut winners = Vec::new(); 116 | let mut winner_pk = String::new(); 117 | let mut winner_name = String::new(); 118 | let mut best_score = 0; 119 | 120 | for p in &self.peers { 121 | if p.round_score == 0 { 122 | continue; 123 | } 124 | 125 | let pk = p.public_key.to_string(); 126 | 127 | match get_peer_index(&self.peers, &pk) { 128 | Some(index) => winners.push(index), 129 | None => continue, 130 | }; 131 | 132 | let peername = p.get_nick(); 133 | 134 | db.update_score(&peername, &pk, p.round_score, p.rounds_won); 135 | 136 | if p.round_score > best_score && !pk.is_empty() { 137 | best_score = p.round_score; 138 | winner_pk = pk; 139 | winner_name = peername; 140 | } 141 | } 142 | 143 | let mut message = String::new(); 144 | 145 | if winners.is_empty() { 146 | write!(&mut message, "Game over.\n").unwrap(); 147 | self.send_message(tox, &message); 148 | return; 149 | } 150 | 151 | write!(&mut message, "Game over. The winner is {}!\nScoreboard:\n", winner_name).unwrap(); 152 | 153 | winners.sort_by(|a, b| self.peers[*a].round_score.cmp(&self.peers[*b].round_score).reverse()); 154 | 155 | for &index in winners.iter() { 156 | let score = self.peers[index].round_score; 157 | let peername = self.peers[index].get_nick(); 158 | write!(&mut message, "{}: {}\n", peername, score).unwrap(); 159 | 160 | self.peers[index].clear_round(); 161 | } 162 | 163 | self.send_message(tox, &message); 164 | 165 | db.update_score(&winner_name, &winner_pk, 0, 0); 166 | db.save(); 167 | } 168 | 169 | pub fn abort_game(&mut self, tox: &mut Tox, privileged: bool) { 170 | if !self.trivia.running { 171 | return; 172 | } 173 | 174 | // if we're not privileged but but we own this game of trivia we can only stop 175 | // the game if no other peers have a positive score 176 | if !privileged { 177 | for p in &mut self.peers { 178 | if p.round_score > 0 && p.public_key != self.trivia.owner_key { 179 | return; 180 | } 181 | } 182 | } 183 | 184 | self.trivia.reset(); 185 | 186 | for p in &mut self.peers { 187 | p.clear_round(); 188 | } 189 | 190 | self.send_message(tox, "Game aborted."); 191 | } 192 | 193 | pub fn enable_trivia(&mut self) { 194 | self.trivia.disabled = false; 195 | } 196 | 197 | pub fn disable_trivia(&mut self) { 198 | self.trivia.disabled = true; 199 | } 200 | 201 | pub fn next_trivia_question(&mut self, tox: &mut Tox, questions: &Vec, db: &mut DataBase) { 202 | if self.trivia.rounds > 0 && !self.trivia.winner && !self.trivia.answer.is_empty() { 203 | let mut message = String::new(); 204 | write!(&mut message, "Time's up! The answer was: {}", self.trivia.answer).unwrap(); 205 | self.send_message(tox, &message); 206 | self.trivia.end_timer = get_time(); 207 | } 208 | 209 | if self.trivia.rounds >= MAX_ROUNDS { 210 | self.end_trivia(tox, db); 211 | return; 212 | } 213 | 214 | if !self.trivia.new_round(questions) { 215 | return; 216 | } 217 | 218 | let mut message = String::new(); 219 | write!(&mut message, "ROUND {}: {}", self.trivia.rounds, self.trivia.question).unwrap(); 220 | self.send_message(tox, &message); 221 | } 222 | } 223 | 224 | pub fn get_group_index(bot: &mut Bot, groupnumber: u32) -> Option 225 | { 226 | let index = match bot.groups.iter().position(|g| g.groupnumber == groupnumber) { 227 | Some(index) => Some(index), 228 | None => None, 229 | }; 230 | 231 | index 232 | } 233 | 234 | pub fn get_peer_index(peers: &Vec, public_key: &str) -> Option 235 | { 236 | let index = match peers.iter().position(|p| p.public_key == public_key) { 237 | Some(index) => Some(index), 238 | None => None, 239 | }; 240 | 241 | index 242 | } 243 | 244 | pub fn get_peer_public_key(tox: &mut Tox, groupnumber: u32, peernumber: u32) -> Option 245 | { 246 | let public_key = match tox.get_peer_public_key(groupnumber, peernumber) { 247 | Ok(key) => Some(key.to_string()), 248 | Err(_) => None, 249 | }; 250 | 251 | public_key 252 | } 253 | -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | /* main.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | #[macro_use(lazy_static)] 24 | extern crate lazy_static; 25 | extern crate rand; 26 | extern crate time; 27 | extern crate rstox; 28 | extern crate byteorder; 29 | extern crate ctrlc; 30 | 31 | use std::fs::File; 32 | use std::path::Path; 33 | use std::io::prelude::*; 34 | use std::io::BufReader; 35 | use std::cmp::*; 36 | use rand::*; 37 | use time::get_time; 38 | use rstox::core::*; 39 | use std::sync::atomic::{AtomicBool, Ordering}; 40 | use std::sync::Arc; 41 | 42 | mod db; 43 | mod util; 44 | use util::*; 45 | mod trivia; 46 | use self::trivia::*; 47 | mod group; 48 | use self::group::*; 49 | mod bot; 50 | use self::bot::*; 51 | mod commands; 52 | use self::commands::execute; 53 | 54 | const QUESTIONS_PATH: &'static str = "data/questions"; 55 | const MASTERKEYS_PATH: &'static str = "data/masterkeys"; 56 | const DHT_NODES_PATH: &'static str = "data/DHTnodes"; 57 | 58 | // Time to wait between bootstrap attempts 59 | const BOOTSTRAP_INTERVAL: i64 = 10; 60 | 61 | // Number of random bootstrap nodes to connect to per try 62 | const MAX_BOOTSTRAP_NODES: usize = 5; 63 | 64 | // Use in case DHTnodes file fails to load 65 | const BOOTSTRAP_IP: &'static str = "144.217.167.73"; 66 | const BOOTSTRAP_PORT: u16 = 33445; 67 | const BOOTSTRAP_KEY: &'static str = "7E5668E0EE09E19F320AD47902419331FFEE147BB3606769CFBE921A2A2FD34C"; 68 | 69 | fn load_tox() -> Option 70 | { 71 | let options = ToxOptions::new().no_lan(); 72 | 73 | let fp = match open_file(PROFILE_DATA_PATH, false) { 74 | Some(fp) => fp, 75 | None => { 76 | let tox = match Tox::new(options, None) { 77 | Ok(tox) => tox, 78 | Err(e) => { 79 | println!("Tox instance failed to initialize ({:?})", e); 80 | return None; 81 | } 82 | }; 83 | 84 | return Some(tox); 85 | } 86 | }; 87 | 88 | let mut buf = Vec::new(); 89 | let mut reader = BufReader::new(&fp); 90 | 91 | match reader.read_to_end(&mut buf) { 92 | Ok(_) => (), 93 | Err(e) => { 94 | println!("Failed to read tox data to buffer: {}", e); 95 | return None; 96 | } 97 | }; 98 | 99 | let tox = match Tox::new(options, Some(&mut buf)) { 100 | Ok(tox) => tox, 101 | Err(e) => { 102 | println!("Tox instance failed to initialize ({:?})", e); 103 | return None; 104 | } 105 | }; 106 | 107 | return Some(tox); 108 | } 109 | 110 | fn init_tox(tox: &mut Tox) 111 | { 112 | match tox.set_name(NAME) { 113 | Ok(_) => (), 114 | Err(e) => println!("Failed to set name ({:?})", e), 115 | }; 116 | 117 | match tox.set_status_message(STATUS_MESSAGE) { 118 | Ok(_) => (), 119 | Err(e) => println!("Failed to set status message ({:?})", e), 120 | }; 121 | } 122 | 123 | fn bootstrap_backup(tox: &mut Tox) 124 | { 125 | println!("Trying backup bootstrap server..."); 126 | 127 | match tox.bootstrap(BOOTSTRAP_IP, BOOTSTRAP_PORT, BOOTSTRAP_KEY.parse().unwrap()) { 128 | Ok(_) => (), 129 | Err(e) => println!("Failed to bootstrap with backup ({:?}).", e), 130 | } 131 | } 132 | 133 | fn bootstrap_tox(bot: &mut Bot) 134 | { 135 | if !timed_out(bot.last_connect, BOOTSTRAP_INTERVAL) { 136 | return; 137 | } 138 | 139 | bot.last_connect = get_time(); 140 | println!("Bootstrapping to DHT network..."); 141 | 142 | let path = Path::new(DHT_NODES_PATH); 143 | let display = path.display(); 144 | 145 | let mut fp = match File::open(&path) { 146 | Ok(fp) => fp, 147 | Err(e) => { 148 | println!("Failed to open file {}: {}", display, e); 149 | bootstrap_backup(bot.tox); 150 | return; 151 | } 152 | }; 153 | 154 | let mut nodes_str = String::new(); 155 | 156 | match fp.read_to_string(&mut nodes_str) { 157 | Ok(_) => (), 158 | Err(e) => { 159 | println!("Failed to read file {}: {}", display, e); 160 | bootstrap_backup(bot.tox); 161 | return; 162 | } 163 | }; 164 | 165 | let nodes: Vec<&str> = nodes_str.split("\n").collect(); 166 | let num_nodes = nodes.len(); 167 | let mut rng = thread_rng(); 168 | 169 | for _ in 0..min(MAX_BOOTSTRAP_NODES, num_nodes as usize) { 170 | let idx = rng.gen_range(0, num_nodes); 171 | let node: Vec<&str> = nodes[idx].split(" ").collect(); 172 | 173 | if node.len() != 3 { 174 | continue; 175 | } 176 | 177 | let ip = node[0]; 178 | 179 | let port = match node[1].to_string().parse::() { 180 | Ok(port) => port, 181 | Err(_) => continue, 182 | }; 183 | 184 | let key = match node[2].parse() { 185 | Ok(key) => key, 186 | Err(_) => continue, 187 | }; 188 | 189 | match bot.tox.bootstrap(ip, port, key) { 190 | Ok(_) => (), 191 | Err(e) => println!("Bootstrap failed: {:?}", e), 192 | } 193 | } 194 | } 195 | 196 | fn load_trivia_questions(bot: &mut Bot) -> Result<(), String> 197 | { 198 | 199 | println!("Loading trivia questions..."); 200 | 201 | let path = Path::new(QUESTIONS_PATH); 202 | let display = path.display(); 203 | let mut questions = String::new(); 204 | 205 | let mut fp = File::open(&path).map_err(|e| format!("Open failed on file {}: {}", display, e))?; 206 | fp.read_to_string(&mut questions).map_err(|e| format!("Read failed on file {}: {}", display, e))?; 207 | 208 | for line in questions.split("\n") { 209 | bot.questions.push(line.to_string()); 210 | } 211 | 212 | Ok(()) 213 | } 214 | 215 | // Returns true if peernumber is in the masterkeys list or is the owner of groupnumber 216 | fn check_privilege(bot: &mut Bot, groupnumber: u32, peernumber: u32) -> bool 217 | { 218 | let public_key = match get_peer_public_key(bot.tox, groupnumber, peernumber) { 219 | Some(key) => key.to_string(), 220 | None => { 221 | println!("Failed to fetch peer {}'s key in group {}", peernumber, groupnumber); 222 | return false; 223 | } 224 | }; 225 | 226 | let path = Path::new(MASTERKEYS_PATH); 227 | let display = path.display(); 228 | 229 | let mut fp = match File::open(&path) { 230 | Ok(fp) => fp, 231 | Err(e) => { 232 | println!("Failed to open file {}: {}", display, e); 233 | return false; 234 | } 235 | }; 236 | 237 | let mut keys = String::new(); 238 | 239 | match fp.read_to_string(&mut keys) { 240 | Ok(_) => (), 241 | Err(e) => { 242 | println!("Failed to read file {}: {}", display, e); 243 | return false; 244 | } 245 | }; 246 | 247 | for key in keys.split("\n") { 248 | if key.contains(&public_key) { 249 | return true; 250 | } 251 | } 252 | 253 | for g in &bot.groups { 254 | if g.groupnumber != groupnumber { 255 | continue; 256 | } 257 | 258 | if g.owner_pk == public_key { 259 | return true; 260 | } 261 | 262 | break; 263 | } 264 | 265 | false 266 | } 267 | 268 | fn cb_connection_status(bot: &mut Bot, status: Connection) 269 | { 270 | match status { 271 | Connection::None => bot.last_connect = get_time(), 272 | _ => (), 273 | } 274 | 275 | println!("DHT connection status: {:?}", status); 276 | } 277 | 278 | fn cb_friend_request(bot: &mut Bot, id: PublicKey, message: &str) 279 | { 280 | let id_string = id.to_string(); 281 | println!("Friend request from:\n{}", id_string); 282 | println!("Message: {}", message); 283 | 284 | match bot.tox.add_friend_norequest(&id) { 285 | Ok(_) => { 286 | println!("Friend added."); 287 | bot.save(); 288 | } 289 | Err(e) => println!("Failed to add friend ({:?})", e), 290 | }; 291 | } 292 | 293 | fn cb_group_invite(bot: &mut Bot, friendnumber: u32, _kind: ConferenceType, cookie: &Cookie) 294 | { 295 | bot.add_group(friendnumber, cookie); 296 | } 297 | 298 | fn cb_group_peerlist_change(bot: &mut Bot, groupnumber: u32) 299 | { 300 | let index = match get_group_index(bot, groupnumber) { 301 | Some(index) => index, 302 | None => return println!("get_group_index() failed in cb_group_peerlist_change() for groupnumber {}", groupnumber), 303 | }; 304 | 305 | let num_peers = bot.tox.conference_peer_count(groupnumber).unwrap(); 306 | let mut new_list: Vec = Vec::new(); 307 | 308 | for i in 0..num_peers { 309 | let public_key = match bot.tox.get_peer_public_key(groupnumber, i) { 310 | Ok(public_key) => public_key.to_string(), 311 | Err(_) => continue, 312 | }; 313 | 314 | let name = match bot.tox.get_peer_name(groupnumber, i) { 315 | Ok(name) => name, 316 | Err(e) => { 317 | println!("cb_group_peerlist_change() failed to fetch name for peer {}: {:?} (error: {:?})", i, public_key, e); 318 | continue; 319 | }, 320 | }; 321 | 322 | let round_score = match get_peer_index(&bot.groups[index].peers, &public_key) { 323 | Some(peer_idx) => bot.groups[index].peers[peer_idx].get_round_score(), 324 | None => 0, 325 | }; 326 | 327 | let rounds_won = match get_peer_index(&bot.groups[index].peers, &public_key) { 328 | Some(peer_idx) => bot.groups[index].peers[peer_idx].get_rounds_won(), 329 | None => 0, 330 | }; 331 | 332 | bot.db.set_nick(&name, &public_key); 333 | new_list.push(Peer::new(public_key, name, round_score, rounds_won)); 334 | } 335 | 336 | bot.groups[index].peers = new_list; 337 | } 338 | 339 | fn cb_group_message(bot: &mut Bot, groupnumber: u32, peernumber: u32, message: &str) 340 | { 341 | if message.is_empty() { 342 | return; 343 | } 344 | 345 | if message.as_bytes()[0] == b'!' { 346 | execute(bot, groupnumber, peernumber, message); 347 | } else { 348 | process_answer(bot, groupnumber, peernumber, message); 349 | } 350 | } 351 | 352 | fn cb_group_peername_change(bot: &mut Bot, groupnumber: u32, _peernumber: u32, _name: &str) 353 | { 354 | cb_group_peerlist_change(bot, groupnumber); 355 | } 356 | 357 | fn do_tox(bot: &mut Bot) 358 | { 359 | for event in bot.tox.iter() { 360 | match event { 361 | ConnectionStatus(status) => 362 | cb_connection_status(bot, status), 363 | FriendRequest(id, message) => 364 | cb_friend_request(bot, id, &message), 365 | ConferenceInvite { friend, kind, cookie } => 366 | cb_group_invite(bot, friend, kind, &cookie), 367 | ConferencePeerListChanged { conference } => 368 | cb_group_peerlist_change(bot, conference), 369 | ConferencePeerName { conference, peer, name } => 370 | cb_group_peername_change(bot, conference, peer, &name), 371 | ConferenceMessage { conference, peer, kind: _, message } => 372 | cb_group_message(bot, conference, peer, &message), 373 | _ => (), 374 | } 375 | } 376 | 377 | bot.tox.wait(); 378 | } 379 | 380 | fn do_connection(bot: &mut Bot) 381 | { 382 | match bot.tox.get_connection_status() { 383 | Connection::None => bootstrap_tox(bot), 384 | _ => (), 385 | } 386 | } 387 | fn do_rustybot(bot: &mut Bot) 388 | { 389 | do_tox(bot); 390 | do_trivia(bot); 391 | do_connection(bot); 392 | } 393 | 394 | fn kill(bot: &mut Bot) 395 | { 396 | bot.leave_all_groups(); 397 | bot.save(); 398 | 399 | println!("Exiting"); 400 | } 401 | 402 | fn main() 403 | { 404 | let mut tox = match load_tox() { 405 | Some(tox) => tox, 406 | None => return, 407 | }; 408 | 409 | init_tox(&mut tox); 410 | let mut bot = Bot::new(&mut tox); 411 | bot.save(); 412 | bot.print_info(); 413 | bot.db.load(); 414 | 415 | match load_trivia_questions(&mut bot) { 416 | Ok(_) => println!("Loaded."), 417 | Err(e) => println!("Trivia questions failed to load: {}", e), 418 | } 419 | 420 | let running = Arc::new(AtomicBool::new(true)); 421 | let r = running.clone(); 422 | 423 | ctrlc::set_handler(move || { r.store(false, Ordering::SeqCst); }) 424 | .expect("Error setting Ctrl-C handler"); 425 | 426 | while running.load(Ordering::SeqCst) { 427 | do_rustybot(&mut bot); 428 | } 429 | 430 | kill(&mut bot); 431 | } 432 | -------------------------------------------------------------------------------- /src/trivia.rs: -------------------------------------------------------------------------------- 1 | /* trivia.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use rand::seq::SliceRandom; 24 | use rand::{Rng, thread_rng}; 25 | use time::{get_time, Timespec, Duration}; 26 | use bot::Bot; 27 | use std::fmt::Write; 28 | use group::{get_group_index, get_peer_index, get_peer_public_key}; 29 | use util::*; 30 | 31 | const PUNCTUATION: &'static str = " .,':;<>/\\=-()*&^%$#@![]{}|~?\""; 32 | 33 | // Number of seconds before the answer is given 34 | const QUESTION_TIME_LIMIT: i64 = 30; 35 | 36 | // Minimum number of points to win in a round 37 | const BASE_POINTS: i64 = 30; 38 | 39 | // Points multiplier for time bonus 40 | const BONUS_POINTS_MULTIPLIER: i64 = 4; 41 | 42 | // Max number of rounds 43 | pub const MAX_ROUNDS: u32 = 30; 44 | 45 | // Seconds to wait between rounds 46 | const ROUND_DELAY: i64 = 3; 47 | 48 | pub struct Trivia { 49 | pub question: String, // Current round's question 50 | pub answer: String, // Current round's answer 51 | pub running: bool, // True if a game is currently going 52 | pub rounds: u32, // Current round number 53 | pub hints: Vec, // Colleciton of current round's hints 54 | pub hint_count: usize, // Number of hints given for the current round 55 | pub round_timer: Timespec, // Time since round began 56 | pub end_timer: Timespec, // Time since last round ended 57 | pub winner: bool, // True if the round has been won 58 | pub disabled: bool, // True if trivia has been disabled 59 | pub owner_key: String, // The owner of this particular round (enables !stop command) 60 | } 61 | 62 | impl Trivia { 63 | pub fn new() -> Trivia { 64 | Trivia { 65 | question: String::new(), 66 | answer: String::new(), 67 | running: false, 68 | rounds: 0, 69 | hint_count: 0, 70 | hints: Vec::new(), 71 | round_timer: Timespec::new(0, 0), 72 | end_timer: Timespec::new(0, 0), 73 | winner: false, 74 | disabled: false, 75 | owner_key: String::new(), 76 | } 77 | } 78 | 79 | pub fn reset(&mut self) { 80 | self.question.clear(); 81 | self.answer.clear(); 82 | self.running = false; 83 | self.rounds = 0; 84 | self.hints.clear(); 85 | self.hint_count = 0; 86 | self.round_timer = Timespec::new(0, 0); 87 | self.end_timer = Timespec::new(0, 0); 88 | self.winner = false; 89 | self.owner_key.clear(); 90 | } 91 | 92 | pub fn new_game(&mut self, owner_key: &str) { 93 | self.running = true; 94 | self.owner_key = owner_key.to_string(); 95 | } 96 | 97 | /* Returns true if a new round is successfully set up */ 98 | pub fn new_round(&mut self, questions: &Vec) -> bool { 99 | self.winner = false; 100 | self.question.clear(); 101 | self.answer.clear(); 102 | self.hints.clear(); 103 | 104 | if !timed_out(self.end_timer, ROUND_DELAY) { 105 | return false; 106 | } 107 | 108 | let mut rng = thread_rng(); 109 | let idx = rng.gen_range(0, questions.len()); 110 | let split: Vec<&str> = questions[idx].split("`").collect(); 111 | 112 | self.hint_count = 0; 113 | self.rounds += 1; 114 | 115 | if split.len() < 2 { 116 | return false; 117 | } 118 | 119 | self.question = split[0].trim().to_string(); 120 | self.answer = split[1].trim().to_string(); 121 | self.round_timer = get_time(); 122 | self.hints = generate_hints(&self.answer); 123 | 124 | true 125 | } 126 | 127 | pub fn get_hint(&mut self) -> String { 128 | if !self.running { 129 | return "Cram it".to_string(); 130 | } 131 | 132 | let hint = match self.hints.pop() { 133 | Some(hint) => hint.to_string(), 134 | None => "No more hints".to_string(), 135 | }; 136 | 137 | hint 138 | } 139 | 140 | /* The score is based on how many seconds are left in the round and how many hints have been used */ 141 | fn get_score(&self) -> u64 { 142 | let delta = Duration::seconds(QUESTION_TIME_LIMIT) - (get_time() - self.round_timer); 143 | let t = Duration::num_seconds(&delta) + 1; 144 | let score = (t * BONUS_POINTS_MULTIPLIER / (self.hint_count as i64 + 1)) + BASE_POINTS; 145 | score as u64 146 | } 147 | } 148 | 149 | fn answer_is_year(answer: &str) -> bool 150 | { 151 | if answer.len() != 4 { 152 | return false; 153 | } 154 | 155 | for ch in answer.chars() { 156 | if ch < '0' || ch > '9' { 157 | return false; 158 | } 159 | } 160 | 161 | let first_char = answer.chars().nth(0).unwrap(); 162 | first_char == '1' || first_char == '2' 163 | } 164 | 165 | /* Creates a vector of hints for the current answer. Hints are ordered by least to most letters revealed. */ 166 | fn generate_hints(answer: &str) -> Vec 167 | { 168 | let mut hints = Vec::new(); 169 | let len = answer.len(); 170 | 171 | if len <= 3 { 172 | return hints; 173 | } 174 | 175 | // If answer is a year we always give first and third digit 176 | if answer_is_year(answer) { 177 | let mut hint = String::new(); 178 | 179 | for (i, ch) in answer.chars().enumerate() { 180 | hint = if i % 2 == 0 { hint + &ch.to_string() } else { hint + "-" }; 181 | } 182 | 183 | return vec![hint]; 184 | } 185 | 186 | let mut used = vec![false; len]; // Marks used indices 187 | let mut indices = Vec::new(); // Holds unused indices in random order 188 | 189 | // Spaces and punctuation are freebies 190 | for (i, ch) in answer.chars().enumerate() { 191 | let p = ch.to_string(); 192 | 193 | if PUNCTUATION.contains(&p) { 194 | used[i] = true; 195 | } else { 196 | indices.push(i); 197 | } 198 | } 199 | 200 | let mut rng = thread_rng(); 201 | indices.shuffle(&mut rng); 202 | 203 | let chars_per_hint = len / 4; 204 | let num_hints = ((len / 2) / chars_per_hint) + 1; 205 | 206 | for _ in 0..num_hints { 207 | let mut hint = String::new(); 208 | 209 | for _ in 0..chars_per_hint { 210 | let idx = indices.pop().unwrap_or(0); 211 | used[idx] = true; 212 | } 213 | 214 | for (i, ch) in answer.chars().enumerate() { 215 | hint = if used[i] { hint + &ch.to_string() } else { hint + "-" }; 216 | } 217 | 218 | hints.push(hint); 219 | } 220 | 221 | hints.into_iter().rev().collect() 222 | } 223 | 224 | pub fn process_answer(bot: &mut Bot, groupnumber: u32, peernumber: u32, message: &str) 225 | { 226 | let index = match get_group_index(bot, groupnumber) { 227 | Some(index) => index, 228 | None => return println!("get_group_index() failed in process_answer() for groupnumber {}", groupnumber), 229 | }; 230 | 231 | if !bot.groups[index].trivia.running { 232 | return; 233 | } 234 | 235 | if bot.groups[index].trivia.winner { 236 | return; 237 | } 238 | 239 | if message.to_lowercase() != bot.groups[index].trivia.answer.to_lowercase() { 240 | return; 241 | } 242 | 243 | let public_key = match get_peer_public_key(bot.tox, groupnumber, peernumber) { 244 | Some(key) => key, 245 | None => return println!("get_peer_public_key() failed in process_answer() for groupnumber {}, peernumber {}", 246 | groupnumber, peernumber), 247 | }; 248 | 249 | let peer_idx = match get_peer_index(&mut bot.groups[index].peers, &public_key) { 250 | Some(idx) => idx, 251 | None => return println!("get_peer_index() failed in process_answer() for public_key {:?}", public_key.to_string()), 252 | }; 253 | 254 | let points = bot.groups[index].trivia.get_score(); 255 | bot.groups[index].peers[peer_idx].update_round_score(points); 256 | let score = bot.groups[index].peers[peer_idx].get_round_score(); 257 | let rounds_won = bot.groups[index].peers[peer_idx].get_rounds_won(); 258 | let peername = bot.groups[index].peers[peer_idx].get_nick(); 259 | 260 | let mut response = String::new(); 261 | write!(&mut response, "{} got the answer for {} points (Total: {} points, {} rounds)", 262 | peername, points, score, rounds_won).unwrap(); 263 | bot.groups[index].send_message(bot.tox, &response); 264 | 265 | bot.groups[index].trivia.winner = true; 266 | bot.groups[index].trivia.end_timer = get_time(); 267 | bot.groups[index].trivia.round_timer = Timespec::new(0, 0); 268 | } 269 | 270 | pub fn do_trivia(bot: &mut Bot) 271 | { 272 | for group in &mut bot.groups { 273 | if group.trivia.running { 274 | if timed_out(group.trivia.round_timer, QUESTION_TIME_LIMIT) { 275 | group.next_trivia_question(bot.tox, &bot.questions, &mut bot.db); 276 | } 277 | } 278 | } 279 | } 280 | -------------------------------------------------------------------------------- /src/util.rs: -------------------------------------------------------------------------------- 1 | /* util.rs 2 | * 3 | * 4 | * Copyright (C) 2015 rustybot All Rights Reserved. 5 | * 6 | * This file is part of rustybot. 7 | * 8 | * rustybot is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * rustybot is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with rustybot. If not, see . 20 | * 21 | */ 22 | 23 | use std::fs::{OpenOptions, File}; 24 | use std::path::Path; 25 | use std::io::prelude::*; 26 | use std::io::BufWriter; 27 | use std::io::Cursor; 28 | use time::{get_time, Timespec, Duration}; 29 | use byteorder::{LittleEndian, ReadBytesExt}; 30 | 31 | // Number of bytes in an unsigned 32-bit integer 32 | pub const SIZE_U32: usize = 4; 33 | 34 | // Number of bytes in an unsigned 64-bit integer 35 | pub const SIZE_U64: usize = 8; 36 | 37 | /* Returns true if timestamp t has timed out in respect to the provided timeout value */ 38 | pub fn timed_out(t: Timespec, timeout: i64) -> bool 39 | { 40 | t + Duration::seconds(timeout) <= get_time() 41 | } 42 | 43 | /* 44 | * Attempts to open file with path_name and return the file. 45 | * If create is true the file will be force created. 46 | */ 47 | pub fn open_file>(path: P, create: bool) -> Option 48 | { 49 | let mut options = OpenOptions::new(); 50 | 51 | match options.read(true).create(create).append(true).open(&path) { 52 | Ok(fp) => return Some(fp), 53 | Err(e) => { 54 | println!("Failed to open file with error: {}", e); 55 | return None; 56 | }, 57 | }; 58 | } 59 | 60 | /* Saves an arbitrary byte vector to path_name. */ 61 | pub fn save_data(path_name: &str, data: &Vec) -> Result 62 | { 63 | let path = Path::new(path_name); 64 | let display = path.display(); 65 | let mut options = OpenOptions::new(); 66 | 67 | let fp = options.write(true).create(true).open(&path) 68 | .map_err(|e| format!("Couldn't open file {}: {}", display, e))?; 69 | 70 | let mut writer = BufWriter::new(&fp); 71 | 72 | let size = writer.write(&data) 73 | .map_err(|e| format!("Couldn't write to file {}: {}", display, e))?; 74 | Ok(size) 75 | } 76 | 77 | /* Copies up to max_bytes bytes of a string into buf. If string is smaller than max_bytes, pads with zeroes. */ 78 | pub fn string_to_nbytes(s: &str, buf: &mut Vec, max_bytes: usize) 79 | { 80 | for (i, byte) in s.as_bytes().iter().enumerate() { 81 | if i >= max_bytes { 82 | break; 83 | } 84 | 85 | buf.push(*byte); 86 | } 87 | 88 | let len = s.len(); 89 | 90 | if len >= max_bytes { 91 | return; 92 | } 93 | 94 | let padding = max_bytes - len; 95 | 96 | for _ in 0..padding { 97 | buf.push(0); 98 | } 99 | } 100 | 101 | /* Converts a unsigned 32-bit integer into bytes in little-endian order and pushes them to buf */ 102 | pub fn u32_to_bytes_le(val: u32, buf: &mut Vec) 103 | { 104 | buf.push(val as u8); 105 | buf.push((val >> 8) as u8); 106 | buf.push((val >> 16) as u8); 107 | buf.push((val >> 24) as u8); 108 | } 109 | 110 | /* Converts bytes in little-endian order to an unsigned 32-bit integer*/ 111 | pub fn bytes_le_to_u32(buf: &[u8]) -> u32 112 | { 113 | let mut temp = Cursor::new(buf); 114 | temp.read_u32::().unwrap_or(0) 115 | } 116 | 117 | /* Converts a unsigned 64-bit integer into bytes in little-endian order and pushes them to buf vector */ 118 | pub fn u64_to_bytes_le(val: u64, buf: &mut Vec) 119 | { 120 | buf.push(val as u8); 121 | buf.push((val >> 8) as u8); 122 | buf.push((val >> 16) as u8); 123 | buf.push((val >> 24) as u8); 124 | buf.push((val >> 32) as u8); 125 | buf.push((val >> 40) as u8); 126 | buf.push((val >> 48) as u8); 127 | buf.push((val >> 56) as u8); 128 | } 129 | 130 | /* Converts bytes in little-endian order to an unsigned 64-bit integer */ 131 | pub fn bytes_le_to_u64(buf: &[u8]) -> u64 132 | { 133 | let mut temp = Cursor::new(buf); 134 | temp.read_u64::().unwrap_or(0) 135 | } 136 | --------------------------------------------------------------------------------