├── .github └── workflows │ └── cmake.yml ├── .gitmodules ├── CHANGELOG.md ├── CMakeLists.txt ├── LICENSE ├── README.md ├── build.sh ├── examples ├── 1.cpp ├── 2.cpp └── 3.cpp ├── livecoding_screenshot.png └── src ├── expression.hpp ├── generator.hpp ├── instrument.hpp ├── notes.hpp ├── taskpool.hpp ├── zoengine.cpp └── zoengine.h /.github/workflows/cmake.yml: -------------------------------------------------------------------------------- 1 | name: Release Build 2 | 3 | on: 4 | push: 5 | branches: [submodule_rtmidi] 6 | pull_request: 7 | branches: [submodule_rtmidi] 8 | types: [closed] 9 | 10 | jobs: 11 | # release_linux: 12 | # name: zeroOne Linux release 13 | # runs-on: ubuntu-latest 14 | 15 | # steps: 16 | # - uses: actions/checkout@v2 17 | 18 | # - name: Create Build Directory 19 | # run: cmake -E make_directory ${{github.workspace}}/build 20 | 21 | # - name: Configure CMake 22 | # run: cmake -S src -B build -DCMAKE_BUILD_TYPE=Release 23 | 24 | # - name: Build 25 | # run: cmake --build ./build --config Release 26 | 27 | # - name: Create Artifact 28 | # run: | 29 | # mkdir release 30 | # cp build/main release/main 31 | 32 | # - name: Publish Linux Artifact 33 | # uses: actions/upload-artifact@v2 34 | # with: 35 | # name: zeroOne Linux release 36 | # path: release 37 | 38 | release_macos: 39 | name: zeroOne macOS 11 release 40 | runs-on: macos-11 41 | 42 | steps: 43 | - uses: actions/checkout@v2 44 | 45 | - name: Create Build Directory 46 | run: cmake -E make_directory ${{github.workspace}}/build 47 | 48 | - name: Configure CMake 49 | # run: cmake -S . -B build -DCMAKE_BUILD_TYPE=Release 50 | run: cmake -S . -B build -DRTMIDI_API_JACK=OFF RTMIDI_BUILD_TESTING=OFF 51 | 52 | - name: Build 53 | run: cmake --build ./build --config Release 54 | 55 | # - name: Create Artifact 56 | # run: | 57 | # mkdir zeroone/release 58 | # cp zeroone/build/main zeroone/release/main 59 | 60 | # - name: Publish MacOS 11 Artifact 61 | # uses: actions/upload-artifact@v2 62 | # with: 63 | # name: zeroOne macOS 11 release 64 | # path: release 65 | -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "external/diatonic"] 2 | path = external/diatonic 3 | url = https://github.com/pd3v/diatonic.git 4 | [submodule "external/rtmidi"] 5 | path = external/rtmidi 6 | url = https://github.com/thestk/rtmidi.git 7 | -------------------------------------------------------------------------------- /CHANGELOG.md: -------------------------------------------------------------------------------- 1 | ## 0.6 2 | . Includes [__diatonic__](https://github.com/pd3v/diatonic) library 3 | 4 | . Includes **RtMidi** library 5 | 6 | ____ 7 | 8 | ## 0.5 9 | . Builds as a dynamic library 10 | 11 | ____ 12 | 13 | ## 0.4.6 14 | . New beat sync resettable random numbers functions - **rndsync** and **rndbunchsync** 15 | 16 | . Simpler instruments' identifications: i1, i2, ...,i5 adding to the already existent i(1), i(2), ..., i(5) 17 | 18 | . Possible to set CC and note(s) within the instrument's **play** function definition 19 | 20 | . **rotl** and **rotr** beat sync resettable 21 | 22 | . Put back instruments' playing out notes feature 23 | 24 | ____ 25 | 26 | ## 0.4.5 27 | 28 | . New helper **rnd10**, **rnd25**, **rnd50**, **rnd75**, **thisthator** functions 29 | 30 | . Improved sync 31 | 32 | ___ 33 | 34 | ## 0.3.2 35 | 36 | 37 | . New **n** function with note(s), velocity and duration parameters; no octave 38 | 39 | . **n** function is now **no**, and "o" stands for octave parameter 40 | 41 | . Improved sync 42 | 43 | . New helper function - **transp** 44 | 45 | . Metronome on its own thread 46 | 47 | ____ 48 | 49 | ## 0.3.1 50 | 51 | 52 | . Validations in some helper functions 53 | 54 | . Improved sync 55 | 56 | . Short-typed note duration pattern; eg. short-typed {4,3,6,8} parses into {4,3,3,3,6,6,6,6,6,6,8,8}. 1st 1/4 = 4, 2nd 1/4 = 3,3,3, etc. 57 | 58 | . New helper functions - **edger**, **edgerx**, **swarm**, **chop**, **insync** and **bounce** 59 | 60 | . Instruments +1 to work as a metronome (metro()), alias **sync** 61 | 62 | . Rename **istep** to **isync**, **ccstep** to **ccsync**, **whenMod** to **when** 63 | 64 | ___ 65 | 66 | ## 0.3 67 | 68 | 69 | . Refactoring some helper functions to become more generic 70 | 71 | . new helper functions: **cycle**, **rcycle**, **slow**, **fast** and **sine** 72 | 73 | . MIDI CC (virtually unlimited) to each instrument 74 | 75 | . **ccstep**, for synchronizing CC changes to instrument rhythm 76 | 77 | . **noctrl**, to remove all MIDI CC from each and every instrument 78 | 79 | . **x**, stands for rest note 80 | 81 | ___ 82 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.19.2) 2 | 3 | set(CMAKE_CXX_STANDARD 17) 4 | 5 | project(zeroone) 6 | 7 | add_library( 8 | ${PROJECT_NAME} SHARED 9 | src/zoengine.h 10 | src/zoengine.cpp 11 | src/notes.hpp 12 | src/taskpool.hpp 13 | src/instrument.hpp 14 | src/generator.hpp 15 | src/expression.hpp 16 | ) 17 | 18 | add_subdirectory(external/diatonic) 19 | add_subdirectory(external/rtmidi) 20 | 21 | target_include_directories( 22 | ${PROJECT_NAME} 23 | PUBLIC external/diatonic/include/ 24 | PRIVATE external/rtmidi/ 25 | ) 26 | 27 | target_link_directories( 28 | ${PROJECT_NAME} 29 | PUBLIC external/diatonic/src/ 30 | PRIVATE external/rtmidi/ 31 | ) 32 | 33 | target_link_libraries( 34 | ${PROJECT_NAME} 35 | LINK_PUBLIC diatonic 36 | LINK_PRIVATE rtmidi 37 | ) 38 | -------------------------------------------------------------------------------- /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 | # zeroOne 2 | 3 | __zeroOne__ is a polyphonic instrument, multi-instrument, DSLish/API MIDI sequencer for live coding music. It sends MIDI messages to any stand-alone synthesiser or DAW. 4 | ##### To some videos live coding with it [go here](https://twitter.com/search?q=%2301livecoding&src=hashtag_click&f=live).(twttr) 5 | 6 | ![livecoding_screenshot](https://github.com/pd3v/wide/blob/develop/livecoding_screenshot.png) 7 | 8 | ### Dependencies 9 | 10 | [RtMidi](http://www.music.mcgill.ca/~gary/rtmidi/) library 11 | 12 | ### Live coding 13 | 14 | [__cling__](https://github.com/root-project/cling.git) (an interative C++ interpreter) is for the live coding enverionment. 15 | 16 | #### 1. Install cling 17 | 18 | ##### On Mac and Linux using Homebrew 19 | 1. open your command line software 20 | 2. type `brew install cling` 21 | 22 | #### 2. Or download cling 23 | Alternatively, you can download the right build for your machine:[__cling builds for Linux and MacOS__](https://root.cern.ch/download/cling/) 24 | 25 | *Or you still can compile/link __zeroOne__ as any other c++ library and code with it as so.* 26 | 27 | ### How to use it 28 | 1. open your synth ready to listen MIDI messages 29 | 2. open your command line software 30 | 3. run ./build.sh 31 | 4. at cling's prompt load **zeroone** by entering the following lines: 32 | 33 | [cling]$ .L zeroone 34 | 35 | [cling]$ #include "../src/zoengine.h" 36 | 37 | [cling]$ zeroone() 38 | 39 | 5. after message "zEROoNE on <((()))>" appears, copy/paste the code below: 40 | 41 | Instrument 1 sends "C Major" chord notes to midi channel 1, 0.9 amplitude and 1/4 duration. 42 | 43 | ``` 44 | i1.play(n( 45 | ({36,40,43}), 46 | 0.9, 47 | {4}, 48 | )) 49 | ``` 50 | 51 | and/or 52 | 53 | Instrument 2 sends cycling c4,cs4 and d4 notes to midi channel 2, 0.5 amplitude, 1/4, 1/8, 1/4, 1/8, 1/4 duration sequence. 54 | 55 | ``` 56 | i2.play(n( 57 | {cycle({48,49,50},isync(2))}, 58 | 0.5, 59 | ({4,8,4,8,4}) 60 | )) 61 | ``` 62 | 63 | and/or 64 | 65 | Instrument 3 sends cycling pentatonic minor scale notes to midi channel 3 and modulates cc channel 1 and 2. 66 | 67 | ``` 68 | i3.play(n( 69 | {cycle( 70 | scale_::transpose(scale_::pentatonicminor,5), 71 | isync(3)) 72 | }, 73 | 0.9, 74 | ({4,8,4,8,4})), 75 | cc(1,rnd(chop(10))), 76 | cc(2,bounce(0,127)) 77 | ) 78 | ``` 79 | 80 | ## Make some noise! 81 | -------------------------------------------------------------------------------- /build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | mkdir build 4 | cd build 5 | 6 | # Not using JACK 7 | cmake -DRTMIDI_API_JACK=OFF RTMIDI_BUILD_TESTING=OFF .. 8 | 9 | # Using JACK 10 | #cmake -DRTMIDI_BUILD_TESTING=OFF .. 11 | 12 | make 13 | cling -std=c++14 -------------------------------------------------------------------------------- /examples/1.cpp: -------------------------------------------------------------------------------- 1 | 2 | // Play C4 note in instrument 1, amplitude 1, 1/4 duration notes, octave 4. 3 | 4 | i(1).play(n( 5 | {0}, 6 | 1, 7 | {4}, 8 | 4 9 | )) 10 | 11 | // Play C Major 7 chord in instrument 1, amplitude 1, 1/16 duration notes, octave 5. 12 | 13 | i(1).play(n( 14 | ({0,4,7,11}), 15 | 1, 16 | {16}, 17 | 5 18 | )) 19 | 20 | // Or 21 | 22 | chord CMaj7 {0,4,7,11} 23 | 24 | i(1).play(n( 25 | (CMaj7), 26 | 1, 27 | {4}, 28 | 5 29 | )) -------------------------------------------------------------------------------- /examples/2.cpp: -------------------------------------------------------------------------------- 1 | // Play random notes from chromatic scale; default scale for every instrument 2 | 3 | i(1).play(n( 4 | {rnd(12)}, 5 | 1, 6 | {16}, 7 | 4 8 | )) 9 | 10 | // Random chords on varying repeating rhythm 11 | 12 | scale CMajor {0,2,4,5,7,9,11} 13 | 14 | i(1).play(n( 15 | ({rnd(5),rnd(5,8),rnd(8,12)}), // chromatic scale 16 | 1, 17 | ({4,6,32,3}), 18 | 4 19 | )) 20 | 21 | i(2).play(n( 22 | {rnd(CMajor)}, 23 | 1, 24 | ({4,6,32,3}), 25 | 5 26 | )) -------------------------------------------------------------------------------- /examples/3.cpp: -------------------------------------------------------------------------------- 1 | 2 | bpm(140) 3 | 4 | scale CMinor{0,2,3,5,7,8,10} 5 | 6 | // randomize anything and everything 7 | 8 | i(1).play(n( 9 | ({rnd(CMinor)}), 10 | rnd(0.0,1.0), 11 | {rnd({4,3,8,16})}, 12 | rnd({2,5,6})) 13 | ) -------------------------------------------------------------------------------- /livecoding_screenshot.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pd3v/zeroone/dfc58ed1ff7d7809a25363b7dbf2ebd7af3a639a/livecoding_screenshot.png -------------------------------------------------------------------------------- /src/expression.hpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | 7 | #pragma once 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | 15 | extern const int REST_NOTE; 16 | const float PI = 3.14159265; 17 | 18 | auto x = REST_NOTE; 19 | 20 | template 21 | T rnd(const T& max,typename enable_if::value,void*>::type() = nullptr) { 22 | return max != 0 ? rand()%static_cast(max) : 0; 23 | }; 24 | 25 | template 26 | typename std::common_type::type range(const T& value,const T& max, const U& toMax) { 27 | return max != 0 ? static_cast(value)/max*toMax : 0; 28 | } 29 | 30 | // If range is to convert to MIDI values, toMin and toMax already set by default 31 | template 32 | typename std::common_type::type range(const T& value,const T& max,const U& toMin=0,const U& toMax=127) { 33 | return max != 0 ? static_cast(value)*(toMax-toMin)/max+toMin : 0; 34 | } 35 | 36 | template 37 | typename std::common_type::type range(const T& value,const T& min,const T& max,const U& toMin,const U& toMax) { 38 | return max != 0 ? (static_cast(value)-min)*(toMax-toMin)/(max-min)+toMin : 0; 39 | } 40 | 41 | template 42 | float rnd(const T& max,typename enable_if::value,void*>::type() = nullptr) { 43 | return range(static_cast(rand()%1000),static_cast(1000),0.f,static_cast(max)); 44 | }; 45 | 46 | template 47 | T rnd(const T& min,const T& max,typename enable_if::value,void*>::type() = nullptr) { 48 | return max != 0 ? rand()%static_cast(max-min)+min : 0; 49 | }; 50 | 51 | template 52 | float rnd(const T& min,const T& max,typename enable_if::value,void*>::type() = nullptr) { 53 | return range(static_cast(rand()%1000),static_cast(1000),static_cast(min),static_cast(max)); 54 | }; 55 | 56 | template 57 | T rnd(vector bunch) { 58 | return static_cast(bunch[rand()%bunch.size()]); 59 | } 60 | 61 | template 62 | vector rnd(vector> bunch) { 63 | return static_cast>(bunch[rand()%bunch.size()]); 64 | } 65 | 66 | template 67 | vector scramble(vector n) { 68 | random_shuffle(n.begin(),n.end()); 69 | 70 | return n; 71 | } 72 | 73 | template 74 | vector> scramble(vector> n) { 75 | random_shuffle(n.begin(),n.end()); 76 | 77 | return n; 78 | } 79 | 80 | template 81 | vector rndw(T min,T max,T repeatNum,int weight,int size=10) { 82 | vector wVec(size); 83 | 84 | fill(wVec.begin(),wVec.end(),repeatNum); 85 | transform(wVec.begin(),wVec.begin()+static_cast(size-round(weight/10.)),wVec.begin(),[&](T v){ 86 | return rnd(min,max); 87 | }); 88 | 89 | return scramble(wVec); 90 | } 91 | 92 | template 93 | T rnd75(T min,T max,T repeatNum,int size=10) { 94 | return rndw(min,max,repeatNum,25,size).at(0); 95 | } 96 | 97 | template 98 | T rnd50(T min,T max,T repeatNum,int size=10) { 99 | return rndw(min,max,repeatNum,50,size).at(0); 100 | } 101 | 102 | template 103 | T rnd25(T min,T max,T repeatNum,int size=10) { 104 | return rndw(min,max,repeatNum,75,size).at(0); 105 | } 106 | 107 | template 108 | T rnd10(T min,T max,T repeatNum,int size=10) { 109 | return rndw(min,max,repeatNum,90,size).at(0); 110 | } 111 | 112 | auto rndsync = [rndValue=int(0),lastStep=uint16_t(0)](int min,int max,uint16_t step=0) mutable { 113 | if (step != lastStep) { 114 | rndValue = rnd(min,max); 115 | lastStep = step; 116 | } 117 | 118 | return rndValue; 119 | }; 120 | 121 | auto rndbunchsync = [rndValue=int(0),lastStep=uint16_t(0)](vector bunch,uint16_t step=0) mutable { 122 | if (step != lastStep) { 123 | rndValue = rnd(bunch); 124 | lastStep = step; 125 | } 126 | 127 | return rndValue; 128 | }; 129 | 130 | int mod(int countTurn) { 131 | return countTurn != 0 ? Metro::sync(4)%countTurn : 0; 132 | } 133 | 134 | int mod(int countTurn, unsigned long step) { 135 | return countTurn != 0 ? step%countTurn : 0; 136 | } 137 | 138 | bool when(int countTurn, unsigned long step) { 139 | return countTurn != 0 ? step%countTurn == 0 : false; 140 | } 141 | 142 | template 143 | T thisthat(T _this, T _that, int turn, int every) { 144 | return (mod(turn) < every ? _this : _that); 145 | } 146 | 147 | template 148 | T thisthat(T _this, T _that, function pred) { 149 | return pred() ? _this : _that; 150 | } 151 | 152 | template 153 | T thisthat(T _this, T _that, bool pred) { 154 | return (pred == true ? _this : _that); 155 | } 156 | 157 | template 158 | T thisthator(T _this, T _that, T _or, int turn, int every, int orEvery) { 159 | return thisthat(_this, thisthat(_that, _or, turn, orEvery), turn, every); 160 | } 161 | 162 | template 163 | T cycle(T max) { 164 | return (max != 0 ? Metro::sync(4)%max : 0); 165 | } 166 | 167 | template 168 | T cycle(T max, unsigned long step) { 169 | return max != 0 ? step%max : 0; 170 | } 171 | 172 | template 173 | T cycle(T min, T max) { 174 | return (max != 0 && max-min != 0) ? Metro::sync(4)%(max-min)+min : 0; 175 | } 176 | 177 | template 178 | T cycle(T min, T max, unsigned long step) { 179 | return (max != 0 && max-min != 0) ? step%(max-min)+min : 0; 180 | } 181 | 182 | template 183 | T cycle(vector v) { 184 | return v.at(Metro::sync(4)%v.size()); 185 | } 186 | 187 | template 188 | T cycle(vector v, unsigned long step) { 189 | return v.at(step%v.size()); 190 | } 191 | 192 | template 193 | vector cycle(vector> v) { 194 | return v.at(Metro::sync(4)%v.size()); 195 | } 196 | 197 | template 198 | vector cycle(vector> v, unsigned long step) { 199 | return v.at(step%v.size()); 200 | } 201 | 202 | template 203 | T rcycle(T max) { 204 | return max-Metro::sync(4)%max-1; 205 | } 206 | 207 | template 208 | T rcycle(T max, unsigned long step) { 209 | return max-step%max-1; 210 | } 211 | 212 | template 213 | T rcycle(T min, T max) { 214 | return (max-1)-(Metro::sync(4)%(max-min)); 215 | } 216 | 217 | template 218 | T rcycle(T min, T max, unsigned long step) { 219 | return (max-1)-(step%(max-min)); 220 | } 221 | 222 | template 223 | T rcycle(vector v) { 224 | return v.at(v.size()-Metro::sync(4)%v.size()-1); 225 | } 226 | 227 | template 228 | T rcycle(vector v, unsigned long step) { 229 | return v.at(v.size()-step%v.size()-1); 230 | } 231 | 232 | template 233 | vector rcycle(vector> v) { 234 | return v.at(v.size()-Metro::sync(4)%v.size()-1); 235 | } 236 | 237 | template 238 | vector rcycle(vector> v, unsigned long step) { 239 | return v.at(v.size()-step%v.size()-1); 240 | } 241 | 242 | template 243 | vector trim(const vector& v, int nValues) { 244 | vector newVec(v.cbegin(), v.cbegin()+nValues); 245 | 246 | return newVec; 247 | } 248 | 249 | template 250 | vector rtrim(const vector& v, int nValues) { 251 | vector newVec(v.cend()-nValues, v.cend()); 252 | 253 | return newVec; 254 | } 255 | 256 | template 257 | vector merge(vector v1, vector v2) { 258 | vector vMerged(v1); 259 | vMerged.insert(vMerged.cend(),v2.cbegin(),v2.cend()); 260 | 261 | return vMerged; 262 | } 263 | 264 | template 265 | T edge(T min,T max) { 266 | T avg = (max-min)/2; 267 | return Metro::sync(4)%2 == 0 ? cycle(min,avg) : rcycle(avg,max); 268 | } 269 | 270 | template 271 | T edge(vector v) { 272 | T midSize = v.size()/2; 273 | return Metro::sync(4)%2 == 0 ? cycle(trim(v,midSize)) : rcycle(rtrim(v,midSize)); 274 | } 275 | 276 | template 277 | T edge(T min,T max,unsigned long step) { 278 | T avg = (max-min)/2; 279 | return step%2 == 0 ? cycle(min,avg,step) : rcycle(avg,max,step); 280 | } 281 | 282 | template 283 | T edge(vector v,unsigned long step) { 284 | T midSize = v.size()/2; 285 | return Metro::sync(4)%2 == 0 ? cycle(trim(v,midSize),step) : rcycle(rtrim(v,midSize),step); 286 | } 287 | 288 | template 289 | T edgex(T min,T max) { 290 | return Metro::sync(4)%2 == 0 ? cycle(min,max) : rcycle(min,max); 291 | } 292 | 293 | template 294 | T edgex(T min,T max,unsigned long step) { 295 | return step%2 == 0 ? cycle(min,max,step) : rcycle(min,max,step); 296 | } 297 | 298 | template 299 | T edgex(vector v) { 300 | return Metro::sync(4)%2 == 0 ? cycle(v) : rcycle(v); 301 | } 302 | 303 | template 304 | T edgex(vector v,unsigned long step) { 305 | return step%2 == 0 ? cycle(v,step) : rcycle(v,step); 306 | } 307 | 308 | template 309 | T swarm(T value,T spread) { 310 | int sign = rnd(0,2); 311 | return sign == 0 ? value-rnd(0,spread) : value+rnd(0,spread); 312 | } 313 | 314 | int parts(int _parts,int size=127) { 315 | return size/_parts; 316 | } 317 | 318 | vector chop(int parts,int size=127) { 319 | vector v; 320 | 321 | for (int i = 0;i < parts;++i) 322 | v.push_back(floor(size/parts*i)); 323 | 324 | return v; 325 | } 326 | 327 | vector chopr(int parts,int size=127) { 328 | vector v; 329 | 330 | for (int i = 1;i <= parts;++i) { 331 | v.push_back(floor(size/parts*i)); 332 | } 333 | 334 | return v; 335 | } 336 | 337 | template 338 | T bounce(T min,T max) { 339 | return mod(max*2,Metro::sync(4)) < max ? cycle(min,max,Metro::sync(4)) : rcycle(min,max,Metro::sync(4)); 340 | } 341 | 342 | template 343 | T bounce(T min,T max,unsigned long step) { 344 | return mod(max*2,step) < max ? cycle(min,max,step) : rcycle(min,max,step); 345 | } 346 | 347 | template 348 | T bounce(vector v) { 349 | return mod((v.size()-1)*2,Metro::sync(4)) < v.at(v.size()-1) ? cycle(v) : rcycle(v); 350 | } 351 | 352 | template 353 | T bounce(vector v,unsigned long step) { 354 | return mod((v.size()-1)*2,step) < v.at(v.size()-1) ? cycle(v,step) : rcycle(v,step); 355 | } 356 | 357 | template 358 | int slow(T value,float xtimes) { 359 | return floor((static_cast(value)%static_cast(127*xtimes))/xtimes); 360 | } 361 | 362 | template 363 | int fast(T value,float xtimes) { 364 | return floor(static_cast(value*xtimes)%127); 365 | } 366 | 367 | template 368 | vector rotl(vector v) { 369 | rotate(v.begin(),v.begin()+mod(v.size(),Metro::sync(4)),v.end()); 370 | 371 | return v; 372 | } 373 | 374 | template 375 | vector rotl(vector v, unsigned long step) { 376 | rotate(v.begin(),v.begin()+mod(v.size(),step%v.size()),v.end()); 377 | 378 | return v; 379 | } 380 | 381 | template 382 | vector rotr(vector v) { 383 | rotate(v.begin(),v.begin()+(v.size()-mod(v.size(),Metro::sync(4))),v.end()); 384 | 385 | return v; 386 | } 387 | 388 | template 389 | vector rotr(vector v, unsigned long step) { 390 | rotate(v.begin(),v.begin()+(v.size()-mod(v.size(),step%v.size())),v.end()); 391 | 392 | return v; 393 | } 394 | 395 | template 396 | vector transp(vector v,int oct) { 397 | vector _v (v.begin(),v.end()); 398 | 399 | transform(_v.begin(),_v.end(),_v.begin(),[&](int note){return 12*oct+note;}); 400 | 401 | return _v; 402 | } 403 | 404 | template 405 | vector transp(vector v,vector oct) { 406 | vector _v (v.begin(),v.end()); 407 | 408 | transform(_v.begin(),_v.end(),oct.begin(),_v.begin(),[&](int note,int _oct) { 409 | auto noteTransp = 12*_oct+note; 410 | return (noteTransp < 0 || noteTransp > 127) ? note : noteTransp; 411 | }); 412 | 413 | return _v; 414 | } 415 | 416 | float sine(int degrees) { 417 | return fabs(sin(degrees*PI/180)); 418 | } 419 | -------------------------------------------------------------------------------- /src/generator.hpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API + MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | 7 | #pragma once 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include "notes.hpp" 14 | 15 | extern const int REST_NOTE; 16 | extern const float BAR_DUR_REF; // microseconds 17 | extern const float BPM_REF; 18 | 19 | using namespace std; 20 | 21 | using noteDurMs = std::pair; 22 | 23 | class Generator { 24 | public: 25 | static float barDur() { 26 | return BAR_DUR_REF/(bpm/BPM_REF); 27 | } 28 | 29 | //FIXME: division is not an atomic operation, so is this returning atomically?...hummm 30 | static std::atomic bpmRatio() { 31 | return {bpm/BPM_REF}; 32 | } 33 | 34 | static float barDur(float _bpm) { 35 | if (_bpm > 0) { 36 | bpm = _bpm; 37 | return BAR_DUR_REF/(bpm/BPM_REF); 38 | } 39 | return bpm; 40 | } 41 | 42 | static Notes midiNote(const function& fn) { 43 | Notes notes = fn(); 44 | protoNotes = notes; // Notes object before converting to MIDI spec 45 | 46 | if (notes.oct != 1) // MIDI note value depends on octave specification 47 | transform(notes.notes.begin(), notes.notes.end(), notes.notes.begin(), [&](int n){ 48 | return (n != REST_NOTE ? notes.oct*12+scale[n%scale.size()] : n); 49 | }); 50 | 51 | notes.amp = ampToVel(notes.amp); 52 | notes.dur = parseDurPattern(fn); 53 | 54 | transform(notes.dur.begin(), notes.dur.end(), notes.dur.begin(), [&](int d){ 55 | return duration[d]/bpmRatio(); 56 | }); 57 | 58 | return notes; 59 | } 60 | 61 | static Notes midiNoteExcludeDur(const function& fn) { 62 | Notes notes = fn(); 63 | protoNotes = notes; // Notes object before converting to MIDI spec 64 | 65 | if (notes.oct != 1) // MIDI note value depends on octave specification 66 | transform(notes.notes.begin(), notes.notes.end(), notes.notes.begin(), [&](int n){ 67 | return (n != REST_NOTE ? notes.oct*12+scale[n%scale.size()] : n); 68 | }); 69 | 70 | notes.amp = ampToVel(notes.amp); 71 | 72 | return notes; 73 | } 74 | 75 | 76 | static vector midiCC(const vector>& ccsFn) { 77 | vector ccValues; 78 | 79 | for(auto& _ccFn : ccsFn) 80 | ccValues.push_back(_ccFn()); 81 | 82 | return ccValues; 83 | } 84 | 85 | static vector parseDurPattern(const function& fn) { 86 | Notes notes = fn(); 87 | float accDurTotal = 0; 88 | short offset = 5; 89 | vector tempDur; 90 | 91 | if (notes.dur.size() == 1) { 92 | notes.dur.resize(BAR_DUR_REF/duration[(notes.dur.front())]); 93 | fill(notes.dur.begin(),notes.dur.end(),notes.dur.front()); 94 | 95 | return notes.dur; 96 | } 97 | 98 | // --- All time figures explicit 99 | for (int d : notes.dur) 100 | accDurTotal += duration[d]/(bpm/BPM_REF); 101 | 102 | if (accDurTotal >= barDur()-offset && accDurTotal <= barDur()+offset) 103 | return notes.dur; 104 | // --- 105 | 106 | accDurTotal = 0; 107 | 108 | // --- Short-typed note duration pattern. Eg. short-typed {4,3,6,16} parses into {4,3,3,3,6,6,6,6,6,6,16,16,16,16} 109 | for (int d : notes.dur) { 110 | auto numDurFigure = (d < 3 ? static_cast(ceil(static_cast(duration[4])/duration[d])) : duration[4]/duration[d]); 111 | 112 | for (int i = 0;i < numDurFigure; ++i) 113 | tempDur.push_back(d); 114 | } 115 | 116 | for (int d : tempDur) 117 | accDurTotal += duration[d]/(bpm/BPM_REF); 118 | 119 | if (accDurTotal >= barDur()-offset && accDurTotal <= barDur()+offset) 120 | return tempDur; 121 | // --- 122 | 123 | return {}; 124 | } 125 | 126 | static vector scale; 127 | static float bpm; 128 | static Notes protoNotes; 129 | private: 130 | static int ampToVel(float amp) { 131 | return round(127*amp); 132 | } 133 | 134 | static unordered_map duration; 135 | }; 136 | 137 | vector Generator::scale = {}; // Chromatic scale as default 138 | float Generator::bpm = BPM_REF; 139 | Notes Generator::protoNotes = {{0},0.,{1},1}; 140 | 141 | unordered_map Generator::duration{noteDurMs(1,4000000),noteDurMs(2,2000000),noteDurMs(4,1000000),noteDurMs(8,500000),noteDurMs(3,666666),noteDurMs(16,250000),noteDurMs(6,333333),noteDurMs(32,125000),noteDurMs(64,62500)}; 142 | -------------------------------------------------------------------------------- /src/instrument.hpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API + MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | 7 | #pragma once 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include "notes.hpp" 14 | #include "generator.hpp" 15 | 16 | extern const uint16_t NUM_TASKS; 17 | extern const function SILENCE; 18 | extern const vector> NO_CTRL; 19 | 20 | using namespace std; 21 | 22 | class Instrument { 23 | public: 24 | Instrument(uint8_t id) : id(id),_ch(id) {} 25 | 26 | void play(function _f) { 27 | if (!Generator::parseDurPattern(_f).empty()) { 28 | isWritingPlayFunc->store(true); 29 | *f = _f; 30 | isWritingPlayFunc->store(false); 31 | } 32 | } 33 | 34 | // notes function and cc packs function combined 35 | template 36 | void play(function _f,T fcc1,U... fccn) { 37 | play(_f); 38 | if (_recurCCStart) { 39 | _ccs.clear(); 40 | _recurCCStart = false; 41 | } 42 | _ccs.emplace_back(fcc1); 43 | ctrl(fccn...); 44 | } 45 | 46 | void ctrl(){ 47 | isWritingCCFunc->store(true); 48 | *ccs = _ccs; 49 | isWritingCCFunc->store(false); 50 | _recurCCStart = true; 51 | } 52 | 53 | template 54 | void ctrl(T fcc1,U... fccn) { 55 | if (_recurCCStart) { 56 | _ccs.clear(); 57 | _recurCCStart = false; 58 | } 59 | _ccs.emplace_back(fcc1); 60 | ctrl(fccn...); 61 | } 62 | 63 | void noctrl() { 64 | ccs->clear(); 65 | _ccs.clear(); 66 | } 67 | 68 | vector outNotes() { 69 | return out.notes; 70 | } 71 | 72 | int outNotes(int notePos) { 73 | return out.notes.at(notePos); 74 | } 75 | 76 | double outAmp() { 77 | return out.amp; 78 | } 79 | 80 | vector outDur() { 81 | return out.dur; 82 | } 83 | 84 | int outDur(int durPos) { 85 | return out.dur.at(durPos); 86 | } 87 | 88 | int outOct() { 89 | return out.oct; 90 | } 91 | 92 | void mute() { 93 | _mute = true; 94 | } 95 | 96 | void unmute() { 97 | _mute = false; 98 | } 99 | 100 | bool isMuted() { 101 | return _mute; 102 | } 103 | 104 | uint8_t id; 105 | uint32_t step = 0, ccStep = 0; 106 | shared_ptr> const f = make_shared>(SILENCE); 107 | shared_ptr>> const ccs = make_shared>>(NO_CTRL); 108 | Notes out = {{0},0.,{1},1}; 109 | unique_ptr> isWritingPlayFunc = make_unique>(false); 110 | unique_ptr> isWritingCCFunc = make_unique>(false); 111 | 112 | private: 113 | int _ch; 114 | bool _mute = false; 115 | bool _recurCCStart = true; 116 | vector> _ccs{}; 117 | }; 118 | 119 | // Metronome standalone, in an independent thread 120 | struct Metro { 121 | public: 122 | static uint32_t step; 123 | static bool on; 124 | static std::future metronomeTask; 125 | static std::vector instsWaitingTimes; 126 | static unsigned long startTime, elapsedTime; 127 | 128 | static void setTick(int _tickPrecision) { 129 | tickPrecision = _tickPrecision; 130 | } 131 | 132 | static uint8_t tick() { 133 | return tickPrecision; 134 | } 135 | 136 | static int metronome() { 137 | unsigned long t = 0; 138 | 139 | while (on) { 140 | startTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 141 | 142 | step++; 143 | 144 | elapsedTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 145 | t = static_cast((Generator::barDur())/tickPrecision)-(elapsedTime-startTime); 146 | t = (t > 0 ? t : 0); 147 | 148 | this_thread::sleep_for(chrono::microseconds(t)); 149 | } 150 | 151 | return 0; 152 | } 153 | 154 | static void resetWaitingTimes() { 155 | for(auto& t : instsWaitingTimes) 156 | t = 0; 157 | } 158 | 159 | static void start() { 160 | on = true; 161 | metronomeTask = async(launch::async,Metro::metronome); 162 | } 163 | 164 | static void stop() { 165 | on = false; 166 | metronomeTask.get(); 167 | TaskPool::yieldTaskCntr.store(0); 168 | resetWaitingTimes(); 169 | step = 0; 170 | } 171 | 172 | // will attempt to metro sync SJobs' tasks/threads 173 | static int syncInstTask(int instId) { 174 | TaskPool::yieldTaskCntr.store(++TaskPool::yieldTaskCntr); 175 | 176 | while ((TaskPool::yieldTaskCntr.load() >= 1 && TaskPool::yieldTaskCntr.load() <= NUM_TASKS) && on) { 177 | this_thread::yield(); 178 | if (TaskPool::yieldTaskCntr.load() >= NUM_TASKS) TaskPool::yieldTaskCntr.store(0); 179 | } 180 | 181 | return instId; 182 | } 183 | 184 | static long minWaitingTime() { 185 | long minWait = *min_element(instsWaitingTimes.begin(),instsWaitingTimes.end()); 186 | return (minWait < 0 ? 0 : minWait); 187 | } 188 | 189 | //FIXME: this range conversion sometimes returns the same value for two contiguous steps 190 | static uint32_t sync(int timeSignature) { 191 | return floor(step*(timeSignature/static_cast(tickPrecision))); 192 | } 193 | 194 | static uint32_t playhead() { 195 | return step; 196 | } 197 | 198 | private: 199 | static uint16_t tickPrecision; 200 | static future taskDo; 201 | }; 202 | 203 | uint16_t Metro::tickPrecision = 64; 204 | uint32_t Metro::step = 0; 205 | bool Metro::on = false; 206 | std::future Metro::metronomeTask; 207 | unsigned long Metro::startTime = 0, Metro::elapsedTime = 0; 208 | std::vector Metro::instsWaitingTimes(NUM_TASKS,0); 209 | -------------------------------------------------------------------------------- /src/notes.hpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API + MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | 7 | #pragma once 8 | 9 | #include 10 | #include 11 | 12 | struct Notes { 13 | std::vector notes; 14 | double amp; 15 | std::vector dur; 16 | int oct; 17 | // std::vector barDur; // holds original (bar units) dur 18 | 19 | void print() { 20 | std::cout << "{ "; 21 | for_each(notes.begin(),notes.end(),[](int n){std::cout << n << " ";}); 22 | std::cout << "}"; 23 | std::cout << amp << " { "; 24 | for_each(dur.begin(),dur.end(),[](int d){std::cout << d << " ";}); 25 | std::cout << "}" << oct << " " << std::endl; 26 | } 27 | }; 28 | 29 | struct CC { 30 | int ch; 31 | int value; 32 | void print() { 33 | std::cout << "cc { "; 34 | std::cout << ch << "," << value; 35 | std::cout << "}" << std::endl; 36 | } 37 | }; 38 | 39 | -------------------------------------------------------------------------------- /src/taskpool.hpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API + MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | 7 | #pragma once 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include "notes.hpp" 15 | 16 | extern const float BAR_DUR_REF; // microseconds 17 | extern const float BPM_REF; 18 | extern const uint16_t NUM_TASKS; 19 | extern const std::function SILENCE; 20 | 21 | template 22 | struct Job { 23 | int id; 24 | std::function* job; 25 | }; 26 | 27 | template 28 | struct TaskPool { 29 | static std::vector> tasks; 30 | static uint16_t numTasks; 31 | static std::deque jobs; 32 | static bool isRunning; 33 | static std::mutex mtx; 34 | static std::atomic yieldTaskCntr; 35 | static Job job; 36 | 37 | static void stopRunning() { 38 | isRunning = false; 39 | 40 | for (auto& t : tasks) 41 | t.get(); 42 | 43 | tasks.clear(); 44 | jobs.clear(); 45 | } 46 | }; 47 | 48 | template 49 | std::vector> TaskPool::tasks{}; 50 | 51 | template 52 | uint16_t TaskPool::numTasks = NUM_TASKS; 53 | 54 | template 55 | std::deque TaskPool::jobs{}; 56 | 57 | template 58 | std::mutex TaskPool::mtx; 59 | 60 | template 61 | std::atomic TaskPool::yieldTaskCntr(0); 62 | 63 | template 64 | bool TaskPool::isRunning = true; 65 | 66 | template 67 | Job TaskPool::job; 68 | 69 | struct SJob : public Job { 70 | int id; 71 | std::function* job; 72 | }; 73 | 74 | struct CCJob : public Job { 75 | int id; 76 | std::vector>* job; 77 | }; 78 | -------------------------------------------------------------------------------- /src/zoengine.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // wide - Live coding DSLish API + MIDI sequencer 3 | // 4 | // Created by @pd3v_ 5 | // 6 | #include "zoengine.h" 7 | 8 | using ampT = double; 9 | using durT = vector; 10 | using label = int; 11 | 12 | void pushSJob(vector& insts) { 13 | SJob j; 14 | int id = 0; 15 | 16 | while (TaskPool::isRunning) { 17 | if (TaskPool::jobs.size() < JOB_QUEUE_SIZE) { 18 | id = id%insts.size(); 19 | if (!insts.at(id).isWritingPlayFunc->load()) { 20 | j.id = id; 21 | j.job = &*insts.at(id).f; 22 | TaskPool::jobs.emplace_back(j); 23 | 24 | id++; 25 | } 26 | } 27 | this_thread::sleep_for(chrono::milliseconds(5)); 28 | } 29 | } 30 | 31 | void pushCCJob(vector& insts) { 32 | CCJob j; 33 | int id = 0; 34 | 35 | while (TaskPool::isRunning) { 36 | if (TaskPool::jobs.size() < JOB_QUEUE_SIZE) { 37 | id = id%insts.size(); 38 | if (!insts.at(id).isWritingCCFunc->load()) { 39 | j.id = id; 40 | j.job = &*insts.at(id).ccs; 41 | 42 | TaskPool::jobs.emplace_back(j); 43 | 44 | id++; 45 | } 46 | } 47 | this_thread::sleep_for(chrono::milliseconds(5)); 48 | } 49 | } 50 | 51 | // MARK: Not beeing used 52 | // play function algorithm changes have immediate effect on every note parameter but duration 53 | inline Notes checkPlayingFunctionChanges(function& newFunc, function& currentFunc) { 54 | Notes playNotes; 55 | 56 | if (newFunc) { 57 | if (playNotes.dur != Generator::midiNote(newFunc).dur) 58 | playNotes = Generator::midiNoteExcludeDur(currentFunc); 59 | else 60 | playNotes = Generator::midiNoteExcludeDur(newFunc); 61 | } else 62 | playNotes = Generator::midiNoteExcludeDur(currentFunc); 63 | 64 | return playNotes; 65 | } 66 | 67 | int taskDo(vector& insts) { 68 | RtMidiOut midiOut = RtMidiOut(); 69 | long barStartTime, barElapsedTime, barDeltaTime, noteStartTime, noteElapsedTime, noteDeltaTime, loopIterTime = 0; 70 | long t = 0; 71 | double barDur; 72 | vector noteMessage; 73 | 74 | SJob j; 75 | Notes playNotes; 76 | int jId; 77 | function jF = SILENCE; 78 | vector durationsPattern; 79 | 80 | midiOut.openPort(0); 81 | noteMessage.push_back(0); 82 | noteMessage.push_back(0); 83 | noteMessage.push_back(0); 84 | 85 | while (TaskPool::isRunning) { 86 | barStartTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 87 | barDur = Generator::barDur(); 88 | 89 | if (!TaskPool::jobs.empty()) { 90 | { 91 | const std::lock_guard lockJob(TaskPool::mtx); 92 | j = TaskPool::jobs.front(); 93 | jId = j.id; 94 | jF = *j.job; 95 | TaskPool::jobs.pop_front(); 96 | } 97 | 98 | if (jId >= 0 && jId < NUM_TASKS) { 99 | Metro::syncInstTask(jId); 100 | 101 | playNotes = Generator::midiNote(jF); 102 | insts[jId].out = Generator::protoNotes; 103 | 104 | durationsPattern = playNotes.dur; 105 | 106 | for (auto& dur : durationsPattern) { 107 | noteStartTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 108 | 109 | for (auto& note : playNotes.notes) { 110 | noteMessage[0] = 144+jId; 111 | noteMessage[1] = note; 112 | noteMessage[2] = (note != REST_NOTE && !insts[jId].isMuted()) ? playNotes.amp : 0; 113 | midiOut.sendMessage(¬eMessage); 114 | } 115 | 116 | insts.at(jId).step++; 117 | 118 | if (!TaskPool::isRunning) goto finishTask; 119 | 120 | t = dur-round(dur/barDur*Metro::instsWaitingTimes.at(jId)+loopIterTime); 121 | if (t <= 0 || t >= barDur) t = dur; // prevent negative values for duration and thread overrun (?) 122 | 123 | this_thread::sleep_for(chrono::microseconds(t)); 124 | 125 | for (auto& note : playNotes.notes) { 126 | noteMessage[0] = 128+jId; 127 | noteMessage[1] = note; 128 | noteMessage[2] = 0; 129 | midiOut.sendMessage(¬eMessage); 130 | } 131 | 132 | noteElapsedTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 133 | noteDeltaTime = noteElapsedTime-noteStartTime; 134 | loopIterTime = noteDeltaTime > t ? noteDeltaTime-t : 0; 135 | 136 | playNotes = Generator::midiNoteExcludeDur(jF); 137 | } 138 | barElapsedTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 139 | barDeltaTime = barElapsedTime-barStartTime; 140 | 141 | Metro::instsWaitingTimes.at(jId) = barDeltaTime > barDur ? barDeltaTime-barDur : 0; 142 | } 143 | jId = -1; 144 | } 145 | } 146 | finishTask: 147 | // silencing playing notes before task finishing 148 | for (auto& note : playNotes.notes) { 149 | noteMessage[0] = 128+jId; 150 | noteMessage[1] = note; 151 | noteMessage[2] = 0; 152 | midiOut.sendMessage(¬eMessage); 153 | } 154 | return jId; 155 | } 156 | 157 | int ccTaskDo(vector& insts) { 158 | RtMidiOut midiOut = RtMidiOut(); 159 | long startTime, elapsedTime; 160 | vector ccMessage; 161 | 162 | CCJob j; 163 | int jId; 164 | std::vector> ccs; 165 | vector ccComputed; 166 | 167 | midiOut.openPort(0); 168 | ccMessage.push_back(0); 169 | ccMessage.push_back(0); 170 | ccMessage.push_back(0); 171 | 172 | while (TaskPool::isRunning) { 173 | startTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 174 | 175 | if (!TaskPool::jobs.empty()) { 176 | { 177 | const std::lock_guard lockJob(TaskPool::mtx); 178 | j = TaskPool::jobs.front(); 179 | jId = j.id; 180 | ccs = *j.job; 181 | TaskPool::jobs.pop_front(); 182 | } 183 | 184 | if (jId >= 0 && jId < NUM_TASKS) { 185 | ccComputed = Generator::midiCC(ccs); 186 | 187 | for (auto &cc : ccComputed) { 188 | ccMessage[0] = 176+jId; 189 | ccMessage[1] = cc.ch; 190 | ccMessage[2] = cc.value; 191 | midiOut.sendMessage(&ccMessage); 192 | } 193 | 194 | insts.at(jId).ccStep++; 195 | 196 | elapsedTime = chrono::time_point_cast(chrono::steady_clock::now()).time_since_epoch().count(); 197 | this_thread::sleep_for(chrono::milliseconds(CC_RESOLUTION-(elapsedTime-startTime))); 198 | 199 | jId = -1; 200 | } 201 | } 202 | } 203 | 204 | return jId; 205 | } 206 | 207 | Instrument& i(uint8_t ch) { 208 | return insts.at(ch-1); 209 | } 210 | 211 | void bpm(int _bpm) { 212 | Generator::barDur(_bpm); 213 | } 214 | 215 | void bpm() { 216 | cout << floor(Generator::bpm) << " bpm" << endl; 217 | } 218 | 219 | uint32_t sync(int dur) { 220 | return Metro::sync(dur); 221 | } 222 | 223 | uint32_t isync(uint8_t ch) { 224 | return insts.at(ch-1).step; 225 | } 226 | uint32_t ccsync(uint8_t ch) { 227 | return insts.at(ch-1).ccStep; 228 | } 229 | 230 | uint32_t playhead() { 231 | return Metro::playhead(); 232 | } 233 | 234 | void mute() { 235 | for (auto &inst : insts) 236 | inst.mute(); 237 | } 238 | 239 | void mute(int inst) { 240 | insts[inst-1].mute(); 241 | } 242 | 243 | void solo(int inst) { 244 | insts[inst-1].unmute(); 245 | 246 | for (auto &_inst : insts) 247 | if (_inst.id != inst-1) 248 | _inst.mute(); 249 | } 250 | 251 | void unmute() { 252 | for (auto &inst : insts) 253 | inst.unmute(); 254 | } 255 | 256 | void unmute(int inst) { 257 | insts[inst-1].unmute(); 258 | } 259 | 260 | void noctrl() { 261 | for (auto &inst : insts) 262 | inst.noctrl(); 263 | } 264 | 265 | void stop() { 266 | mute(); 267 | noctrl(); 268 | } 269 | 270 | Instrument& i(int id) { 271 | return insts.at(id-1); 272 | } 273 | 274 | void zeroone() { 275 | if (TaskPool::isRunning) { 276 | std::thread([&](){ 277 | TaskPool::numTasks = NUM_TASKS; 278 | TaskPool::numTasks = NUM_TASKS; 279 | 280 | // init instruments 281 | for (int id = 0;id < TaskPool::numTasks;++id) 282 | insts.push_back(Instrument(id)); 283 | 284 | Metro::start(); 285 | 286 | auto futPushSJob = async(launch::async,pushSJob,ref(insts)); 287 | auto futPushCCJob = async(launch::async,pushCCJob,ref(insts)); 288 | 289 | // init sonic task pool 290 | for (int i = 0;i < TaskPool::numTasks;++i) 291 | TaskPool::tasks.push_back(async(launch::async,taskDo,ref(insts))); 292 | 293 | // init cc task pool 294 | for (int i = 0;i < TaskPool::numTasks;++i) 295 | TaskPool::tasks.push_back(async(launch::async,ccTaskDo,ref(insts))); 296 | }).detach(); 297 | 298 | cout << PROJ_NAME << " on <((()))>" << endl; 299 | } 300 | } 301 | 302 | void on(){ 303 | if (!TaskPool::isRunning) { 304 | bpm(60); 305 | 306 | TaskPool::isRunning = true; 307 | TaskPool::isRunning = true; 308 | 309 | zeroone(); 310 | 311 | } else { 312 | cout << PROJ_NAME << " : already : on <((()))>" << endl; 313 | } 314 | } 315 | 316 | void off() { 317 | Metro::stop(); 318 | 319 | TaskPool::stopRunning(); 320 | TaskPool::stopRunning(); 321 | 322 | insts.clear(); 323 | 324 | cout << PROJ_NAME << " off <>" << endl; 325 | } 326 | 327 | int main() { 328 | return 0; 329 | } 330 | -------------------------------------------------------------------------------- /src/zoengine.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #include "notes.hpp" 14 | #include "taskpool.hpp" 15 | #include "instrument.hpp" 16 | #include "generator.hpp" 17 | #include "expression.hpp" 18 | #include "../external/rtmidi/RtMidi.h" 19 | #include "../external/diatonic/include/diatonic.h" 20 | 21 | #define i1 i(1) 22 | #define i2 i(2) 23 | #define i3 i(3) 24 | #define i4 i(4) 25 | #define i5 i(5) 26 | #define f(x) [&](){return x;} 27 | #define n(c,a,d) [&]()->Notes{return (Notes){(vector c),a,(vector d),1};} // note's absolute value setting, no octave parameter 28 | #define no(c,a,d,o) [&]()->Notes{return (Notes){(vector c),a,(vector d),o};} // note's setting with octave parameter 29 | #define cc(ch,value) [&]()->CC{return (CC){ch,value};} 30 | 31 | const char* PROJ_NAME = "zEROoNE"; 32 | const uint16_t NUM_TASKS = 5; 33 | const float BAR_DUR_REF = 4000000; // microseconds 34 | const uint8_t JOB_QUEUE_SIZE = 64; 35 | const int CC_FREQ = 10; // Hz 36 | constexpr uint8_t CC_RESOLUTION = 1000/CC_FREQ; //milliseconds 37 | const float BPM_REF = 60; 38 | const int REST_NOTE = 127; 39 | const function SILENCE = []()->Notes {return {(vector{}),0,{1},1};}; 40 | const vector> NO_CTRL = {}; 41 | 42 | void pushSJob(vector& insts); 43 | void pushCCJob(vector& insts); 44 | inline Notes checkPlayingFunctionChanges(function& newFunc, function& currentFunc); 45 | int taskDo(vector& insts); 46 | int ccTaskDo(vector& insts); 47 | 48 | std::vector insts; 49 | 50 | Instrument& i(uint8_t ch); 51 | void bpm(int _bpm); 52 | void bpm(); 53 | uint32_t sync(uint8_t dur); 54 | uint32_t isync(uint8_t ch); 55 | uint32_t ccsync(uint8_t ch); 56 | uint32_t playhead(); 57 | void mute(); 58 | void mute(int inst); 59 | void solo(int inst); 60 | void unmute(); 61 | void unmute(int inst); 62 | void noctrl(); 63 | void stop(); 64 | void zeroone(); 65 | void on(); 66 | void off(); --------------------------------------------------------------------------------