├── LICENSE ├── README.md └── src ├── csv.h ├── experimental └── json.h ├── extra ├── README.md └── acceleration_maker.cpp ├── json2midi_assert.cpp ├── main.cpp ├── midi.h ├── pt2.cpp ├── pt2.h ├── song_handler.cpp └── song_handler.h /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 | # json2midi 2 | JSON to MIDI converter for Piano Tiles 2 3 | # How to install 4 | `git clone https://github.com/Volian0/json2midi` 5 | `cd json2midi` 6 | `g++ src/*.cpp -std=c++11 -o json2midi` 7 | # How to update 8 | `cd json2midi` 9 | `git pull` 10 | `g++ src/*.cpp -std=c++11 -o json2midi` 11 | # How to use 12 | ## Automatic 13 | If the JSON file contains bpms and baseBeats, you can just simply pass the filename as parameter 14 | `json2midi song.json` 15 | or 16 | `json2midi song.json auto` 17 | ## Manual 18 | In this mode, you need to specify all required bpms and baseBeats for each part 19 | `json2midi song.json 120 0.25 122 0.25 124 0.5` 20 | ## Using music_json.csv 21 | You can convert the entire CSV by passing it as parameter 22 | `json2midi music_json.csv` 23 | -------------------------------------------------------------------------------- /src/csv.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | namespace csv 8 | { 9 | 10 | class CSVrecord 11 | { 12 | public: 13 | std::vector fields; 14 | }; 15 | 16 | class CSVfile 17 | { 18 | public: 19 | std::vector records; 20 | void parse(const std::string& filename) 21 | { 22 | records.clear(); 23 | std::vector bytes; 24 | { 25 | std::ifstream file(filename,std::ios::binary); 26 | if (!file) 27 | throw std::runtime_error("Can't open \""+filename+"\""); 28 | uint8_t c; 29 | while (file >> std::noskipws >> c) 30 | bytes.push_back(c); 31 | } 32 | if (bytes.empty()) 33 | throw std::runtime_error("Empty CSV"); 34 | records.push_back(CSVrecord()); 35 | records.back().fields.push_back(std::string()); 36 | uint8_t mode{}; 37 | bool req_LF{}; 38 | for (std::vector::size_type i=0; i 5 | #include 6 | #include 7 | #include 8 | 9 | namespace json 10 | { 11 | 12 | class JsonValue; 13 | 14 | struct pair 15 | { 16 | std::string str; 17 | JsonValue * value = nullptr; 18 | ~pair(); 19 | }; 20 | class JsonObject 21 | { 22 | friend class JsonFile; 23 | friend class JsonValue; 24 | std::vector pairs; 25 | void Add(const std::string & str) 26 | { 27 | for (size_t i=0; istr==str) 30 | throw std::exception(); 31 | } 32 | pairs.push_back(new pair); 33 | pairs.back()->str=str; 34 | } 35 | ~JsonObject() 36 | { 37 | for (size_t i=0; istr==str) 46 | return pairs[i]->value; 47 | } 48 | if (validate) 49 | throw std::exception(); 50 | return nullptr; 51 | } 52 | }; 53 | class JsonArray 54 | { 55 | friend class JsonFile; 56 | friend class JsonValue; 57 | std::vector values; 58 | ~JsonArray(); 59 | public: 60 | size_t GetSize() 61 | { 62 | return values.size(); 63 | } 64 | JsonValue * GetValue(const size_t & n) 65 | { 66 | if (nstr.length()) 156 | throw std::exception(); 157 | size_t pos = i; 158 | i=i+size; 159 | return str.substr(pos,size); 160 | } 161 | uint8_t ConvertHex(const char c) 162 | { 163 | if (c>='0'&&c<='9') 164 | return c - '0'; 165 | if (c>='A'&&c<='F') 166 | return c - 'A' + 10; 167 | if (c>='a'&&c<='f') 168 | return c - 'a' + 10; 169 | throw std::exception(); 170 | return 0; 171 | } 172 | std::string GetUnicode(const uint16_t code) 173 | { 174 | std::string s; 175 | if (code <= 0x7F) 176 | s += (code & 0x7F); 177 | else if (code <= 0x7FF) 178 | { 179 | s += 0xC0 | ((code >> 6) & 0x1F); 180 | s += 0x80 | (code & 0x3F); 181 | } 182 | //else if (code <= 0xFFFF) 183 | else 184 | { 185 | s += 0xE0 | ((code >> 12) & 0xF); 186 | s += 0x80 | ((code >> 6) & 0x3F); 187 | s += 0x80 | (code & 0x3F); 188 | } 189 | return s; 190 | } 191 | std::string ConvertEscape(const std::string & str,size_t & i) 192 | { 193 | std::string s = GetStringPart(str,i,1); 194 | if (s[0]=='\"'||s[0]=='\\'||s[0]=='/') 195 | return s; 196 | if (s[0]=='b') 197 | return "\b"; 198 | if (s[0]=='f') 199 | return "\f"; 200 | if (s[0]=='n') 201 | return "\n"; 202 | if (s[0]=='r') 203 | return "\r"; 204 | if (s[0]=='t') 205 | return "\t"; 206 | if (s[0]=='u') 207 | { 208 | s = GetStringPart(str,i,4); 209 | return GetUnicode((ConvertHex(s[0])<<12)|(ConvertHex(s[1])<<8)|(ConvertHex(s[2])<<4)|ConvertHex(s[3])); 210 | } 211 | throw std::exception(); 212 | return std::string(); 213 | } 214 | std::string ParseString(const std::string & str,size_t & i) 215 | { 216 | std::string s; 217 | while (true) 218 | { 219 | char c=GetStringPart(str,i,1)[0]; 220 | if (c>=0x0000&&c<=0x001F) 221 | throw std::exception(); 222 | if (c=='\"') 223 | break; 224 | if (c=='\\') 225 | s += ConvertEscape(str,i); 226 | else 227 | s += c; 228 | } 229 | return s; 230 | } 231 | void ValidateOther(const std::string & str) 232 | { 233 | if (str=="true"||str=="false"||str=="null") 234 | return; 235 | uint8_t mode=0; 236 | bool allow=false; 237 | for (size_t i=0; i='1'&&str[i]<='9') 247 | { 248 | mode=2; 249 | continue; 250 | } 251 | else if (mode==1&&str[i]=='0') 252 | { 253 | mode=3; 254 | continue; 255 | } 256 | else if (mode==1) 257 | throw std::exception(); 258 | if (mode==2&&!(str[i]>='0'&&str[i]<='9')) 259 | mode=3; 260 | if (mode==3&&str[i]=='.') 261 | { 262 | mode=4; 263 | continue; 264 | } 265 | else if (mode==3) 266 | mode=5; 267 | if (mode==4&&str[i]>='0'&&str[i]<='9') 268 | allow=true; 269 | else if (mode==4&&allow) 270 | { 271 | allow=false; 272 | mode=5; 273 | } 274 | else if (mode==4) 275 | throw std::exception(); 276 | if (mode==5&&(str[i]=='e'||str[i]=='E')) 277 | { 278 | mode=6; 279 | continue; 280 | } 281 | else if (mode==5) 282 | throw std::exception(); 283 | if (mode==6&&(str[i]=='+'||str[i]=='-')) 284 | { 285 | mode=7; 286 | continue; 287 | } 288 | else if (mode==6) 289 | mode=7; 290 | if (mode==7&&str[i]>='0'&&str[i]<='9') 291 | allow=true; 292 | else if (mode==7) 293 | throw std::exception(); 294 | } 295 | if (mode==2||mode==3||(mode==4&&allow)||mode==5||(mode==7&&allow)) 296 | return; 297 | throw std::exception(); 298 | } 299 | JsonObject * ParseObject(const std::string & str,size_t & i) 300 | { 301 | JsonObject * object = new JsonObject; 302 | IgnoreWhiteSpace(str,i); 303 | char c; 304 | bool once=true; 305 | while (true) 306 | { 307 | IgnoreWhiteSpace(str,i); 308 | c = GetStringPart(str,i,1)[0]; 309 | if (c=='}'&&once) 310 | break; 311 | once = false; 312 | if (c!='\"') 313 | throw std::exception(); 314 | object->Add(ParseString(str,i)); 315 | IgnoreWhiteSpace(str,i); 316 | if (GetStringPart(str,i,1)[0]!=':') 317 | throw std::exception(); 318 | object->pairs.back()->value = ParseValue(str,i); 319 | c = GetStringPart(str,i,1)[0]; 320 | if (c=='}') 321 | break; 322 | if (c!=',') 323 | throw std::exception(); 324 | } 325 | return object; 326 | } 327 | JsonArray * ParseArray(const std::string & str,size_t & i) 328 | { 329 | JsonArray * array = new JsonArray; 330 | IgnoreWhiteSpace(str,i); 331 | char c; 332 | bool once=true; 333 | while (true) 334 | { 335 | IgnoreWhiteSpace(str,i); 336 | c = GetStringPart(str,i,1)[0]; 337 | if (c==']'&&once) 338 | break; 339 | once = false; 340 | array->values.push_back(ParseValue(str,--i)); 341 | c = GetStringPart(str,i,1)[0]; 342 | if (c==']') 343 | break; 344 | if (c!=',') 345 | throw std::exception(); 346 | } 347 | return array; 348 | } 349 | JsonValue * ParseValue(const std::string & str,size_t & i) 350 | { 351 | JsonValue * value = new JsonValue; 352 | IgnoreWhiteSpace(str,i); 353 | std::string s = GetStringPart(str,i,1); 354 | if (s[0]=='\"') 355 | { 356 | value->value = new std::string(ParseString(str,i)); 357 | value->type = 1; 358 | } 359 | else if (s[0]=='{') 360 | { 361 | value->value = ParseObject(str,i); 362 | value->type = 2; 363 | } 364 | else if (s[0]=='[') 365 | { 366 | value->value = ParseArray(str,i); 367 | value->type = 3; 368 | } 369 | else 370 | { 371 | while(i='0'&&str[i]<='9')||(str[i]>='a'&&str[i]<='z')||str[i]=='.'||str[i]=='+'||str[i]=='-'||str[i]=='E')) 372 | { 373 | s+=str[i]; 374 | ++i; 375 | } 376 | ValidateOther(s); 377 | value->value = new std::string(s); 378 | value->type = 4; 379 | } 380 | IgnoreWhiteSpace(str,i); 381 | return value; 382 | } 383 | public: 384 | JsonValue * value = nullptr; 385 | JsonFile(const std::string & filename) 386 | { 387 | delete value; 388 | std::ifstream file(filename,std::ios::binary); 389 | if (file) 390 | { 391 | std::string str; 392 | char c; 393 | size_t i = 0; 394 | while (file >> std::noskipws >> c) 395 | str+=c; 396 | file.close(); 397 | value = ParseValue(str,i); 398 | if (i!=str.size()) 399 | throw std::exception(); 400 | } 401 | else 402 | throw std::exception(); 403 | } 404 | ~JsonFile() 405 | { 406 | delete value; 407 | value = nullptr; 408 | } 409 | }; 410 | 411 | } 412 | 413 | #endif 414 | -------------------------------------------------------------------------------- /src/extra/README.md: -------------------------------------------------------------------------------- 1 | # Acceleration Maker 2 | This program generates tempo map for PT2 songs with acceleration 3 | `acceleration_maker [staring TPM] [acceleration] [time in seconds] [MIDI filename]` 4 | -------------------------------------------------------------------------------- /src/extra/acceleration_maker.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include "../midi.h" 5 | 6 | int main(int argc, char* argv[]) 7 | { 8 | if (argc<5) 9 | throw std::logic_error("Not enough arguments"); 10 | long double start_tpm{std::stold(argv[1])}; 11 | long double acc{std::stold(argv[2])}; 12 | uint64_t time{std::stoull(argv[3])*10}; 13 | uint64_t current_tick{}; 14 | midi::MIDIfile midi(1200); 15 | for (uint64_t i{}; iuint64_t{}-1)&&!(tick_ld==0)) 20 | throw std::logic_error("Error 1"); 21 | uint64_t tick = tick_ld; 22 | if (current_tick>tick) 23 | throw std::logic_error("Error 2"); 24 | midi[0].AddDelay(tick-current_tick); 25 | current_tick = tick; 26 | midi.SetTempo(120000000/tpm); 27 | } 28 | midi.Create(argv[4]); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /src/json2midi_assert.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | static_assert(std::numeric_limits::digits>=31,"Float not precise enough"); 4 | -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | #include "song_handler.h" 2 | 3 | int main(int argc, char* argv[]) 4 | { 5 | std::vector args; 6 | for (int i = 1; i < argc; ++i) 7 | args.push_back(argv[i]); 8 | return pt2::handle_file(args); 9 | } 10 | -------------------------------------------------------------------------------- /src/midi.h: -------------------------------------------------------------------------------- 1 | #ifndef MIDI_H 2 | #define MIDI_H 3 | 4 | #include // For std::vector<> 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | namespace midi 11 | { 12 | 13 | /* First define a custom wrapper over std::vector 14 | * so we can quickly push_back multiple bytes with a single call. 15 | */ 16 | class MIDIvec 17 | { 18 | public: 19 | std::vector bytes; 20 | // Methods for appending raw data into the vector: 21 | template 22 | void AddBytes(uint8_t data, Args...args) 23 | { 24 | bytes.push_back(data); 25 | AddBytes(args...); 26 | } 27 | template 28 | void AddBytes(const std::string& s, Args...args) 29 | { 30 | bytes.insert(bytes.end(), s.begin(), s.end()); 31 | AddBytes(args...); 32 | } 33 | void AddBytes() { } 34 | }; 35 | 36 | /* Define a class which encodes MIDI events into a track */ 37 | class MIDItrack: public MIDIvec 38 | { 39 | protected: 40 | uint32_t delay, running_status; 41 | public: 42 | MIDItrack() 43 | : MIDIvec(), delay(0), running_status(0) 44 | { 45 | } 46 | 47 | // Methods for indicating how much time elapses: 48 | void AddDelay(uint32_t amount) 49 | { 50 | delay += amount; 51 | if((delay|amount)>0xFFFFFFF) 52 | throw std::overflow_error("Time overflow"); 53 | } 54 | 55 | void AddVarLen(uint32_t t) 56 | { 57 | if(t >> 21) 58 | AddBytes(0x80 | ((t >> 21) & 0x7F)); 59 | if(t >> 14) 60 | AddBytes(0x80 | ((t >> 14) & 0x7F)); 61 | if(t >> 7) 62 | AddBytes(0x80 | ((t >> 7) & 0x7F)); 63 | AddBytes(((t >> 0) & 0x7F)); 64 | } 65 | 66 | void Flush() 67 | { 68 | AddVarLen(delay); 69 | delay = 0; 70 | } 71 | 72 | // Methods for appending events into the track: 73 | template 74 | void AddEvent(uint8_t data, Args...args) 75 | { 76 | /* MIDI tracks have the following structure: 77 | * 78 | * { timestamp [metaevent ... ] event } ... 79 | * 80 | * Each event is prefixed with a timestamp, 81 | * which is encoded in a variable-length format. 82 | * The timestamp describes the amount of time that 83 | * must be elapsed before this event can be handled. 84 | * 85 | * After the timestamp, comes the event data. 86 | * The first byte of the event always has the high bit on, 87 | * and the remaining bytes always have the high bit off. 88 | * 89 | * The first byte can however be omitted; in that case, 90 | * it is assumed that the first byte is the same as in 91 | * the previous command. This is called "running status". 92 | * The event may furthermore beprefixed 93 | * with a number of meta events. 94 | */ 95 | Flush(); 96 | if(data != running_status) 97 | AddBytes(running_status = data); 98 | AddBytes(args...); 99 | } 100 | void AddEvent() { } 101 | 102 | template 103 | void AddMetaEvent(uint8_t metatype, uint8_t nbytes, Args...args) 104 | { 105 | Flush(); 106 | AddBytes(0xFF, metatype, nbytes, args...); 107 | } 108 | 109 | // Key-related parameters: channel number, note number, pressure 110 | void KeyOn(uint8_t ch, uint8_t n, uint8_t p) 111 | { 112 | if((n|p)<0x80) 113 | AddEvent(0x90|ch, n, p); 114 | } 115 | void KeyOff(uint8_t ch, uint8_t n, uint8_t p) 116 | { 117 | if((n|p)<0x80) 118 | AddEvent(0x80|ch, n, p); 119 | } 120 | void KeyTouch(uint8_t ch, uint8_t n, uint8_t p) 121 | { 122 | if((n|p)<0x80) 123 | AddEvent(0xA0|ch, n, p); 124 | } 125 | // Events with other types of parameters: 126 | void Control(uint16_t ch, uint16_t c, uint16_t v) 127 | { 128 | AddEvent(0xB0|ch, c, v); 129 | } 130 | void Patch(uint16_t ch, uint16_t patchno) 131 | { 132 | AddEvent(0xC0|ch, patchno); 133 | } 134 | void Wheel(uint16_t ch, uint32_t value) 135 | { 136 | AddEvent(0xE0|ch, value&0x7F, (value>>7)&0x7F); 137 | } 138 | 139 | // Methods for appending metadata into the track: 140 | void AddText(uint16_t texttype, const std::string& text) 141 | { 142 | AddMetaEvent(texttype, text.size(), text); 143 | } 144 | }; 145 | 146 | /* Define a class that encapsulates all methods needed to craft a MIDI file. */ 147 | class MIDIfile: public MIDIvec 148 | { 149 | protected: 150 | std::vector tracks; 151 | uint32_t deltaticks; 152 | public: 153 | MIDIfile(uint32_t ppq) 154 | : MIDIvec(), tracks(), deltaticks(ppq) 155 | { 156 | } 157 | 158 | void AddLoopStart() 159 | { 160 | (*this)[0].AddText(6, "loopStart"); 161 | } 162 | void AddLoopEnd() 163 | { 164 | (*this)[0].AddText(6, "loopEnd"); 165 | } 166 | void SetTempo(uint32_t tempo) 167 | { 168 | (*this)[0].AddMetaEvent(0x51,3, tempo>>16, tempo>>8, tempo); 169 | } 170 | 171 | MIDItrack& operator[] (uint16_t trackno) 172 | { 173 | if(trackno >= tracks.size()) 174 | { 175 | tracks.resize(trackno+1); 176 | } 177 | 178 | return tracks[trackno]; 179 | } 180 | 181 | void Create(const std::string& filename) 182 | { 183 | bytes.clear(); 184 | AddBytes( 185 | // MIDI signature (MThd and number 6) 186 | "MThd", 0,0,0,6, 187 | // Format number (1: multiple tracks, synchronous) 188 | 0,1, 189 | tracks.size() >> 8, tracks.size(), 190 | deltaticks >> 8, deltaticks); 191 | for(uint32_t a=0; a> 24, 198 | tracks[a].bytes.size() >> 16, 199 | tracks[a].bytes.size() >> 8, 200 | tracks[a].bytes.size() >> 0); 201 | bytes.insert(bytes.end(), tracks[a].bytes.begin(), tracks[a].bytes.end()); 202 | } 203 | tracks.clear(); 204 | std::ofstream file; 205 | file.exceptions(std::ios_base::failbit); 206 | file.open(filename,std::ios::binary|std::ios::trunc); 207 | file.write(reinterpret_cast(bytes.data()),bytes.size()); 208 | file.flush(); 209 | } 210 | }; 211 | 212 | } 213 | 214 | #endif 215 | -------------------------------------------------------------------------------- /src/pt2.cpp: -------------------------------------------------------------------------------- 1 | #include "pt2.h" 2 | #include "midi.h" 3 | #include "experimental/json.h" //MEMORY LEAK! 4 | #include 5 | #include 6 | 7 | namespace pt2 8 | { 9 | 10 | uint8_t message::GetType() const 11 | { 12 | return (value&0xF0000000)>>28; 13 | } 14 | 15 | message::message(uint32_t length,uint8_t type) 16 | : value((length&0x0FFFFFFF)|(type<<28)) {} 17 | 18 | message::operator uint32_t() const 19 | { 20 | return (value&0x0FFFFFFF); 21 | } 22 | 23 | void part::VerifyLength() 24 | { 25 | if (tracks.empty()) 26 | throw std::logic_error("No tracks"); 27 | for (std::vector::size_type i=1; i0) 36 | { 37 | tracks[i].warnings.push_back("Track is shorter than the first track ("+std::to_string(diff)+" ticks)"); 38 | tracks[i].messages.push_back(message(diff,2)); 39 | } 40 | } 41 | } 42 | 43 | bool part::HasWarnings() const 44 | { 45 | for (const auto& t : tracks) 46 | if (!t.warnings.empty()) 47 | return true; 48 | return false; 49 | } 50 | 51 | void track::parse(const std::string& score,long double bpm) 52 | { 53 | uint8_t mode=0; 54 | std::vector notes; 55 | for (std::string::size_type i=0; i='0'&&score[i]<='9'))&&mode==0) 150 | continue; 151 | if ((score[i]=='>'||score[i]=='{'||score[i]=='}'||(score[i]>='0'&&score[i]<='9'))&&mode==5) 152 | continue; 153 | std::string temp; 154 | while (true) 155 | { 156 | temp+=score[i]; 157 | ++i; 158 | if (i==score.size()||score[i]=='.'||score[i]=='(' 159 | ||score[i]==')'||score[i]=='~'||score[i]=='[' 160 | ||score[i]==']'||score[i]==','||score[i]==';' 161 | ||score[i]=='<'||score[i]=='>'||score[i]=='@' 162 | ||score[i]=='%'||score[i]=='!'||score[i]=='$' 163 | ||score[i]=='^'||score[i]=='&') 164 | { 165 | --i; 166 | break; 167 | } 168 | } 169 | uint8_t note = GetNote(temp); 170 | uint32_t length = GetLength(temp,0); 171 | uint32_t rest = GetLength(temp,1); 172 | if (note) 173 | { 174 | if (mode==0) 175 | mode = 3; 176 | else if (mode==1) 177 | mode = 2; 178 | else 179 | throw std::exception(); 180 | if (note != 1) 181 | notes.push_back(note); 182 | } 183 | else if (length) 184 | { 185 | if (mode==4) 186 | mode = 6; 187 | else 188 | throw std::exception(); 189 | // // //flush notes 190 | uint32_t div = std::count(notes.begin(),notes.end(),2); // ~ 191 | uint32_t arp1 = std::count(notes.begin(),notes.end(),3); // @ 192 | uint32_t arp2 = std::count(notes.begin(),notes.end(),4); // % 193 | uint32_t arp3 = std::count(notes.begin(),notes.end(),5); // ! 194 | uint32_t arp4 = std::count(notes.begin(),notes.end(),6); // ^ 195 | if (uint32_t(div>0)+uint32_t(arp1>0)+uint32_t(arp2>0)+uint32_t(arp3>0)+uint32_t(arp4>0)>1||arp4>1) 196 | throw std::logic_error("Problem with operators"); 197 | div = div + 1; 198 | safe_divider sdiv; 199 | std::vector tempnotes; 200 | if (arp1) 201 | { 202 | for (auto n = notes.begin(); n<=notes.end(); ++n) 203 | { 204 | if (n==notes.end()) 205 | { 206 | messages.push_back(message(length,2)); 207 | for (auto tn : notes) 208 | if (tn!=3) 209 | messages.push_back(message(tn,1)); 210 | } 211 | else if (*n==3) 212 | { 213 | uint32_t delay; 214 | if (arp1==1) 215 | delay = sdiv.divide(length,10); 216 | else 217 | delay = sdiv.divide(length,10*(arp1-1)); 218 | if (delay>length) 219 | throw std::logic_error("Fatal error with @"); 220 | length = length - delay; 221 | messages.push_back(message(delay,2)); 222 | } 223 | else 224 | messages.push_back(message(*n,0)); 225 | } 226 | } 227 | else if (arp2) 228 | { 229 | for (auto n = notes.begin(); n<=notes.end(); ++n) 230 | { 231 | if (n==notes.end()) 232 | { 233 | messages.push_back(message(length,2)); 234 | for (auto tn : notes) 235 | if (tn!=4) 236 | messages.push_back(message(tn,1)); 237 | } 238 | else if (*n==4) 239 | { 240 | uint32_t delay; 241 | delay = sdiv.divide(3*length,10*arp2); 242 | if (delay>length) 243 | throw std::logic_error("Fatal error with %"); 244 | length = length - delay; 245 | messages.push_back(message(delay,2)); 246 | } 247 | else 248 | messages.push_back(message(*n,0)); 249 | } 250 | } 251 | else if (arp3) 252 | { 253 | for (auto n = notes.begin(); n<=notes.end(); ++n) 254 | { 255 | if (n==notes.end()) 256 | { 257 | messages.push_back(message(length,2)); 258 | for (auto tn : notes) 259 | if (tn!=5) 260 | messages.push_back(message(tn,1)); 261 | } 262 | else if (*n==5) 263 | { 264 | uint32_t delay; 265 | delay = sdiv.divide(3*length,20*arp3); 266 | if (delay>length) 267 | throw std::logic_error("Fatal error with !"); 268 | length = length - delay; 269 | messages.push_back(message(delay,2)); 270 | } 271 | else 272 | messages.push_back(message(*n,0)); 273 | } 274 | } 275 | else if (arp4) 276 | { 277 | if (notes.size()!=3||notes.at(1)!=6||notes.at(0)<20||notes.at(2)<20) 278 | throw std::logic_error("Problem with ornament"); 279 | //how long is 1/12 of a second? 280 | uint8_t note_flip = 0; 281 | uint32_t bpm32 = bpm * 32; 282 | while (true) 283 | { 284 | //play note 285 | messages.push_back(message(notes.at(note_flip),0)); 286 | //wait 287 | uint32_t delay = sdiv.divide(bpm32,720); 288 | if (delay>=length) //end 289 | { 290 | //wait length 291 | messages.push_back(message(length,2)); 292 | //note off 293 | messages.push_back(message(notes.at(note_flip),1)); 294 | break; 295 | } 296 | else 297 | { 298 | length = length - delay; 299 | //wait delay 300 | messages.push_back(message(delay,2)); 301 | //note off 302 | messages.push_back(message(notes.at(note_flip),1)); 303 | } 304 | if (note_flip==0) 305 | note_flip=2; 306 | else if (note_flip==2) 307 | note_flip=0; 308 | } 309 | } 310 | else 311 | for (auto n = notes.begin(); n<=notes.end(); ++n) 312 | { 313 | if (n==notes.end()||*n==2) 314 | { 315 | for (auto tn : tempnotes) 316 | messages.push_back(message(tn,0)); 317 | messages.push_back(message(sdiv.divide(length,div),2)); 318 | for (auto tn : tempnotes) 319 | messages.push_back(message(tn,1)); 320 | tempnotes.clear(); 321 | } 322 | else 323 | tempnotes.push_back(*n); 324 | } 325 | notes.clear(); 326 | // // // 327 | } 328 | else if (rest) 329 | { 330 | if (mode==0) 331 | { 332 | mode = 5; 333 | messages.push_back(message(rest,2)); 334 | } 335 | else if (mode==1) 336 | { 337 | warnings.push_back("\""+temp+"\" inside () converted to mute"); 338 | mode = 2; 339 | } 340 | else 341 | throw std::exception(); 342 | } 343 | else 344 | throw std::runtime_error("Couldn't parse \""+temp+"\""); 345 | } 346 | } 347 | if (mode!=0&&mode!=5) 348 | throw std::exception(); 349 | } 350 | 351 | uint32_t track::GetLength(const std::string& n,bool mode) const 352 | { 353 | uint32_t delay{}; 354 | if (mode) 355 | { 356 | for (uint8_t b : n) 357 | { 358 | //Q-Y 359 | if (b=='Q') 360 | delay+= 256*basebeats; 361 | else if (b=='R') 362 | delay+= 128*basebeats; 363 | else if (b=='S') 364 | delay+= 64*basebeats; 365 | else if (b=='T') 366 | delay+= 32*basebeats; 367 | else if (b=='U') 368 | delay+= 16*basebeats; 369 | else if (b=='V') 370 | delay+= 8*basebeats; 371 | else if (b=='W') 372 | delay+= 4*basebeats; 373 | else if (b=='X') 374 | delay+= 2*basebeats; 375 | else if (b=='Y') 376 | delay+= 1*basebeats; 377 | else 378 | return 0; 379 | if(delay>0xFFFFFFF) 380 | throw std::overflow_error("Length overflow"); 381 | } 382 | } 383 | else 384 | { 385 | for (uint8_t b : n) 386 | { 387 | //H-P 388 | if (b=='H') 389 | delay+= 256*basebeats; 390 | else if (b=='I') 391 | delay+= 128*basebeats; 392 | else if (b=='J') 393 | delay+= 64*basebeats; 394 | else if (b=='K') 395 | delay+= 32*basebeats; 396 | else if (b=='L') 397 | delay+= 16*basebeats; 398 | else if (b=='M') 399 | delay+= 8*basebeats; 400 | else if (b=='N') 401 | delay+= 4*basebeats; 402 | else if (b=='O') 403 | delay+= 2*basebeats; 404 | else if (b=='P') 405 | delay+= 1*basebeats; 406 | else 407 | return 0; 408 | if(delay>0xFFFFFFF) 409 | throw std::overflow_error("Length overflow"); 410 | } 411 | } 412 | return delay; 413 | } 414 | 415 | int32_t track::operator-(const track& tr) const 416 | { 417 | int32_t diff{}; 418 | std::vector::size_type a{}; 419 | std::vector::size_type b{}; 420 | std::vector msg_a{messages}; 421 | std::vector msg_b{tr.messages}; 422 | while (a0xFFFFFFF||diff<-0xFFFFFFF) 445 | throw std::overflow_error("Length overflow"); 446 | } 447 | return diff; 448 | } 449 | 450 | void track::shrink(uint32_t a) 451 | { 452 | for (std::vector::size_type i{messages.size()}; i>0; --i) 453 | { 454 | if (messages[i-1].GetType()==2) 455 | { 456 | int32_t diff = a - messages[i-1]; 457 | if (diff>=0) 458 | { 459 | a = diff; 460 | messages[i-1] = message(0,2); 461 | } 462 | else if (diff<0) 463 | { 464 | a = 0; 465 | messages[i-1] = message(-diff,2); 466 | } 467 | if (a==0) 468 | break; 469 | } 470 | } 471 | if (a!=0) 472 | throw std::logic_error("This shouldn't happen, contact Volian0"); 473 | //note cleaning... 474 | std::vector note_on; 475 | for (auto& m : messages) 476 | { 477 | if (m.GetType()==2&&m>0) 478 | note_on.clear(); 479 | else if (m.GetType()==0) 480 | note_on.push_back(&m); 481 | else if (m.GetType()==1) 482 | for (auto& n : note_on) 483 | if (n->GetType()==0&&m==*n) 484 | { 485 | m=message(0,3); 486 | *n=message(0,3); 487 | break; 488 | } 489 | } 490 | } 491 | 492 | song::song(const std::vector& args) 493 | : arguments{args} 494 | { 495 | ParseJSON(); 496 | VerifyTracks(); 497 | MakeMIDI(args.at(0)); 498 | } 499 | 500 | void song::ParseJSON() 501 | { 502 | std::string name = arguments.at(0); 503 | arguments.erase(arguments.begin()); 504 | bool automode = false; 505 | if (arguments.empty()||arguments.at(0)=="auto") 506 | { 507 | automode = true; 508 | arguments.clear(); 509 | } 510 | const json::JsonFile file(name); 511 | json::JsonArray* musics = file.value->GetObject()->Find("musics")->GetArray(); 512 | for (uint32_t p=0; pGetSize(); ++p) 513 | { 514 | try 515 | { 516 | std::string bpm; 517 | std::string basebeats; 518 | parts.push_back(part()); 519 | //SET BPM AND BASEBEATS 520 | json::JsonObject* part = musics->GetValue(p)->GetObject(); 521 | if (automode) 522 | { 523 | bpm = part->Find("bpm")->GetString(true); 524 | basebeats = part->Find("baseBeats")->GetString(true); 525 | } 526 | else 527 | { 528 | try 529 | { 530 | bpm = arguments.at(0); 531 | arguments.erase(arguments.begin()); 532 | basebeats = arguments.at(0); 533 | arguments.erase(arguments.begin()); 534 | } 535 | catch (const std::exception&) 536 | { 537 | throw std::runtime_error("Error with arguments"); 538 | } 539 | } 540 | // // // setting BPM and Basebeats 541 | if (basebeats=="15") 542 | parts.back().basebeats = 1; 543 | else if (basebeats=="7.5") 544 | parts.back().basebeats = 2; 545 | else if (basebeats=="5") 546 | parts.back().basebeats = 3; 547 | else if (basebeats=="3.75") 548 | parts.back().basebeats = 4; 549 | else if (basebeats=="3") 550 | parts.back().basebeats = 5; 551 | else if (basebeats=="2.5") 552 | parts.back().basebeats = 6; 553 | else if (basebeats=="1.875") 554 | parts.back().basebeats = 8; 555 | else if (basebeats=="1.5") 556 | parts.back().basebeats = 10; 557 | else if (basebeats=="1.25") 558 | parts.back().basebeats = 12; 559 | else if (basebeats=="1") 560 | parts.back().basebeats = 15; 561 | else if (basebeats=="0.9375") 562 | parts.back().basebeats = 16; 563 | else if (basebeats=="0.75") 564 | parts.back().basebeats = 20; 565 | else if (basebeats=="0.625") 566 | parts.back().basebeats = 24; 567 | else if (basebeats=="0.5") 568 | parts.back().basebeats = 30; 569 | else if (basebeats=="0.46875") 570 | parts.back().basebeats = 32; 571 | else if (basebeats=="0.375") 572 | parts.back().basebeats = 40; 573 | else if (basebeats=="0.3125") 574 | parts.back().basebeats = 48; 575 | else if (basebeats=="0.25") 576 | parts.back().basebeats = 60; 577 | else if (basebeats=="0.234375") 578 | parts.back().basebeats = 64; 579 | else if (basebeats=="0.1875") 580 | parts.back().basebeats = 80; 581 | else if (basebeats=="0.15625") 582 | parts.back().basebeats = 96; 583 | else if (basebeats=="0.125") 584 | parts.back().basebeats = 120; 585 | else if (basebeats=="0.1171875") 586 | parts.back().basebeats = 128; 587 | else if (basebeats=="0.09375") 588 | parts.back().basebeats = 160; 589 | else if (basebeats=="0.078125") 590 | parts.back().basebeats = 192; 591 | else if (basebeats=="0.0625") 592 | parts.back().basebeats = 240; 593 | else if (basebeats=="0.05859375") 594 | parts.back().basebeats = 256; 595 | else if (basebeats=="0.046875") 596 | parts.back().basebeats = 320; 597 | else if (basebeats=="0.0390625") 598 | parts.back().basebeats = 384; 599 | else if (basebeats=="0.03125") 600 | parts.back().basebeats = 480; 601 | else if (basebeats=="0.029296875") 602 | parts.back().basebeats = 512; 603 | else if (basebeats=="0.0234375") 604 | parts.back().basebeats = 640; 605 | else if (basebeats=="0.01953125") 606 | parts.back().basebeats = 768; 607 | else if (basebeats=="0.015625") 608 | parts.back().basebeats = 960; 609 | else 610 | throw std::invalid_argument("Wrong BaseBeats"); 611 | parts.back().bpm = std::stold(bpm)*parts.back().basebeats; 612 | json::JsonArray* scores = part->Find("scores")->GetArray(); 613 | for (uint32_t t=0; tGetSize(); ++t) 614 | { 615 | try 616 | { 617 | //SET BASEBEATS 618 | parts.back().tracks.push_back(track()); 619 | parts.back().tracks.back().basebeats = parts.back().basebeats; 620 | std::string track = scores->GetValue(t)->GetString(); 621 | parts.back().tracks.back().parse(track,parts.back().bpm); 622 | } 623 | catch(const std::exception& e) 624 | { 625 | throw std::runtime_error("Track "+std::to_string(t+1)+":\n"+e.what()); 626 | } 627 | } 628 | parts.back().VerifyLength(); 629 | } 630 | catch(const std::exception& e) 631 | { 632 | throw std::runtime_error("Part "+std::to_string(p+1)+":\n"+e.what()); 633 | } 634 | } 635 | } 636 | 637 | void song::VerifyTracks() 638 | { 639 | uint32_t max_size{}; 640 | for (const auto& p : parts) 641 | { 642 | if (p.tracks.size()>max_size) 643 | max_size = p.tracks.size(); 644 | } 645 | for (auto& p : parts) 646 | { 647 | while (p.tracks.size()=5&&name.substr(name.size()-5,5)==".json") 664 | filename = name.substr(0,name.size()-5); 665 | filename += ".mid"; 666 | midi::MIDIfile file(960); 667 | for (const auto& p : parts) 668 | { 669 | uint16_t track_id{}; 670 | // // // 671 | if (p.bpm==0) 672 | throw std::invalid_argument("Dividing by 0"); 673 | file.SetTempo(1800000000/p.bpm); 674 | // // // 675 | for (const auto& t : p.tracks) 676 | { 677 | // // // 678 | for (const auto& m : t.messages) 679 | { 680 | if (m.GetType()==0) 681 | file[track_id].KeyOn(track_id%16,m,100); 682 | else if (m.GetType()==1) 683 | file[track_id].KeyOff(track_id%16,m,64); 684 | else if (m.GetType()==2) 685 | file[track_id].AddDelay(m); 686 | } 687 | // // // 688 | ++track_id; 689 | } 690 | } 691 | file.Create(filename); 692 | } 693 | 694 | uint32_t safe_divider::divide(uint32_t a,uint32_t b) 695 | { 696 | if (b==0) 697 | throw std::invalid_argument("Dividing by 0"); 698 | uint32_t c = a/b; 699 | remainder += a - (c*b); 700 | if (remainder>=b) 701 | { 702 | ++c; 703 | remainder = remainder-b; 704 | } 705 | return c; 706 | } 707 | 708 | uint8_t GetNote(const std::string& n) 709 | { 710 | if (n=="c5") 711 | return 108; 712 | else if (n=="b4") 713 | return 107; 714 | else if (n=="#a4") 715 | return 106; 716 | else if (n=="a4") 717 | return 105; 718 | else if (n=="#g4") 719 | return 104; 720 | else if (n=="g4") 721 | return 103; 722 | else if (n=="#f4") 723 | return 102; 724 | else if (n=="f4") 725 | return 101; 726 | else if (n=="e4") 727 | return 100; 728 | else if (n=="#d4") 729 | return 99; 730 | else if (n=="d4") 731 | return 98; 732 | else if (n=="#c4") 733 | return 97; 734 | else if (n=="c4") 735 | return 96; 736 | else if (n=="b3") 737 | return 95; 738 | else if (n=="#a3") 739 | return 94; 740 | else if (n=="a3") 741 | return 93; 742 | else if (n=="#g3") 743 | return 92; 744 | else if (n=="g3") 745 | return 91; 746 | else if (n=="#f3") 747 | return 90; 748 | else if (n=="f3") 749 | return 89; 750 | else if (n=="e3") 751 | return 88; 752 | else if (n=="#d3") 753 | return 87; 754 | else if (n=="d3") 755 | return 86; 756 | else if (n=="#c3") 757 | return 85; 758 | else if (n=="c3") 759 | return 84; 760 | else if (n=="b2") 761 | return 83; 762 | else if (n=="#a2") 763 | return 82; 764 | else if (n=="a2") 765 | return 81; 766 | else if (n=="#g2") 767 | return 80; 768 | else if (n=="g2") 769 | return 79; 770 | else if (n=="#f2") 771 | return 78; 772 | else if (n=="f2") 773 | return 77; 774 | else if (n=="e2") 775 | return 76; 776 | else if (n=="#d2") 777 | return 75; 778 | else if (n=="d2") 779 | return 74; 780 | else if (n=="#c2") 781 | return 73; 782 | else if (n=="c2") 783 | return 72; 784 | else if (n=="b1") 785 | return 71; 786 | else if (n=="#a1") 787 | return 70; 788 | else if (n=="a1") 789 | return 69; 790 | else if (n=="#g1") 791 | return 68; 792 | else if (n=="g1") 793 | return 67; 794 | else if (n=="#f1") 795 | return 66; 796 | else if (n=="f1") 797 | return 65; 798 | else if (n=="e1") 799 | return 64; 800 | else if (n=="#d1") 801 | return 63; 802 | else if (n=="d1") 803 | return 62; 804 | else if (n=="#c1") 805 | return 61; 806 | else if (n=="c1") 807 | return 60; 808 | else if (n=="b") 809 | return 59; 810 | else if (n=="#a") 811 | return 58; 812 | else if (n=="a") 813 | return 57; 814 | else if (n=="#g") 815 | return 56; 816 | else if (n=="g") 817 | return 55; 818 | else if (n=="#f") 819 | return 54; 820 | else if (n=="f") 821 | return 53; 822 | else if (n=="e") 823 | return 52; 824 | else if (n=="#d") 825 | return 51; 826 | else if (n=="d") 827 | return 50; 828 | else if (n=="#c") 829 | return 49; 830 | else if (n=="c") 831 | return 48; 832 | else if (n=="B-1") 833 | return 47; 834 | else if (n=="#A-1") 835 | return 46; 836 | else if (n=="A-1") 837 | return 45; 838 | else if (n=="#G-1") 839 | return 44; 840 | else if (n=="G-1") 841 | return 43; 842 | else if (n=="#F-1") 843 | return 42; 844 | else if (n=="F-1") 845 | return 41; 846 | else if (n=="E-1") 847 | return 40; 848 | else if (n=="#D-1") 849 | return 39; 850 | else if (n=="D-1") 851 | return 38; 852 | else if (n=="#C-1") 853 | return 37; 854 | else if (n=="C-1") 855 | return 36; 856 | else if (n=="B-2") 857 | return 35; 858 | else if (n=="#A-2") 859 | return 34; 860 | else if (n=="A-2") 861 | return 33; 862 | else if (n=="#G-2") 863 | return 32; 864 | else if (n=="G-2") 865 | return 31; 866 | else if (n=="#F-2") 867 | return 30; 868 | else if (n=="F-2") 869 | return 29; 870 | else if (n=="E-2") 871 | return 28; 872 | else if (n=="#D-2") 873 | return 27; 874 | else if (n=="D-2") 875 | return 26; 876 | else if (n=="#C-2") 877 | return 25; 878 | else if (n=="C-2") 879 | return 24; 880 | else if (n=="B-3") 881 | return 23; 882 | else if (n=="#A-3") 883 | return 22; 884 | else if (n=="A-3") 885 | return 21; 886 | else if (n=="mute") 887 | return 1; 888 | else if (n=="empty") 889 | return 1; 890 | return 0; 891 | } 892 | 893 | } 894 | -------------------------------------------------------------------------------- /src/pt2.h: -------------------------------------------------------------------------------- 1 | #ifndef PT2_H 2 | #define PT2_H 3 | 4 | #include 5 | #include 6 | #include 7 | 8 | namespace pt2 9 | { 10 | 11 | /* This is a class for storing 12 | Note messages and lengths */ 13 | class message 14 | { 15 | protected: 16 | uint32_t value; 17 | public: 18 | uint8_t GetType() const; // 0 - note on, 1 - note off, 2 - length, 3 - ignore 19 | operator uint32_t() const; 20 | message(uint32_t,uint8_t); // sets value 21 | }; 22 | 23 | class track 24 | { 25 | protected: 26 | //std::string instrument; // optional, used for patching 27 | public: 28 | uint16_t basebeats; 29 | std::vector warnings; 30 | std::vector messages; 31 | void parse(const std::string&,long double); 32 | uint32_t GetLength(const std::string&,bool) const; // 0 - lengths, 1 - rests 33 | int32_t operator-(const track& tr) const; 34 | void shrink(uint32_t); 35 | }; 36 | 37 | class part 38 | { 39 | protected: 40 | public: 41 | long double bpm; // tempo 42 | uint16_t basebeats; // multiplier for tempo and tile length 43 | std::vector tracks; 44 | void VerifyLength(); 45 | bool HasWarnings() const; 46 | }; 47 | 48 | class song // this class handles json to midi conversion 49 | { 50 | protected: 51 | std::vector arguments; 52 | void ParseJSON(); 53 | void VerifyTracks(); 54 | void MakeMIDI(const std::string&); 55 | public: 56 | std::vector parts; 57 | song(const std::vector&); 58 | }; 59 | 60 | class safe_divider // class for dividing in a safe way 61 | { 62 | protected: 63 | uint32_t remainder{}; 64 | public: 65 | uint32_t divide(uint32_t,uint32_t); 66 | }; 67 | 68 | uint8_t GetNote(const std::string&); // 0 - error, 1 - empty/mute, 2 - ~, 3 - @, 4 - %, 5 - !, 6 - ^ 69 | 70 | } 71 | 72 | #endif 73 | -------------------------------------------------------------------------------- /src/song_handler.cpp: -------------------------------------------------------------------------------- 1 | #include "song_handler.h" 2 | #include "pt2.h" 3 | #include "csv.h" 4 | #include 5 | 6 | namespace pt2 7 | { 8 | 9 | int handle_song(const std::vector& args) 10 | try 11 | { 12 | std::cout << args.at(0) << std::endl; 13 | song song(args); 14 | for (uint32_t p=0; p args; 41 | csv::CSVfile csv(filename); 42 | uint32_t stat_allsongs{}; 43 | uint32_t stat_goodsongs{}; 44 | uint8_t bpm{2}; 45 | if (old) 46 | bpm = 4; 47 | for (auto i=csv.records.begin(); i<=csv.records.end(); ++i) 48 | { 49 | if (!args.empty()&&(i==csv.records.end()||args[0]!=i->fields.at(5))) 50 | { 51 | ++stat_allsongs; 52 | args[0] = args[0] + ".json"; 53 | args.push_back("-f"); 54 | if (handle_song(args)==0) 55 | ++stat_goodsongs; 56 | args.clear(); 57 | } 58 | if (i==csv.records.end()) 59 | break; 60 | if (i->fields.at(bpm).empty()||i->fields.at(3).empty()) 61 | { 62 | args.clear(); 63 | } 64 | else 65 | { 66 | if (args.empty()) 67 | args.push_back(i->fields.at(5)); 68 | args.push_back(i->fields.at(bpm)); 69 | args.push_back(i->fields.at(3)); 70 | } 71 | } 72 | std::cout << "================================" << std::endl; 73 | std::cout << stat_goodsongs << " of " << stat_allsongs << " songs were converted." << std::endl; 74 | std::cout << "Conversion rate is:" << std::endl; 75 | std::cout << static_cast(stat_goodsongs*100)/static_cast(stat_allsongs) << "%" << std::endl; 76 | std::cout << "================================" << std::endl; 77 | std::cin.get(); 78 | } 79 | 80 | int handle_file(const std::vector& args) 81 | { 82 | const std::string& name = args.at(0); 83 | if (name.size()>=4&&name.substr(name.size()-4,4)==".csv") 84 | handle_csv(name,(args.back()=="-old")); 85 | else 86 | return handle_song(args); 87 | return 0; 88 | } 89 | 90 | } 91 | -------------------------------------------------------------------------------- /src/song_handler.h: -------------------------------------------------------------------------------- 1 | #ifndef SONG_HANDLER_H 2 | #define SONG_HANDLER_H 3 | 4 | #include 5 | #include 6 | 7 | namespace pt2 8 | { 9 | 10 | int handle_file(const std::vector&); 11 | 12 | } 13 | 14 | #endif 15 | --------------------------------------------------------------------------------