├── .github └── workflows │ └── ci.yaml ├── .gitignore ├── LICENSE ├── README.md ├── data-in-depth ├── Cargo.toml └── src │ └── main.rs ├── elipu ├── Cargo.toml └── src │ └── main.rs ├── fibonacci-1 ├── Cargo.toml └── src │ ├── fibonacci │ ├── dynamic.rs │ ├── mod.rs │ └── rec.rs │ └── main.rs ├── frominto ├── Cargo.toml └── src │ └── main.rs ├── hello-world ├── Cargo.toml └── src │ └── main.rs ├── linked-list ├── Cargo.toml └── src │ └── main.rs ├── mandelbrot ├── Cargo.toml └── src │ └── main.rs ├── matrix ├── Cargo.toml └── src │ ├── main.rs │ └── sample.csv ├── ownership ├── Cargo.toml └── src │ └── main.rs ├── phonebook ├── Cargo.toml └── src │ ├── contact │ └── mod.rs │ ├── main.rs │ └── phonebook │ └── mod.rs ├── rcalc ├── Cargo.toml └── src │ ├── main.rs │ └── parsemath │ ├── mod.rs │ ├── token.rs │ └── tokenizer.rs ├── rds ├── .gitignore ├── Cargo.toml └── src │ ├── heap │ └── mod.rs │ └── lib.rs ├── recho ├── Cargo.toml └── src │ └── main.rs ├── slices ├── Cargo.toml └── src │ └── main.rs ├── tryfrom ├── Cargo.toml └── src │ └── main.rs └── word-count-parham ├── Cargo.toml ├── src └── main.rs └── test.txt /.github/workflows/ci.yaml: -------------------------------------------------------------------------------- 1 | --- 2 | name: ci 3 | on: 4 | push: 5 | 6 | jobs: 7 | cargo: 8 | name: cargo 9 | runs-on: ubuntu-latest 10 | defaults: 11 | run: 12 | working-directory: ${{ matrix.projects }} 13 | strategy: 14 | matrix: 15 | projects: 16 | - phonebook 17 | - rds 18 | - word-count-parham 19 | - recho 20 | - data-in-depth 21 | - elipu 22 | - fibonacci-1 23 | steps: 24 | - name: checkout sources 25 | uses: actions/checkout@v5 26 | - name: install stable toolchain 27 | uses: dtolnay/rust-toolchain@v1 28 | with: 29 | toolchain: stable 30 | components: rustfmt, clippy 31 | - name: run cargo fmt 32 | run: cargo fmt --all -- --check 33 | - name: run cargo clippy 34 | run: cargo clippy -- -D warnings 35 | - run: | 36 | if [ -f docker-compose.yml ]; then 37 | docker-compose up -d 38 | fi 39 | - run: cargo test 40 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Created by https://www.toptal.com/developers/gitignore/api/rust 2 | # Edit at https://www.toptal.com/developers/gitignore?templates=rust 3 | 4 | ### Rust ### 5 | # Generated by Cargo 6 | # will have compiled files and executables 7 | debug/ 8 | target/ 9 | 10 | # Remove Cargo.lock from gitignore if creating an executable, leave it for libraries 11 | # More information here https://doc.rust-lang.org/cargo/guide/cargo-toml-vs-cargo-lock.html 12 | Cargo.lock 13 | 14 | # These are backup files generated by rustfmt 15 | **/*.rs.bk 16 | 17 | # MSVC Windows builds of rustc generate these, which store debugging information 18 | *.pdb 19 | 20 | # End of https://www.toptal.com/developers/gitignore/api/rust 21 | -------------------------------------------------------------------------------- /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 |
2 |

Rust 101

3 |
Learning Rust with the love of your life
4 | GitHub Workflow Status (with event) 5 |
6 | 7 | ## Introduction 8 | 9 | Easy to understand applications with Rust just for having fun :relieved:. 10 | 11 | ## Tools 12 | 13 | ### rustc 14 | 15 | The Rust compiler 16 | 17 | ### cargo 18 | 19 | The Rust dependency/project manager 20 | 21 | ### Rustup 22 | 23 | Rustup manages the rust versions, required programs, etc. It is a great program to simplify your rust programming workflow. 24 | 25 | ## Dependencies 26 | 27 | Rust handles dependencies by hand in `cargo.toml` file. In this file you specify the dependencies by their required version. 28 | 29 | ```bash 30 | # Create a new Cargo package 31 | carg new 32 | 33 | # Build and install a Rust binary 34 | cargo install 35 | 36 | # Compile the current package 37 | cargo build 38 | 39 | # Search packages in crates.io 40 | cargo search 41 | 42 | # Build a package's documentation 43 | cargo doc 44 | 45 | # Execute unit and integration tests of a package 46 | cargo test 47 | 48 | # Automatically fix lint warnings reported by rustc 49 | cargo fix 50 | 51 | # Execute benchmarks of a package 52 | cargo bench 53 | ``` 54 | 55 | For finding about latest release of each cargo you can use [Docs.rs](https://docs.rs). 56 | 57 | ## Expression vs Statement 58 | 59 | Statement is instruction that performs some action and do not return a value. 60 | Expressions evaluate to a resulting value. 61 | 62 | The `let y = 6` statement doesn't return a value. This is different from what happens in other languages, such as C and Ruby, where the assignment returns the value of the assignment. 63 | 64 | These are expressions: 65 | 66 | - The `6` in the statement `let y = 6;` 67 | - Calling a function 68 | - Calling a macro 69 | - {} 70 | 71 | ## Print 72 | 73 | rust has `println!` macro which has `{}` for normal printing, `{:?}` for debug printing and `{:p}` for pointers. 74 | 75 | ## Match 76 | 77 | ```rust 78 | let some_u8_value = Some(0u8); 79 | if let Some(3) = some_u8_value { 80 | println!("three"); 81 | } 82 | 83 | let some\*u8_value = 0u8; 84 | match some_u8_value { 85 | 1 => println!("one"), 86 | 2 => println!("two"), 87 | 88 | - => (), 89 | } 90 | 91 | # [derive(Debug)] 92 | 93 | enum UsState { 94 | Alabama, 95 | // --snip-- 96 | } 97 | 98 | enum Coin { 99 | Penny, 100 | Nickel, 101 | Dime, 102 | Quarter(UsState) 103 | } 104 | 105 | match coin { 106 | Coin::Penny => 1, 107 | Coin::Nickel => 2, 108 | Coin::Dime => 10, 109 | Coin::Quarter(state) => { 110 | println!("State quarter from {:?}!", state); 111 | 25 112 | }, 113 | } 114 | 115 | ``` 116 | 117 | ## Loops 118 | 119 | ```rust 120 | let result = loop { 121 | counter += 1; 122 | if counter == 10 { 123 | break counter * 2; 124 | } 125 | }; 126 | ``` 127 | 128 | ```rust 129 | let a = [10, 20, 30, 40, 50]; 130 | 131 | for element in a.iter() { 132 | println!("the value is: {}", element) 133 | } 134 | 135 | for number in (1..4).rev() { 136 | println!("{}!", number) 137 | } 138 | ``` 139 | 140 | ## Stack vs. Heap 141 | 142 | All data stored on the stack must have a known, fixed size. Data with an unknown size at compile time or a size might change must be stored on the heap instead. 143 | string literals (`str` type) are stored on executable and we know them at the compile time. `String`s are stored on heap and we get their memory at the runtime from the heap. 144 | We need to free heap memory and rust will do this by calling the `drop` function on that complex type. 145 | 146 | ## Ownership 147 | 148 | Assignments in rust may copy or move the variable if variable has the copy trait rust will uses copy otherwise it uses move. 149 | types that doesn't have drop method in them or their parts can have copy trait otherwise there would be a compile error unless you implement the clone trait. 150 | With references you can prevent moving variables. 151 | 152 | ## Iterators 153 | 154 | iterators have method for casting them into collections which is named /collect/. 155 | 156 | ## Arrays 157 | 158 | Rust arrays have fixed size and can be defined in the following ways: 159 | 160 | ```rust 161 | let a1 = [1, 2, 3] 162 | let a2: [u64; 5] = [1, 2, 3, 4, 5] 163 | 164 | ``` 165 | 166 | Invalid array access doesn't cause compile error in Rust but it cause panic at runtime. Go in this case creates compile error. 167 | 168 | ## Slice 169 | 170 | Slice is reference to its underlying array: 171 | 172 | ```rust 173 | 174 | let s = String::from("hello") 175 | 176 | let slice = &s[..] 177 | let slice = &s[0..] 178 | 179 | ``` 180 | 181 | ## Traits 182 | 183 | traits are similar to interface in go. they can be implemented on structures or their references. 184 | 185 | ## Github Actions 186 | 187 | [Unofficial GitHub Actions for Rust programming language](https://github.com/actions-rs) 188 | 189 | ## To Read 190 | 191 | - [writing an os in rust](https://github.com/phil-opp/blog_os) 192 | 193 | ## Crates 194 | 195 | - [clap is a simple-to-use, efficient, and full-featured library for parsing command line arguments and subcommands when writing console/terminal applications.](https://docs.rs/clap/) 196 | - [Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.](https://serde.rs) 197 | - [The reqwest crate provides a convenient, higher-level HTTP Client.](https://docs.rs/reqwest) 198 | - [Rust client for NATS, the cloud native messaging system.](https://github.com/nats-io/nats.rs) 199 | - [Tokio is an asynchronous runtime for the Rust programming language.](https://tokio.rs) 200 | - [Termion is a pure Rust, bindless library for low-level handling, manipulating and reading information about terminals. This provides a full-featured alternative to Termbox.](https://docs.rs/termion) 201 | 202 | ## Projects 203 | 204 | ### Phone Book 📱 205 | 206 | Phone book application stores users and their phones as struct. 207 | It has an uncomplicated menu, 208 | and users can add, get, and remove entities. 209 | 210 | ### Word Count 🔢 211 | 212 | This application receives a delimiter and some entries 213 | (i.e. some text files or array of strings) and after separation based on a delimiter, 214 | it will count and calculate the number of each word in the entries. 215 | 216 | ### Data in Depth 217 | 218 | This example is based on _Rust in Action_ book and shows how data is stored. 219 | One of its example use rust overflow panic and 220 | if you build it in release mode then you don't have it. 221 | 222 | ### BPF 223 | 224 | To write BPF code in Rust, it's easiest to use cargo-bpf (part of the `redbpf` suite) 225 | which handles setting up the project and can even function as a development loader. 226 | 227 | ```bash 228 | sudo pacman -Syu llvm 229 | cargo install cargo-bpf --features=llvm13 230 | ``` 231 | 232 | ```bash 233 | cargo bpf new elbpf 234 | cargo bpf add hello 235 | ``` 236 | -------------------------------------------------------------------------------- /data-in-depth/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "data-in-depth" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /data-in-depth/src/main.rs: -------------------------------------------------------------------------------- 1 | fn main() { 2 | print_16bit_integers(); 3 | print_32bit_float(); 4 | print_32bit_int(); 5 | // count_to_infinity(); 6 | split_float32(); 7 | } 8 | 9 | fn print_16bit_integers() { 10 | let a: u16 = 1378; 11 | let b: i16 = -1378; 12 | 13 | println!("a: {:016b} {}", a, a); 14 | println!("b: {:016b} {}", b, b); 15 | 16 | let c: u16 = i16::cast_unsigned(-1378i16); 17 | 18 | println!("c: {:016b} {}", c, c); 19 | } 20 | 21 | fn print_32bit_float() { 22 | let f: f32 = 1378.1373; 23 | 24 | let fake: u32 = f.to_bits(); 25 | 26 | println!( 27 | "32bit float representation in bits: {:032b} {} - {}", 28 | fake, fake, f 29 | ); 30 | } 31 | 32 | fn print_32bit_int() { 33 | let i: u32 = 1378; 34 | 35 | println!("32bit uint representation: {:032b} {}", i, i); 36 | } 37 | 38 | fn _count_to_infinity() { 39 | let mut i: u16 = 0; 40 | print!("{}...", i); 41 | 42 | loop { 43 | i += 1000; 44 | print!("{}...", i); 45 | if i % 10000 == 0 { 46 | println!(); 47 | } 48 | } 49 | } 50 | 51 | fn split_float32() { 52 | let n: f32 = 1378.1378; 53 | 54 | let n_bits: u32 = n.to_bits(); 55 | 56 | let sign_bit = n_bits >> 31; 57 | println!("{}", sign_bit); 58 | 59 | let exponent = (((n_bits >> 23) & 0xff) as i32) - 127; 60 | println!("{}", exponent); 61 | 62 | let mut mantissa: f32 = 1.0; 63 | 64 | for i in 0..23 { 65 | let mask = 1 << i; 66 | let one_at_bit_i = n_bits & mask; 67 | 68 | if one_at_bit_i != 0 { 69 | mantissa += 2f32.powf(i as f32 - 23.0); 70 | } 71 | } 72 | println!("{}", mantissa); 73 | } 74 | -------------------------------------------------------------------------------- /elipu/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "elipu" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /elipu/src/main.rs: -------------------------------------------------------------------------------- 1 | struct Cpu { 2 | registers: [u8; 16], 3 | position_in_memory: usize, 4 | memory: [u8; 0x1000], 5 | // the stack's minimum height is 16. after 16 nested function calls, the 6 | // program encounters a stack overflow. 7 | stack: [u16; 16], 8 | stack_pointer: usize, 9 | } 10 | 11 | impl Cpu { 12 | fn read_opcode(&self) -> u16 { 13 | let p = self.position_in_memory; 14 | let op_byte1 = self.memory[p] as u16; 15 | let op_byte2 = self.memory[p + 1] as u16; 16 | 17 | op_byte1 << 8 | op_byte2 18 | } 19 | 20 | fn call(&mut self, addr: u16) { 21 | let sp = self.stack_pointer; 22 | let stack = &mut self.stack; 23 | 24 | if sp > stack.len() { 25 | panic!("stack overflow"); 26 | } 27 | 28 | stack[sp] = self.position_in_memory as u16; 29 | self.stack_pointer += 1; 30 | self.position_in_memory = addr as usize; 31 | } 32 | 33 | fn ret(&mut self) { 34 | if self.stack_pointer == 0 { 35 | panic!("stack underflow"); 36 | } 37 | 38 | self.stack_pointer -= 1; 39 | let call_addr = self.stack[self.stack_pointer]; 40 | self.position_in_memory = call_addr as usize; 41 | } 42 | 43 | fn run(&mut self) { 44 | loop { 45 | let opcode = self.read_opcode(); 46 | self.position_in_memory += 2; 47 | 48 | let c = ((opcode & 0xF000) >> 12) as u8; 49 | let x = ((opcode & 0x0F00) >> 8) as u8; 50 | let y = ((opcode & 0x00F0) >> 4) as u8; 51 | let d = (opcode & 0x000F) as u8; 52 | 53 | let nnn = opcode & 0xFFF; 54 | 55 | match (c, x, y, d) { 56 | (0, 0, 0, 0) => return, 57 | (0x8, _, _, 0x4) => self.add_xy(x, y), 58 | (0, 0, 0xE, 0xE) => self.ret(), 59 | (0x2, _, _, _) => self.call(nnn), 60 | _ => todo!("opcode {:04x}", opcode), 61 | } 62 | } 63 | } 64 | 65 | fn add_xy(&mut self, x: u8, y: u8) { 66 | let (res, is_overflow) = 67 | self.registers[x as usize].overflowing_add(self.registers[y as usize]); 68 | self.registers[x as usize] = res; 69 | 70 | if is_overflow { 71 | self.registers[0xF] = 1; 72 | } else { 73 | self.registers[0xF] = 0; 74 | } 75 | } 76 | } 77 | 78 | fn main() { 79 | let mut cpu = Cpu { 80 | registers: [0; 16], 81 | memory: [0; 0x1000], 82 | position_in_memory: 0, 83 | stack: [0; 16], 84 | stack_pointer: 0, 85 | }; 86 | 87 | cpu.registers[0] = 5; 88 | cpu.registers[1] = 10; 89 | cpu.registers[2] = 10; 90 | cpu.registers[3] = 10; 91 | 92 | let mem = &mut cpu.memory; 93 | mem[0x000] = 0x21; // call 0x100 94 | mem[0x001] = 0x00; 95 | 96 | mem[0x002] = 0x21; // call 0x100 97 | mem[0x003] = 0x00; 98 | 99 | mem[0x004] = 0x00; // exit 100 | mem[0x005] = 0x00; 101 | 102 | mem[0x100] = 0x80; // add reg[0] reg[1] 103 | mem[0x101] = 0x14; 104 | 105 | mem[0x102] = 0x80; // add reg[0] reg[1] 106 | mem[0x103] = 0x14; 107 | 108 | mem[0x104] = 0x00; // ret 109 | mem[0x105] = 0xEE; 110 | 111 | cpu.run(); 112 | 113 | assert_eq!(cpu.registers[0], 45); 114 | 115 | println!("5 + 10 + 10 + 10 + 10 = {}", cpu.registers[0]); 116 | } 117 | -------------------------------------------------------------------------------- /fibonacci-1/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "fibonacci-1" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /fibonacci-1/src/fibonacci/dynamic.rs: -------------------------------------------------------------------------------- 1 | use crate::fibonacci::{Fibonacci, Iter}; 2 | 3 | pub struct Dynamic { 4 | data: Vec, 5 | } 6 | 7 | impl Default for Dynamic { 8 | fn default() -> Self { 9 | Self::new() 10 | } 11 | } 12 | 13 | impl Dynamic { 14 | pub fn new() -> Self { 15 | Dynamic { data: vec![1, 1] } 16 | } 17 | } 18 | 19 | impl Fibonacci for Dynamic { 20 | fn fibonacci(&mut self, n: usize) -> i64 { 21 | match self.data.get(n) { 22 | Some(v) => *v, 23 | None => { 24 | let v = self.fibonacci(n - 1) + self.fibonacci(n - 2); 25 | self.data.insert(n, v); 26 | v 27 | } 28 | } 29 | } 30 | } 31 | 32 | impl<'a> IntoIterator for &'a mut Dynamic { 33 | type Item = i64; 34 | 35 | type IntoIter = Iter<'a, Dynamic>; 36 | 37 | fn into_iter(self) -> Self::IntoIter { 38 | Self::IntoIter { 39 | n: 0, 40 | generator: self, 41 | } 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /fibonacci-1/src/fibonacci/mod.rs: -------------------------------------------------------------------------------- 1 | use crate::fibonacci::{dynamic::Dynamic, rec::Recursive}; 2 | 3 | mod dynamic; 4 | mod rec; 5 | 6 | pub trait Fibonacci { 7 | fn fibonacci(&mut self, n: usize) -> i64; 8 | } 9 | 10 | pub struct Iter<'a, T: Fibonacci> { 11 | n: usize, 12 | generator: &'a mut T, 13 | } 14 | 15 | impl<'a, T: Fibonacci> Iterator for Iter<'a, T> { 16 | type Item = i64; 17 | 18 | fn next(&mut self) -> Option { 19 | self.n += 1; 20 | Some(self.generator.fibonacci(self.n - 1)) 21 | } 22 | } 23 | 24 | pub fn choose(name: &str) -> Box { 25 | match name { 26 | "recursive" => Box::new(Recursive {}), 27 | "dynamic" => Box::new(Dynamic::new()), 28 | _ => panic!("no such a fibonacci implementation named {}", name), 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /fibonacci-1/src/fibonacci/rec.rs: -------------------------------------------------------------------------------- 1 | use crate::fibonacci::{Fibonacci, Iter}; 2 | 3 | pub struct Recursive {} 4 | 5 | impl Fibonacci for Recursive { 6 | fn fibonacci(&mut self, n: usize) -> i64 { 7 | if n == 0 || n == 1 { 8 | 1 9 | } else { 10 | self.fibonacci(n - 1) + self.fibonacci(n - 2) 11 | } 12 | } 13 | } 14 | 15 | impl<'a> IntoIterator for &'a mut Recursive { 16 | type Item = i64; 17 | 18 | type IntoIter = Iter<'a, Recursive>; 19 | 20 | fn into_iter(self) -> Self::IntoIter { 21 | Self::IntoIter { 22 | n: 0, 23 | generator: self, 24 | } 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /fibonacci-1/src/main.rs: -------------------------------------------------------------------------------- 1 | use crate::fibonacci::choose; 2 | 3 | mod fibonacci; 4 | 5 | fn main() { 6 | let mut r = choose("dynamic"); 7 | 8 | println!("{}", r.fibonacci(10)); 9 | } 10 | -------------------------------------------------------------------------------- /frominto/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "frominto" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /frominto/src/main.rs: -------------------------------------------------------------------------------- 1 | struct Number { 2 | v: i32, 3 | } 4 | 5 | impl> From for Number { 6 | fn from(value: T) -> Self { 7 | Self { v: value.into() } 8 | } 9 | } 10 | 11 | fn main() { 12 | let n = Number::from(10); 13 | println!("here is the {}", n.v); 14 | 15 | let n: Number = 1378.into(); 16 | println!("here is the {}", n.v); 17 | 18 | let v: i16 = 1373; 19 | let n: Number = v.into(); 20 | println!("here is the {}", n.v); 21 | } 22 | -------------------------------------------------------------------------------- /hello-world/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "hello-world" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /hello-world/src/main.rs: -------------------------------------------------------------------------------- 1 | use std::fmt; 2 | use std::ops::Add; 3 | 4 | fn add>(a: T, b: T) -> T { 5 | return a + b; 6 | } 7 | 8 | #[derive(Debug)] 9 | struct Person> { 10 | name: T, 11 | age: u8, 12 | } 13 | 14 | impl + fmt::Display> Person { 15 | fn hello(&self) -> String { 16 | return format!("Hello {}", self.name); 17 | } 18 | } 19 | 20 | // T is the inner type of the Person to store the name, here 21 | // we want it to have an implementation for display. 22 | impl + fmt::Display> fmt::Display for Person { 23 | fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { 24 | return write!( 25 | f, 26 | "There is a person with name: {} and age {}", 27 | self.name, self.age 28 | ); 29 | } 30 | } 31 | 32 | fn main() { 33 | println!("Hello, world!, because it is a hello world example"); 34 | 35 | let _h: &str = "Hello"; 36 | 37 | // create a person using an AsRef 38 | let mut p = Person { 39 | name: "Parham Alvani", 40 | age: 25, 41 | }; 42 | 43 | println!("{}", p); 44 | 45 | { 46 | let name: String = String::from("Elahe Dastan"); 47 | p.name = name.as_str(); 48 | 49 | println!("{}", p); 50 | } 51 | 52 | // uncomment the following line to get a nice compile error 53 | // because it __moves__ into inner context and name doesn't live 54 | // enough 55 | // println!("{}", p); 56 | 57 | let mut p = Person { 58 | name: String::from("Raha Dastan"), 59 | age: 23, 60 | }; 61 | 62 | p.name.push('!'); 63 | 64 | println!("{}", p); 65 | 66 | // learn about clourses 67 | let p = Person { 68 | name: "Parham Alvani", 69 | age: 25, 70 | }; 71 | 72 | let parham_namer = || { 73 | println!("{}", p.name); 74 | }; 75 | 76 | parham_namer(); 77 | parham_namer(); 78 | } 79 | -------------------------------------------------------------------------------- /linked-list/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "linked-list" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /linked-list/src/main.rs: -------------------------------------------------------------------------------- 1 | enum List { 2 | // Cons: Tuple struct that wraps an element and a pointer to the next node 3 | Cons(u32, Box), 4 | // Nil: A node that signifies the end of the linked list 5 | Nil, 6 | } 7 | 8 | impl List { 9 | // Create an empty list. 10 | fn new() -> List { 11 | List::Nil 12 | } 13 | 14 | // Consume a list, and return the same list with a new element at its front. 15 | fn prepend(self: Self, elem: u32) -> List { 16 | List::Cons(elem, Box::new(self)) 17 | } 18 | 19 | // Return the length of the list. 20 | fn len(self: &Self) -> u32 { 21 | // `self` has to be matched, because the behavior of this method 22 | // depends on the variant of `self`. 23 | 24 | // `self` has type `&List`, and `*self` has type `List`, matching on a 25 | // concrete type `T` is preferred over a match on a reference `&T`. 26 | match *self { 27 | // Can't take ownership of the tail, because `self` is borrowed; 28 | // instead take a reference to the tail. 29 | List::Cons(_, ref tail) => 1 + tail.len(), 30 | // Base Case: An empty list has zero length. 31 | List::Nil => 0, 32 | } 33 | } 34 | 35 | // Return representation of the list as a (heap allocated) string. 36 | fn stringify(&self) -> String { 37 | match *self { 38 | List::Cons(head, ref tail) => { 39 | // `format!` is similar to `print!`, but returns a heap 40 | // allocated string instead of printing to the console. 41 | format!("{}, {}", head, tail.stringify()) 42 | } 43 | List::Nil => { 44 | format!("Nil") 45 | } 46 | } 47 | } 48 | } 49 | 50 | fn main() { 51 | // Create an empty linked list. 52 | let mut list = List::new(); 53 | 54 | // Prepend some elements. 55 | list = list.prepend(1); 56 | list = list.prepend(2); 57 | list = list.prepend(3); 58 | 59 | println!("linked list has length: {}", list.len()); 60 | println!("{}", list.stringify()); 61 | } 62 | -------------------------------------------------------------------------------- /mandelbrot/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "mandelbrot" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | num = "0.4.1" 10 | -------------------------------------------------------------------------------- /mandelbrot/src/main.rs: -------------------------------------------------------------------------------- 1 | use num::complex::Complex; 2 | 3 | fn calculate_mandelbrot( 4 | max_iters: usize, 5 | x_min: f64, 6 | x_max: f64, 7 | y_min: f64, 8 | y_max: f64, 9 | width: usize, 10 | height: usize, 11 | ) -> Vec> { 12 | let mut rows: Vec<_> = Vec::with_capacity(width); 13 | for img_y in 0..height { 14 | let mut row: Vec = Vec::with_capacity(height); 15 | for img_x in 0..width { 16 | let x_percent = img_x as f64 / width as f64; 17 | let y_percent = img_y as f64 / height as f64; 18 | let cx = x_min + (x_max - x_min) * x_percent; 19 | let cy = y_min + (y_max - y_min) * y_percent; 20 | let escaped_at = mandelbrot_at_point(cx, cy, max_iters); 21 | 22 | row.push(escaped_at); 23 | } 24 | 25 | rows.push(row) 26 | } 27 | 28 | rows 29 | } 30 | 31 | fn mandelbrot_at_point(cx: f64, cy: f64, max_iters: usize) -> usize { 32 | let mut z = Complex { re: 0.0, im: 0.0 }; 33 | let c = Complex::new(cx, cy); 34 | 35 | for i in 0..=max_iters { 36 | if z.norm() > 2.0 { 37 | return i; 38 | } 39 | z = z * z + c; 40 | } 41 | 42 | max_iters 43 | } 44 | 45 | fn render_mandelbrot(escape_vals: Vec>) { 46 | for row in escape_vals { 47 | let mut line = String::with_capacity(row.len()); 48 | 49 | for column in row { 50 | let val = match column { 51 | 0..=2 => ' ', 52 | 3..=5 => '.', 53 | 6..=10 => '⬤', 54 | 11..=30 => '*', 55 | 31..=100 => '+', 56 | 101..=200 => 'X', 57 | 201..=400 => '$', 58 | 401..=700 => '#', 59 | _ => '%', 60 | }; 61 | 62 | line.push(val); 63 | } 64 | println!("{}", line); 65 | } 66 | } 67 | 68 | fn main() { 69 | let mandelbrot = calculate_mandelbrot(1000, 2.0, 1.0, -1.0, 1.0, 100, 24); 70 | 71 | render_mandelbrot(mandelbrot); 72 | } 73 | -------------------------------------------------------------------------------- /matrix/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "matrix" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | csv = "1.3.0" 10 | serde = { version = "1.0.195", features = ["derive"] } 11 | -------------------------------------------------------------------------------- /matrix/src/main.rs: -------------------------------------------------------------------------------- 1 | use csv::Error; 2 | use std::fs; 3 | use serde::Deserialize; 4 | 5 | #[derive(Deserialize)] 6 | struct Row { 7 | year: String, 8 | make: String, 9 | model: String, 10 | description: String, 11 | } 12 | 13 | fn main() -> Result<(), Error> { 14 | let contents = fs::read_to_string("src/sample.csv") 15 | .expect("Should have been able to read the file"); 16 | 17 | let mut reader = csv::Reader::from_reader(contents.as_bytes()); 18 | 19 | let mut matrix: Vec>; 20 | 21 | for record in reader.deserialize() { 22 | let row: Row = record?; 23 | 24 | let mut new_row = vec![vec![ 25 | row.year 26 | ] 27 | ]; 28 | matrix.append( 29 | &mut new_row, 30 | ); 31 | } 32 | 33 | println!("{:?}", matrix); 34 | 35 | Ok(()) 36 | } 37 | 38 | -------------------------------------------------------------------------------- /matrix/src/sample.csv: -------------------------------------------------------------------------------- 1 | year,make,model,description 2 | 1948,Porsche,356,Luxury sports car 3 | 1967,Ford,Mustang fastback 1967,American car -------------------------------------------------------------------------------- /ownership/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "ownership" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /ownership/src/main.rs: -------------------------------------------------------------------------------- 1 | struct Person { 2 | name: String, 3 | age: i32, 4 | } 5 | 6 | fn print(p: &Person) { 7 | println!("{} {}", p.name, p.age); 8 | } 9 | 10 | fn older(p: &mut Person, years: i32) { 11 | p.age += years; 12 | } 13 | 14 | fn main() { 15 | let p = Person{ 16 | name: String::from("Elahe Dastan"), 17 | age: 30, 18 | }; 19 | 20 | print(&p); 21 | 22 | p; 23 | } 24 | -------------------------------------------------------------------------------- /phonebook/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "phonebook" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /phonebook/src/contact/mod.rs: -------------------------------------------------------------------------------- 1 | pub struct Contact { 2 | pub first_name: String, 3 | pub last_name: String, 4 | pub phone: String, 5 | pub id: String, 6 | } 7 | -------------------------------------------------------------------------------- /phonebook/src/main.rs: -------------------------------------------------------------------------------- 1 | mod contact; 2 | mod phonebook; 3 | 4 | use std::io::Write; 5 | 6 | use crate::contact::Contact; 7 | use crate::phonebook::PhoneBook; 8 | 9 | fn main() { 10 | let mut phonebook = PhoneBook::new(); 11 | let stdin = std::io::stdin(); 12 | 13 | loop { 14 | print!("> "); 15 | let mut input = String::new(); 16 | 17 | std::io::stdout() 18 | .flush() 19 | .expect("flushing the output failed"); 20 | 21 | stdin.read_line(&mut input).unwrap(); 22 | 23 | let mut cmds = input.split_whitespace(); 24 | 25 | match cmds.next() { 26 | Some(cmd) => match cmd { 27 | "set" => { 28 | let mut contact = Contact { 29 | first_name: String::from(""), 30 | last_name: String::from(""), 31 | phone: String::from(""), 32 | id: String::from(""), 33 | }; 34 | 35 | if let Some(first_name) = cmds.next() { 36 | contact.first_name = String::from(first_name); 37 | } else { 38 | println!("set "); 39 | continue; 40 | } 41 | 42 | if let Some(last_name) = cmds.next() { 43 | contact.last_name = String::from(last_name); 44 | } else { 45 | println!("set "); 46 | continue; 47 | } 48 | 49 | if let Some(phone) = cmds.next() { 50 | contact.phone = String::from(phone); 51 | } else { 52 | println!("set "); 53 | continue; 54 | } 55 | 56 | if let Some(id) = cmds.next() { 57 | contact.id = String::from(id); 58 | } else { 59 | println!("set "); 60 | continue; 61 | } 62 | 63 | phonebook.insert(contact); 64 | } 65 | "get" => { 66 | if let Some(id) = cmds.next() { 67 | match phonebook.get(id) { 68 | Some(contact) => { 69 | println!("first_name: {}", contact.first_name); 70 | println!("last_name: {}", contact.last_name); 71 | println!("phone: {}", contact.phone); 72 | println!("id: {}", contact.id); 73 | } 74 | None => { 75 | println!("there is no contact with {}", id); 76 | continue; 77 | } 78 | } 79 | } else { 80 | println!("get "); 81 | continue; 82 | } 83 | } 84 | "exit" | "quit" => break, 85 | _ => { 86 | println!("unknown command {}", cmd); 87 | continue; 88 | } 89 | }, 90 | None => { 91 | println!("you need to specify a command"); 92 | continue; 93 | } 94 | } 95 | } 96 | } 97 | -------------------------------------------------------------------------------- /phonebook/src/phonebook/mod.rs: -------------------------------------------------------------------------------- 1 | use crate::contact::Contact; 2 | use std::collections::HashMap; 3 | 4 | pub struct PhoneBook { 5 | contacts: HashMap, 6 | } 7 | 8 | impl PhoneBook { 9 | pub fn new() -> PhoneBook { 10 | PhoneBook { 11 | contacts: HashMap::new(), 12 | } 13 | } 14 | 15 | pub fn insert(&mut self, contact: Contact) { 16 | self.contacts.insert(contact.id.clone(), contact); 17 | } 18 | 19 | pub fn get(&self, id: &str) -> Option<&Contact> { 20 | self.contacts.get(id) 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /rcalc/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "rcalc" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /rcalc/src/main.rs: -------------------------------------------------------------------------------- 1 | mod parsemath; 2 | 3 | use parsemath::tokenizer::Tokenizer; 4 | 5 | fn main() { 6 | let tz = Tokenizer::new("1+2/3"); 7 | 8 | for t in tz { 9 | println!("{:?}", t) 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /rcalc/src/parsemath/mod.rs: -------------------------------------------------------------------------------- 1 | pub mod token; 2 | pub mod tokenizer; 3 | -------------------------------------------------------------------------------- /rcalc/src/parsemath/token.rs: -------------------------------------------------------------------------------- 1 | #[derive(Debug)] 2 | pub enum Token { 3 | Add, 4 | Subtract, 5 | Multiply, 6 | Divide, 7 | Caret, 8 | LeftParen, 9 | RightParen, 10 | Num(f64), 11 | // Eof, 12 | } 13 | -------------------------------------------------------------------------------- /rcalc/src/parsemath/tokenizer.rs: -------------------------------------------------------------------------------- 1 | use super::token::Token; 2 | use std::iter::Peekable; 3 | use std::str::Chars; 4 | 5 | pub struct Tokenizer<'a> { 6 | expr: Peekable>, 7 | } 8 | 9 | impl<'a> Tokenizer<'a> { 10 | pub fn new(expr: &'a str) -> Self { 11 | Tokenizer { 12 | expr: expr.chars().peekable(), 13 | } 14 | } 15 | } 16 | 17 | impl<'a> Iterator for Tokenizer<'a> { 18 | type Item = Token; 19 | 20 | fn next(&mut self) -> Option { 21 | let next_char = self.expr.next(); 22 | 23 | match next_char { 24 | Some('0'..='9') => { 25 | let mut number = next_char?.to_string(); 26 | 27 | while let Some(next_char) = self.expr.peek() { 28 | if next_char.is_numeric() || next_char == &'.' { 29 | number.push(self.expr.next()?); 30 | } else { 31 | break; 32 | } 33 | } 34 | 35 | Some(Token::Num(number.parse::().unwrap())) 36 | } 37 | Some('+') => Some(Token::Add), 38 | Some('-') => Some(Token::Subtract), 39 | Some('*') => Some(Token::Multiply), 40 | Some('/') => Some(Token::Divide), 41 | Some('^') => Some(Token::Caret), 42 | Some('(') => Some(Token::LeftParen), 43 | Some(')') => Some(Token::RightParen), 44 | None => None, 45 | Some(_) => None, 46 | } 47 | } 48 | } 49 | -------------------------------------------------------------------------------- /rds/.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | Cargo.lock 3 | -------------------------------------------------------------------------------- /rds/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "rds" 3 | version = "0.1.0" 4 | edition = "2018" 5 | authors = ["Parham Alvani "] 6 | 7 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 8 | 9 | [dependencies] 10 | -------------------------------------------------------------------------------- /rds/src/heap/mod.rs: -------------------------------------------------------------------------------- 1 | use std::fmt::Display; 2 | 3 | pub trait Heap { 4 | fn top(&self) -> &T; 5 | fn peek(&mut self) -> T; 6 | fn insert(&mut self, element: T, priority: P); 7 | } 8 | 9 | pub struct DHeap { 10 | pairs: std::vec::Vec<(T, P)>, 11 | d: usize, 12 | } 13 | 14 | impl DHeap { 15 | pub fn new_heap2() -> DHeap { 16 | DHeap::new(2) 17 | } 18 | 19 | pub fn new(d: usize) -> DHeap { 20 | DHeap { 21 | pairs: std::vec::Vec::new(), 22 | d, 23 | } 24 | } 25 | 26 | // highest_priority_child for the given node returns its child index which has the 27 | // leargest priority. 28 | fn highest_priority_child(&self, index: usize) -> usize { 29 | let mut highest_priority_child = self.d * index + 1; 30 | for i in 1..self.d { 31 | let child_index = self.d * index + i + 1; 32 | match self.pairs.get(child_index) { 33 | Some(child) => { 34 | if child.1 > self.pairs[highest_priority_child].1 { 35 | highest_priority_child = child_index; 36 | } 37 | } 38 | None => break, 39 | } 40 | } 41 | 42 | highest_priority_child 43 | } 44 | 45 | // first_leaf_index return the index of the first leaf node. 46 | fn first_leaf_index(&self) -> usize { 47 | match self.pairs.len() { 48 | 0 | 1 => 0, 49 | _ => (self.pairs.len() - 2) / self.d + 1, 50 | } 51 | } 52 | 53 | // push_donw maintains the max heap property. 54 | // it moves an element from the top of heap to its position. 55 | fn push_down(&mut self, index: usize) { 56 | let mut current_index = index; 57 | 58 | while current_index < self.first_leaf_index() { 59 | let child_index = self.highest_priority_child(current_index); 60 | 61 | if self.pairs[child_index].1 > self.pairs[current_index].1 { 62 | self.pairs.swap(current_index, child_index); 63 | current_index = child_index; 64 | } else { 65 | break; 66 | } 67 | } 68 | } 69 | 70 | // bubble_up maintains the max heap property. 71 | // it moves an element from the button of heap to its position. 72 | fn bubble_up(&mut self, index: usize) { 73 | let mut parent_index = index; 74 | while parent_index > 0 { 75 | let current_index = parent_index; 76 | parent_index = (parent_index - 1) / self.d; 77 | 78 | if self.pairs[parent_index].1 < self.pairs[current_index].1 { 79 | self.pairs.swap(parent_index, current_index); 80 | } else { 81 | break; 82 | } 83 | } 84 | } 85 | } 86 | 87 | impl Heap for DHeap { 88 | fn top(&self) -> &T { 89 | &self.pairs[0].0 90 | } 91 | 92 | fn peek(&mut self) -> T { 93 | let (element, _) = self.pairs.remove(0); 94 | 95 | self.push_down(0); 96 | 97 | element 98 | } 99 | 100 | fn insert(&mut self, element: T, priority: P) { 101 | self.pairs.push((element, priority)); 102 | 103 | self.bubble_up(self.pairs.len() - 1); 104 | } 105 | } 106 | 107 | impl DHeap { 108 | pub fn update(&mut self, element: &T, priority: P) { 109 | let mut index = self.pairs.len(); 110 | 111 | for i in 0..self.pairs.len() { 112 | if self.pairs[i].0 == *element { 113 | index = i; 114 | } 115 | } 116 | 117 | if index == self.pairs.len() { 118 | return; 119 | } 120 | 121 | let direction = self.pairs[index].1 < priority; 122 | 123 | self.pairs[index].1 = priority; 124 | if direction { 125 | self.bubble_up(index); 126 | } else { 127 | self.push_down(index); 128 | } 129 | } 130 | } 131 | 132 | impl Display for DHeap 133 | where 134 | T: Display, 135 | P: PartialOrd, 136 | P: Display, 137 | { 138 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 139 | let mut r = String::new(); 140 | 141 | for (element, priority) in &self.pairs { 142 | r = if r.is_empty() { 143 | format!("({}, {})", element, priority) 144 | } else { 145 | format!("{} ({}, {})", r, element, priority) 146 | } 147 | } 148 | 149 | write!(f, "{}", r) 150 | } 151 | } 152 | 153 | #[cfg(test)] 154 | mod tests { 155 | use super::*; 156 | 157 | #[test] 158 | fn heap2_insert_peek() { 159 | let mut h = DHeap::::new_heap2(); 160 | 161 | h.insert(10, 10); 162 | h.insert(15, 20); 163 | h.insert(5, 5); 164 | 165 | assert_eq!(*h.top(), 15); 166 | assert_eq!(h.peek(), 15); 167 | assert_eq!(h.peek(), 10); 168 | assert_eq!(h.peek(), 5); 169 | } 170 | 171 | #[test] 172 | fn heap2_update() { 173 | let mut h = DHeap::<&str, i32>::new_heap2(); 174 | 175 | h.insert("Elahe", 100); 176 | h.insert("Parham", 0); 177 | h.insert("Iman", 120); 178 | 179 | assert_eq!(*h.top(), "Iman"); 180 | 181 | h.update(&"Iman", 80); 182 | 183 | assert_eq!(*h.top(), "Elahe"); 184 | } 185 | 186 | #[test] 187 | fn heap2_print() { 188 | let mut h = DHeap::<&str, i32>::new_heap2(); 189 | 190 | h.insert("Elahe", 200); 191 | h.insert("Parham", 0); 192 | h.insert("Iman", 120); 193 | 194 | assert_eq!(format!("{}", h), "(Elahe, 200) (Parham, 0) (Iman, 120)"); 195 | } 196 | } 197 | -------------------------------------------------------------------------------- /rds/src/lib.rs: -------------------------------------------------------------------------------- 1 | mod heap; 2 | 3 | pub use heap::*; 4 | -------------------------------------------------------------------------------- /recho/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "recho" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | clap = { version = "3.1.12", features = ["color"] } 10 | -------------------------------------------------------------------------------- /recho/src/main.rs: -------------------------------------------------------------------------------- 1 | use clap::{Arg, Command}; 2 | 3 | fn main() { 4 | let matches = Command::new("recho") 5 | .version("0.1.0") 6 | .author("Parham Alvani ") 7 | .about("echo but this time in rust") 8 | .arg( 9 | Arg::new("text") 10 | .value_name("TEXT") 11 | .help("input text") 12 | .required(true) 13 | .min_values(1), 14 | ) 15 | .arg( 16 | Arg::new("omit_newline") 17 | .short('n') 18 | .help("do not print newline") 19 | .takes_value(false), 20 | ) 21 | .get_matches(); 22 | 23 | let text: Vec<&str> = matches.values_of("text").unwrap().collect(); 24 | let omit_newline = matches.is_present("omit_newline"); 25 | 26 | print!("{}{}", text.join(" "), if omit_newline { "" } else { "\n" }); 27 | } 28 | -------------------------------------------------------------------------------- /slices/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "slices" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | [dependencies] 7 | -------------------------------------------------------------------------------- /slices/src/main.rs: -------------------------------------------------------------------------------- 1 | fn main() { 2 | let a = [1, 2, 3, 4, 5]; 3 | let slice = &a[1..3]; // This slice has the type &[i32] 4 | 5 | // assert_eq! is a macro that panics if the two arguments aren't equal. 6 | // It's useful for testing. 7 | assert_eq!(slice, &[2, 3]); 8 | } 9 | -------------------------------------------------------------------------------- /tryfrom/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "tryfrom" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /tryfrom/src/main.rs: -------------------------------------------------------------------------------- 1 | use std::convert::TryFrom; 2 | use std::convert::TryInto; 3 | 4 | #[derive(Debug, PartialEq)] 5 | struct EvenNumber(i32); 6 | 7 | impl TryFrom for EvenNumber { 8 | type Error = (); 9 | 10 | fn try_from(value: i32) -> Result { 11 | if value % 2 == 0 { 12 | Ok(EvenNumber(value)) 13 | } else { 14 | Err(()) 15 | } 16 | } 17 | } 18 | 19 | fn main() { 20 | // TryFrom 21 | 22 | assert_eq!(EvenNumber::try_from(8), Ok(EvenNumber(8))); 23 | assert_eq!(EvenNumber::try_from(5), Err(())); 24 | 25 | // TryInto 26 | 27 | let result: Result = 8i32.try_into(); 28 | assert_eq!(result, Ok(EvenNumber(8))); 29 | let result: Result = 5i32.try_into(); 30 | assert_eq!(result, Err(())); 31 | } -------------------------------------------------------------------------------- /word-count-parham/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "word-count-parham" 3 | version = "0.1.0" 4 | edition = "2018" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | -------------------------------------------------------------------------------- /word-count-parham/src/main.rs: -------------------------------------------------------------------------------- 1 | use std::fs::File; 2 | use std::io::{self, Read}; 3 | 4 | #[derive(Debug)] 5 | struct Options<'a> { 6 | delimiter: &'a str, 7 | debug: bool, 8 | } 9 | 10 | fn main() { 11 | let mut option = Options { 12 | delimiter: " ", 13 | debug: false, 14 | }; 15 | let args: Vec = std::env::args().skip(1).collect(); 16 | let mut file_names: Vec<&str> = Vec::new(); 17 | 18 | let mut i = 0; 19 | while i < args.len() { 20 | if args[i].starts_with("--") { 21 | match args[i].trim_start_matches("--") { 22 | "delimiter" => match args.get(i + 1) { 23 | Some(value) => { 24 | option.delimiter = value; 25 | i += 1; 26 | } 27 | None => panic!("--delimiter needs a value"), 28 | }, 29 | "debug" => match args.get(i + 1) { 30 | Some(value) => { 31 | match value.to_lowercase().as_str() { 32 | "true" => option.debug = true, 33 | "false" => option.debug = false, 34 | _ => panic!("--debug can be true or false"), 35 | } 36 | i += 1; 37 | } 38 | None => panic!("--debug needs a value"), 39 | }, 40 | &_ => { 41 | panic!("option {} not supported", args[i]) 42 | } 43 | } 44 | } else { 45 | file_names.push(&args[i]); 46 | } 47 | i += 1 48 | } 49 | 50 | println!("{:#?}\nFiles: {:#?}", option, file_names); 51 | 52 | let mut count: usize = 0; 53 | for file_name in file_names { 54 | count += count_words_from_file(file_name, &option) 55 | .unwrap_or_else(|err| panic!("cannot open {} {}", file_name, err)) 56 | } 57 | 58 | println!("number of words: {}", count); 59 | } 60 | 61 | fn count_words_from_file(file_name: &str, option: &Options) -> Result { 62 | let mut f = File::open(file_name)?; 63 | let mut s = String::new(); 64 | f.read_to_string(&mut s)?; 65 | 66 | if option.debug { 67 | println!("{:?}", s.split(option.delimiter).collect::>()); 68 | } 69 | 70 | Ok(s.split(option.delimiter).count()) 71 | } 72 | -------------------------------------------------------------------------------- /word-count-parham/test.txt: -------------------------------------------------------------------------------- 1 | Parham Alvani 2 | Elahe Dastan 3 | --------------------------------------------------------------------------------