Skip to content
Snippets Groups Projects

Compare revisions

Changes are shown as if the source revision was being merged into the target revision. Learn more about comparing revisions.

Source

Select target project
No results found

Target

Select target project
  • jwilkes/purr-data
  • aggraef/purr-data
  • samthursfield/purr-data
  • prakhar/purr-data
  • yadu05/purr-data
  • NegiAkash890/purr-data
  • prateekpardeshi/purr-data
  • Shruti3004/purr-data
  • hidimpu/purr-data
  • Atseosi/purr-data
  • piyushjasaiwal/purr-data
  • deveshprasad/purr-data
  • skm_7/purr-data
  • sankt/purr-data
  • ashim_tom/purr-data
  • dineshsoni02/purr-data
  • chaitanya1-coder/purr-data
  • Nitish0007/purr-data
  • nitin/purr-data
  • shuvam09/purr-data
  • gabrielabittencourt/purr-data
  • sivasai/purr-data
  • flachyjoe/purr-data
  • ishankaler/purr-data
  • prateek/purr-data
  • RukshanJS/purr-data
  • rajatshrm648/purr-data
  • Srashti/purr-data
  • Paarth/purr-data
  • AniruddhaGawali/purr-data
  • brittneyjuliet/purr-data
  • prakharagarwal1/purr-data
  • Shreyanshpaliwalcmsmn/purr-data
  • k_amrut/purr-data
  • AyushAnand/purr-data
  • Va16hav07/purr-data
36 results
Show changes
Commits on Source (3557)
3,457 additional commits have been omitted to prevent performance issues.
Hide whitespace changes
Inline Side-by-side
Showing
with 3465 additions and 1693 deletions
.github/workflows/makefile.yml 0 → 100644
View file @ 7dc4f29c
name: Makefile CI
on:
push:
branches: [ master, release, testing ]
tags: [ '*' ]
pull_request:
branches: [ master ]
jobs:
macos-build:
runs-on: macos-13
steps:
- uses: actions/checkout@v3
with:
submodules: recursive
fetch-depth: 0
- name: install dependencies
run: |
brew install automake
brew install fftw
brew install fluidsynth
brew install faac
brew install jpeg
brew install speex
brew install gsl
brew install libquicktime
brew install sdl2
pip3 install markdown
- name: version
run: |
echo "version=$(git describe --tags)" >> $GITHUB_ENV
- name: make
run: |
echo version: $version
make V=0
- name: check
run: make check
- name: upload
uses: actions/upload-artifact@v3
with:
name: purr-data-${{ env.version }}-macos-x86_64
path: Purr-Data-*.dmg
retention-days: 2
ubuntu-build:
runs-on: ubuntu-latest
env:
DEBEMAIL: "Albert Graef <aggraef@gmail.com>"
steps:
- uses: actions/checkout@v3
with:
submodules: recursive
fetch-depth: 0
- name: install dependencies
run: |
# dance around Azure connectivity issues
sudo apt-get update && sudo apt-get -o Acquire::Retries=3 install -q -y debhelper devscripts autoconf automake libtool pkg-config bison flex libgtk2.0-dev libgtk-3-dev dh-python ladspa-sdk libasound2-dev libjack-dev libbluetooth-dev libcairo2-dev libgl-dev libglew-dev libgsl-dev libmagick++-dev libavifile-0.7-dev libdc1394-dev libfftw3-dev libfluidsynth-dev libftgl-dev libgsm1-dev libjpeg-dev libmp3lame-dev libmpeg3-dev libquicktime-dev libraw1394-dev libsmpeg-dev libspeex-dev libstk-dev libtiff5-dev libv4l-dev libdv4-dev libiec61883-dev libxv-dev libxxf86vm-dev libvorbis-dev zlib1g-dev rsync libgconf2-dev libnss3-dev libxtst-dev libxss-dev
pip install markdown
- name: version
run: |
echo "version=$(git describe --tags)" >> $GITHUB_ENV
- name: make
run: |
echo version: $version
cd debuild
make debchange
make deb-us
- name: check
run: echo handled by debuild
- name: upload
uses: actions/upload-artifact@v3
with:
name: purr-data-${{ env.version }}-ubuntu-x86_64
path: debuild/purr-data*.deb
retention-days: 2
windows-build:
runs-on: windows-2022
defaults:
run:
shell: msys2 {0}
env:
CC: gcc
CXX: g++
steps:
- uses: msys2/setup-msys2@v2
- uses: actions/checkout@v3
with:
submodules: recursive
fetch-depth: 0
- name: install innosetup
run: |
wget https://jrsoftware.org/download.php/is.exe -O innosetup.exe
./innosetup.exe //SILENT //CURRENTUSER
- name: install dependencies
run: |
pacman --noconfirm --disable-download-timeout -S autoconf automake git libtool make mingw-w64-x86_64-dlfcn mingw-w64-x86_64-fftw mingw-w64-x86_64-fluidsynth mingw-w64-x86_64-SDL2 mingw-w64-x86_64-ftgl mingw-w64-x86_64-fribidi mingw-w64-x86_64-ladspa-sdk mingw-w64-x86_64-lame mingw-w64-x86_64-libsndfile mingw-w64-x86_64-libvorbis mingw-w64-x86_64-lua mingw-w64-x86_64-toolchain mingw-w64-x86_64-libjpeg-turbo mingw-w64-x86_64-speex mingw-w64-x86_64-python mingw-w64-x86_64-python-markdown rsync unzip wget
- name: version
run: |
echo "version=$(git describe --tags)" >> $GITHUB_ENV
- name: make
run: |
echo version: $version
echo UNAME: `uname -s`
make V=0
- name: check
run: make check
- name: upload
uses: actions/upload-artifact@v3
with:
name: purr-data-${{ env.version }}-mingw-x86_64
path: Purr-Data-*.exe
retention-days: 2
release:
if: startsWith(github.ref, 'refs/tags/')
runs-on: ubuntu-latest
needs: [macos-build, ubuntu-build, windows-build]
steps:
- uses: actions/download-artifact@v3
- name: ziptie
run: |
mkdir dist
for x in purr-data-*; do (cd $x && zip -r ../dist/$x.zip *); done
- name: release
uses: softprops/action-gh-release@v1
with:
prerelease: true
draft: true
files: dist/*.zip
.gitignore
View file @ 7dc4f29c
...@@ -30,5 +30,11 @@ pd.pc ...@@ -30,5 +30,11 @@ pd.pc
.svn .svn
packages/linux_make/build/ packages/linux_make/build/
pd/src/makefile pd/src/makefile
pd/src/config.h
pd/src/s_version.h
pd/nw/nw/
l2ork_addons/cwiid/defs.mak l2ork_addons/cwiid/defs.mak
CVS CVS
.DS_Store
*.dmg
.vscode/
\ No newline at end of file
.gitlab-ci.yml 0 → 100644
View file @ 7dc4f29c
# This file creates automated tests on GitLab CI for Purr Data.
# See https://docs.gitlab.com/ee/ci/yaml/README.html for details of the format.
# These are script snippets used in the jobs defined below.
.debian_image_preparation: &debian_image_preparation
- echo "" | sudo -S apt-get -qq purge -y pd-l2ork > /dev/null || echo "couldn't purge..."
- echo "" | sudo -S DEBIAN_FRONTEND=noninteractive apt-get -qq -y update > /dev/null
- echo "" | sudo -S DEBIAN_FRONTEND=noninteractive apt-get -qq -y upgrade > /dev/null
.build_all: &build_all
- echo -e "section_start:`date +%s`:build_all\r\e[0KBuilding Purr Data"
- cd l2ork_addons
- export V=0
- ./tar_em_up.sh $BUILD_TYPE_FLAG
- cd ..
- echo -e "section_end:`date +%s`:build_all\r\e[0K"
.test_linux: &test_linux
- echo -e "section_start:`date +%s`:test_linux\r\e[0KTesting Purr Data for Linux"
- echo "" | sudo -S DEBIAN_FRONTEND=noninteractive dpkg --force-all -i pd-l2ork*.deb > /dev/null
- valgrind pd-l2ork -noprefs -nogui -nrt -noaudio -send "init dollarzero \$0" scripts/regression_tests.pd
- valgrind pd-l2ork -noprefs -nostdpath -nogui -nrt -noaudio scripts/external-tests.pd
- echo -e "section_end:`date +%s`:text_linux\r\e[0K"
.test_osx: &test_osx
- echo -e "section_start:`date +%s`:test_osx\r\e[0KTesting Purr Data for Mac OSX"
- cd scripts
- ../packages/darwin_app/build/*.app/Contents/Resources/app.nw/bin/pd-l2ork -noprefs -nogui -noaudio -send "init dollarzero \$0" regression_tests.pd
- ../packages/darwin_app/build/*.app/Contents/Resources/app.nw/bin/pd-l2ork -noprefs -nostdpath -nogui -noaudio external-tests.pd
- echo -e "section_end:`date +%s`:text_osx\r\e[0K"
.test_windows: &test_windows
- echo -e "section_start:`date +%s`:test_windows\r\e[0KTesting Purr Data for Windows"
- cd scripts
- ../packages/win64_inno/build/bin/pd.com -noprefs -nogui -noaudio -send "init dollarzero \$0" regression_tests.pd
- ../packages/win64_inno/build/bin/pd.com -noprefs -nostdpath -nogui -noaudio external-tests.pd
- echo -e "section_end:`date +%s`:text_windows\r\e[0K"
debian_stretch_x86_64_deb:
tags:
- debian
- stretch
- x86_64
variables:
BUILD_TYPE_FLAG: -B
before_script:
- *debian_image_preparation
script:
- *build_all
- *test_linux
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- pd*.deb
ubuntu_16.04_x86_64_deb:
tags:
- ubuntu
- v16.04
- x86_64
variables:
BUILD_TYPE_FLAG: -B
before_script:
- *debian_image_preparation
script:
- *build_all
- *test_linux
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- pd*.deb
osx_10.11_x86_64_dmg:
tags:
- osx
- v10.11
- dmg
variables:
BUILD_TYPE_FLAG: -X
script:
- echo `pwd`
- *build_all
- *test_osx
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- Purr*.dmg
osx_10.8_x86_64_dmg:
tags:
- osx
- v10.8
- dmg
variables:
BUILD_TYPE_FLAG: -X
osx_version: "10.8"
script:
- echo `pwd`
- *build_all
- *test_osx
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- Purr*.dmg
windows_x86_64_innosetup:
tags:
- windows
- x86_64
variables:
BUILD_TYPE_FLAG: -Z
script:
- echo `pwd`
- *build_all
- *test_windows
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- Purr*.exe
raspbian_stretch_armv7l_deb:
tags:
- raspbian
- arm
- stretch
variables:
BUILD_TYPE_FLAG: -r
before_script:
- *debian_image_preparation
script:
- echo `pwd`
- *build_all
- *test_linux
artifacts:
name: "$CI_RUNNER_DESCRIPTION"
expire_in: 1 day
paths:
- pd*.deb
.gitmodules
View file @ 7dc4f29c
[submodule "l2ork_addons/rtcmix-in-pd"]
path = externals/rtcmix-in-pd
url = https://github.com/jwmatthys/rtcmix-in-pd.git
[submodule "l2ork_addons/cwiid"]
path = externals/disis/cwiid
url = https://github.com/pd-l2ork/cwiid
[submodule "Gem"] [submodule "Gem"]
path = Gem path = Gem
url = git://git.code.sf.net/p/pd-gem/gem url = https://github.com/agraef/Gem.git
[submodule "l2ork_addons/raspberry_pi/disis_gpio/wiringPi"]
path = l2ork_addons/raspberry_pi/disis_gpio/wiringPi
url = https://git.purrdata.net/jwilkes/wiringPi.git
[submodule "externals/pd-lua"]
path = externals/pd-lua
url = https://github.com/agraef/pd-lua.git
Gem @ 0d5f10cc
Subproject commit 374f71368f4a54e8d0f7887460a178e9020a1ba4 Subproject commit 0d5f10cc9166ce8971c6fde32fa0d2d47ab33fa0
LICENSE.html 0 → 100644
View file @ 7dc4f29c
<h1 id="purr-data-copyright-and-terms-of-use">Purr-Data Copyright and
Terms of Use</h1>
<p>Pd, as well as this compilation of Pd-related software known as
Purr-Data a.k.a. Pd-l2ork 2.x, is copyrighted software by various
authors, but it is distributed as open-source software, which means that
it can be used freely and without any costs under the appropriate
license terms, as detailed below.</p>
<p>THIS SOFTWARE IS PROVIDED BY THE AUTHORS “AS IS” AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.</p>
<h2 id="pd-license">Pd License</h2>
<p>Copyright (c) by Miller S. Puckette and others</p>
<p>Pd (the core system including the main program and the built-in
objects, i.e., everything that lives in the pd subdirectory of the
sources) is licensed under a 3-clause BSD license, please check the <a
href="pd/LICENSE.txt">LICENSE.txt</a> file for details.</p>
<h2 id="bundled-software">Bundled Software</h2>
<p>Copyright (c) by various authors, please see the included license
files for details</p>
<p>Purr-Data includes a large number of bundled abstractions and
externals by various authors. These can be found in the abstractions,
externals and Gem subdirectories in the source, and in the extra
subdirectory of the Purr-Data library directory of the installed
application. Each of these items has its own open-source license under
which it is distributed (mostly different variations of the BSD license
or the GPL), so please check the corresponding license files in the
source or the extra directory of the installed package for license
information pertaining to each of the different software modules.</p>
<h2 id="purr-data-license">Purr-Data License</h2>
<p>Copyright (c) by Hans-Christoph Steiner, Ico Bukvic, Jonathan Wilkes
and others</p>
<p>Purr-Data (by Jonathan Wilkes) is based on Pd-l2ork (by Ico Bukvic)
which in turn is based on Pd-extended (by Hans-Christoph Steiner), which
is licensed under the GPL (GNU Public License) version 3, replicated
below. Please note that this license applies to all parts of this
package which are <em>not</em> accompanied by their own license
conditions (such as the Pd core and the bundled software, as detailed
above).</p>
<h1 id="gnu-general-public-license">GNU GENERAL PUBLIC LICENSE</h1>
<p>Version 3, 29 June 2007</p>
<p>Copyright (C) 2007 <a href="http://fsf.org/">Free Software
Foundation, Inc.</a></p>
<p>Everyone is permitted to copy and distribute verbatim copies of this
license document, but changing it is not allowed.</p>
<h2 id="preamble">Preamble</h2>
<p>The GNU General Public License is a free, copyleft license for
software and other kinds of works.</p>
<p>The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program–to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.</p>
<p>When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.</p>
<p>To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.</p>
<p>For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.</p>
<p>Developers that use the GNU GPL protect your rights with two
steps:</p>
<ol type="1">
<li>assert copyright on the software, and</li>
<li>offer you this License giving you legal permission to copy,
distribute and/or modify it.</li>
</ol>
<p>For the developers’ and authors’ protection, the GPL clearly explains
that there is no warranty for this free software. For both users’ and
authors’ sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.</p>
<p>Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of protecting
users’ freedom to change the software. The systematic pattern of such
abuse occurs in the area of products for individuals to use, which is
precisely where it is most unacceptable. Therefore, we have designed
this version of the GPL to prohibit the practice for those products. If
such problems arise substantially in other domains, we stand ready to
extend this provision to those domains in future versions of the GPL, as
needed to protect the freedom of users.</p>
<p>Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.</p>
<p>The precise terms and conditions for copying, distribution and
modification follow.</p>
<h2 id="terms-and-conditions">TERMS AND CONDITIONS</h2>
<h3 id="definitions.">0. Definitions.</h3>
<p><em>This License</em> refers to version 3 of the GNU General Public
License.</p>
<p><em>Copyright</em> also means copyright-like laws that apply to other
kinds of works, such as semiconductor masks.</p>
<p><em>The Program</em> refers to any copyrightable work licensed under
this License. Each licensee is addressed as <em>you</em>.
<em>Licensees</em> and <em>recipients</em> may be individuals or
organizations.</p>
<p>To <em>modify</em> a work means to copy from or adapt all or part of
the work in a fashion requiring copyright permission, other than the
making of an exact copy. The resulting work is called a <em>modified
version</em> of the earlier work or a work <em>based on</em> the earlier
work.</p>
<p>A <em>covered work</em> means either the unmodified Program or a work
based on the Program.</p>
<p>To <em>propagate</em> a work means to do anything with it that,
without permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.</p>
<p>To <em>convey</em> a work means any kind of propagation that enables
other parties to make or receive copies. Mere interaction with a user
through a computer network, with no transfer of a copy, is not
conveying.</p>
<p>An interactive user interface displays <em>Appropriate Legal
Notices</em> to the extent that it includes a convenient and prominently
visible feature that</p>
<ol type="1">
<li>displays an appropriate copyright notice, and</li>
<li>tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the work
under this License, and how to view a copy of this License.</li>
</ol>
<p>If the interface presents a list of user commands or options, such as
a menu, a prominent item in the list meets this criterion.</p>
<h3 id="source-code.">1. Source Code.</h3>
<p>The <em>source code</em> for a work means the preferred form of the
work for making modifications to it. <em>Object code</em> means any
non-source form of a work.</p>
<p>A <em>Standard Interface</em> means an interface that either is an
official standard defined by a recognized standards body, or, in the
case of interfaces specified for a particular programming language, one
that is widely used among developers working in that language.</p>
<p>The <em>System Libraries</em> of an executable work include anything,
other than the work as a whole, that (a) is included in the normal form
of packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that Major
Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
<em>Major Component</em>, in this context, means a major essential
component (kernel, window system, and so on) of the specific operating
system (if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.</p>
<p>The <em>Corresponding Source</em> for a work in object code form
means all the source code needed to generate, install, and (for an
executable work) run the object code and to modify the work, including
scripts to control those activities. However, it does not include the
work’s System Libraries, or general-purpose tools or generally available
free programs which are used unmodified in performing those activities
but which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for the
work, and the source code for shared libraries and dynamically linked
subprograms that the work is specifically designed to require, such as
by intimate data communication or control flow between those subprograms
and other parts of the work.</p>
<p>The Corresponding Source need not include anything that users can
regenerate automatically from other parts of the Corresponding
Source.</p>
<p>The Corresponding Source for a work in source code form is that same
work.</p>
<h3 id="basic-permissions.">2. Basic Permissions.</h3>
<p>All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright
law.</p>
<p>You may make, run and propagate covered works that you do not convey,
without conditions so long as your license otherwise remains in force.
You may convey covered works to others for the sole purpose of having
them make modifications exclusively for you, or provide you with
facilities for running those works, provided that you comply with the
terms of this License in conveying all material for which you do not
control copyright. Those thus making or running the covered works for
you must do so exclusively on your behalf, under your direction and
control, on terms that prohibit them from making any copies of your
copyrighted material outside their relationship with you.</p>
<p>Conveying under any other circumstances is permitted solely under the
conditions stated below. Sublicensing is not allowed; section 10 makes
it unnecessary.</p>
<h3 id="protecting-users-legal-rights-from-anti-circumvention-law.">3.
Protecting Users’ Legal Rights From Anti-Circumvention Law.</h3>
<p>No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article 11
of the WIPO copyright treaty adopted on 20 December 1996, or similar
laws prohibiting or restricting circumvention of such measures.</p>
<p>When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to the
covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work’s
users, your or third parties’ legal rights to forbid circumvention of
technological measures.</p>
<h3 id="conveying-verbatim-copies.">4. Conveying Verbatim Copies.</h3>
<p>You may convey verbatim copies of the Program’s source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice; keep
intact all notices stating that this License and any non-permissive
terms added in accord with section 7 apply to the code; keep intact all
notices of the absence of any warranty; and give all recipients a copy
of this License along with the Program.</p>
<p>You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.</p>
<h3 id="conveying-modified-source-versions.">5. Conveying Modified
Source Versions.</h3>
<p>You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the terms
of section 4, provided that you also meet all of these conditions:</p>
<ul>
<li><ol type="a">
<li>The work must carry prominent notices stating that you modified it,
and giving a relevant date.</li>
</ol></li>
<li><ol start="2" type="a">
<li>The work must carry prominent notices stating that it is released
under this License and any conditions added under section 7. This
requirement modifies the requirement in section 4 to <em>keep intact all
notices</em>.</li>
</ol></li>
<li><ol start="3" type="a">
<li>You must license the entire work, as a whole, under this License to
anyone who comes into possession of a copy. This License will therefore
apply, along with any applicable section 7 additional terms, to the
whole of the work, and all its parts, regardless of how they are
packaged. This License gives no permission to license the work in any
other way, but it does not invalidate such permission if you have
separately received it.</li>
</ol></li>
<li><ol start="4" type="a">
<li>If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your work need
not make them do so.</li>
</ol></li>
</ul>
<p>A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work, and
which are not combined with it such as to form a larger program, in or
on a volume of a storage or distribution medium, is called an
<em>aggregate</em> if the compilation and its resulting copyright are
not used to limit the access or legal rights of the compilation’s users
beyond what the individual works permit. Inclusion of a covered work in
an aggregate does not cause this License to apply to the other parts of
the aggregate.</p>
<h3 id="conveying-non-source-forms.">6. Conveying Non-Source Forms.</h3>
<p>You may convey a covered work in object code form under the terms of
sections 4 and 5, provided that you also convey the machine-readable
Corresponding Source under the terms of this License, in one of these
ways:</p>
<ul>
<li><ol type="a">
<li>Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium customarily used
for software interchange.</li>
</ol></li>
<li><ol start="2" type="a">
<li>Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a written
offer, valid for at least three years and valid for as long as you offer
spare parts or customer support for that product model, to give anyone
who possesses the object code either</li>
</ol>
<ol type="1">
<li>a copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical medium
customarily used for software interchange, for a price no more than your
reasonable cost of physically performing this conveying of source,
or</li>
<li>access to copy the Corresponding Source from a network server at no
charge.</li>
</ol></li>
<li><ol start="3" type="a">
<li>Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This alternative is
allowed only occasionally and noncommercially, and only if you received
the object code with such an offer, in accord with subsection 6b.</li>
</ol></li>
<li><ol start="4" type="a">
<li>Convey the object code by offering access from a designated place
(gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to copy
the object code is a network server, the Corresponding Source may be on
a different server operated by you or a third party) that supports
equivalent copying facilities, provided you maintain clear directions
next to the object code saying where to find the Corresponding Source.
Regardless of what server hosts the Corresponding Source, you remain
obligated to ensure that it is available for as long as needed to
satisfy these requirements.</li>
</ol></li>
<li><ol start="5" type="a">
<li>Convey the object code using peer-to-peer transmission, provided you
inform other peers where the object code and Corresponding Source of the
work are being offered to the general public at no charge under
subsection 6d.</li>
</ol></li>
</ul>
<p>A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be included
in conveying the object code work.</p>
<p>A <em>User Product</em> is either</p>
<ol type="1">
<li>a <em>consumer product</em>, which means any tangible personal
property which is normally used for personal, family, or household
purposes, or</li>
<li>anything designed or sold for incorporation into a dwelling.</li>
</ol>
<p>In determining whether a product is a consumer product, doubtful
cases shall be resolved in favor of coverage. For a particular product
received by a particular user, <em>normally used</em> refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.</p>
<p><em>Installation Information</em> for a User Product means any
methods, procedures, authorization keys, or other information required
to install and execute modified versions of a covered work in that User
Product from a modified version of its Corresponding Source. The
information must suffice to ensure that the continued functioning of the
modified object code is in no case prevented or interfered with solely
because modification has been made.</p>
<p>If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied by
the Installation Information. But this requirement does not apply if
neither you nor any third party retains the ability to install modified
object code on the User Product (for example, the work has been
installed in ROM).</p>
<p>The requirement to provide Installation Information does not include
a requirement to continue to provide support service, warranty, or
updates for a work that has been modified or installed by the recipient,
or for the User Product in which it has been modified or installed.
Access to a network may be denied when the modification itself
materially and adversely affects the operation of the network or
violates the rules and protocols for communication across the
network.</p>
<p>Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in source
code form), and must require no special password or key for unpacking,
reading or copying.</p>
<h3 id="additional-terms.">7. Additional Terms.</h3>
<p><em>Additional permissions</em> are terms that supplement the terms
of this License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by this
License without regard to the additional permissions.</p>
<p>When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own removal
in certain cases when you modify the work.) You may place additional
permissions on material, added by you to a covered work, for which you
have or can give appropriate copyright permission.</p>
<p>Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders
of that material) supplement the terms of this License with terms:</p>
<ul>
<li><ol type="a">
<li>Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or</li>
</ol></li>
<li><ol start="2" type="a">
<li>Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal Notices
displayed by works containing it; or</li>
</ol></li>
<li><ol start="3" type="a">
<li>Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or</li>
</ol></li>
<li><ol start="4" type="a">
<li>Limiting the use for publicity purposes of names of licensors or
authors of the material; or</li>
</ol></li>
<li><ol start="5" type="a">
<li>Declining to grant rights under trademark law for use of some trade
names, trademarks, or service marks; or</li>
</ol></li>
<li><ol start="6" type="a">
<li>Requiring indemnification of licensors and authors of that material
by anyone who conveys the material (or modified versions of it) with
contractual assumptions of liability to the recipient, for any liability
that these contractual assumptions directly impose on those licensors
and authors.</li>
</ol></li>
</ul>
<p>All other non-permissive additional terms are considered <em>further
restrictions</em> within the meaning of section 10. If the Program as
you received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains a
further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms of
that license document, provided that the further restriction does not
survive such relicensing or conveying.</p>
<p>If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the additional
terms that apply to those files, or a notice indicating where to find
the applicable terms.</p>
<p>Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions; the above
requirements apply either way.</p>
<h3 id="termination.">8. Termination.</h3>
<p>You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).</p>
<p>However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated</p>
<ul>
<li><ol type="a">
<li>provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and</li>
</ol></li>
<li><ol start="2" type="a">
<li>permanently, if the copyright holder fails to notify you of the
violation by some reasonable means prior to 60 days after the
cessation.</li>
</ol></li>
</ul>
<p>Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after your
receipt of the notice.</p>
<p>Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.</p>
<h3 id="acceptance-not-required-for-having-copies.">9. Acceptance Not
Required for Having Copies.</h3>
<p>You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission to
receive a copy likewise does not require acceptance. However, nothing
other than this License grants you permission to propagate or modify any
covered work. These actions infringe copyright if you do not accept this
License. Therefore, by modifying or propagating a covered work, you
indicate your acceptance of this License to do so.</p>
<h3 id="automatic-licensing-of-downstream-recipients.">10. Automatic
Licensing of Downstream Recipients.</h3>
<p>Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.</p>
<p>An <em>entity transaction</em> is a transaction transferring control
of an organization, or substantially all assets of one, or subdividing
an organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that transaction
who receives a copy of the work also receives whatever licenses to the
work the party’s predecessor in interest had or could give under the
previous paragraph, plus a right to possession of the Corresponding
Source of the work from the predecessor in interest, if the predecessor
has it or can get it with reasonable efforts.</p>
<p>You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may not
impose a license fee, royalty, or other charge for exercise of rights
granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that any
patent claim is infringed by making, using, selling, offering for sale,
or importing the Program or any portion of it.</p>
<h3 id="patents.">11. Patents.</h3>
<p>A <em>contributor</em> is a copyright holder who authorizes use under
this License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor’s <em>contributor
version</em>.</p>
<p>A contributor’s <em>essential patent claims</em> are all patent
claims owned or controlled by the contributor, whether already acquired
or hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a consequence
of further modification of the contributor version. For purposes of this
definition, <em>control</em> includes the right to grant patent
sublicenses in a manner consistent with the requirements of this
License.</p>
<p>Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor’s essential patent claims, to make,
use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.</p>
<p>In the following three paragraphs, a <em>patent license</em> is any
express agreement or commitment, however denominated, not to enforce a
patent (such as an express permission to practice a patent or covenant
not to sue for patent infringement). To <em>grant</em> such a patent
license to a party means to make such an agreement or commitment not to
enforce a patent against the party.</p>
<p>If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone to
copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either</p>
<ol type="1">
<li>cause the Corresponding Source to be so available, or</li>
<li>arrange to deprive yourself of the benefit of the patent license for
this particular work, or</li>
<li>arrange, in a manner consistent with the requirements of this
License, to extend the patent license to downstream recipients.</li>
</ol>
<p><em>Knowingly relying</em> means you have actual knowledge that, but
for the patent license, your conveying the covered work in a country, or
your recipient’s use of the covered work in a country, would infringe
one or more identifiable patents in that country that you have reason to
believe are valid.</p>
<p>If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify or
convey a specific copy of the covered work, then the patent license you
grant is automatically extended to all recipients of the covered work
and works based on it.</p>
<p>A patent license is <em>discriminatory</em> if it does not include
within the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is in
the business of distributing software, under which you make payment to
the third party based on the extent of your activity of conveying the
work, and under which the third party grants, to any of the parties who
would receive the covered work from you, a discriminatory patent
license</p>
<ul>
<li><ol type="a">
<li>in connection with copies of the covered work conveyed by you (or
copies made from those copies), or</li>
</ol></li>
<li><ol start="2" type="a">
<li>primarily for and in connection with specific products or
compilations that contain the covered work, unless you entered into that
arrangement, or that patent license was granted, prior to 28 March
2007.</li>
</ol></li>
</ul>
<p>Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may otherwise
be available to you under applicable patent law.</p>
<h3 id="no-surrender-of-others-freedom.">12. No Surrender of Others’
Freedom.</h3>
<p>If conditions are imposed on you (whether by court order, agreement
or otherwise) that contradict the conditions of this License, they do
not excuse you from the conditions of this License. If you cannot convey
a covered work so as to satisfy simultaneously your obligations under
this License and any other pertinent obligations, then as a consequence
you may not convey it at all. For example, if you agree to terms that
obligate you to collect a royalty for further conveying from those to
whom you convey the Program, the only way you could satisfy both those
terms and this License would be to refrain entirely from conveying the
Program.</p>
<h3 id="use-with-the-gnu-affero-general-public-license.">13. Use with
the GNU Affero General Public License.</h3>
<p>Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.</p>
<h3 id="revised-versions-of-this-license.">14. Revised Versions of this
License.</h3>
<p>The Free Software Foundation may publish revised and/or new versions
of the GNU General Public License from time to time. Such new versions
will be similar in spirit to the present version, but may differ in
detail to address new problems or concerns.</p>
<p>Each version is given a distinguishing version number. If the Program
specifies that a certain numbered version of the GNU General Public
License <em>or any later version</em> applies to it, you have the option
of following the terms and conditions either of that numbered version or
of any later version published by the Free Software Foundation. If the
Program does not specify a version number of the GNU General Public
License, you may choose any version ever published by the Free Software
Foundation.</p>
<p>If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy’s
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.</p>
<p>Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.</p>
<h3 id="disclaimer-of-warranty.">15. Disclaimer of Warranty.</h3>
<p>THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM <em>AS IS</em> WITHOUT
WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF
THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.</p>
<h3 id="limitation-of-liability.">16. Limitation of Liability.</h3>
<p>IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT
NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES
SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE
WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN
ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.</p>
<h3 id="interpretation-of-sections-15-and-16.">17. Interpretation of
Sections 15 and 16.</h3>
<p>If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates an
absolute waiver of all civil liability in connection with the Program,
unless a warranty or assumption of liability accompanies a copy of the
Program in return for a fee.</p>
<h2 id="end-of-terms-and-conditions">END OF TERMS AND CONDITIONS</h2>
<h3 id="how-to-apply-these-terms-to-your-new-programs">How to Apply
These Terms to Your New Programs</h3>
<p>If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these
terms.</p>
<p>To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least the
<em>copyright</em> line and a pointer to where the full notice is
found.</p>
<pre><code>&lt;one line to give the program&#39;s name and a brief idea of what it does.&gt;
Copyright (C) &lt;year&gt; &lt;name of author&gt;
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see &lt;http://www.gnu.org/licenses/&gt;.</code></pre>
<p>Also add information on how to contact you by electronic and paper
mail.</p>
<p>If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:</p>
<pre><code>&lt;program&gt; Copyright (C) &lt;year&gt; &lt;name of author&gt;
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w&#39;.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c&#39; for details.</code></pre>
<p>The hypothetical commands <code>show w</code> and <code>show c</code>
should show the appropriate parts of the General Public License. Of
course, your program’s commands might be different; for a GUI interface,
you would use an <em>about box</em>.</p>
<p>You should also get your employer (if you work as a programmer) or
school, if any, to sign a <em>copyright disclaimer</em> for the program,
if necessary. For more information on this, and how to apply and follow
the GNU GPL, see <a
href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>.</p>
<p>The GNU General Public License does not permit incorporating your
program into proprietary programs. If your program is a subroutine
library, you may consider it more useful to permit linking proprietary
applications with the library. If this is what you want to do, use the
GNU Lesser General Public License instead of this License. But first,
please read <a
href="http://www.gnu.org/philosophy/why-not-lgpl.html">http://www.gnu.org/philosophy/why-not-lgpl.html</a>.</p>
LICENSE.md 0 → 100644
View file @ 7dc4f29c
# Purr-Data Copyright and Terms of Use
Pd, as well as this compilation of Pd-related software known as Purr-Data
a.k.a. Pd-l2ork 2.x, is copyrighted software by various authors, but it is
distributed as open-source software, which means that it can be used freely
and without any costs under the appropriate license terms, as detailed below.
THIS SOFTWARE IS PROVIDED BY THE AUTHORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
## Pd License
Copyright (c) by Miller S. Puckette and others
Pd (the core system including the main program and the built-in objects, i.e.,
everything that lives in the pd subdirectory of the sources) is licensed under
a 3-clause BSD license, please check the [LICENSE.txt](pd/LICENSE.txt) file
for details.
## Bundled Software
Copyright (c) by various authors, please see the included license files for
details
Purr-Data includes a large number of bundled abstractions and externals by
various authors. These can be found in the abstractions, externals and Gem
subdirectories in the source, and in the extra subdirectory of the Purr-Data
library directory of the installed application. Each of these items has its
own open-source license under which it is distributed (mostly different
variations of the BSD license or the GPL), so please check the corresponding
license files in the source or the extra directory of the installed package
for license information pertaining to each of the different software modules.
## Purr-Data License
Copyright (c) by Hans-Christoph Steiner, Ico Bukvic, Jonathan Wilkes and
others
Purr-Data (by Jonathan Wilkes) is based on Pd-l2ork (by Ico Bukvic) which in
turn is based on Pd-extended (by Hans-Christoph Steiner), which is licensed
under the GPL (GNU Public License) version 3, replicated below. Please note
that this license applies to all parts of this package which are *not*
accompanied by their own license conditions (such as the Pd core and the
bundled software, as detailed above).
# GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 [Free Software Foundation, Inc.](http://fsf.org/)
Everyone is permitted to copy and distribute verbatim copies of this license
document, but changing it is not allowed.
## Preamble
The GNU General Public License is a free, copyleft license for software and
other kinds of works.
The licenses for most software and other practical works are designed to take
away your freedom to share and change the works. By contrast, the GNU General
Public License is intended to guarantee your freedom to share and change all
versions of a program--to make sure it remains free software for all its users.
We, the Free Software Foundation, use the GNU General Public License for most
of our software; it applies also to any other work released this way by its
authors. You can apply it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our
General Public Licenses are designed to make sure that you have the freedom to
distribute copies of free software (and charge for them if you wish), that you
receive source code or can get it if you want it, that you can change the
software or use pieces of it in new free programs, and that you know you can do
these things.
To protect your rights, we need to prevent others from denying you these rights
or asking you to surrender the rights. Therefore, you have certain
responsibilities if you distribute copies of the software, or if you modify it:
responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether gratis or for
a fee, you must pass on to the recipients the same freedoms that you received.
You must make sure that they, too, receive or can get the source code. And you
must show them these terms so they know their rights.
Developers that use the GNU GPL protect your rights with two steps:
1. assert copyright on the software, and
2. offer you this License giving you legal permission to copy, distribute
and/or modify it.
For the developers' and authors' protection, the GPL clearly explains that
there is no warranty for this free software. For both users' and authors' sake,
the GPL requires that modified versions be marked as changed, so that their
problems will not be attributed erroneously to authors of previous versions.
Some devices are designed to deny users access to install or run modified
versions of the software inside them, although the manufacturer can do so. This
is fundamentally incompatible with the aim of protecting users' freedom to
change the software. The systematic pattern of such abuse occurs in the area of
products for individuals to use, which is precisely where it is most
unacceptable. Therefore, we have designed this version of the GPL to prohibit
the practice for those products. If such problems arise substantially in other
domains, we stand ready to extend this provision to those domains in future
versions of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents. States
should not allow patents to restrict development and use of software on
general-purpose computers, but in those that do, we wish to avoid the special
danger that patents applied to a free program could make it effectively
proprietary. To prevent this, the GPL assures that patents cannot be used to
render the program non-free.
The precise terms and conditions for copying, distribution and modification
follow.
## TERMS AND CONDITIONS
### 0. Definitions.
*This License* refers to version 3 of the GNU General Public License.
*Copyright* also means copyright-like laws that apply to other kinds of works,
such as semiconductor masks.
*The Program* refers to any copyrightable work licensed under this License.
Each licensee is addressed as *you*. *Licensees* and *recipients* may be
individuals or organizations.
To *modify* a work means to copy from or adapt all or part of the work in a
fashion requiring copyright permission, other than the making of an exact copy.
The resulting work is called a *modified version* of the earlier work or a work
*based on* the earlier work.
A *covered work* means either the unmodified Program or a work based on the
Program.
To *propagate* a work means to do anything with it that, without permission,
would make you directly or secondarily liable for infringement under applicable
copyright law, except executing it on a computer or modifying a private copy.
Propagation includes copying, distribution (with or without modification),
making available to the public, and in some countries other activities as well.
To *convey* a work means any kind of propagation that enables other parties to
make or receive copies. Mere interaction with a user through a computer
network, with no transfer of a copy, is not conveying.
An interactive user interface displays *Appropriate Legal Notices* to the
extent that it includes a convenient and prominently visible feature that
1. displays an appropriate copyright notice, and
2. tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the work
under this License, and how to view a copy of this License.
If the interface presents a list of user commands or options, such as a menu, a
prominent item in the list meets this criterion.
### 1. Source Code.
The *source code* for a work means the preferred form of the work for making
modifications to it. *Object code* means any non-source form of a work.
A *Standard Interface* means an interface that either is an official standard
defined by a recognized standards body, or, in the case of interfaces specified
for a particular programming language, one that is widely used among developers
working in that language.
The *System Libraries* of an executable work include anything, other than the
work as a whole, that (a) is included in the normal form of packaging a Major
Component, but which is not part of that Major Component, and (b) serves only
to enable use of the work with that Major Component, or to implement a Standard
Interface for which an implementation is available to the public in source code
form. A *Major Component*, in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system (if any) on
which the executable work runs, or a compiler used to produce the work, or an
object code interpreter used to run it.
The *Corresponding Source* for a work in object code form means all the source
code needed to generate, install, and (for an executable work) run the object
code and to modify the work, including scripts to control those activities.
However, it does not include the work's System Libraries, or general-purpose
tools or generally available free programs which are used unmodified in
performing those activities but which are not part of the work. For example,
Corresponding Source includes interface definition files associated with source
files for the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require, such as
by intimate data communication or control flow between those subprograms and
other parts of the work.
The Corresponding Source need not include anything that users can regenerate
automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same work.
### 2. Basic Permissions.
All rights granted under this License are granted for the term of copyright on
the Program, and are irrevocable provided the stated conditions are met. This
License explicitly affirms your unlimited permission to run the unmodified
Program. The output from running a covered work is covered by this License only
if the output, given its content, constitutes a covered work. This License
acknowledges your rights of fair use or other equivalent, as provided by
copyright law.
You may make, run and propagate covered works that you do not convey, without
conditions so long as your license otherwise remains in force. You may convey
covered works to others for the sole purpose of having them make modifications
exclusively for you, or provide you with facilities for running those works,
provided that you comply with the terms of this License in conveying all
material for which you do not control copyright. Those thus making or running
the covered works for you must do so exclusively on your behalf, under your
direction and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under the
conditions stated below. Sublicensing is not allowed; section 10 makes it
unnecessary.
### 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological measure
under any applicable law fulfilling obligations under article 11 of the WIPO
copyright treaty adopted on 20 December 1996, or similar laws prohibiting or
restricting circumvention of such measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention is
effected by exercising rights under this License with respect to the covered
work, and you disclaim any intention to limit operation or modification of the
work as a means of enforcing, against the work's users, your or third parties'
legal rights to forbid circumvention of technological measures.
### 4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you receive it,
in any medium, provided that you conspicuously and appropriately publish on
each copy an appropriate copyright notice; keep intact all notices stating that
this License and any non-permissive terms added in accord with section 7 apply
to the code; keep intact all notices of the absence of any warranty; and give
all recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey, and you may
offer support or warranty protection for a fee.
### 5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to produce it
from the Program, in the form of source code under the terms of section 4,
provided that you also meet all of these conditions:
- a) The work must carry prominent notices stating that you modified it, and
giving a relevant date.
- b) The work must carry prominent notices stating that it is released under
this License and any conditions added under section 7. This requirement
modifies the requirement in section 4 to *keep intact all notices*.
- c) You must license the entire work, as a whole, under this License to
anyone who comes into possession of a copy. This License will therefore
apply, along with any applicable section 7 additional terms, to the whole
of the work, and all its parts, regardless of how they are packaged. This
License gives no permission to license the work in any other way, but it
does not invalidate such permission if you have separately received it.
- d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your work need
not make them do so.
A compilation of a covered work with other separate and independent works,
which are not by their nature extensions of the covered work, and which are not
combined with it such as to form a larger program, in or on a volume of a
storage or distribution medium, is called an *aggregate* if the compilation and
its resulting copyright are not used to limit the access or legal rights of the
compilation's users beyond what the individual works permit. Inclusion of a
covered work in an aggregate does not cause this License to apply to the other
parts of the aggregate.
### 6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of sections 4
and 5, provided that you also convey the machine-readable Corresponding Source
under the terms of this License, in one of these ways:
- a) Convey the object code in, or embodied in, a physical product (including
a physical distribution medium), accompanied by the Corresponding Source
fixed on a durable physical medium customarily used for software
interchange.
- b) Convey the object code in, or embodied in, a physical product (including
a physical distribution medium), accompanied by a written offer, valid for
at least three years and valid for as long as you offer spare parts or
customer support for that product model, to give anyone who possesses the
object code either
1. a copy of the Corresponding Source for all the software in the product
that is covered by this License, on a durable physical medium
customarily used for software interchange, for a price no more than your
reasonable cost of physically performing this conveying of source, or
2. access to copy the Corresponding Source from a network server at no
charge.
- c) Convey individual copies of the object code with a copy of the written
offer to provide the Corresponding Source. This alternative is allowed only
occasionally and noncommercially, and only if you received the object code
with such an offer, in accord with subsection 6b.
- d) Convey the object code by offering access from a designated place
(gratis or for a charge), and offer equivalent access to the Corresponding
Source in the same way through the same place at no further charge. You
need not require recipients to copy the Corresponding Source along with the
object code. If the place to copy the object code is a network server, the
Corresponding Source may be on a different server operated by you or a
third party) that supports equivalent copying facilities, provided you
maintain clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the Corresponding
Source, you remain obligated to ensure that it is available for as long as
needed to satisfy these requirements.
- e) Convey the object code using peer-to-peer transmission, provided you
inform other peers where the object code and Corresponding Source of the
work are being offered to the general public at no charge under subsection
6d.
A separable portion of the object code, whose source code is excluded from the
Corresponding Source as a System Library, need not be included in conveying the
object code work.
A *User Product* is either
1. a *consumer product*, which means any tangible personal property which is
normally used for personal, family, or household purposes, or
2. anything designed or sold for incorporation into a dwelling.
In determining whether a product is a consumer product, doubtful cases shall be
resolved in favor of coverage. For a particular product received by a
particular user, *normally used* refers to a typical or common use of that
class of product, regardless of the status of the particular user or of the way
in which the particular user actually uses, or expects or is expected to use,
the product. A product is a consumer product regardless of whether the product
has substantial commercial, industrial or non-consumer uses, unless such uses
represent the only significant mode of use of the product.
*Installation Information* for a User Product means any methods, procedures,
authorization keys, or other information required to install and execute
modified versions of a covered work in that User Product from a modified
version of its Corresponding Source. The information must suffice to ensure
that the continued functioning of the modified object code is in no case
prevented or interfered with solely because modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as part of a
transaction in which the right of possession and use of the User Product is
transferred to the recipient in perpetuity or for a fixed term (regardless of
how the transaction is characterized), the Corresponding Source conveyed under
this section must be accompanied by the Installation Information. But this
requirement does not apply if neither you nor any third party retains the
ability to install modified object code on the User Product (for example, the
work has been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates for a
work that has been modified or installed by the recipient, or for the User
Product in which it has been modified or installed. Access to a network may be
denied when the modification itself materially and adversely affects the
operation of the network or violates the rules and protocols for communication
across the network.
Corresponding Source conveyed, and Installation Information provided, in accord
with this section must be in a format that is publicly documented (and with an
implementation available to the public in source code form), and must require
no special password or key for unpacking, reading or copying.
### 7. Additional Terms.
*Additional permissions* are terms that supplement the terms of this License by
making exceptions from one or more of its conditions. Additional permissions
that are applicable to the entire Program shall be treated as though they were
included in this License, to the extent that they are valid under applicable
law. If additional permissions apply only to part of the Program, that part may
be used separately under those permissions, but the entire Program remains
governed by this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option remove any
additional permissions from that copy, or from any part of it. (Additional
permissions may be written to require their own removal in certain cases when
you modify the work.) You may place additional permissions on material, added
by you to a covered work, for which you have or can give appropriate copyright
permission.
Notwithstanding any other provision of this License, for material you add to a
covered work, you may (if authorized by the copyright holders of that material)
supplement the terms of this License with terms:
- a) Disclaiming warranty or limiting liability differently from the terms of
sections 15 and 16 of this License; or
- b) Requiring preservation of specified reasonable legal notices or author
attributions in that material or in the Appropriate Legal Notices displayed
by works containing it; or
- c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in reasonable
ways as different from the original version; or
- d) Limiting the use for publicity purposes of names of licensors or authors
of the material; or
- e) Declining to grant rights under trademark law for use of some trade
names, trademarks, or service marks; or
- f) Requiring indemnification of licensors and authors of that material by
anyone who conveys the material (or modified versions of it) with
contractual assumptions of liability to the recipient, for any liability
that these contractual assumptions directly impose on those licensors and
authors.
All other non-permissive additional terms are considered *further restrictions*
within the meaning of section 10. If the Program as you received it, or any
part of it, contains a notice stating that it is governed by this License along
with a term that is a further restriction, you may remove that term. If a
license document contains a further restriction but permits relicensing or
conveying under this License, you may add to a covered work material governed
by the terms of that license document, provided that the further restriction
does not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you must place,
in the relevant source files, a statement of the additional terms that apply to
those files, or a notice indicating where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the form of a
separately written license, or stated as exceptions; the above requirements
apply either way.
### 8. Termination.
You may not propagate or modify a covered work except as expressly provided
under this License. Any attempt otherwise to propagate or modify it is void,
and will automatically terminate your rights under this License (including any
patent licenses granted under the third paragraph of section 11).
However, if you cease all violation of this License, then your license from a
particular copyright holder is reinstated
- a) provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and
- b) permanently, if the copyright holder fails to notify you of the
violation by some reasonable means prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is reinstated
permanently if the copyright holder notifies you of the violation by some
reasonable means, this is the first time you have received notice of violation
of this License (for any work) from that copyright holder, and you cure the
violation prior to 30 days after your receipt of the notice.
Termination of your rights under this section does not terminate the licenses
of parties who have received copies or rights from you under this License. If
your rights have been terminated and not permanently reinstated, you do not
qualify to receive new licenses for the same material under section 10.
### 9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run a copy
of the Program. Ancillary propagation of a covered work occurring solely as a
consequence of using peer-to-peer transmission to receive a copy likewise does
not require acceptance. However, nothing other than this License grants you
permission to propagate or modify any covered work. These actions infringe
copyright if you do not accept this License. Therefore, by modifying or
propagating a covered work, you indicate your acceptance of this License to do
so.
### 10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically receives a
license from the original licensors, to run, modify and propagate that work,
subject to this License. You are not responsible for enforcing compliance by
third parties with this License.
An *entity transaction* is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered work
results from an entity transaction, each party to that transaction who receives
a copy of the work also receives whatever licenses to the work the party's
predecessor in interest had or could give under the previous paragraph, plus a
right to possession of the Corresponding Source of the work from the
predecessor in interest, if the predecessor has it or can get it with
reasonable efforts.
You may not impose any further restrictions on the exercise of the rights
granted or affirmed under this License. For example, you may not impose a
license fee, royalty, or other charge for exercise of rights granted under this
License, and you may not initiate litigation (including a cross-claim or
counterclaim in a lawsuit) alleging that any patent claim is infringed by
making, using, selling, offering for sale, or importing the Program or any
portion of it.
### 11. Patents.
A *contributor* is a copyright holder who authorizes use under this License of
the Program or a work on which the Program is based. The work thus licensed is
called the contributor's *contributor version*.
A contributor's *essential patent claims* are all patent claims owned or
controlled by the contributor, whether already acquired or hereafter acquired,
that would be infringed by some manner, permitted by this License, of making,
using, or selling its contributor version, but do not include claims that would
be infringed only as a consequence of further modification of the contributor
version. For purposes of this definition, *control* includes the right to grant
patent sublicenses in a manner consistent with the requirements of this
License.
Each contributor grants you a non-exclusive, worldwide, royalty-free patent
license under the contributor's essential patent claims, to make, use, sell,
offer for sale, import and otherwise run, modify and propagate the contents of
its contributor version.
In the following three paragraphs, a *patent license* is any express agreement
or commitment, however denominated, not to enforce a patent (such as an express
permission to practice a patent or covenant not to sue for patent
infringement). To *grant* such a patent license to a party means to make such
an agreement or commitment not to enforce a patent against the party.
If you convey a covered work, knowingly relying on a patent license, and the
Corresponding Source of the work is not available for anyone to copy, free of
charge and under the terms of this License, through a publicly available
network server or other readily accessible means, then you must either
1. cause the Corresponding Source to be so available, or
2. arrange to deprive yourself of the benefit of the patent license for this
particular work, or
3. arrange, in a manner consistent with the requirements of this License, to
extend the patent license to downstream recipients.
*Knowingly relying* means you have actual knowledge that, but for the patent
license, your conveying the covered work in a country, or your recipient's use
of the covered work in a country, would infringe one or more identifiable
patents in that country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or arrangement, you
convey, or propagate by procuring conveyance of, a covered work, and grant a
patent license to some of the parties receiving the covered work authorizing
them to use, propagate, modify or convey a specific copy of the covered work,
then the patent license you grant is automatically extended to all recipients
of the covered work and works based on it.
A patent license is *discriminatory* if it does not include within the scope of
its coverage, prohibits the exercise of, or is conditioned on the non-exercise
of one or more of the rights that are specifically granted under this License.
You may not convey a covered work if you are a party to an arrangement with a
third party that is in the business of distributing software, under which you
make payment to the third party based on the extent of your activity of
conveying the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory patent
license
- a) in connection with copies of the covered work conveyed by you (or copies
made from those copies), or
- b) primarily for and in connection with specific products or compilations
that contain the covered work, unless you entered into that arrangement, or
that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting any implied
license or other defenses to infringement that may otherwise be available to
you under applicable patent law.
### 12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not excuse
you from the conditions of this License. If you cannot convey a covered work so
as to satisfy simultaneously your obligations under this License and any other
pertinent obligations, then as a consequence you may not convey it at all. For
example, if you agree to terms that obligate you to collect a royalty for
further conveying from those to whom you convey the Program, the only way you
could satisfy both those terms and this License would be to refrain entirely
from conveying the Program.
### 13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have permission to
link or combine any covered work with a work licensed under version 3 of the
GNU Affero General Public License into a single combined work, and to convey
the resulting work. The terms of this License will continue to apply to the
part which is the covered work, but the special requirements of the GNU Affero
General Public License, section 13, concerning interaction through a network
will apply to the combination as such.
### 14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of the GNU
General Public License from time to time. Such new versions will be similar in
spirit to the present version, but may differ in detail to address new problems
or concerns.
Each version is given a distinguishing version number. If the Program specifies
that a certain numbered version of the GNU General Public License *or any later
version* applies to it, you have the option of following the terms and
conditions either of that numbered version or of any later version published by
the Free Software Foundation. If the Program does not specify a version number
of the GNU General Public License, you may choose any version ever published by
the Free Software Foundation.
If the Program specifies that a proxy can decide which future versions of the
GNU General Public License can be used, that proxy's public statement of
acceptance of a version permanently authorizes you to choose that version for
the Program.
Later license versions may give you additional or different permissions.
However, no additional obligations are imposed on any author or copyright
holder as a result of your choosing to follow a later version.
### 15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE
LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER
PARTIES PROVIDE THE PROGRAM *AS IS* WITHOUT WARRANTY OF ANY KIND, EITHER
EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE
QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
### 16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY
COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS
PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL,
INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED
INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE
PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY
HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
### 17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided above cannot
be given local legal effect according to their terms, reviewing courts shall
apply local law that most closely approximates an absolute waiver of all civil
liability in connection with the Program, unless a warranty or assumption of
liability accompanies a copy of the Program in return for a fee.
## END OF TERMS AND CONDITIONS ###
### How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest possible
use to the public, the best way to achieve this is to make it free software
which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest to attach
them to the start of each source file to most effectively state the exclusion
of warranty; and each file should have at least the *copyright* line and a
pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short notice like
this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w` and `show c` should show the appropriate
parts of the General Public License. Of course, your program's commands might
be different; for a GUI interface, you would use an *about box*.
You should also get your employer (if you work as a programmer) or school, if
any, to sign a *copyright disclaimer* for the program, if necessary. For more
information on this, and how to apply and follow the GNU GPL, see
[http://www.gnu.org/licenses/](http://www.gnu.org/licenses/).
The GNU General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may consider
it more useful to permit linking proprietary applications with the library. If
this is what you want to do, use the GNU Lesser General Public License instead
of this License. But first, please read
[http://www.gnu.org/philosophy/why-not-lgpl.html](http://www.gnu.org/philosophy/why-not-lgpl.html).
Makefile 0 → 100644
View file @ 7dc4f29c
# Toplevel Makefile for Purr Data. Please note that at present this is just a
# thin wrapper around l2ork_addons/tar_em_up.sh, the traditional Pd-l2ork
# build script.
# The Pd-l2ork build system is very arcane and intricate. Its main purpose is
# putting together a staging area with a complete Pd-l2ork installation and
# then building installers for the supported platforms from that, pulling
# together a bunch of separate packages, each with their own build system.
# Compiling sources is just one of the tasks that the builder does. Therefore
# you'll notice that, unlike with other less complicated source packages,
# `make` will rebuild lots of things even if you just finished another build.
# The available build targets are:
# all: produce a native installer for the host platform (equivalent to
# `tar_em_up.sh -Tk`); note that in order to force a complete rebuild (like
# what `tar_em_up.sh -T` does), you'll have to run `make clean` first
# incremental: like `all`, but does an "incremental build" (equivalent to
# `tar_em_up.sh -tk`), bypassing Gem which takes an eternity to compile; please
# check the tar_em_up.sh script for details
# light: like `incremental`, but does a light build (equivalent to
# `tar_em_up.sh -tkl`) which only includes the most essential externals;
# please check the tar_em_up.sh script for details
# checkout: convenience target to check out all submodules in preparation for
# a subsequent build (the `all`, `incremental` and `dist` targets also do this
# automatically when needed)
# clean: does something similar to what `tar_em_up.sh` does in order to start
# from a clean slate, so that a subsequent build starts from scratch again
# realclean: put the sources into pristine state again (WARNING: this will get
# rid of any uncommitted source changes, too); use this as a last resort to
# get the sources into a compilable state again after things have gone awry
# dist: create a self-contained distribution tarball of the source
# NOTES:
# The realclean and dist targets use git commands and thus only work in a
# working copy of the git repo, not in the static tarball snapshots produced
# by the dist target.
# On Linux systems running `make` will try to produce a Debian package. On
# Linux distributions like Arch which are no Debian derivatives, the Debian
# packaging tools are not available. In this case, `make` will stop right
# before creating the actual package and leave the ready-made staged
# installation tree under `packages/linux_make/build` from where it can be
# copied or packaged up in any desired way.
# The incremental and light builds assume an existing staging area
# (packages/*/build directory) which is *not* cleaned before installing. This
# makes it possible to update the existing staging area after recompiling just
# a part of the system (all but Gem in the case of "incremental", only the
# Pd core and a few essential externals in the case of "light"). Use `make
# clean` beforehand if you want to install into a clean staging area.
# When doing a `light` build, which only includes the most essential
# externals, it may be desirable to manually include additional abstractions
# and externals in the build. To these ends, after running `make light` you
# can run `make` with the `foo_abs` or `foo_ext` target, where `foo` is the
# name of the desired abstraction or external, respectively. E.g., you can run
# `make light memento_abs pdlua_ext` to get a light build with the `memento`
# abstraction and the `pdlua` external included. (This will not rebuild the
# Debian package, though, so you'll have to install manually with `make
# install` instead.) The names of the desired addons must be specified as
# given in abstractions/Makefile and externals/Makefile, respectively (look
# for targets looking like `foo_install`). Also note that even though a
# subsequent `make install` will then include your addons, they won't be
# enabled by default, so you'll have to do that manually in Purr Data's
# `Startup` dialog. Simply adding the name of the addon in the `Libraries`
# list should normally do the trick. Or you can add an option like `-lib foo`
# when running Purr Data from the command line.
.PHONY: all incremental checkout clean realclean dist
# Target platform (OSX/macOS only): On Mojave (10.14 with Xcode 10) this needs
# to be at least 10.9, which is the default now. With older Xcode versions you
# can try earlier versions (>= 10.4) if you need to compile for legacy OSX
# versions.
export macos_target = 10.9
# Installation prefix under which Pd-l2ork is installed (Linux only). If this
# isn't set, a default location will be used (usually /usr/local). NOTE: We
# *always* assume that this variable is set properly in the install targets,
# as well as the (Linux) check target (see below).
prefix = /usr
ifneq ($(prefix),)
env = inst_dir="$(prefix)"
endif
install_vars = DESTDIR=$(firstword $(wildcard $(CURDIR)/packages/*/build)) prefix=$(prefix)
# You can set the nwjsver variable to indicate the nw.js version to build
# against. This will also clear out any cached nw.js binaries beforehand.
# Note that some nw.js versions for certain platforms have to be hard-coded,
# so the nwjsver variable won't affect these, but it will still cause the
# cache to be cleared and the binaries to be downloaded. See the tar_em_up.sh
# script for details.
ifneq ($(nwjsver),)
env += nwjsver="$(nwjsver)"
endif
# You can set CFLAGS to whatever special compile options are needed. E.g., to
# build the double precision version: CFLAGS = -DPD_FLOATSIZE=64
CFLAGS =
export CFLAGS
# For the light build only, you can add externals to be included in the build.
addons =
export addons
# You can also set this variable to specify externals NOT to be built. E.g.,
# to prevent building Gem (which takes an eternity to build): blacklist = gem
blacklist =
export blacklist
all:
cd l2ork_addons && $(env) ./tar_em_up.sh -Tk
incremental:
cd l2ork_addons && $(env) ./tar_em_up.sh -tk
light:
cd l2ork_addons && $(env) ./tar_em_up.sh -tkl
# Convenience targets to build the double precision version.
# Blacklist of externals which don't work with double precision yet.
double_blacklist = autotune smlib
# These are dubious, passing float* for t_float* pointers, and so are most
# likely broken, even though they compile with double precision.
double_blacklist += cyclone lyonpotpourri
all-double:
cd l2ork_addons && $(env) CFLAGS=-DPD_FLOATSIZE=64 blacklist="$(double_blacklist)" ./tar_em_up.sh -Tk
incremental-double:
cd l2ork_addons && $(env) CFLAGS=-DPD_FLOATSIZE=64 blacklist="$(double_blacklist)" ./tar_em_up.sh -tk
light-double:
cd l2ork_addons && $(env) CFLAGS=-DPD_FLOATSIZE=64 blacklist="$(double_blacklist)" ./tar_em_up.sh -tkl
%_abs:
make -C abstractions $(@:%_abs=%) $(@:%_abs=%_install) $(install_vars)
%_ext:
make -C externals $(@:%_ext=%) $(@:%_ext=%_install) $(install_vars)
checkout:
git submodule update --init --recursive
clean:
test "$(shell uname -s)" = "Darwin" && make -C packages/darwin_app clean || true
cd pd/src && aclocal && autoconf && make clean || true
cd externals/miXed && make clean || true
cd Gem/src/ && test -f Makefile && make distclean || true
cd Gem/src/ && rm -rf ./.libs && rm -rf ./*/.libs || true
cd Gem/ && test -f Makefile && make distclean || true
cd Gem/ && rm -f gemglutwindow.pd_linux Gem.pd_linux || true
rm -rf packages/*/build/
realclean:
# This requires a working copy of the git repo.
@test -d .git || (echo "Not a git repository, bailing out." && false)
git submodule deinit --all -f
git checkout .
git clean -dffx -e pd/nw/nw/
# Check targets. These run the regression tests in scripts.
# Requires a full build.
os = $(shell uname|sed 's/^\(MINGW[0-9]*\)_NT.*/\1/')
ifeq ($(os),Linux)
# Linux (all flavors)
pdprog = packages/linux_make/build$(prefix)/bin/pd-l2ork
else ifeq ($(os),Darwin)
# Mac
pdprog = packages/darwin_app/build/*.app/Contents/Resources/app.nw/bin/pd-l2ork
else ifeq ($(os),MINGW64)
# Msys2 mingw64
pdprog = packages/win64_inno/build/bin/pd.exe
else ifeq ($(os),MINGW32)
# Msys2 mingw32
pdprog = packages/win32_inno/build/bin/pd.exe
endif
ifneq ($(pdprog),)
# This runs just a quick regression test, useful to see whether the program
# works at all.
check1:
$(pdprog) -noprefs -nogui -noaudio -send 'init dollarzero $$0' scripts/regression_tests.pd
# This runs the full test suite, including the test of the externals.
check:
$(pdprog) -noprefs -nogui -noaudio -send 'init dollarzero $$0' scripts/regression_tests.pd
$(pdprog) -noprefs -nostdpath -nogui -noaudio scripts/external-tests.pd
else
check1 check:
@echo "Target $(os) not recognized, can't run 'make $@'!"; false
endif
# Installation targets. These don't work on Mac and Windows right now, you
# should use the generated installers on these systems instead. Also,
# $(prefix) must be set. $(DESTDIR) is supported as well, so you can do staged
# installs (but then again presumably you already have a staged install
# sitting in packages/*/build, so you might as well use that instead).
# Note that these targets simply (un)install whatever is in the
# packages/*/build directory at the time they're invoked. If no build
# directory is present then nothing will happen, so you need to run `make` (or
# `make incremental`, etc.) before running these targets. Also note that some
# old cruft under build/etc (all but the bash auto-completions) isn't
# installed as it isn't needed on modern Linux systems any more.
builddir = $(firstword $(wildcard packages/*/build))
ifneq ($(builddir),)
manifest = etc/bash_completion.d/pd-l2ork $(prefix:/%=%)/include/pd-l2ork $(prefix:/%=%)/lib/pd-l2ork $(patsubst $(builddir)/%,%, $(wildcard $(builddir)/$(prefix:/%=%)/bin/*) $(shell find $(builddir)/usr/share -type f))
endif
ifneq ($(manifest),)
install:
test -z "$(DESTDIR)" || (rm -rf "$(DESTDIR)" && mkdir -p "$(DESTDIR)")
tar -c -C $(builddir) $(manifest) | tar -x -C $(DESTDIR)/
# Edit the library paths in the default user.settings file so that it matches
# our installation prefix.
test -f "$(DESTDIR)"$(prefix)/lib/pd-l2ork/default.settings && cd "$(DESTDIR)"$(prefix)/lib/pd-l2ork && sed -e "s!/usr/lib/pd-l2ork!$(prefix)/lib/pd-l2ork!g" -i default.settings || true
uninstall:
rm -rf $(addprefix $(DESTDIR)/, $(manifest))
else
install:
@echo "no build directory, run make first" && false
uninstall:
@echo "no build directory, run make first" && false
endif
# Build a self-contained distribution tarball (snapshot). This is pretty much
# the same as in debuild/Makefile and must be run in a working copy of the git
# repo.
# The Debian version gets derived from the date and serial number of the last
# commit.
debversion = $(shell grep PD_L2ORK_VERSION pd/src/m_pd.h | sed 's|^.define *PD_L2ORK_VERSION *"\(.*\)".*|\1|')+git$(shell test -d .git && git rev-list --count HEAD)+$(shell test -d .git && git rev-parse --short HEAD)
# Source tarball and folder.
debsrc = purr-data_$(debversion).orig.tar.gz
debdist = purr-data-$(debversion)
# Submodules (Gem, etc.).
submodules = $(sort $(shell test -d .git && (git config --file .gitmodules --get-regexp path | awk '{ print $$2 }')))
dist: $(debsrc)
# Determine the version number of this build. We get this from m_pd.h.
PD_L2ORK_VERSION := $(shell grep PD_L2ORK_VERSION pd/src/m_pd.h | sed 's|^.define *PD_L2ORK_VERSION *"\(.*\)".*|\1|')
# Determine the build version which needs git to be computed, so we can't do
# it in a stand-alone build from a tarball.
PD_BUILD_VERSION := $(shell test -d .git && (git log -1 --format=%cd --date=short | sed -e 's/-//g'))-rev.$(shell test -d .git && git rev-parse --short HEAD)
$(debsrc):
@test -d .git || (echo "Not a git repository, bailing out." && false)
rm -rf $(debdist)
# Make sure that the submodules are initialized.
git submodule update --init
# Grab the main source.
git archive --format=tar.gz --prefix=$(debdist)/ HEAD | tar xfz -
# Grab the submodules.
for x in $(submodules); do (cd $(debdist) && rm -rf $$x && git -C ../$$x archive --format=tar.gz --prefix=$$x/ HEAD | tar xfz -); done
# Pre-generate and put s_version.h into the tarball (see above; the build
# version is generated using git which can't be done outside the git repo).
sed 's|^\(#define PD_BUILD_VERSION "\).*"|\1$(PD_BUILD_VERSION)"|' pd/src/s_version.h.in > $(debdist)/pd/src/s_version.h
# Pre-generate the markdown and html docs so that they will be included in the
# source. This means that we don't need any special tools as a build
# dependency, which makes live a lot easier.
make -C packages/gendoc version="$(PD_L2ORK_VERSION)" build_version="$(PD_BUILD_VERSION)"
mv packages/gendoc/{ReadMe,Welcome}-*.{md,html} $(debdist)/packages/gendoc
make -C packages/gendoc clean
# Create the source tarball.
tar cfz $(debsrc) $(debdist)
rm -rf $(debdist)
README.md
View file @ 7dc4f29c
## Pure Data L2ork ## Purr-Data
maintainer: Ivica Bukvic <ico@vt.edu> Maintainers:
maintainer: Jonathan Wilkes <jancsika@yahoo.com> * Ivica Ico Bukvic <ico@vt.edu> (Pd-l2ork)
* Jonathan Wilkes <jancsika@yahoo.com> (Purr Data)
* Albert Graef <aggraef@gmail.com> (GitHub Mirror, JGU Packages)
Contact: [DISIS mailing list](http://disis.music.vt.edu/cgi-bin/mailman/listinfo/l2ork-dev)
**GitLab Repository:** <https://git.purrdata.net/jwilkes/purr-data>
Official Purr Data source code in the "master" branch.
**GitHub Mirror:** <https://github.com/agraef/purr-data>
Mirrors the GitLab "master" branch, and also has "release" and "testing"
branches, binary packages, a website, and a wiki (WIP).
Contents:
* [Downloads](#downloads)
* [One Paragraph Overview](#one-paragraph-overview) * [One Paragraph Overview](#one-paragraph-overview)
* [Flavors of Pure Data](#flavors-of-pure-data)
* [Three Paragraph Overview](#three-paragraph-overview) * [Three Paragraph Overview](#three-paragraph-overview)
* [Goals](#goals) * [Goals](#goals)
* [Installation Guide](#installation-guide) * [User Guide](#user-guide)
* [Relationship of Purr Data to Pure Data](#relationship-of-purr-data-to-pure-data)
* [Build Guide](#build-guide)
* [Gnu/Linux](#linux)
* [OSX](#osx-64-bit-using-homebrew)
* [Windows](#windows-64-bit-using-msys2)
* [Code of Conduct](#code-of-conduct)
* [Project Governance](#project-governance)
* [Contributor Guide](#contributor-guide) * [Contributor Guide](#contributor-guide)
* [Human Interface Guidelines](#human-interface-guidelines)
* [Core Pd Notes](#core-pd-notes) * [Core Pd Notes](#core-pd-notes)
* [GUI Message Spec](#gui-messaging-specification) * [GUI Message Spec](#gui-messaging-specification)
### One Paragraph Overview ### One Paragraph Overview
Pure Data (aka Pd) is a visual programming. That means you can use it to Pure Data (aka Pd) is a visual programming language. That means you can use it
create software graphically by drawing diagrams instead of writing lines of to create software graphically by drawing diagrams instead of writing lines of
code. These diagram shows how data flows through the software, displaying on code. These diagrams show how data flows through the software, displaying on
the screen what text-based languages require you to piece together in your mind. the screen what text-based languages require you to piece together in your mind.
### Flavors of Pure Data
There are currently three main distributions of Pure Data:
1. Pd-l2ork. Version used by Ivica Bukvic for his laptop orchestra. This
guide is for Pd-l2ork.
2. Pure Data "Vanilla". Miller Puckette's personal version which he hosts on
his website and maintains. It doesn't include external libraries like
objects for doing graphics, video, etc.
2. Pure Data Extended. A monolithic distribution which ships with lots of
external libraries. At the moment it doesn't look to be maintained.
### Three Paragraph Overview ### Three Paragraph Overview
Pd has been designed with an emphasis on generating sound, video, Pd has been designed with an emphasis on generating sound, video,
...@@ -52,7 +63,7 @@ methods, as well as for realizing complex systems for large-scale projects. ...@@ -52,7 +63,7 @@ methods, as well as for realizing complex systems for large-scale projects.
### Goals ### Goals
Pd-l2ork has the following goals: Purr-Data has the following goals:
1. Documentation. We like documentation. It's like code, except friendly. 1. Documentation. We like documentation. It's like code, except friendly.
2. Be reliable. Binary releases must be usable for performances and 2. Be reliable. Binary releases must be usable for performances and
...@@ -62,18 +73,242 @@ Pd-l2ork has the following goals: ...@@ -62,18 +73,242 @@ Pd-l2ork has the following goals:
bugs. Patches for new functionality that lack documentation are spam. bugs. Patches for new functionality that lack documentation are spam.
4. Be consistent. Consistent interfaces are themselves a kind of 4. Be consistent. Consistent interfaces are themselves a kind of
documentation. We like documentation, so it follows that we like consistent documentation. We like documentation, so it follows that we like consistent
interviews. interfaces.
### User Guide and Weblinks
For a more in-depth look at Purr Data for new users and developers, see:
<https://agraef.github.io/purr-data-intro/Purr-Data-Intro.html>
For more resources see:
<https://agraef.github.io/purr-data/>
For Ico Bukvic's original Pd-l2ork website see:
<http://l2ork.music.vt.edu/main/make-your-own-l2ork/software/>
### Relationship of Purr Data to Pure Data
At the time of this writing, there are four maintained distributions of Pure
Data, two of which (Purr Data, Pd-l2ork) belong to the Pd-extended lineage.
1. Purr Data. This started out as the 2.0 version of Pd-l2ork. It ships with
lots of external libraries and uses a modern GUI written using HTML5.
2. Pd-l2ork is the version used by Ivica Bukvic for his laptop orchestra.
Pd-l2ork 1.0 used tcl/tk (and tkpath) for the GUI. Pd-l2ork 2.x is a fork
of an earlier Purr Data version which is developed separately. You can find
these [here](http://l2ork.music.vt.edu/main/make-your-own-l2ork/software/).
3. Pure Data "Vanilla". Miller Puckette's personal version which he hosts on
his website and maintains. It doesn't come with external libraries
pre-installed, but it does include an interface you can use to search
and install external libraries maintained and packaged by other developers.
4. Plugdata. A new libpd-based distribution of Pure Data which can be run as a
plugin. See <https://plugdata.org/>.
### Downloads
**Windows, Ubuntu, and Mac OSX:**
Releases are done on Albert Gräf's GitHub mirror, which also provides a
website, wiki, additional documentation, and an up-to-date mirror of the
source code repository.
<https://github.com/agraef/purr-data/releases>
**More Linux packages:**
Packages for various Linux distributions (including Arch, Debian, Ubuntu, and
Fedora) are available through the JGU package repositories maintained by
Albert Gräf on the OBS (Open Build System). Detailed instructions can be found
[here](https://github.com/agraef/purr-data/wiki/Installation#linux).
You can also just go to the [OBS Download](https://software.opensuse.org/download/package?package=purr-data&project=home%3Aaggraef%3Apurr-data-jgu), pick your Linux system, and follow
the instructions.
### Build Guide
Purr Data is usually built by just running `make` in the toplevel source
directory after checking out the sources from its git repository. This works
across all supported platforms (Linux, Mac and Windows at this time).
The Makefile also offers the customary targets to clean (`make clean`, or
`make realclean` to put the sources in pristine state again) and to roll a
self-contained distribution tarball (`make dist`), as well as some other
convenience targets (please check the comments at the beginning of the Makefile
for more information).
However, to make this work, you will most likely have to install some
prerequisites first: *build tools* such as a C/C++ compiler and the make
program itself, as well as *dependencies*, the libraries that Purr Data needs.
Detailed instructions for each of the supported platforms are given below.
#### Linux
Time to build: *10 minutes light install, 45 minutes to 1.5 hours full install*
Hard drive space required: *roughly 2.5 GB*
0. Remember to update your packages:
sudo apt-get update && sudo apt-get upgrade
1. Install the dependencies:
sudo apt-get install bison flex automake libasound2-dev \
libjack-jackd2-dev libtool libbluetooth-dev libgl1-mesa-dev \
libglu1-mesa-dev libglew-dev libmagick++-dev libftgl-dev \
libgmerlin-dev libgmerlin-avdec-dev libavifile-0.7-dev \
libmpeg3-dev libquicktime-dev libv4l-dev libraw1394-dev \
libdc1394-22-dev libfftw3-dev libvorbis-dev ladspa-sdk \
dssi-dev tap-plugins invada-studio-plugins-ladspa blepvco \
swh-plugins mcp-plugins cmt blop slv2-jack omins rev-plugins \
libslv2-dev dssi-utils vco-plugins wah-plugins fil-plugins \
mda-lv2 libmp3lame-dev libspeex-dev libgsl0-dev \
portaudio19-dev liblua5.3-dev python-dev libsmpeg0 libjpeg62-turbo \
libgsm1-dev libgtk2.0-dev git libstk0-dev \
libfluidsynth-dev fluid-soundfont-gm byacc \
python3-markdown
**Note:** The given package names are for a generic Debian/Ubuntu system.
However, package names and versions vary *a lot* between different Linux
distributions and releases, thus it's impossible to give a definitive and
up-to-date package list here. Please consult your distribution's
documentation and package manager to find the exact package names for your
system.
2. The gui toolkit may require installing the following extra dependencies
sudo apt-get install gconf2 libnss3
### Installation Guide 3. Clone the Purr-Data repository *(2 to 10 minutes)*
To install using a pre-compiled binary, follow these instructions:
http://l2ork.music.vt.edu/main/?page_id=56
To set up a development environment, first make sure you have the following git clone https://git.purrdata.net/jwilkes/purr-data.git
package dependencies listed here:
http://l2ork.music.vt.edu/main/?page_id=56
Then follow the steps outlined here: 4. Compile the code *(5 minutes [light] to 1.5 hours [full])*
http://l2ork.music.vt.edu/main/?page_id=56#install-dev
* to build only the core: `make light` *(5 minutes)*
* to build the core and all externals: `make all` *(20 minutes to 1.5 hours)*
* to build everything *except* Gem: `make incremental` *(10 to 20 minutes)*
5. If you're using an apt-based Linux distribution and you have the necessary
Debian packaging tools installed, there should now be an installer file in
the main source directory, which can be installed as usual. Otherwise, run
`make install` to install the software, and `make uninstall` to remove it
again.
#### OSX 64-bit using Homebrew
Time to build: *50 minutes to 1.5 hours*
Hard drive space required: *roughly 2 GB*
1. Install [Homebrew](https://brew.sh) *(15 minutes)*
(asks for password twice-- once for command line tools, once for homebrew)
2. Install the dependencies *(10 minutes)*:
brew install wget
brew install autoconf
brew install automake
brew install libtool
brew install fftw
brew install python
brew install lua
brew install fluidsynth
brew install faac
brew install jpeg
brew install lame
brew install libvorbis
brew install speex
brew install gsl
brew install libquicktime
brew install sdl2
brew install pkg-config
You'll also need to install the python markdown module to generate the
platform-specific release notes (ReadMe.html, Welcome.html):
pip3 install markdown
**Note:** Depending on your macOS and Xcode version, the 10 minutes
estimate for this step may be a overly optimistic. Some build dependencies
may require recompilation which can take a long time (up to several hours,
if it includes a complete build of, e.g., gcc and cmake).
3. Clone the Purr-Data repository *(10 minutes)*
git clone https://git.purrdata.net/jwilkes/purr-data.git
4. Change to the source directory
cd purr-data
5. Build the OSX app and the installer disk image (.dmg file) *(15 minutes)*
make
6. There should now be a .dmg file in your current directory, which lets you
install the app in the usual way
#### Windows 64-bit Using msys2
Time to build: *roughly 1.5 hours-- 30 minutes of this is for Gem alone*
Hard drive space required to build: *rougly 2.5 GB*
**Important note:** We recommend doing the build under your msys2 home
directory (usually /home/username in the msys2 shell). This directory should
not have any spaces in it, which would otherwise cause trouble during the
build. Never try using your Windows home directory for this purpose instead,
since it will usually contain spaces, making the build fail.
1. In a browser, navigate to: `https://git.purrdata.net/jwilkes/ci-runner-setup/-/raw/master/win64_install_build_deps.ps1`
2. Select all with `<control-a>`
3. Right-click and choose "Copy"
4. In the Start menu type `PowerShell ISE` and click the "Windows Powershell ISE" app that pops up.
5. In the Powershell ISE window menu, choose File -> New
6. In the area with the white background, right-click and choose "Paste"
7. Click the `Run Script` arrow in the toolbar *(20 minutes)*
8. If there were no errors in the script, msys2 and Inno Setup are now installed.
9. Open the directory "C:\msys64" and click `mingw64.exe`
10. Download the source code *(3-6 minutes)*
In the msys terminal window, issue the following command to create a new directory "purr-data" and clone the repository to it:
git clone https://git.purrdata.net/jwilkes/purr-data.git
6. Enter the source directory *(less than a minute)*
cd purr-data
7. Finally, build Purr-Data *(45-80 minutes)*
make
8. Look in the top level source directory and double-click the setup file to
start installing Purr Data on your system or run `./"setup file name"` in MSYS2 shell.
### Code of Conduct
1. No sarcasm, please.
2. Don't appear to lack empathy.
3. You can't live here. If you're spending hours a day writing Purr Data
code or-- worse-- spending hours a day *writing emails about* code that
has yet to be written, you're doing it wrong.
4. If working on something for the first time, ask to be mentored.
5. If no one asked you to mentor them, don't teach.
6. It is better to let small things go than to risk taking time away from
solving bigger problems.
It is a bad idea to break this Code of Conduct *even if* no one complains
about your behaviour.
### Project Governance
* The three maintainers listed at the top of this document are the ones in
charge of this project.
* Unanimous decisions are preferred.
* 2 out of 3 can break a disagreement.
* There will only ever be three maintainers of this project at any given time.
If you'd like to temporarily step in as one of the three,
send an inquiry to the list and we can discuss it.
### Contributor Guide ### Contributor Guide
...@@ -81,48 +316,123 @@ Contributing is easy: ...@@ -81,48 +316,123 @@ Contributing is easy:
1. Join the development list: 1. Join the development list:
http://disis.music.vt.edu/cgi-bin/mailman/listinfo/l2ork-dev http://disis.music.vt.edu/cgi-bin/mailman/listinfo/l2ork-dev
2. Tell us what you'd like to work on. Unfortunately there are _lots_ of 2. Fork Purr Data using the gitlab UI and then try to build it from source
externals and even core features that are poorly documented. We can help for your own platform using the [Build Guide](#build-guide) above.
make sure you aren't duplicating functionality (or that you at least know If you run into problems ask on the development list for help.
what's already been implemented). 3. Once you have successfully built Purr Data, install it and make sure it
3. Send us your patch and we'll try it out. If it's well-documented and runs correctly.
there aren't any bugs we'll add it to the software. 4. Start making changes to the code with brief, clear commit messages. If you
4. If you want to do regular development and have commit access, just request want some practice you can try fixing one of the bugs on the issue tracker
it, then follow the Pd-l2ork goals above. labeled
["good-first-bug"](https://git.purrdata.net/jwilkes/purr-data/issues?label_name%5B%5D=good-first-bug)
5. One you are done fixing the bug or adding your feature, make a merge request
in the Gitlab UI so we can merge the fix for the next release.
A few guidelines:
* There should be a short and clear commit message for each merge request.
* Short and clear title and description are required for each merge request.
* There should be a short branch name related to the issue, like "update-readme".
* _No prototypes, please_. Purr Data's biggest strength is that users can
turn an idea into working code very quickly. But a prototyping language that
is itself a prototype isn't very useful. That means Purr Data's core code
and libraries must be stable, consistent, well-documented, and easy to use.
* Develop incrementally. Small, solid improvements to the software are
preferable to large, disruptive ones.
* Try not to duplicate existing functionality.
For backwards compatibility Purr Data ships many legacy
libraries which unfortunately duplicate the same functionality. This makes
it harder to learn how to use Pd, and makes it burdensome to read patches
and keep track of all the disparate implementations.
* Keep dependencies to a minimum. Cross-platform dependency handling is
unfortunately still an open research problem. In the even that you need
an external library dependency, please mirror it at git.purrdata.net
so that the build system doesn't depend on the availability of external
infrastructure.
Here are some of the current tasks: Here are some of the current tasks:
* coming up with a better name than Pd-l2ork. :) * Writing small audio/visual Pd games or demos to include in the next release
* skills needed: creativity, basic knowledge about programming in Pd * Skills needed: Ability to write Pd programs
* status: no work done on this yet * Status: I wrote a little sprite-based game that will ship with the next
* writing small audio/visual Pd games or demos to include in the next release version of Pd-L2Ork. In it, the character walks around in an actual
* skills needed: ability to write Pd programs
* status: I wrote a little sprite-based game that will ship with the next
version of Pd-l2ork. In it, the character walks around in an actual
Pd diagram shoots at the objects to progress, and to make realtime Pd diagram shoots at the objects to progress, and to make realtime
changes to the music. changes to the music.
What I'd like is to include a new, smallish game with each release What I'd like is to include a new, smallish game with each release
that has a link in the Pd console. It can be a little demo or game, that has a link in the Pd console. It can be a little demo or game,
just something fun that shows off what can be done using Pure Data. just something fun that shows off what can be done using Pure Data.
* porting Pd-l2ork's graphical user interface from Tcl/Tk to Qt. * Designing/Implementing regression test template
* skills needed: knowledge about Qt5/QML, threading, and Pd's core design * Skills needed: Knowledge about... regression tests. :) But also some
and deterministic message-dispatching and scheduling
* status: under active development
* designing/implementing regression test template
* skills needed: knowledge about... regression tests. :) But also some
expertise in using Pd so that the tests themselves can expertise in using Pd so that the tests themselves can
be written in Pure Data. At the same time, they should be written in Pure Data. At the same time, they should
be able to be run as part of the automated packaging be able to be run as part of the automated packaging
process (i.e., in -nogui mode). process (i.e., in -nogui mode).
* status: some externals have their own testing environments, but they are * Status: Some externals have their own testing environments, but they are
limited as they require manual intervention to run and read the limited as they require manual intervention to run and read the
results inside a graphical window. results inside a graphical window.
We currently have a crude test system that at least ensures that each
external library instantiates without crashing.
Here's an email thread with Katja Vetter's design, which looks to Here's an email thread with Katja Vetter's design, which looks to
be automatable: be automatable:
http://markmail.org/message/t7yitfc55anus76i#query:+page:1+mid:chb56ve7kea2qumn+state:results http://markmail.org/message/t7yitfc55anus76i#query:+page:1+mid:chb56ve7kea2qumn+state:results
And Mathieu Bouchard's "pure unity" (not sure if this is the most And Mathieu Bouchard's "pure unity" (not sure if this is the most
recent link...): recent link...):
http://sourceforge.net/p/pure-data/svn/HEAD/tree/tags/externals/pureunity/pureunity-0.0/ http://sourceforge.net/p/pure-data/svn/HEAD/tree/tags/externals/pureunity/pureunity-0.0/
* Adding support for double precision to the external libraries that ship with purr-data
* Skills needed: Knowledge about data types in C language(specially float and double)
* Status: The core classes of purr data and the freeverb~ external library
have been changed to support both float and double but still the remaining
external libraries only have support for single precision.
The task ahead is to add double precision support to these external libraries.
As per the current resources we have the merge requests that have been used to add double
precision support to the core libraries:
https://git.purrdata.net/jwilkes/purr-data/merge_requests?scope=all&utf8=%E2%9C%93&state=merged&author_username=pranay_36
And Katja Vetter's double precision patches to the pd-double project which were
actually used for adding double precision support to the core libraries of purr-data.
https://github.com/pd-projects/pd-double/commit/982ad1aa1a82b9bcd29c5b6a6e6b597675d5f300
### Human Interface Guidelines
#### General Look and Feel
Pd is a multi-window application that consists of three parts:
1. A main window, called the "Pd Window" or "Console Window". This window
displays informational and error messages for Pd programs.
2. One or more "canvas" windows-- aka "patch" windows, used to display the
diagrams that make up a Pd program.
3. One or more dialog windows used to configure the various parts of Pd.
All should look simple and uncluttered. Although "canvas" windows cannot
(yet) be traversed and edited using only the keyboard, all three parts of Pd
should be designed so that they can be manipulated using only the keyboard.
### Hooks for new users
It should also be possible to produce sound and interact when a new user runs
program for the very first time. In every release, there should be a link at
the bottom of the Console Window to a short game written in Pd that demonstrates
one or more of the capabilities of the Pd environment. The game should be
designed to be fun outside of its efficacy as a demonstration of Pd.
#### Fonts
Pd ships with "DejaVu Sans Mono", which is used for the text in canvas windows.
Fonts are sized to fit the hard-coded constraints in Pd Vanilla. This way box
sizes will match as closely as possible across distributions and OSes.
These hard-coded sizes are maximum character widths and heights. No font
fits these maximums exactly, so it's currently impossible to tell when looking
at a Pd canvas whether the objects will collide on a system using a different
font (or even a different font-rendering engine).
Dialogs and console button labels may use variable-width fonts. There is not
yet a suggested default to use for these.
The console printout area currently uses "DejaVu Sans Mono". Errors are printed
as a link so that the user can click them to highlight the corresponded canvas
or object that triggered the error.
#### Colors
Nothing set in stone yet.
### Core Pd Notes ### Core Pd Notes
...@@ -130,7 +440,7 @@ The following is adapted from Pd Vanilla's original source notes. (Found ...@@ -130,7 +440,7 @@ The following is adapted from Pd Vanilla's original source notes. (Found
in pd/src/CHANGELOG.txt for some reason...) in pd/src/CHANGELOG.txt for some reason...)
Sections 2-3 below are quite old. Someone needs to check whether they even Sections 2-3 below are quite old. Someone needs to check whether they even
hold true for Pd Vanilla any more. hold true for Pd Vanilla anymore.
#### Structure definition roadmap. #### Structure definition roadmap.
...@@ -140,19 +450,19 @@ and t_graph and t_canvas, should be unified...) ...@@ -140,19 +450,19 @@ and t_graph and t_canvas, should be unified...)
BEFORE 0.35: BEFORE 0.35:
m_pd.h t_pd anything with a class m_pd.h t_pd anything with a class
t_gobj "graphic object" t_gobj "graphic object"
t_text text object t_text text object
g_canvas.h g_canvas.h
t_glist list of graphic objects t_glist list of graphic objects
g_canvas.c t_canvas Pd "document" g_canvas.c t_canvas Pd "document"
AFTER 0.35: AFTER 0.35:
m_pd.h t_pd anything with a class m_pd.h t_pd anything with a class
t_gobj "graphic object" t_gobj "graphic object"
t_text patchable object, AKA t_object t_text patchable object, AKA t_object
g_canvas.h t_glist list of graphic objects, AKA t_canvas g_canvas.h t_glist list of graphic objects, AKA t_canvas
Other structures: Other structures:
...@@ -166,25 +476,31 @@ Other structures: ...@@ -166,25 +476,31 @@ Other structures:
#### 1. Coding Style #### 1. Coding Style
1.0 C coding style. The source should pass most "warnings" of C compilers 1.0 C coding style. The source should pass most "warnings" of C compilers
(-Wall on linux, for instance; see the makefile.) Some informalities (-Wall on Linux, for instance-- see the makefile.) Some informalities
are intentional, for instance the loose use of function prototypes (see are intentional, for instance the loose use of function prototypes (see
below) and uncast conversions from longer to shorter numerical formats. below) and uncast conversions from longer to shorter numerical formats.
The code doesn't respect "const" yet. The code doesn't respect "const" yet.
1.1. Prefixes in structure elements. The names of structure elements always 1.1. Prefixes in structure elements. The names of structure elements always
have a K&R-style prefix, as in ((t_atom)x)->a_type, where the "a_" prefix have a K&R-style prefix, as in `((t_atom)x)->a_type`, where the `a_` prefix
indicates "atom." This is intended to enhance readability (although the indicates "atom." This is intended to enhance readability (although the
convention arose from a limitation of early C compilers.) Common prefixes are convention arose from a limitation of early C compilers.) Common prefixes are:
"w_" (word), "a_" (atom), "s_" (symbol), "ob_" (object), "te_" (text object), * `w_` (word)
"g_" (graphical object), and "gl_" (glist, a list of graphical objects). Also, * `a_` (atom)
global symbols sometimes get prefixes, as in "s_float" (the symbol whose string * `s_` (symbol)
is "float). Typedefs are prefixed by "t_". Most _private_ structures, i.e., * `ob_` (object)
structures whose definitions appear in a ".c" file, are prefixed by "x_". * `te_` (text object)
* `g_` (graphical object)
* `gl_` (glist, a list of graphical objects).
Also, global symbols sometimes get prefixes, as in `s_float` (the symbol whose
string is "float"). Typedefs are prefixed by `t_`. Most _private_ structures,
i.e., structures whose definitions appear in a ".c" file, are prefixed by `x_`.
1.2. Function arguments. Many functions take as their first 1.2. Function arguments. Many functions take as their first
argument a pointer named "x", which is a pointer to a structure suggested argument a pointer named `x`, which is a pointer to a structure suggested
by the function prefix; e.g., canvas_dirty(x, n) where "x" points to a canvas by the function prefix; e.g., `canvas_dirty(x, n)` where `x` points to a canvas
(t_canvas *x). `(t_canvas *x)`.
1.3. Function Prototypes. Functions which are used in at least two different 1.3. Function Prototypes. Functions which are used in at least two different
files (besides where they originate) are prototyped in the appropriate include files (besides where they originate) are prototyped in the appropriate include
...@@ -229,6 +545,7 @@ char * or void * instead. ...@@ -229,6 +545,7 @@ char * or void * instead.
3.2. Pd passes true single-precision floating-point arguments to methods; 3.2. Pd passes true single-precision floating-point arguments to methods;
Max uses double. Max uses double.
Typedefs are provided: Typedefs are provided:
t_floatarg, t_intarg for arguments passed by the message system t_floatarg, t_intarg for arguments passed by the message system
t_float, t_int for the "word" union (in atoms, for example.) t_float, t_int for the "word" union (in atoms, for example.)
...@@ -250,8 +567,9 @@ to. The exceptions are: ...@@ -250,8 +567,9 @@ to. The exceptions are:
post, error, bug (s_print.c) post, error, bug (s_print.c)
which are all frequently called and which don't fit into simple categories. which are all frequently called and which don't fit into simple categories.
Important packages are: Important packages are:
(pd-gui:) pdgui -- everything (pd-gui:) pdgui -- everything
(pd:) pd -- functions common to all "pd" objects (pd:) pd -- functions common to all "pd" objects
obj -- fuctions common to all "patchable" objects ala Max obj -- fuctions common to all "patchable" objects ala Max
sys -- "system" level functions sys -- "system" level functions
binbuf -- functions manipulating binbufs binbuf -- functions manipulating binbufs
...@@ -261,16 +579,25 @@ Important packages are: ...@@ -261,16 +579,25 @@ Important packages are:
#### 5. Source file prefixes #### 5. Source file prefixes
5.0. Source file prefixes. 5.0. Source file prefixes.
PD: PD:
s system interface
m message system s system interface
g graphics stuff m message system
d DSP objects g graphics stuff
x control objects d DSP objects
z other x control objects
z other
PD-GUI: PD-GUI:
t TK front end
gui GUI front end
#### 6. Javascript style
1. Brackets on the same line as declaration or expression: `if (a) {`.
2. Single line comments only: `//`.
3. Use double-quotes for strings.
4. Use underscores to separate words of function names and variables.
### GUI Messaging Specification ### GUI Messaging Specification
#### Public GUI interface #### Public GUI interface
...@@ -289,13 +616,13 @@ The public interface consists of the following: ...@@ -289,13 +616,13 @@ The public interface consists of the following:
gui_vmess(const char *msg, const char *format, ...); gui_vmess(const char *msg, const char *format, ...);
``` ```
where const char *format consists of zero or more of the following: where `const char *format` consists of zero or more of the following:
* f - floating point value (t_float) * f - floating point value (`t_float`)
* i - integer (int) * i - integer (`int`)
* s - c string (char*) * s - c string (`char* )
* x - hexadecimal integer value, with a precision of at least six digits. * x - hexadecimal integer value, with a precision of at least six digits.
(hex value is preceded by an 'x', like "x123456") (hex value is preceded by an 'x', like `x123456`)
For some of Pd's internals like array visualization, the message length may For some of Pd's internals like array visualization, the message length may
vary. For these _special_ cases, the following functions allow the developer vary. For these _special_ cases, the following functions allow the developer
...@@ -336,4 +663,4 @@ primitives (numbers, strings, and arrays). For the arrays, Javascript's array ...@@ -336,4 +663,4 @@ primitives (numbers, strings, and arrays). For the arrays, Javascript's array
notation is used. This is a highly idiosyncratic, quick-and-dirty approach. notation is used. This is a highly idiosyncratic, quick-and-dirty approach.
But the point is that the idiosyncracy exists in a single file of the source But the point is that the idiosyncracy exists in a single file of the source
code, and can be easily made more modular (or replaced entirely by something code, and can be easily made more modular (or replaced entirely by something
else) without affecting _any_ of the rest of the C code. else) without affecting _any_ of the rest of the C code.
\ No newline at end of file
abstractions/Makefile
View file @ 7dc4f29c
...@@ -76,15 +76,13 @@ ds-abs_install: ...@@ -76,15 +76,13 @@ ds-abs_install:
#------------------------------------------------------------------------------# #------------------------------------------------------------------------------#
# JMMMP # JMMMP
jmmmp: JMMMP_NAME = jmmmp
make -C $(abstractions_src)/jmmmp
jmmmp_install: jmmmp_install:
make -C $(abstractions_src)/jmmmp DESTDIR="$(DESTDIR)" objectsdir="$(objectsdir)" install install -d $(DESTDIR)$(objectsdir)/$(JMMMP_NAME)
install -d $(DESTDIR)$(objectsdir)/$(JMMMP_NAME)/examples
jmmmp_clean: install -p $(abstractions_src)/$(JMMMP_NAME)/*.* $(DESTDIR)$(objectsdir)/$(JMMMP_NAME)
make -C $(abstractions_src)/jmmmp clean install -p $(abstractions_src)/$(JMMMP_NAME)/examples/*.* \
$(DESTDIR)$(objectsdir)/$(JMMMP_NAME)/examples
#------------------------------------------------------------------------------# #------------------------------------------------------------------------------#
# LIST-ABS # LIST-ABS
...@@ -128,9 +126,6 @@ memento_install: ...@@ -128,9 +126,6 @@ memento_install:
--author "Frank Barknecht" \ --author "Frank Barknecht" \
--license "GNU GPL" \ --license "GNU GPL" \
--description "a collection of objects for managing state saving" --description "a collection of objects for managing state saving"
install -d $(DESTDIR)$(manualsdir)/$(MEMENTO_NAME)
install -p $(abstractions_src)/rradical/memento/tutorial/*.* \
$(DESTDIR)$(manualsdir)/$(MEMENTO_NAME)
install -d $(DESTDIR)$(objectsdir)/$(MEMENTO_NAME)/manual install -d $(DESTDIR)$(objectsdir)/$(MEMENTO_NAME)/manual
install -p $(abstractions_src)/rradical/memento/tutorial/*.* \ install -p $(abstractions_src)/rradical/memento/tutorial/*.* \
$(DESTDIR)$(objectsdir)/$(MEMENTO_NAME)/manual $(DESTDIR)$(objectsdir)/$(MEMENTO_NAME)/manual
...@@ -238,11 +233,6 @@ pixeltango_install: ...@@ -238,11 +233,6 @@ pixeltango_install:
install -d $(DESTDIR)$(examplesdir)/$(PIXELTANGO_NAME) install -d $(DESTDIR)$(examplesdir)/$(PIXELTANGO_NAME)
install -p $(abstractions_src)/pixelTANGO/Example-Patches/*.* \ install -p $(abstractions_src)/pixelTANGO/Example-Patches/*.* \
$(DESTDIR)$(examplesdir)/$(PIXELTANGO_NAME) $(DESTDIR)$(examplesdir)/$(PIXELTANGO_NAME)
install -d $(DESTDIR)$(manualsdir)/$(PIXELTANGO_NAME)
install -p $(abstractions_src)/pixelTANGO/*.txt \
$(DESTDIR)$(manualsdir)/$(PIXELTANGO_NAME)
install -p $(abstractions_src)/pixelTANGO/dev-notes/*.txt \
$(DESTDIR)$(manualsdir)/$(PIXELTANGO_NAME)
install -d $(DESTDIR)$(objectsdir)/$(PIXELTANGO_NAME)/manual install -d $(DESTDIR)$(objectsdir)/$(PIXELTANGO_NAME)/manual
install -p $(abstractions_src)/pixelTANGO/*.txt \ install -p $(abstractions_src)/pixelTANGO/*.txt \
$(DESTDIR)$(objectsdir)/$(PIXELTANGO_NAME)/manual $(DESTDIR)$(objectsdir)/$(PIXELTANGO_NAME)/manual
...@@ -354,10 +344,6 @@ timestretch_install: ...@@ -354,10 +344,6 @@ timestretch_install:
# install -d $(DESTDIR)$(manualsdir)/$(TIMESTRETCH_NAME) # install -d $(DESTDIR)$(manualsdir)/$(TIMESTRETCH_NAME)
# install -p $(abstractions_src)/timestretch/doc/*.txt \ # install -p $(abstractions_src)/timestretch/doc/*.txt \
# $(DESTDIR)$(manualsdir)/$(TIMESTRETCH_NAME) # $(DESTDIR)$(manualsdir)/$(TIMESTRETCH_NAME)
# install -d $(DESTDIR)$(readmesdir)
# install -p $(abstractions_src)/timestretch/README \
# $(DESTDIR)$(readmesdir)/$(TIMESTRETCH_NAME).txt
#------------------------------------------------------------------------------- #-------------------------------------------------------------------------------
...@@ -371,42 +357,15 @@ pd-wavelet_install: ...@@ -371,42 +357,15 @@ pd-wavelet_install:
$(DESTDIR)$(objectsdir)/$(PDWAVELET_NAME) $(DESTDIR)$(objectsdir)/$(PDWAVELET_NAME)
install -p $(abstractions_src)/pd-wavelet/main.pd \ install -p $(abstractions_src)/pd-wavelet/main.pd \
$(DESTDIR)$(objectsdir)/$(PDWAVELET_NAME) $(DESTDIR)$(objectsdir)/$(PDWAVELET_NAME)
install -p $(abstractions_src)/pd-wavelet/README.txt \
$(DESTDIR)$(objectsdir)/$(PDWAVELET_NAME)
$(scripts_src)/generate-libdir-metafile.sh $(DESTDIR)$(objectsdir) $(PDWAVELET_NAME) \ $(scripts_src)/generate-libdir-metafile.sh $(DESTDIR)$(objectsdir) $(PDWAVELET_NAME) \
--author "Raul Diaz Poblete" \ --author "Raul Diaz Poblete" \
--description "manipulation of audio in the wavelet domain" \ --description "manipulation of audio in the wavelet domain" \
--license "GNU GPL v2" \ --license "GNU GPL v2" \
--version "" --version ""
install -d $(DESTDIR)$(readmesdir)
install -p $(abstractions_src)/pd-wavelet/README.txt \
$(DESTDIR)$(readmesdir)/$(PDWAVELET_NAME).txt
#==============================================================================#
#
# DEVELOPER'S TARGETS
#
#==============================================================================#
# make the symlinks necessary to simulate the installed environment
devsymlinks:
# make symlinks for help patches
test -e $(abstractions_src)/../2.control.examples || \
ln -s $(pd_src)/doc/2.control.examples \
$(abstractions_src)/../2.control.examples
test -e $(abstractions_src)/../3.audio.examples || \
ln -s $(pd_src)/doc/3.audio.examples \
$(abstractions_src)/../3.audio.examples
# pd <= 0.38-4 has 4.fft.examples
test -e $(abstractions_src)/../4.fft.examples || \
ln -s $(pd_src)/doc/4.fft.examples $(abstractions_src)/../4.fft.examples
# pd > 0.38-4 has 4.data.structures
test -e $(abstractions_src)/../4.data.structures || \
ln -s $(pd_src)/doc/4.data.structures \
$(abstractions_src)/../4.data.structures
test -e $(abstractions_src)/../7.stuff || \
ln -s $(pd_src)/doc/7.stuff $(abstractions_src)/../7.stuff
test -e $(abstractions_src)/../sound || \
ln -s $(pd_src)/doc/sound $(abstractions_src)/../sound
#==============================================================================# #==============================================================================#
# #
......
abstractions/footils/list-abs/Makefile
View file @ 7dc4f29c
...@@ -41,6 +41,10 @@ LIBS = ...@@ -41,6 +41,10 @@ LIBS =
# #
#------------------------------------------------------------------------------# #------------------------------------------------------------------------------#
ifeq ($(macos_target),)
macos_target = 10.9
endif
# get library version from meta file # get library version from meta file
LIBRARY_VERSION = $(shell sed -n 's|^\#X text [0-9][0-9]* [0-9][0-9]* VERSION \(.*\);|\1|p' $(LIBRARY_NAME)-meta.pd) LIBRARY_VERSION = $(shell sed -n 's|^\#X text [0-9][0-9]* [0-9][0-9]* VERSION \(.*\);|\1|p' $(LIBRARY_NAME)-meta.pd)
...@@ -92,13 +96,13 @@ ifeq ($(UNAME),Darwin) ...@@ -92,13 +96,13 @@ ifeq ($(UNAME),Darwin)
OPT_CFLAGS = -ftree-vectorize -ftree-vectorizer-verbose=2 -fast OPT_CFLAGS = -ftree-vectorize -ftree-vectorizer-verbose=2 -fast
# build universal 32-bit on 10.4 and 32/64 on newer # build universal 32-bit on 10.4 and 32/64 on newer
ifeq ($(shell uname -r | sed 's|\([0-9][0-9]*\)\.[0-9][0-9]*\.[0-9][0-9]*|\1|'), 8) ifeq ($(shell uname -r | sed 's|\([0-9][0-9]*\)\.[0-9][0-9]*\.[0-9][0-9]*|\1|'), 8)
FAT_FLAGS = -arch ppc -arch i386 -mmacosx-version-min=10.4 FAT_FLAGS = -arch ppc -arch i386 -mmacosx-version-min=$(macos_target)
else else
FAT_FLAGS = -arch ppc -arch i386 -arch x86_64 -mmacosx-version-min=10.4 FAT_FLAGS = -arch ppc -arch i386 -arch x86_64 -mmacosx-version-min=$(macos_target)
SOURCES += $(SOURCES_iphoneos) SOURCES += $(SOURCES_iphoneos)
endif endif
CFLAGS += $(FAT_FLAGS) -fPIC -I/sw/include CFLAGS += $(FAT_FLAGS) -fPIC
LDFLAGS += $(FAT_FLAGS) -bundle -undefined dynamic_lookup -L/sw/lib LDFLAGS += $(FAT_FLAGS) -bundle -undefined dynamic_lookup
# if the 'pd' binary exists, check the linking against it to aid with stripping # if the 'pd' binary exists, check the linking against it to aid with stripping
LDFLAGS += $(shell test -e $(PD_PATH)/bin/pd && echo -bundle_loader $(PD_PATH)/bin/pd) LDFLAGS += $(shell test -e $(PD_PATH)/bin/pd && echo -bundle_loader $(PD_PATH)/bin/pd)
LIBS += -lc LIBS += -lc
......
abstractions/jmmmp/Makefile deleted 100644 → 0
View file @ 7ec27720
## Pd library template version 1.0.6
# For instructions on how to use this template, see:
# http://puredata.info/docs/developer/MakefileTemplate
LIBRARY_NAME = jmmmp
# add your .c source files, one object per file, to the SOURCES
# variable, help files will be included automatically
SOURCES =
# list all pd objects (i.e. myobject.pd) files here, and their helpfiles will
# be included automatically
PDOBJECTS = appent.pd ardourjack-gui.pd array+.pd array-edit.pd but.pd clock.pd dacm~.pd datei-o.pd datei-r.pd datei-w.pd dsp01.pd f+.pd lbang.pd liner+~.pd liner~.pd m-i.pd maat~.pd mat~.pd metrum.pd met~.pd mk.pd oscD.pd oscS.pd pd-colors.pd prepent.pd rec-name.pd sguigot.pd sliders.pd snaps~.pd spectrogram~.pd stoppuhr.pd tastin.pd uhr.pd
# example patches and related files, in the 'examples' subfolder
EXAMPLES = ardour_icon_48px.gif computer_keyboard.png computer_keyboard_active.png crossfade-in-S1.png crossfade-in-S2.png crossfade-in-constant-power.png crossfade-in-fast-cut.png crossfade-in-linear.png crossfade-in-long-cut.png crossfade-in-short-cut.png crossfade-in-slow-cut.png crossfade-out-S1.png crossfade-out-S2.png crossfade-out-constant-power.png crossfade-out-fast-cut.png crossfade-out-linear.png crossfade-out-long-cut.png crossfade-out-short-cut.png crossfade-out-slow-cut.png fader_belt.png fader_belt_h.png hide.png nudge_left.png nudge_right.png record_normal_red.gif record_tape_red.png strip_width.png transport_end.gif transport_loop.gif transport_play.gif transport_range.gif transport_record.gif transport_start.gif transport_stop.gif zoom_full.png zoom_in.png zoom_out.png
# manuals and related files, in the 'manual' subfolder
MANUAL =
# if you want to include any other files in the source and binary tarballs,
# list them here. This can be anything from header files, test patches,
# documentation, etc. README.txt and LICENSE.txt are required and therefore
# automatically included
EXTRA_DIST =
#------------------------------------------------------------------------------#
#
# things you might need to edit if you are using other C libraries
#
#------------------------------------------------------------------------------#
# -I"$(PD_INCLUDE)/pd" supports the header location for 0.43
CFLAGS = -I"$(PD_INCLUDE)/pd" -Wall -W -g
LDFLAGS =
LIBS =
#------------------------------------------------------------------------------#
#
# you shouldn't need to edit anything below here, if we did it right :)
#
#------------------------------------------------------------------------------#
# get library version from meta file
LIBRARY_VERSION = $(shell sed -n 's|^\#X text [0-9][0-9]* [0-9][0-9]* VERSION \(.*\);|\1|p' $(LIBRARY_NAME)-meta.pd)
CFLAGS += -DPD -DVERSION='"$(LIBRARY_VERSION)"'
PD_INCLUDE = $(PD_PATH)/include
# where to install the library, overridden below depending on platform
prefix = /usr/local
libdir = $(prefix)/lib
pkglibdir = $(libdir)/pd-externals
objectsdir = $(pkglibdir)
INSTALL = install
INSTALL_PROGRAM = $(INSTALL) -p -m 644
INSTALL_DATA = $(INSTALL) -p -m 644
INSTALL_DIR = $(INSTALL) -p -m 755 -d
ALLSOURCES := $(SOURCES) $(SOURCES_android) $(SOURCES_cygwin) $(SOURCES_macosx) \
$(SOURCES_iphoneos) $(SOURCES_linux) $(SOURCES_windows)
DISTDIR=$(LIBRARY_NAME)-$(LIBRARY_VERSION)
ORIGDIR=pd-$(LIBRARY_NAME:~=)_$(LIBRARY_VERSION)
UNAME := $(shell uname -s)
ifeq ($(UNAME),Darwin)
CPU := $(shell uname -p)
ifeq ($(CPU),arm) # iPhone/iPod Touch
SOURCES += $(SOURCES_iphoneos)
EXTENSION = pd_darwin
OS = iphoneos
PD_PATH = /Applications/Pd-extended.app/Contents/Resources
IPHONE_BASE=/Developer/Platforms/iPhoneOS.platform/Developer/usr/bin
CC=$(IPHONE_BASE)/gcc
CPP=$(IPHONE_BASE)/cpp
CXX=$(IPHONE_BASE)/g++
ISYSROOT = -isysroot /Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS3.0.sdk
IPHONE_CFLAGS = -miphoneos-version-min=3.0 $(ISYSROOT) -arch armv6
OPT_CFLAGS = -fast -funroll-loops -fomit-frame-pointer
CFLAGS := $(IPHONE_CFLAGS) $(OPT_CFLAGS) $(CFLAGS)
LDFLAGS += -arch armv6 -bundle -undefined dynamic_lookup $(ISYSROOT)
LIBS += -lc
STRIP = strip -x
DISTBINDIR=$(DISTDIR)-$(OS)
else # Mac OS X
SOURCES += $(SOURCES_macosx)
EXTENSION = pd_darwin
OS = macosx
PD_PATH = /Applications/Pd-extended.app/Contents/Resources
OPT_CFLAGS = -ftree-vectorize -ftree-vectorizer-verbose=2 -fast
# build universal 32-bit on 10.4 and 32/64 on newer
ifeq ($(shell uname -r | sed 's|\([0-9][0-9]*\)\.[0-9][0-9]*\.[0-9][0-9]*|\1|'), 8)
FAT_FLAGS = -arch ppc -arch i386 -mmacosx-version-min=10.4
else
FAT_FLAGS = -arch ppc -arch i386 -arch x86_64 -mmacosx-version-min=10.4
SOURCES += $(SOURCES_iphoneos)
endif
CFLAGS += $(FAT_FLAGS) -fPIC -I/sw/include
LDFLAGS += $(FAT_FLAGS) -bundle -undefined dynamic_lookup -L/sw/lib
# if the 'pd' binary exists, check the linking against it to aid with stripping
LDFLAGS += $(shell test -e $(PD_PATH)/bin/pd && echo -bundle_loader $(PD_PATH)/bin/pd)
LIBS += -lc
STRIP = strip -x
DISTBINDIR=$(DISTDIR)-$(OS)
# install into ~/Library/Pd on Mac OS X since /usr/local isn't used much
pkglibdir=$(HOME)/Library/Pd
endif
endif
ifeq ($(UNAME),Linux)
CPU := $(shell uname -m)
SOURCES += $(SOURCES_linux)
EXTENSION = pd_linux
OS = linux
PD_PATH = /usr
OPT_CFLAGS = -O6 -funroll-loops -fomit-frame-pointer
CFLAGS += -fPIC
LDFLAGS += -Wl,--export-dynamic -shared -fPIC
LIBS += -lc
STRIP = strip --strip-unneeded -R .note -R .comment
DISTBINDIR=$(DISTDIR)-$(OS)-$(shell uname -m)
endif
ifeq ($(UNAME),GNU)
# GNU/Hurd, should work like GNU/Linux for basically all externals
CPU := $(shell uname -m)
SOURCES += $(SOURCES_linux)
EXTENSION = pd_linux
OS = linux
PD_PATH = /usr
OPT_CFLAGS = -O6 -funroll-loops -fomit-frame-pointer
CFLAGS += -fPIC
LDFLAGS += -Wl,--export-dynamic -shared -fPIC
LIBS += -lc
STRIP = strip --strip-unneeded -R .note -R .comment
DISTBINDIR=$(DISTDIR)-$(OS)-$(shell uname -m)
endif
ifeq ($(UNAME),GNU/kFreeBSD)
# Debian GNU/kFreeBSD, should work like GNU/Linux for basically all externals
CPU := $(shell uname -m)
SOURCES += $(SOURCES_linux)
EXTENSION = pd_linux
OS = linux
PD_PATH = /usr
OPT_CFLAGS = -O6 -funroll-loops -fomit-frame-pointer
CFLAGS += -fPIC
LDFLAGS += -Wl,--export-dynamic -shared -fPIC
LIBS += -lc
STRIP = strip --strip-unneeded -R .note -R .comment
DISTBINDIR=$(DISTDIR)-$(OS)-$(shell uname -m)
endif
ifeq (CYGWIN,$(findstring CYGWIN,$(UNAME)))
CPU := $(shell uname -m)
SOURCES += $(SOURCES_cygwin)
EXTENSION = dll
OS = cygwin
PD_PATH = $(cygpath $(PROGRAMFILES))/pd
OPT_CFLAGS = -O6 -funroll-loops -fomit-frame-pointer
CFLAGS +=
LDFLAGS += -Wl,--export-dynamic -shared -L"$(PD_PATH)/src" -L"$(PD_PATH)/bin"
LIBS += -lc -lpd
STRIP = strip --strip-unneeded -R .note -R .comment
DISTBINDIR=$(DISTDIR)-$(OS)
endif
ifeq (MINGW,$(findstring MINGW,$(UNAME)))
CPU := $(shell uname -m)
SOURCES += $(SOURCES_windows)
EXTENSION = dll
OS = windows
PD_PATH = $(shell cd "$(PROGRAMFILES)"/pd && pwd)
OPT_CFLAGS = -O3 -funroll-loops -fomit-frame-pointer
CFLAGS += -mms-bitfields
LDFLAGS += -s -shared -Wl,--enable-auto-import
LIBS += -L"$(PD_PATH)/src" -L"$(PD_PATH)/bin" -L"$(PD_PATH)/obj" -lpd -lwsock32 -lkernel32 -luser32 -lgdi32
STRIP = strip --strip-unneeded -R .note -R .comment
DISTBINDIR=$(DISTDIR)-$(OS)
endif
# in case somebody manually set the HELPPATCHES above
HELPPATCHES ?= $(SOURCES:.c=-help.pd) $(PDOBJECTS:.pd=-help.pd)
CFLAGS += $(OPT_CFLAGS)
.PHONY = install libdir_install single_install install-doc install-exec install-examples install-manual clean dist etags $(LIBRARY_NAME)
all: $(SOURCES:.c=.$(EXTENSION))
%.o: %.c
$(CC) $(CFLAGS) -o "$*.o" -c "$*.c"
%.$(EXTENSION): %.o
$(CC) $(LDFLAGS) -o "$*.$(EXTENSION)" "$*.o" $(LIBS)
chmod a-x "$*.$(EXTENSION)"
# this links everything into a single binary file
$(LIBRARY_NAME): $(SOURCES:.c=.o) $(LIBRARY_NAME).o
$(CC) $(LDFLAGS) -o $(LIBRARY_NAME).$(EXTENSION) $(SOURCES:.c=.o) $(LIBRARY_NAME).o $(LIBS)
chmod a-x $(LIBRARY_NAME).$(EXTENSION)
install: libdir_install
# The meta and help files are explicitly installed to make sure they are
# actually there. Those files are not optional, then need to be there.
libdir_install: $(SOURCES:.c=.$(EXTENSION)) install-doc install-examples install-manual
$(INSTALL_DIR) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
$(INSTALL_DATA) $(LIBRARY_NAME)-meta.pd \
$(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
test -z "$(strip $(SOURCES))" || (\
$(INSTALL_PROGRAM) $(SOURCES:.c=.$(EXTENSION)) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME) && \
$(STRIP) $(addprefix $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/,$(SOURCES:.c=.$(EXTENSION))))
test -z "$(strip $(PDOBJECTS))" || \
$(INSTALL_DATA) $(PDOBJECTS) \
$(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
# install library linked as single binary
single_install: $(LIBRARY_NAME) install-doc install-exec
$(INSTALL_DIR) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
$(INSTALL_PROGRAM) $(LIBRARY_NAME).$(EXTENSION) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
$(STRIP) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/$(LIBRARY_NAME).$(EXTENSION)
install-doc:
$(INSTALL_DIR) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
test -z "$(strip $(SOURCES) $(PDOBJECTS))" || \
$(INSTALL_DATA) $(HELPPATCHES) \
$(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)
$(INSTALL_DATA) README.txt $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/README.txt
$(INSTALL_DATA) LICENSE.txt $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/LICENSE.txt
install-examples:
test -z "$(strip $(EXAMPLES))" || \
$(INSTALL_DIR) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/examples && \
for file in $(EXAMPLES); do \
$(INSTALL_DATA) examples/$$file $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/examples; \
done
install-manual:
test -z "$(strip $(MANUAL))" || \
$(INSTALL_DIR) $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/manual && \
for file in $(MANUAL); do \
$(INSTALL_DATA) manual/$$file $(DESTDIR)$(objectsdir)/$(LIBRARY_NAME)/manual; \
done
clean:
-rm -f -- $(SOURCES:.c=.o) $(SOURCES_LIB:.c=.o)
-rm -f -- $(SOURCES:.c=.$(EXTENSION))
-rm -f -- $(LIBRARY_NAME).o
-rm -f -- $(LIBRARY_NAME).$(EXTENSION)
distclean: clean
-rm -f -- $(DISTBINDIR).tar.gz
-rm -rf -- $(DISTBINDIR)
-rm -f -- $(DISTDIR).tar.gz
-rm -rf -- $(DISTDIR)
-rm -f -- $(ORIGDIR).tar.gz
-rm -rf -- $(ORIGDIR)
$(DISTBINDIR):
$(INSTALL_DIR) $(DISTBINDIR)
libdir: all $(DISTBINDIR)
$(INSTALL_DATA) $(LIBRARY_NAME)-meta.pd $(DISTBINDIR)
$(INSTALL_DATA) $(SOURCES) $(DISTBINDIR)
$(INSTALL_DATA) $(HELPPATCHES) $(DISTBINDIR)
test -z "$(strip $(EXTRA_DIST))" || \
$(INSTALL_DATA) $(EXTRA_DIST) $(DISTBINDIR)
# tar --exclude-vcs -czpf $(DISTBINDIR).tar.gz $(DISTBINDIR)
$(DISTDIR):
$(INSTALL_DIR) $(DISTDIR)
$(ORIGDIR):
$(INSTALL_DIR) $(ORIGDIR)
dist: $(DISTDIR)
$(INSTALL_DATA) Makefile $(DISTDIR)
$(INSTALL_DATA) README.txt $(DISTDIR)
$(INSTALL_DATA) LICENSE.txt $(DISTDIR)
$(INSTALL_DATA) $(LIBRARY_NAME)-meta.pd $(DISTDIR)
test -z "$(strip $(ALLSOURCES))" || \
$(INSTALL_DATA) $(ALLSOURCES) $(DISTDIR)
test -z "$(strip $(PDOBJECTS))" || \
$(INSTALL_DATA) $(PDOBJECTS) $(DISTDIR)
test -z "$(strip $(HELPPATCHES))" || \
$(INSTALL_DATA) $(HELPPATCHES) $(DISTDIR)
test -z "$(strip $(EXTRA_DIST))" || \
$(INSTALL_DATA) $(EXTRA_DIST) $(DISTDIR)
test -z "$(strip $(EXAMPLES))" || \
$(INSTALL_DIR) $(DISTDIR)/examples && \
for file in $(EXAMPLES); do \
$(INSTALL_DATA) examples/$$file $(DISTDIR)/examples; \
done
test -z "$(strip $(MANUAL))" || \
$(INSTALL_DIR) $(DISTDIR)/manual && \
for file in $(MANUAL); do \
$(INSTALL_DATA) manual/$$file $(DISTDIR)/manual; \
done
tar --exclude-vcs -czpf $(DISTDIR).tar.gz $(DISTDIR)
# make a Debian source package
dpkg-source:
debclean
make distclean dist
mv $(DISTDIR) $(ORIGDIR)
tar --exclude-vcs -czpf ../$(ORIGDIR).orig.tar.gz $(ORIGDIR)
rm -f -- $(DISTDIR).tar.gz
rm -rf -- $(DISTDIR) $(ORIGDIR)
cd .. && dpkg-source -b $(LIBRARY_NAME)
etags:
etags *.h $(SOURCES) ../../pd/src/*.[ch] /usr/include/*.h /usr/include/*/*.h
showsetup:
@echo "CFLAGS: $(CFLAGS)"
@echo "LDFLAGS: $(LDFLAGS)"
@echo "LIBS: $(LIBS)"
@echo "PD_INCLUDE: $(PD_INCLUDE)"
@echo "PD_PATH: $(PD_PATH)"
@echo "objectsdir: $(objectsdir)"
@echo "LIBRARY_NAME: $(LIBRARY_NAME)"
@echo "LIBRARY_VERSION: $(LIBRARY_VERSION)"
@echo "SOURCES: $(SOURCES)"
@echo "PDOBJECTS: $(PDOBJECTS)"
@echo "ALLSOURCES: $(ALLSOURCES)"
@echo "UNAME: $(UNAME)"
@echo "CPU: $(CPU)"
@echo "pkglibdir: $(pkglibdir)"
@echo "DISTDIR: $(DISTDIR)"
@echo "ORIGDIR: $(ORIGDIR)"
abstractions/jmmmp/README.txt
View file @ 7dc4f29c
Abstractions from Joo Pais Abstractions from Joo Pais
(c) 2005-9 João Pais - jmmmpais@googlemail.com Version 0.47
(c) 2005-2016 Joo Pais - jmmmpais@gmail.com
Released under the BSD license (more information in each abstraction). Released under the BSD license (more information in each abstraction).
This package has several base utilities that make coding a bit easier. It is composed of the following abstractions: This package has several utilities with different functions. It is composed of abstractions only.
array-edit - edit properties of arrays and populate them following several formulas ardourjack-gui - Controls ardour transport and jack settings from Pd
array-edit - Edit properties of arrays and populate them following several formulas
bezier - Transfer function GUI with one cubic bzier curve
bezier~ - Transfer function GUI with one cubic bzier curve at audio rate
but - Monochrome bang button but - Monochrome bang button
butt - Color-changing Toggle Button
clock - Chronometer with display in seconds clock - Chronometer with display in seconds
dacc~ - dynamic dac~ outlet up to 32 channels
dacm~ - Mono dac~ for lazy people dacm~ - Mono dac~ for lazy people
datei-o - Sends the message "open ../../" datei-o - Sends the message "open ../../"
datei-r - Sends the message "read ../../" datei-r - Sends the message "read ../../"
datei-w - Sends the message "write ../../" datei-w - Sends the message "write ../../"
ds-color-sel - color selector for data structures
dsp01 - DSP switch dsp01 - DSP switch
f+ - Counter with variable increment f+ - Counter with variable increment
gui-edit - edit standard GUI objects fast gui-edit - edit standard GUI objects fast
jp.menu - Dropdown menu programmed with data structures
jp.preset - Dropdown preset saver programmed with data structures
lbang - loadbang which can be triggered more often lbang - loadbang which can be triggered more often
liner~ - practical implementation of [line~] liner~ - practical implementation of [line~]
liner+~ - practical implementation of signal envelopping liner+~ - practical implementation of signal envelopping
mat~ - Level meter with amplitude control mat~ - Level meter with amplitude control
mat-~ - Level meter with amplitude control, horizontal
maat~ - Level meter with amplitude control, stereo maat~ - Level meter with amplitude control, stereo
matrixctrl - GUI for [iemmatrix/mtx_mul~]
met~ - Level meter with amplitude control (with VU, too CPU expensive for me) met~ - Level meter with amplitude control (with VU, too CPU expensive for me)
metrum - Metro with GUI metrum - Metro with GUI
m-i - Automatic conversion of MIDI controller m-i - Automatic conversion of MIDI controller
mk - shows the controller number and MIDI value mk - Visual display of MIDI inputs
oscD - Counts received OSC messages oscD - Counts received OSC messages
oscS - Interface for sendOSC oscS - Interface for sendOSC
pd-colors - Pd color palettes (Data Structures + Tcl/Tk) pd-colors - Pd color palettes (Data Structures + Tcl/Tk)
pix2canvas - Convert images into canvas
rec-name - Automatic naming for a record/playback engine rec-name - Automatic naming for a record/playback engine
rgb-color - Pick RGB colors for your GUI objects
sguigot - spigot GUI implementation sguigot - spigot GUI implementation
sliders - GUI for incoming midi data sliders - GUI for incoming midi data
snaps~ - snapshot~ GUI implementation snaps~ - snapshot~ GUI implementation
spectrogram~ - Spectrogram with 512 bins resolution spectrogram~ - Spectrogram with 512 bins resolution
stoppuhr - Chronometer with two layers stoppuhr - Chronometer with two layers
swatch - Pick a color using the hue-saturation chart
swatch-gui - Pick a color for your GUI using the hue-saturation chart
tastin - Gate for keyboard input tastin - Gate for keyboard input
uhr - Shows the time uhr - Shows the time
It is recomended to use these abstractions with Pd-extended, since I don't keep track of which externals are used. Some abstractions use other ones of this package, so it is also better to have always the whole package in one place. The jmmmp library is dependent from the following libraries: cyclone, ext13, ggee, iemlib, iemmatrix, jmmmp, zexy 2.2.6.
2009.02.20 2016.06.30
Non-working or discarded abstractions: Non-working or discarded abstractions:
......
abstractions/jmmmp/appent-help.pd
View file @ 7dc4f29c
#N canvas 329 129 450 300 10;
#X obj 189 121 appent;
#X text 73 61 [list append]--[list trim] shortcut;
abstractions/jmmmp/ardourjack-gui-help.pd
View file @ 7dc4f29c
#N canvas 436 287 450 300 10;
#X obj 165 118 ardourjack-gui;
#N canvas 49 336 494 344 META 0;
#X text 12 55 AUTHOR Joo Pais <jmmmpais@googlemail.com>;
#X text 12 95 LICENSE BSD;
#X text 12 75 LIBRARY jmmmp;
#X text 12 5 DESCRIPTION Controls ardour transport and jack settings
from Pd;
#X text 12 35 KEYWORDS ardour jack transport;
#X text 12 135 VERSION 09.05.2013;
#X text 13 115 WEBSITE http://puredata.info/Members/jmmmp;
#X restore 392 276 pd META;
#X text 70 40 Controls ardour transport and jack settings from Pd;
abstractions/jmmmp/array+.pd deleted 100644 → 0
View file @ 7ec27720
#N struct 1094-graph float x float y float dist float resol float width
float stres array 1094-boxes 1094-box;
#N struct 1094-box float y float width;
#N canvas 330 25 920 794 10;
#N canvas 651 507 450 300 \$0-box 0;
#X obj 40 83 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1
;
#X obj 22 26 struct \$0-box float y float width;
#X obj 28 114 drawpolygon 0 2 0 0 width 0;
#X connect 0 0 2 0;
#X restore 753 114 pd \$0-box;
#N canvas 600 79 615 150 \$0-graph 0;
#X obj 19 21 struct \$0-graph float x float y float dist float resol
float width float stres array \$0-boxes \$0-box;
#X obj 30 100 plot -y y(0:4)(4:0)(1) \$0-boxes 0 0 0 0 dist;
#X restore 753 134 pd \$0-graph;
#X obj 20 203 pointer;
#X obj 107 454 setsize \$0-graph \$0-boxes;
#X obj 119 163 pointer;
#X obj 119 123 \$0;
#X obj 124 424 set \$0-graph dist;
#X obj 124 404 expr 10/$f1;
#X obj 133 534 element \$0-graph \$0-boxes;
#X msg 139 96 clear;
#X obj 20 183 append \$0-graph x;
#X obj 40 554 set \$0-box width;
#X obj 40 424 until;
#X obj 40 444 f+;
#X obj 40 404 t f b f;
#X obj 79 484 expr 10/$f1;
#X obj 40 504 f;
#X obj 40 464 t b f;
#X obj 20 163 0;
#X obj 98 46 t b b b b;
#X obj 464 144 element \$0-graph \$0-boxes;
#X obj 464 164 get \$0-box y;
#X msg 149 76 donecanvasdialog 1 -1 2 0 0 10 4 100 70 0 0;
#X obj 511 536 element \$0-graph \$0-boxes;
#X obj 442 466 until;
#X obj 442 486 f+;
#X obj 442 506 t b f;
#X obj 442 556 set \$0-box y;
#X obj 442 426 f;
#X obj 442 526 0;
#X obj 90 374 t f f f f;
#X obj 442 446 t f b;
#X obj 98 25 loadbang;
#X obj 611 124 r \$0-pointer-aux;
#X text 356 14 komisches workaround \, weil gop nicht richtig funktioniert
;
#X obj 175 28 bng 15 250 50 0 empty empty empty 17 7 0 10 -262144 -1
-1;
#X obj 51 334 \$2;
#N canvas 0 0 450 300 (subpatch) 0;
#X array array1 100 float 3;
#A 0 0.157144 0.17143 0.17143 0.17143 0.17143 0.17143 0.17143 0.17143
0.17143 0.17143 0.17143 0.17143 0.17143 0.185715 0.228573 0.242859
0.261907 0.280954 0.300002 0.328574 0.34286 0.361907 0.380955 0.400003
0.414289 0.44286 0.457146 0.471432 0.485718 0.500004 0.528575 0.542861
0.571433 0.585719 0.600004 0.61429 0.657148 0.671433 0.685719 0.685719
0.685719 0.700005 0.700005 0.700005 0.692862 0.685719 0.671433 0.66429
0.657148 0.628576 0.600004 0.571433 0.542861 0.521432 0.500004 0.485718
0.471432 0.44286 0.433336 0.423812 0.414289 0.407146 0.400003 0.39286
0.385717 0.378574 0.371431 0.364288 0.357145 0.353574 0.350002 0.346431
0.34286 0.34286 0.342859 0.338098 0.333336 0.328574 0.321431 0.314288
0.300002 0.300002 0.27143 0.228573 0.17143 0.157144 0.128572 0.100001
0.0857147 0.0428572 0.0285714 -0.0428577 -0.100001 0.0857148 0.0833339
0.0809529 0.0785719 0.076191 0.07381 0.071429;
#X coords 0 1 99 -1 200 140 1;
#X restore 707 269 graph;
#X msg 730 418 \; array1 0 1 1 1 1 -1 -1 -1;
#X obj 51 354 moses 1;
#N canvas 35 70 367 459 \$0-array 0;
#X scalar 1094-graph 0 0 0 0 0 1 \; 0 0 \; \;;
#X coords 0 0 10 4 100 70 1;
#X restore 753 30 pd \$0-array;
#X obj 149 116 s pd-\$0-array;
#X msg 120 143 traverse pd-\$1-array \, bang;
#X obj 20 223 s \$0-pointer-array;
#X obj 565 506 r \$0-pointer-array;
#X obj 187 504 r \$0-pointer-array;
#X obj 312 246 inlet;
#X text 449 124 [inlet];
#X floatatom 21 303 5 0 0 0 - - -;
#N canvas 55 71 450 300 list-populate 0;
#X obj 26 19 inlet;
#X obj 168 93 r \$0-reset-aux;
#X obj 158 73 r \$0-reset;
#X obj 201 251 element \$0-graph \$0-boxes;
#X obj 132 201 f+;
#X obj 132 271 set \$0-box y;
#X obj 158 118 f;
#X obj 158 138 t f b;
#X obj 255 221 r \$0-pointer-array;
#X obj 26 39 list split 1;
#X obj 26 99 drip;
#X obj 26 79 list;
#X obj 26 59 t b f;
#X obj 41 139 t b f;
#X connect 0 0 9 0;
#X connect 1 0 6 0;
#X connect 2 0 6 0;
#X connect 3 0 5 1;
#X connect 4 0 3 0;
#X connect 6 0 7 0;
#X connect 7 1 4 1;
#X connect 8 0 3 1;
#X connect 9 0 12 0;
#X connect 9 1 11 1;
#X connect 10 0 13 0;
#X connect 11 0 10 0;
#X connect 12 0 11 0;
#X connect 12 1 4 1;
#X connect 13 0 4 0;
#X connect 13 1 5 0;
#X restore 365 286 pd list-populate;
#X msg 372 246 10 -1 1 -1 0.5 -0.5 0.5 -0.2 0.2 -0.2 0.1 -0.1 0;
#X obj 78 96 t b b b;
#X obj 127 675 moses 1;
#X obj 262 695 r \$0-pointer-array;
#X obj 127 655 \$3;
#X text 610 632 \$1 - array name;
#X text 609 651 \$2 - array size;
#X text 608 669 \$3 - step resolution;
#X msg 127 695 1;
#X obj 157 715 set \$0-graph stres;
#X floatatom 84 646 5 0 0 0 - - -;
#X text 97 735 usar uma variavel para o step nao e possivel???;
#X obj 418 306 f;
#X obj 418 326 outlet;
#X obj 312 266 route resize list arraysize const;
#X obj 442 396 t b f;
#X text 482 396 const;
#X text 448 217 read / write / rename / bounds / labels / ticks / gop-size
;
#X connect 2 0 43 0;
#X connect 4 0 10 1;
#X connect 5 0 42 0;
#X connect 7 0 6 0;
#X connect 8 0 11 1;
#X connect 9 0 41 0;
#X connect 10 0 2 0;
#X connect 12 0 13 0;
#X connect 13 0 17 0;
#X connect 14 0 12 0;
#X connect 14 1 13 1;
#X connect 14 2 15 0;
#X connect 15 0 16 1;
#X connect 16 0 11 0;
#X connect 17 0 16 0;
#X connect 17 1 8 0;
#X connect 18 0 10 0;
#X connect 19 0 51 0;
#X connect 19 1 5 0;
#X connect 19 2 9 0;
#X connect 19 3 22 0;
#X connect 20 0 21 0;
#X connect 22 0 41 0;
#X connect 23 0 27 1;
#X connect 24 0 25 0;
#X connect 25 0 26 0;
#X connect 26 0 29 0;
#X connect 26 1 23 0;
#X connect 28 0 31 0;
#X connect 29 0 27 0;
#X connect 30 0 14 0;
#X connect 30 1 3 0;
#X connect 30 2 7 0;
#X connect 30 3 28 1;
#X connect 31 0 24 0;
#X connect 31 1 25 1;
#X connect 32 0 19 0;
#X connect 33 0 20 1;
#X connect 35 0 19 0;
#X connect 36 0 39 0;
#X connect 36 0 62 1;
#X connect 39 1 30 0;
#X connect 42 0 4 0;
#X connect 44 0 23 1;
#X connect 45 0 8 1;
#X connect 45 0 3 1;
#X connect 45 0 6 1;
#X connect 46 0 64 0;
#X connect 48 0 36 0;
#X connect 50 0 64 0;
#X connect 51 0 54 0;
#X connect 51 1 36 0;
#X connect 51 2 18 0;
#X connect 52 0 58 0;
#X connect 52 1 59 0;
#X connect 53 0 59 1;
#X connect 54 0 52 0;
#X connect 58 0 59 0;
#X connect 60 0 52 0;
#X connect 62 0 63 0;
#X connect 64 0 36 0;
#X connect 64 1 49 0;
#X connect 64 2 62 0;
#X connect 64 3 65 0;
#X connect 65 0 28 0;
#X connect 65 1 29 0;
abstractions/jmmmp/array-edit-help.pd
View file @ 7dc4f29c
#N canvas 345 87 450 300 10;
#X obj 175 132 array-edit;
#X text 73 84 edit properties of arrays and populate them following
several formulas;
abstractions/jmmmp/array-edit.pd
View file @ 7dc4f29c
#N canvas 68 28 402 755 10; #N canvas 68 0 414 704 10;
#N canvas 202 330 639 485 inside 0; #N canvas 202 330 639 485 inside 0;
#X msg 287 128 const \$1; #X msg 287 128 const \$1;
#X obj 15 159 r \$0-resize; #X obj 15 159 r \$0-resize;
#X msg 64 199 resize \$1; #X msg 64 199 resize \$1;
#X obj 15 68 arraysize; #X obj 15 68 arraysize;
#X obj 15 28 r \$0-arr; #X obj 15 28 r \$0-arr;
#X msg 15 48 set \$1 \, bang; #X msg 15 48 set \$1 \, bang;
#X msg 15 98 set \$1; #X msg 15 98 set \$1;
#X obj 89 97 s \$0-arrsize; #X obj 89 97 s \$0-arrsize;
#X obj 15 119 s \$0-resize-i; #X obj 15 119 s \$0-resize-i;
#X obj 287 108 r \$0-const; #X obj 287 108 r \$0-const;
#X text 21 9 Resize; #X text 21 9 Resize;
#X text 293 86 Constant; #X text 293 86 Constant;
#X obj 531 104 tabread; #X obj 531 104 tabread;
#X obj 541 64 r \$0-arr; #X obj 541 64 r \$0-arr;
#X msg 541 84 set \$1; #X msg 541 84 set \$1;
#X obj 531 34 r \$0-ind_i; #X obj 531 34 r \$0-ind_i;
#X obj 531 124 s \$0-ind_t-i; #X obj 531 124 s \$0-ind_t-i;
#X obj 531 214 s \$0-ind_i-i; #X obj 531 214 s \$0-ind_i-i;
#X msg 531 194 range 0 \$1; #X msg 531 194 range 0 \$1;
#X obj 531 154 r \$0-arrsize; #X obj 531 154 r \$0-arrsize;
#X obj 531 174 - 1; #X obj 531 174 - 1;
#X text 532 12 Index test; #X text 532 12 Index test;
#X msg 436 59 rename \$1; #X msg 436 59 rename \$1;
#X text 445 18 Rename; #X text 445 18 Rename;
#X obj 436 39 r \$0-rename; #X obj 436 39 r \$0-rename;
#X obj 446 179 s \$0-arr-i; #X obj 446 179 s \$0-arr-i;
#X msg 446 159 symbol \$1; #X msg 446 159 symbol \$1;
#X obj 287 38 r \$0-norml; #X obj 287 38 r \$0-norml;
#X text 293 16 Normalize; #X text 293 16 Normalize;
#X msg 287 58 normalize \$1; #X msg 287 58 normalize \$1;
#N canvas 335 713 293 221 x-ticks 0; #N canvas 335 713 293 221 x-ticks 0;
#X obj 103 16 r \$0-arrsize; #X obj 103 16 r \$0-arrsize;
#X obj 143 86 /; #X obj 143 86 /;
#X obj 143 56 t b f; #X obj 143 56 t b f;
#X obj 115 126 pack f f f; #X obj 115 126 pack f f f;
#X obj 172 106 expr 100/$f1; #X obj 172 106 expr 100/$f1;
#X obj 115 176 outlet; #X obj 115 176 outlet;
#X obj 143 36 r \$0-xtick-div; #X obj 143 36 r \$0-xtick-div;
#X obj 172 86 r \$0-xtick-prop; #X obj 172 86 r \$0-xtick-prop;
#X obj 35 86 r \$0-xtick-send; #X obj 35 86 r \$0-xtick-send;
#X msg 115 146 xticks \$1 \$2 \$3; #X msg 115 146 xticks \$1 \$2 \$3;
#X connect 0 0 1 0; #X connect 0 0 1 0;
#X connect 1 0 3 1; #X connect 1 0 3 1;
#X connect 2 0 1 0; #X connect 2 0 1 0;
#X connect 2 1 1 1; #X connect 2 1 1 1;
#X connect 3 0 9 0; #X connect 3 0 9 0;
#X connect 4 0 3 2; #X connect 4 0 3 2;
#X connect 6 0 2 0; #X connect 6 0 2 0;
#X connect 7 0 4 0; #X connect 7 0 4 0;
#X connect 8 0 3 0; #X connect 8 0 3 0;
#X connect 9 0 5 0; #X connect 9 0 5 0;
#X coords 0 0 1 1 201 75 0; #X coords 0 0 1 1 201 75 0;
#X restore 199 197 pd x-ticks; #X restore 199 197 pd x-ticks;
#X text 150 197 X-ticks; #X text 150 197 X-ticks;
#X text 150 217 X-label; #X text 150 217 X-label;
#N canvas 274 695 314 213 bounds 0; #N canvas 274 695 314 213 bounds 0;
#X msg 41 142 bounds \$1 \$2 \$3 \$4; #X msg 41 142 bounds \$1 \$2 \$3 \$4;
#X obj 41 122 pack f f f f; #X obj 41 122 pack f f f f;
#X obj 193 125 r \$0-arrsize; #X obj 193 125 r \$0-arrsize;
#X obj 34 62 f; #X obj 34 62 f;
#X obj 41 172 outlet; #X obj 41 172 outlet;
#X obj 49 42 r \$0-bound-x; #X obj 49 42 r \$0-bound-x;
#X obj 87 82 r \$0-bound-xx; #X obj 87 82 r \$0-bound-xx;
#X obj 193 165 s \$0-bound-xx-i; #X obj 193 165 s \$0-bound-xx-i;
#X obj 64 62 r \$0-bound-y; #X obj 64 62 r \$0-bound-y;
#X obj 110 102 r \$0-bound-yy; #X obj 110 102 r \$0-bound-yy;
#X obj 34 22 r \$0-bound-send; #X obj 34 22 r \$0-bound-send;
#X obj 193 145 - 1; #X obj 193 145 - 1;
#X connect 0 0 4 0; #X connect 0 0 4 0;
#X connect 1 0 0 0; #X connect 1 0 0 0;
#X connect 2 0 11 0; #X connect 2 0 11 0;
#X connect 3 0 1 0; #X connect 3 0 1 0;
#X connect 5 0 3 1; #X connect 5 0 3 1;
#X connect 6 0 1 2; #X connect 6 0 1 2;
#X connect 8 0 1 1; #X connect 8 0 1 1;
#X connect 9 0 1 3; #X connect 9 0 1 3;
#X connect 10 0 3 0; #X connect 10 0 3 0;
#X connect 11 0 7 0; #X connect 11 0 7 0;
#X coords 0 0 1 1 116 75 0; #X coords 0 0 1 1 116 75 0;
#X restore 199 137 pd bounds; #X restore 199 137 pd bounds;
#X text 153 137 Bounds; #X text 153 137 Bounds;
#N canvas 0 0 304 224 send 0; #N canvas 0 0 304 224 send 0;
#X obj 197 153 send13 foo; #X obj 197 153 send13 foo;
#X obj 207 103 r \$0-arr; #X obj 207 103 r \$0-arr;
#X msg 207 123 set \$1; #X msg 207 123 set \$1;
#X obj 177 63 inlet; #X obj 177 63 inlet;
#X obj 64 183 s \$0-command; #X obj 64 183 s \$0-command;
#X obj 64 133 drip; #X obj 64 133 drip;
#X msg 124 153 set; #X msg 124 153 set;
#X obj 64 103 t a b; #X obj 64 103 t a b;
#X msg 64 153 add2 \$1; #X msg 64 153 add2 \$1;
#X obj 124 123 loadbang; #X obj 124 123 loadbang;
#X connect 1 0 2 0; #X connect 1 0 2 0;
#X connect 2 0 0 0; #X connect 2 0 0 0;
#X connect 3 0 0 0; #X connect 3 0 0 0;
#X connect 3 0 7 0; #X connect 3 0 7 0;
#X connect 5 0 8 0; #X connect 5 0 8 0;
#X connect 6 0 4 0; #X connect 6 0 4 0;
#X connect 7 0 5 0; #X connect 7 0 5 0;
#X connect 7 1 6 0; #X connect 7 1 6 0;
#X connect 8 0 4 0; #X connect 8 0 4 0;
#X connect 9 0 6 0; #X connect 9 0 6 0;
#X restore 279 297 pd send; #X restore 279 297 pd send;
#N canvas 595 204 275 570 x-label 0; #N canvas 595 204 275 570 x-label 0;
#X obj 130 279 r \$0-arrsize; #X obj 130 279 r \$0-arrsize;
#X obj 96 499 prepent xlabel; #X obj 96 499 prepent xlabel;
#X obj 42 39 - 1.2; #X obj 42 39 - 1.2;
#X obj 96 479 prepent; #X obj 96 479 prepent;
#X obj 61 299 expr $f2/$f1; #X obj 61 299 expr $f2/$f1;
#X obj 56 399 serialize; #X obj 56 399 serialize;
#X obj 22 340 until; #X obj 22 340 until;
#X obj 73 369 +; #X obj 73 369 +;
#X obj 46 369 0; #X obj 46 369 0;
#X obj 61 329 t b f; #X obj 61 329 t b f;
#X obj 61 349 0; #X obj 61 349 0;
#X obj 42 249 t f f f; #X obj 42 249 t f f f;
#X obj 61 279 - 1; #X obj 61 279 - 1;
#X obj 42 109 moses 2; #X obj 42 109 moses 2;
#X obj 42 89 r \$0-xlabel-wv; #X obj 42 89 r \$0-xlabel-wv;
#X obj 42 59 s \$0-xlabel-dist-i; #X obj 42 59 s \$0-xlabel-dist-i;
#X obj 42 19 loadbang; #X obj 42 19 loadbang;
#X obj 96 529 outlet; #X obj 96 529 outlet;
#X obj 42 229 f; #X obj 42 229 f;
#X obj 108 459 t b f; #X obj 108 459 t b f;
#X obj 91 129 t b f; #X obj 91 129 t b f;
#X obj 116 197 spigot 0; #X obj 116 197 spigot 0;
#X obj 141 167 1; #X obj 141 167 1;
#X obj 171 147 r \$0-arr; #X obj 171 147 r \$0-arr;
#X msg 171 167 0; #X msg 171 167 0;
#X obj 108 439 r \$0-xlabel-dist; #X obj 108 439 r \$0-xlabel-dist;
#X connect 0 0 4 1; #X connect 0 0 4 1;
#X connect 1 0 17 0; #X connect 1 0 17 0;
#X connect 2 0 15 0; #X connect 2 0 15 0;
#X connect 3 0 1 0; #X connect 3 0 1 0;
#X connect 4 0 9 0; #X connect 4 0 9 0;
#X connect 5 0 3 0; #X connect 5 0 3 0;
#X connect 6 0 8 0; #X connect 6 0 8 0;
#X connect 7 0 8 1; #X connect 7 0 8 1;
#X connect 8 0 7 0; #X connect 8 0 7 0;
#X connect 8 0 5 0; #X connect 8 0 5 0;
#X connect 9 0 10 0; #X connect 9 0 10 0;
#X connect 9 1 7 1; #X connect 9 1 7 1;
#X connect 10 0 8 1; #X connect 10 0 8 1;
#X connect 11 0 6 0; #X connect 11 0 6 0;
#X connect 11 1 12 0; #X connect 11 1 12 0;
#X connect 11 2 5 1; #X connect 11 2 5 1;
#X connect 12 0 4 0; #X connect 12 0 4 0;
#X connect 13 1 20 0; #X connect 13 1 20 0;
#X connect 14 0 13 0; #X connect 14 0 13 0;
#X connect 16 0 2 0; #X connect 16 0 2 0;
#X connect 18 0 11 0; #X connect 18 0 11 0;
#X connect 19 0 21 0; #X connect 19 0 21 0;
#X connect 19 1 3 1; #X connect 19 1 3 1;
#X connect 20 0 22 0; #X connect 20 0 22 0;
#X connect 20 1 18 0; #X connect 20 1 18 0;
#X connect 21 0 18 0; #X connect 21 0 18 0;
#X connect 22 0 21 1; #X connect 22 0 21 1;
#X connect 23 0 24 0; #X connect 23 0 24 0;
#X connect 24 0 21 1; #X connect 24 0 21 1;
#X connect 25 0 19 0; #X connect 25 0 19 0;
#X coords 0 0 1 1 195 60 0; #X coords 0 0 1 1 195 60 0;
#X restore 199 217 pd x-label; #X restore 199 217 pd x-label;
#X text 150 177 Y-label; #X text 150 177 Y-label;
#X text 148 157 Y-ticks; #X text 148 157 Y-ticks;
#N canvas 906 167 297 695 y-label 0; #N canvas 906 167 297 695 y-label 0;
#X obj 106 609 prepent; #X obj 106 609 prepent;
#X obj 66 529 serialize; #X obj 66 529 serialize;
#X obj 32 430 until; #X obj 32 430 until;
#X obj 83 459 +; #X obj 83 459 +;
#X obj 56 459 0; #X obj 56 459 0;
#X obj 71 419 t b f; #X obj 71 419 t b f;
#X obj 71 439 0; #X obj 71 439 0;
#X obj 52 269 t f f f; #X obj 52 269 t f f f;
#X obj 71 369 - 1; #X obj 71 369 - 1;
#X obj 52 109 moses 2; #X obj 52 109 moses 2;
#X obj 52 19 loadbang; #X obj 52 19 loadbang;
#X obj 106 659 outlet; #X obj 106 659 outlet;
#X obj 52 59 s \$0-ylabel-dist-i; #X obj 52 59 s \$0-ylabel-dist-i;
#X obj 52 89 r \$0-ylabel-wv; #X obj 52 89 r \$0-ylabel-wv;
#X obj 118 569 r \$0-ylabel-dist; #X obj 118 569 r \$0-ylabel-dist;
#X obj 106 629 prepent ylabel; #X obj 106 629 prepent ylabel;
#X obj 52 39 - 6; #X obj 52 39 - 6;
#X obj 140 339 t b f; #X obj 140 339 t b f;
#X obj 140 369 -; #X obj 140 369 -;
#X obj 100 299 r \$0-bound-y; #X obj 100 299 r \$0-bound-y;
#X obj 140 319 r \$0-bound-yy; #X obj 140 319 r \$0-bound-yy;
#X obj 81 489 r \$0-bound-yy; #X obj 81 489 r \$0-bound-yy;
#X obj 71 389 expr $f2/$f1; #X obj 71 389 expr $f2/$f1;
#X obj 66 509 +; #X obj 66 509 +;
#X obj 52 249 f; #X obj 52 249 f;
#X obj 118 589 t b f; #X obj 118 589 t b f;
#X obj 91 129 t b f; #X obj 91 129 t b f;
#X obj 136 207 spigot 0; #X obj 136 207 spigot 0;
#X obj 161 177 1; #X obj 161 177 1;
#X obj 191 157 r \$0-arr; #X obj 191 157 r \$0-arr;
#X msg 191 177 0; #X msg 191 177 0;
#X connect 0 0 15 0; #X connect 0 0 15 0;
#X connect 1 0 0 0; #X connect 1 0 0 0;
#X connect 2 0 4 0; #X connect 2 0 4 0;
#X connect 3 0 4 1; #X connect 3 0 4 1;
#X connect 4 0 3 0; #X connect 4 0 3 0;
#X connect 4 0 23 0; #X connect 4 0 23 0;
#X connect 5 0 6 0; #X connect 5 0 6 0;
#X connect 5 1 3 1; #X connect 5 1 3 1;
#X connect 6 0 4 1; #X connect 6 0 4 1;
#X connect 7 0 2 0; #X connect 7 0 2 0;
#X connect 7 1 8 0; #X connect 7 1 8 0;
#X connect 7 2 1 1; #X connect 7 2 1 1;
#X connect 8 0 22 0; #X connect 8 0 22 0;
#X connect 9 1 26 0; #X connect 9 1 26 0;
#X connect 10 0 16 0; #X connect 10 0 16 0;
#X connect 13 0 9 0; #X connect 13 0 9 0;
#X connect 14 0 25 0; #X connect 14 0 25 0;
#X connect 15 0 11 0; #X connect 15 0 11 0;
#X connect 16 0 12 0; #X connect 16 0 12 0;
#X connect 17 0 18 0; #X connect 17 0 18 0;
#X connect 17 1 18 1; #X connect 17 1 18 1;
#X connect 18 0 22 1; #X connect 18 0 22 1;
#X connect 19 0 18 0; #X connect 19 0 18 0;
#X connect 20 0 17 0; #X connect 20 0 17 0;
#X connect 21 0 23 1; #X connect 21 0 23 1;
#X connect 22 0 5 0; #X connect 22 0 5 0;
#X connect 23 0 1 0; #X connect 23 0 1 0;
#X connect 24 0 7 0; #X connect 24 0 7 0;
#X connect 25 0 27 0; #X connect 25 0 27 0;
#X connect 25 1 0 1; #X connect 25 1 0 1;
#X connect 26 0 28 0; #X connect 26 0 28 0;
#X connect 26 1 24 0; #X connect 26 1 24 0;
#X connect 27 0 24 0; #X connect 27 0 24 0;
#X connect 28 0 27 1; #X connect 28 0 27 1;
#X connect 29 0 30 0; #X connect 29 0 30 0;
#X connect 30 0 27 1; #X connect 30 0 27 1;
#X coords 0 0 1 1 195 60 0; #X coords 0 0 1 1 195 60 0;
#X restore 199 177 pd y-label; #X restore 199 177 pd y-label;
#N canvas 524 614 293 249 y-ticks 0; #N canvas 524 614 293 249 y-ticks 0;
#X obj 133 126 /; #X obj 133 126 /;
#X obj 133 96 t b f; #X obj 133 96 t b f;
#X obj 105 166 pack f f f; #X obj 105 166 pack f f f;
#X obj 162 146 expr 100/$f1; #X obj 162 146 expr 100/$f1;
#X obj 105 216 outlet; #X obj 105 216 outlet;
#X obj 25 126 r \$0-ytick-send; #X obj 25 126 r \$0-ytick-send;
#X msg 105 186 yticks \$1 \$2 \$3; #X msg 105 186 yticks \$1 \$2 \$3;
#X obj 162 126 r \$0-ytick-prop; #X obj 162 126 r \$0-ytick-prop;
#X obj 133 76 r \$0-ytick-div; #X obj 133 76 r \$0-ytick-div;
#X obj 93 56 t b f; #X obj 93 56 t b f;
#X obj 93 86 -; #X obj 93 86 -;
#X obj 53 16 r \$0-bound-y; #X obj 53 16 r \$0-bound-y;
#X obj 93 36 r \$0-bound-yy; #X obj 93 36 r \$0-bound-yy;
#X connect 0 0 2 1; #X connect 0 0 2 1;
#X connect 1 0 0 0; #X connect 1 0 0 0;
#X connect 1 1 0 1; #X connect 1 1 0 1;
#X connect 2 0 6 0; #X connect 2 0 6 0;
#X connect 3 0 2 2; #X connect 3 0 2 2;
#X connect 5 0 2 0; #X connect 5 0 2 0;
#X connect 6 0 4 0; #X connect 6 0 4 0;
#X connect 7 0 3 0; #X connect 7 0 3 0;
#X connect 8 0 1 0; #X connect 8 0 1 0;
#X connect 9 0 10 0; #X connect 9 0 10 0;
#X connect 9 1 10 1; #X connect 9 1 10 1;
#X connect 10 0 0 0; #X connect 10 0 0 0;
#X connect 11 0 10 0; #X connect 11 0 10 0;
#X connect 12 0 9 0; #X connect 12 0 9 0;
#X coords 0 0 1 1 201 75 0; #X coords 0 0 1 1 201 75 0;
#X restore 199 157 pd y-ticks; #X restore 199 157 pd y-ticks;
#X obj 14 338 r \$0-f-writ; #X obj 14 338 r \$0-f-writ;
#X msg 14 358 \; pd-function-writer vis 1; #X msg 14 358 \; pd-function-writer vis 1;
#X msg 14 298 \; pd-segment-draw vis 1; #X msg 14 298 \; pd-segment-draw vis 1;
#X obj 14 278 r \$0-s-draw; #X obj 14 278 r \$0-s-draw;
#X obj 15 179 moses 1; #X obj 15 179 moses 1;
#X obj 279 317 dsp01 1; #X obj 279 317 dsp01 1;
#X text 18 434 adicionar toggle para com/sem wraparound.; #X text 18 434 adicionar toggle para com/sem wraparound.;
#X obj 327 349 inlet; #X obj 327 349 inlet;
#X obj 382 139 symbol \$1; #X obj 382 139 symbol \$1;
#X obj 382 119 loadbang; #X obj 382 119 loadbang;
#X obj 327 409 s \$0-segrel; #X obj 327 409 s \$0-segrel;
#X obj 327 369 route segrel segabs; #X obj 327 369 route segrel segabs;
#X obj 382 389 s \$0-segabs; #X obj 382 389 s \$0-segabs;
#X text 285 390 FUNKTIONIERT NICHT \, DIE " \, " MACHEN MEHRERE NACHRICHTEN #X text 285 390 FUNKTIONIERT NICHT \, DIE " \, " MACHEN MEHRERE NACHRICHTEN
; ;
#X connect 0 0 35 0; #X connect 0 0 35 0;
#X connect 1 0 45 0; #X connect 1 0 45 0;
#X connect 2 0 35 0; #X connect 2 0 35 0;
#X connect 3 0 6 0; #X connect 3 0 6 0;
#X connect 3 0 7 0; #X connect 3 0 7 0;
#X connect 4 0 5 0; #X connect 4 0 5 0;
#X connect 5 0 3 0; #X connect 5 0 3 0;
#X connect 6 0 8 0; #X connect 6 0 8 0;
#X connect 9 0 0 0; #X connect 9 0 0 0;
#X connect 12 0 16 0; #X connect 12 0 16 0;
#X connect 13 0 14 0; #X connect 13 0 14 0;
#X connect 14 0 12 0; #X connect 14 0 12 0;
#X connect 15 0 12 0; #X connect 15 0 12 0;
#X connect 18 0 17 0; #X connect 18 0 17 0;
#X connect 19 0 20 0; #X connect 19 0 20 0;
#X connect 20 0 18 0; #X connect 20 0 18 0;
#X connect 22 0 35 0; #X connect 22 0 35 0;
#X connect 24 0 22 0; #X connect 24 0 22 0;
#X connect 24 0 26 0; #X connect 24 0 26 0;
#X connect 26 0 25 0; #X connect 26 0 25 0;
#X connect 27 0 29 0; #X connect 27 0 29 0;
#X connect 29 0 35 0; #X connect 29 0 35 0;
#X connect 30 0 35 0; #X connect 30 0 35 0;
#X connect 33 0 35 0; #X connect 33 0 35 0;
#X connect 36 0 35 0; #X connect 36 0 35 0;
#X connect 39 0 35 0; #X connect 39 0 35 0;
#X connect 40 0 35 0; #X connect 40 0 35 0;
#X connect 41 0 42 0; #X connect 41 0 42 0;
#X connect 44 0 43 0; #X connect 44 0 43 0;
#X connect 45 1 2 0; #X connect 45 1 2 0;
#X connect 45 1 7 0; #X connect 45 1 7 0;
#X connect 48 0 52 0; #X connect 48 0 52 0;
#X connect 49 0 25 0; #X connect 49 0 25 0;
#X connect 50 0 49 0; #X connect 50 0 49 0;
#X connect 52 0 51 0; #X connect 52 0 51 0;
#X connect 52 1 53 0; #X connect 52 1 53 0;
#X connect 52 2 26 0; #X connect 52 2 26 0;
#X restore 32 695 pd inside; #X restore 32 695 pd inside;
#X obj 290 310 cnv 15 100 100 empty empty empty 20 12 0 14 -191407 #X obj 290 310 cnv 15 100 100 empty empty empty 20 12 0 14 -191407
-66577 0; -66577 0;
#X floatatom 307 367 5 0 0 0 - #0-bound-x-i #0-bound-x; #X floatatom 307 367 5 0 0 0 - #0-bound-x-i #0-bound-x;
#X floatatom 327 347 5 0 0 0 - #0-bound-y-i #0-bound-y; #X floatatom 327 347 5 0 0 0 - #0-bound-y-i #0-bound-y;
#X floatatom 347 367 5 0 0 0 - #0-bound-xx-i #0-bound-xx; #X floatatom 347 367 5 0 0 0 - #0-bound-xx-i #0-bound-xx;
#X floatatom 327 387 5 0 0 0 - #0-bound-yy-i #0-bound-yy; #X floatatom 327 387 5 0 0 0 - #0-bound-yy-i #0-bound-yy;
#X text 294 312 Graphic bounds; #X text 294 312 Graphic bounds;
#X text 293 365 X; #X text 293 365 X;
#X text 328 328 Y; #X text 328 328 Y;
#X obj 307 347 bng 13 250 50 0 \$0-bound-send \$0-bound-send-i empty #X obj 307 347 bng 13 250 50 0 \$0-bound-send \$0-bound-send-i empty
17 7 0 10 -228856 -1 -1; 17 7 0 10 -228856 -1 -1;
#X obj 12 398 cnv 15 265 65 empty empty empty 20 12 0 14 -191407 -66577 #X obj 12 398 cnv 15 265 65 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 17 418 5 2 100000 0 - #0-xlabel-wv-i #0-xlabel-wv; #X floatatom 17 418 5 2 100000 0 - #0-xlabel-wv-i #0-xlabel-wv;
#X text 108 418 How many numbers in total; #X text 108 418 How many numbers in total;
#X floatatom 17 438 6 0 0 0 - #0-xlabel-dist-i #0-xlabel-dist; #X floatatom 17 438 6 0 0 0 - #0-xlabel-dist-i #0-xlabel-dist;
#X text 108 438 Distance (as y value); #X text 108 438 Distance (as y value);
#X obj 12 310 cnv 15 265 80 empty empty empty 20 12 0 14 -191407 -66577 #X obj 12 310 cnv 15 265 80 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 18 329 5 0 0 0 - #0-xtick-div-i #0-xtick-div; #X floatatom 18 329 5 0 0 0 - #0-xtick-div-i #0-xtick-div;
#X floatatom 18 349 5 0 0 0 - #0-xtick-prop-i #0-xtick-prop; #X floatatom 18 349 5 0 0 0 - #0-xtick-prop-i #0-xtick-prop;
#X obj 25 369 bng 14 250 50 0 \$0-xtick-send \$0-xtick-send-i empty #X obj 25 369 bng 14 250 50 0 \$0-xtick-send \$0-xtick-send-i empty
17 7 0 10 -228856 -1 -1; 17 7 0 10 -228856 -1 -1;
#X text 108 369 Send format; #X text 108 369 Send format;
#X text 108 349 Proportion of big ticks (%); #X text 108 349 Proportion of big ticks (%);
#X text 108 329 How many divisions in total; #X text 108 329 How many divisions in total;
#X obj 11 186 cnv 15 135 25 empty empty empty 20 12 0 14 -191407 -66577 #X obj 11 186 cnv 15 135 25 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 15 191 5 0 0 0 - #0-norml-i #0-norml; #X floatatom 15 191 5 0 0 0 - #0-norml-i #0-norml;
#X text 50 191 Normalize to x; #X text 50 191 Normalize to x;
#X obj 197 151 cnv 15 115 60 empty empty empty 20 12 0 14 -191407 -66577 #X obj 197 151 cnv 15 115 60 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 202 189 10 0 0 0 - #0-ind_t-i #0-ind_t; #X floatatom 202 189 10 0 0 0 - #0-ind_t-i #0-ind_t;
#X text 199 150 Index test; #X text 199 150 Index test;
#X text 268 169 Index; #X text 268 169 Index;
#X text 268 188 Value; #X text 268 188 Value;
#X obj 12 216 cnv 15 170 25 empty empty empty 20 12 0 14 -191407 -66577 #X obj 12 216 cnv 15 170 25 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 16 221 5 0 0 0 - #0-const-i #0-const; #X floatatom 16 221 5 0 0 0 - #0-const-i #0-const;
#X text 51 221 Set a constant value; #X text 51 221 Set a constant value;
#X obj 11 156 cnv 15 145 25 empty empty empty 20 12 0 14 -191407 -66577 #X obj 11 156 cnv 15 145 25 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X floatatom 15 160 10 0 0 0 - #0-resize-i #0-resize; #X floatatom 15 160 10 0 0 0 - #0-resize-i #0-resize;
#X text 82 160 Size/Resize; #X text 82 160 Size/Resize;
#X obj 71 52 cnv 15 260 60 empty empty empty 20 12 0 14 -241339 -66577 #X obj 71 52 cnv 15 260 60 empty empty empty 20 12 0 14 -241339 -66577
0; 0;
#X symbolatom 144 61 30 0 0 0 - #0-arr-i #0-arr; #X symbolatom 144 61 30 0 0 0 - #0-arr-i #0-arr;
#X symbolatom 144 89 30 0 0 0 - #0-rename-i #0-rename; #X symbolatom 144 89 30 0 0 0 - #0-rename-i #0-rename;
#X text 74 89 Rename it; #X text 74 89 Rename it;
#X text 74 61 Array name; #X text 74 61 Array name;
#X obj 117 8 cnv 15 160 30 empty empty ARRAY-EDITOR 8 16 0 20 -191407 #X obj 117 8 cnv 15 160 30 empty empty ARRAY-EDITOR 8 16 0 20 -191407
-33289 0; -33289 0;
#X obj 12 255 cnv 15 60 20 empty empty Display 5 11 0 12 -191407 -33289 #X obj 12 255 cnv 15 60 20 empty empty Display 5 11 0 12 -191407 -33289
0; 0;
#X obj 202 169 nbx 5 16 0 99 0 0 \$0-ind_i \$0-ind_i-i empty 0 -8 0 #X obj 202 169 nbx 5 16 0 99 0 0 \$0-ind_i \$0-ind_i-i empty 0 -8 0
10 -228856 -1 -1 0 256; 10 -228856 -1 -1 0 256;
#X obj 12 495 r \$0-command; #X obj 12 495 r \$0-command;
#X msg 12 515; #X msg 12 515;
#X floatatom 68 329 5 0 0 0 - #0-ytick-div-i #0-ytick-div; #X floatatom 68 329 5 0 0 0 - #0-ytick-div-i #0-ytick-div;
#X floatatom 68 349 5 0 0 0 - #0-ytick-prop-i #0-ytick-prop; #X floatatom 68 349 5 0 0 0 - #0-ytick-prop-i #0-ytick-prop;
#X obj 75 369 bng 14 250 50 0 \$0-ytick-send \$0-ytick-send-i empty #X obj 75 369 bng 14 250 50 0 \$0-ytick-send \$0-ytick-send-i empty
17 7 0 10 -228856 -1 -1; 17 7 0 10 -228856 -1 -1;
#X floatatom 67 418 5 2 100000 0 - #0-ylabel-wv-i #0-ylabel-wv; #X floatatom 67 418 5 2 100000 0 - #0-ylabel-wv-i #0-ylabel-wv;
#X floatatom 67 438 6 0 0 0 - #0-ylabel-dist-i #0-ylabel-dist; #X floatatom 67 438 6 0 0 0 - #0-ylabel-dist-i #0-ylabel-dist;
#X text 23 310 X / Y Ticks; #X text 23 310 X / Y Ticks;
#X text 25 398 X / Y Label; #X text 25 398 X / Y Label;
#N canvas 505 36 496 590 function-writer 0; #N canvas 505 36 496 590 function-writer 0;
#X obj 27 231 tabwrite~ \$1; #X obj 27 231 tabwrite~ \$1;
#X obj 27 122 bng 15 250 50 0 empty empty Calculate 21 8 0 12 -228856 #X obj 27 122 bng 15 250 50 0 empty empty Calculate 21 8 0 12 -228856
-1 -1; -1 -1;
#X text 15 51 1 - Edit your formula below; #X text 15 51 1 - Edit your formula below;
#X text 13 330 Some formula examples:; #X text 13 330 Some formula examples:;
#X text 17 398 - descending line; #X text 17 398 - descending line;
#X obj 139 379 expr~ $v1; #X obj 139 379 expr~ $v1;
#X obj 139 399 expr~ 1-$v1; #X obj 139 399 expr~ 1-$v1;
#X obj 139 439 expr~ pow($v1 \, .5); #X obj 139 439 expr~ pow($v1 \, .5);
#X text 17 438 - logarithmic line; #X text 17 438 - logarithmic line;
#X text 17 418 - exponential line; #X text 17 418 - exponential line;
#X obj 139 419 expr~ pow($v1 \, 2); #X obj 139 419 expr~ pow($v1 \, 2);
#X text 13 350 Lines; #X text 13 350 Lines;
#X floatatom 279 150 5 0 0 0 - - -; #X floatatom 279 150 5 0 0 0 - - -;
#X text 14 8 The function writer writes a funcion in your array. It #X text 14 8 The function writer writes a funcion in your array. It
analyses the sample rate and arraysize \, so that the wave fits perfectly analyses the sample rate and arraysize \, so that the wave fits perfectly
with the array. To create a new waveform:; with the array. To create a new waveform:;
#X text 131 103 Edit your formula here \, or copy-paste from the ones #X text 131 103 Edit your formula here \, or copy-paste from the ones
below. The number field is to connect with the gaussian formula \, below. The number field is to connect with the gaussian formula \,
or with any formulas that need extra argument(s).; or with any formulas that need extra argument(s).;
#N canvas 0 0 450 372 calc 0; #N canvas 0 0 450 372 calc 0;
#X obj 187 38 inlet; #X obj 187 38 inlet;
#X obj 226 78 samplerate~; #X obj 226 78 samplerate~;
#X obj 127 278 r \$0-arr; #X obj 127 278 r \$0-arr;
#X obj 197 298 phasor~; #X obj 197 298 phasor~;
#X obj 226 238 /; #X obj 226 238 /;
#X msg 127 298 set \$1; #X msg 127 298 set \$1;
#X obj 206 258 0; #X obj 206 258 0;
#X obj 241 98 r \$0-arrsize; #X obj 241 98 r \$0-arrsize;
#X obj 187 58 t a b b; #X obj 187 58 t a b b;
#X obj 187 338 outlet; #X obj 187 338 outlet;
#X obj 197 318 outlet~; #X obj 197 318 outlet~;
#X obj 241 218 +; #X obj 241 218 +;
#X obj 256 118 r \$0-wrapar; #X obj 256 118 r \$0-wrapar;
#X obj 256 138 * -1; #X obj 256 138 * -1;
#X obj 241 188 f; #X obj 241 188 f;
#X obj 256 158 t b f; #X obj 256 158 t b f;
#X connect 0 0 8 0; #X connect 0 0 8 0;
#X connect 1 0 4 0; #X connect 1 0 4 0;
#X connect 2 0 5 0; #X connect 2 0 5 0;
#X connect 3 0 10 0; #X connect 3 0 10 0;
#X connect 4 0 3 0; #X connect 4 0 3 0;
#X connect 5 0 9 0; #X connect 5 0 9 0;
#X connect 6 0 3 1; #X connect 6 0 3 1;
#X connect 7 0 14 0; #X connect 7 0 14 0;
#X connect 8 0 9 0; #X connect 8 0 9 0;
#X connect 8 1 6 0; #X connect 8 1 6 0;
#X connect 8 2 1 0; #X connect 8 2 1 0;
#X connect 11 0 4 1; #X connect 11 0 4 1;
#X connect 12 0 13 0; #X connect 12 0 13 0;
#X connect 13 0 15 0; #X connect 13 0 15 0;
#X connect 14 0 11 0; #X connect 14 0 11 0;
#X connect 15 0 14 0; #X connect 15 0 14 0;
#X connect 15 1 11 1; #X connect 15 1 11 1;
#X restore 27 140 pd calc; #X restore 27 140 pd calc;
#X text 70 543 If there's any function that you think should be here #X text 70 543 If there's any function that you think should be here
\, tell me about it at jmmmpais@googlemail.com; \, tell me about it at jmmmpais@googlemail.com;
#N canvas 0 0 685 457 (subpatch) 0; #N canvas 0 0 685 457 (subpatch) 0;
#X array array2 120 float 0; #X array array2 120 float 0;
#X coords 0 1 119 0 120 90 1; #X coords 0 1 119 0 120 90 1;
#X restore 311 354 graph; #X restore 311 354 graph;
#X obj 286 292 s \$0-arr-i; #X obj 286 292 s \$0-arr-i;
#X text 50 254 To try out the waveforms below \, first choose this #X text 50 254 To try out the waveforms below \, first choose this
array as the array to be edited by clicking on:; array as the array to be edited by clicking on:;
#X msg 286 272 symbol array2; #X msg 286 272 symbol array2;
#X text 15 71 2 - Bang "Calculate"; #X text 15 71 2 - Bang "Calculate";
#X text 16 378 - ascending line; #X text 16 378 - ascending line;
#N canvas 232 298 502 383 panning-curves 0; #N canvas 232 298 502 383 panning-curves 0;
#X obj 380 12 switch~ 0; #X obj 380 12 switch~ 0;
#X text 17 138 - simple (triangular); #X text 17 138 - simple (triangular);
#X text 12 19 Panning curves; #X text 12 19 Panning curves;
#X obj 149 139 expr~ 1-$v1; #X obj 149 139 expr~ 1-$v1;
#X text 11 80 Some curves need the Wraparound option \, so that the #X text 11 80 Some curves need the Wraparound option \, so that the
final value is as close as possible.; final value is as close as possible.;
#X obj 149 159 expr~ pow(1-$v1 \, .5); #X obj 149 159 expr~ pow(1-$v1 \, .5);
#X text 17 158 - square root; #X text 17 158 - square root;
#X obj 149 179 expr~ cos($v1*0.5*3.14159); #X obj 149 179 expr~ cos($v1*0.5*3.14159);
#X text 17 178 - sinus; #X text 17 178 - sinus;
#X obj 149 199 expr~ ((sqrt(2)/2) * (cos(($v1) * (4 * atan(1)) - (4 #X obj 149 199 expr~ ((sqrt(2)/2) * (cos(($v1) * (4 * atan(1)) - (4
* atan(1)/2)) - sin(($v1) * (4 * atan(1)) - (4 * atan(1)/2))))*0.5+0.5 * atan(1)/2)) - sin(($v1) * (4 * atan(1)) - (4 * atan(1)/2))))*0.5+0.5
; ;
#X text 16 198 - "equal power"; #X text 16 198 - "equal power";
#X text 11 40 These curves are for the left side. To get the right #X text 11 40 These curves are for the left side. To get the right
side value \, just read the table at the mirror point: [arraysize]-[index]-1. side value \, just read the table at the mirror point: [arraysize]-[index]-1.
; ;
#X text 17 328 Formulas taken from Csound Ezine/Jamie Bullock \, Georg #X text 17 328 Formulas taken from Csound Ezine/Jamie Bullock \, Georg
Holzmann.; Holzmann.;
#X obj 149 265 expr~ (cos($v1)-sin($v1))*(sqrt(2)/2); #X obj 149 265 expr~ (cos($v1)-sin($v1))*(sqrt(2)/2);
#X obj 149 245 expr~ ($v1*3.14159/2)-3.14159/4; #X obj 149 245 expr~ ($v1*3.14159/2)-3.14159/4;
#X text 16 245 - tangent law; #X text 16 245 - tangent law;
#X connect 14 0 13 0; #X connect 14 0 13 0;
#X restore 23 478 pd panning-curves; #X restore 23 478 pd panning-curves;
#N canvas 148 141 450 259 trigonometry/windowing 0; #N canvas 148 141 450 259 trigonometry/windowing 0;
#X text 17 48 - sine wave; #X text 17 48 - sine wave;
#X obj 139 49 expr~ sin($v1*3.14159*2); #X obj 139 49 expr~ sin($v1*3.14159*2);
#X obj 139 89 expr~ 0.5*(1-cos($v1*3.14159*2)); #X obj 139 89 expr~ 0.5*(1-cos($v1*3.14159*2));
#X text 17 68 - cosine window; #X text 17 68 - cosine window;
#X obj 139 69 expr~ sin($v1*3.14159); #X obj 139 69 expr~ sin($v1*3.14159);
#X obj 139 109 expr~ 0.53836-0.46164*cos($v1*3.14159*2); #X obj 139 109 expr~ 0.53836-0.46164*cos($v1*3.14159*2);
#X text 17 108 - hamming window; #X text 17 108 - hamming window;
#X text 17 88 - hanning window; #X text 17 88 - hanning window;
#X text 17 128 - connes window; #X text 17 128 - connes window;
#X obj 139 129 expr~ pow(1-pow($v1*2-1 \, 2) \, 2); #X obj 139 129 expr~ pow(1-pow($v1*2-1 \, 2) \, 2);
#X obj 139 149 expr~ 1-abs($v1*2-1); #X obj 139 149 expr~ 1-abs($v1*2-1);
#X text 17 148 - welch window; #X text 17 148 - welch window;
#X text 17 168 - gaussian window; #X text 17 168 - gaussian window;
#X obj 137 170 expr~ pow(2 \, pow((($v1*2-1)/$f2) \, 2)*-1); #X obj 137 170 expr~ pow(2 \, pow((($v1*2-1)/$f2) \, 2)*-1);
#X text 17 208 - lanczos window; #X text 17 208 - lanczos window;
#X obj 139 209 expr~ sin(($v1*2-1)*3.14159)/(($v1*2-1)*3.14159); #X obj 139 209 expr~ sin(($v1*2-1)*3.14159)/(($v1*2-1)*3.14159);
#X text 12 19 Trigonometry/Windowing formulas; #X text 12 19 Trigonometry/Windowing formulas;
#X obj 380 12 switch~ 0; #X obj 380 12 switch~ 0;
#X text 134 188 (0 < $f2 < 1); #X text 134 188 (0 < $f2 < 1);
#X restore 23 508 pd trigonometry/windowing; #X restore 23 508 pd trigonometry/windowing;
#X obj 67 181 expr~ pow(2 \, pow((($v1*2-1)/$f2) \, 2)*-1); #X obj 67 181 expr~ pow(2 \, pow((($v1*2-1)/$f2) \, 2)*-1);
#X connect 1 0 15 0; #X connect 1 0 15 0;
#X connect 12 0 25 1; #X connect 12 0 25 1;
#X connect 15 0 0 0; #X connect 15 0 0 0;
#X connect 15 1 25 0; #X connect 15 1 25 0;
#X connect 20 0 18 0; #X connect 20 0 18 0;
#X connect 25 0 0 0; #X connect 25 0 0 0;
#X restore 32 639 pd function-writer; #X restore 32 639 pd function-writer;
#X obj 12 128 cnv 15 60 20 empty empty Basic 5 11 0 12 -191407 -33289 #X obj 12 128 cnv 15 60 20 empty empty Basic 5 11 0 12 -191407 -33289
0; 0;
#X text 12 277 Attention: to edit the Y fields \, you must first define #X text 12 277 Attention: to edit the Y fields \, you must first define
the Y values in Graphic Bounds.; the Y values in Graphic Bounds.;
#N canvas 266 36 411 747 segment-draw 0; #N canvas 266 36 411 747 segment-draw 0;
#X msg 75 356 0 0 \, -1.5 15 \, 1 50 \, 0.75 75 \, 0 100; #X msg 75 356 0 0 \, -1.5 15 \, 1 50 \, 0.75 75 \, 0 100;
#X text 11 528 relative index: 0%-100%; #X text 11 528 relative index: 0%-100%;
#N canvas 545 59 692 802 segment-function-draw 0; #N canvas 545 59 692 802 segment-function-draw 0;
#X obj 173 33 inlet; #X obj 173 33 inlet;
#X obj 92 133 r \$0-arrsize; #X obj 92 133 r \$0-arrsize;
#X obj 77 153 *; #X obj 77 153 *;
#X obj 77 113 * 0.01; #X obj 77 113 * 0.01;
#X obj 344 21 inlet; #X obj 344 21 inlet;
#X text 168 9 relativ; #X text 168 9 relativ;
#X text 389 16 absolut; #X text 389 16 absolut;
#X obj 77 173 i; #X obj 77 173 i;
#X obj 219 573 samplerate~; #X obj 219 573 samplerate~;
#X obj 69 682 r \$0-arr; #X obj 69 682 r \$0-arr;
#X obj 219 593 /; #X obj 219 593 /;
#X msg 69 702 set \$1; #X msg 69 702 set \$1;
#X obj 189 644 0; #X obj 189 644 0;
#X obj 143 293 -; #X obj 143 293 -;
#X obj 158 273 f; #X obj 158 273 f;
#X obj 143 243 t f f b; #X obj 143 243 t f f b;
#X msg 130 583 start \$1; #X msg 130 583 start \$1;
#X obj 170 553 t f b b; #X obj 170 553 t f b b;
#X obj 77 193 t f f; #X obj 77 193 t f f;
#X obj 27 283 moses; #X obj 27 283 moses;
#X obj 54 263 r \$0-arrsize; #X obj 54 263 r \$0-arrsize;
#X obj 104 213 moses 1; #X obj 104 213 moses 1;
#X obj 152 682 phasor~; #X obj 152 682 phasor~;
#X obj 130 772 tabwrite~ \$1; #X obj 130 772 tabwrite~ \$1;
#X obj 295 627 del; #X obj 295 627 del;
#X obj 295 607 * 1.01; #X obj 295 607 * 1.01;
#N canvas 77 335 450 302 blocksize 0; #N canvas 77 335 450 302 blocksize 0;
#X obj 174 211 outlet; #X obj 174 211 outlet;
#X obj 164 31 inlet; #X obj 164 31 inlet;
#X obj 164 51 samplerate~; #X obj 164 51 samplerate~;
#X obj 174 171 /; #X obj 174 171 /;
#X obj 174 191 * 1000; #X obj 174 191 * 1000;
#X obj 179 121 iem_blocksize~; #X obj 179 121 iem_blocksize~;
#X obj 164 141 f; #X obj 164 141 f;
#X obj 164 71 t b f; #X obj 164 71 t b f;
#X obj 179 101 sig~; #X obj 179 101 sig~;
#X connect 1 0 2 0; #X connect 1 0 2 0;
#X connect 2 0 7 0; #X connect 2 0 7 0;
#X connect 3 0 4 0; #X connect 3 0 4 0;
#X connect 4 0 0 0; #X connect 4 0 0 0;
#X connect 5 0 6 1; #X connect 5 0 6 1;
#X connect 6 0 3 0; #X connect 6 0 3 0;
#X connect 7 0 6 0; #X connect 7 0 6 0;
#X connect 7 1 3 1; #X connect 7 1 3 1;
#X connect 8 0 5 0; #X connect 8 0 5 0;
#X restore 295 587 pd blocksize; #X restore 295 587 pd blocksize;
#X obj 219 613 t b f; #X obj 219 613 t b f;
#X obj 179 83 swap; #X obj 179 83 swap;
#X obj 151 742 +~; #X obj 151 742 +~;
#X text 327 629 each segment is written after a delay of 1 block. maybe #X text 327 629 each segment is written after a delay of 1 block. maybe
not the best way \, but the only one using ~ ?; not the best way \, but the only one using ~ ?;
#X obj 152 722 *~; #X obj 152 722 *~;
#X obj 170 493 textfile; #X obj 170 493 textfile;
#X obj 310 155 f; #X obj 310 155 f;
#X obj 275 238 route list; #X obj 275 238 route list;
#X obj 275 208 list prepend; #X obj 275 208 list prepend;
#X obj 344 188 spigot 0; #X obj 344 188 spigot 0;
#X msg 374 168 0; #X msg 374 168 0;
#X msg 404 168 1; #X msg 404 168 1;
#X obj 275 125 t f b f b; #X obj 275 125 t f b f b;
#X obj 275 258 unpack; #X obj 275 258 unpack;
#X obj 304 318 -; #X obj 304 318 -;
#X obj 294 298 f; #X obj 294 298 f;
#X obj 275 278 t f b f; #X obj 275 278 t f b f;
#X obj 170 443 prepent add; #X obj 170 443 prepent add;
#X msg 104 473 clear; #X msg 104 473 clear;
#X msg 205 467 rewind \, bang; #X msg 205 467 rewind \, bang;
#X obj 143 373 swap; #X obj 143 373 swap;
#X obj 143 353 pack; #X obj 143 353 pack;
#X obj 205 139 t b b b; #X obj 205 139 t b b b;
#X obj 143 403 pack f f f f f; #X obj 143 403 pack f f f f f;
#X obj 170 523 unpack f f f f f; #X obj 170 523 unpack f f f f f;
#X obj 173 53 zexy/unpack f f f; #X obj 173 53 zexy/unpack f f f;
#X obj 254 413 0; #X obj 254 413 0;
#X obj 143 423 t b a; #X obj 143 423 t b a;
#X obj 152 702 expr~ pow($v1 \, exp($f2*5*log(2))); #X obj 152 702 expr~ pow($v1 \, exp($f2*5*log(2)));
#X text 280 523 dauer \, anfangspunkt \, anfangswert \, skalierung #X text 280 523 dauer \, anfangspunkt \, anfangswert \, skalierung
\, exp-curve; \, exp-curve;
#X obj 350 71 swap; #X obj 350 71 swap;
#X obj 344 41 zexy/unpack f f f; #X obj 344 41 zexy/unpack f f f;
#X msg 323 471 print; #X msg 323 471 print;
#X obj 93 23 r \$0-segrel; #X obj 93 23 r \$0-segrel;
#X obj 263 13 r \$0-segabs; #X obj 263 13 r \$0-segabs;
#X connect 0 0 52 0; #X connect 0 0 52 0;
#X connect 1 0 2 1; #X connect 1 0 2 1;
#X connect 2 0 7 0; #X connect 2 0 7 0;
#X connect 3 0 2 0; #X connect 3 0 2 0;
#X connect 4 0 58 0; #X connect 4 0 58 0;
#X connect 7 0 18 0; #X connect 7 0 18 0;
#X connect 8 0 10 0; #X connect 8 0 10 0;
#X connect 9 0 11 0; #X connect 9 0 11 0;
#X connect 10 0 27 0; #X connect 10 0 27 0;
#X connect 11 0 23 0; #X connect 11 0 23 0;
#X connect 12 0 22 1; #X connect 12 0 22 1;
#X connect 13 0 48 0; #X connect 13 0 48 0;
#X connect 14 0 13 1; #X connect 14 0 13 1;
#X connect 15 0 13 0; #X connect 15 0 13 0;
#X connect 15 1 14 1; #X connect 15 1 14 1;
#X connect 15 2 14 0; #X connect 15 2 14 0;
#X connect 16 0 23 0; #X connect 16 0 23 0;
#X connect 17 0 16 0; #X connect 17 0 16 0;
#X connect 17 1 12 0; #X connect 17 1 12 0;
#X connect 17 2 8 0; #X connect 17 2 8 0;
#X connect 18 0 19 0; #X connect 18 0 19 0;
#X connect 18 1 21 0; #X connect 18 1 21 0;
#X connect 19 0 48 1; #X connect 19 0 48 1;
#X connect 19 1 49 0; #X connect 19 1 49 0;
#X connect 20 0 19 1; #X connect 20 0 19 1;
#X connect 21 0 14 1; #X connect 21 0 14 1;
#X connect 21 0 45 0; #X connect 21 0 45 0;
#X connect 21 1 15 0; #X connect 21 1 15 0;
#X connect 22 0 55 0; #X connect 22 0 55 0;
#X connect 24 0 32 0; #X connect 24 0 32 0;
#X connect 25 0 24 0; #X connect 25 0 24 0;
#X connect 26 0 25 0; #X connect 26 0 25 0;
#X connect 27 0 26 0; #X connect 27 0 26 0;
#X connect 27 1 22 0; #X connect 27 1 22 0;
#X connect 28 0 3 0; #X connect 28 0 3 0;
#X connect 28 1 39 0; #X connect 28 1 39 0;
#X connect 29 0 23 0; #X connect 29 0 23 0;
#X connect 31 0 29 0; #X connect 31 0 29 0;
#X connect 32 0 51 0; #X connect 32 0 51 0;
#X connect 33 0 36 0; #X connect 33 0 36 0;
#X connect 34 0 40 0; #X connect 34 0 40 0;
#X connect 35 0 34 0; #X connect 35 0 34 0;
#X connect 36 0 35 1; #X connect 36 0 35 1;
#X connect 37 0 36 1; #X connect 37 0 36 1;
#X connect 38 0 36 1; #X connect 38 0 36 1;
#X connect 39 0 35 0; #X connect 39 0 35 0;
#X connect 39 1 38 0; #X connect 39 1 38 0;
#X connect 39 2 33 1; #X connect 39 2 33 1;
#X connect 39 3 33 0; #X connect 39 3 33 0;
#X connect 40 0 43 0; #X connect 40 0 43 0;
#X connect 40 1 42 1; #X connect 40 1 42 1;
#X connect 41 0 50 3; #X connect 41 0 50 3;
#X connect 42 0 41 0; #X connect 42 0 41 0;
#X connect 43 0 50 2; #X connect 43 0 50 2;
#X connect 43 1 42 0; #X connect 43 1 42 0;
#X connect 43 2 41 1; #X connect 43 2 41 1;
#X connect 44 0 32 0; #X connect 44 0 32 0;
#X connect 45 0 32 0; #X connect 45 0 32 0;
#X connect 46 0 32 0; #X connect 46 0 32 0;
#X connect 47 0 50 0; #X connect 47 0 50 0;
#X connect 47 1 50 1; #X connect 47 1 50 1;
#X connect 48 0 47 0; #X connect 48 0 47 0;
#X connect 49 0 46 0; #X connect 49 0 46 0;
#X connect 49 1 35 1; #X connect 49 1 35 1;
#X connect 49 2 37 0; #X connect 49 2 37 0;
#X connect 50 0 54 0; #X connect 50 0 54 0;
#X connect 51 0 17 0; #X connect 51 0 17 0;
#X connect 51 1 10 1; #X connect 51 1 10 1;
#X connect 51 2 29 1; #X connect 51 2 29 1;
#X connect 51 3 31 1; #X connect 51 3 31 1;
#X connect 51 4 55 1; #X connect 51 4 55 1;
#X connect 52 0 28 0; #X connect 52 0 28 0;
#X connect 52 1 28 1; #X connect 52 1 28 1;
#X connect 52 2 50 4; #X connect 52 2 50 4;
#X connect 53 0 50 4; #X connect 53 0 50 4;
#X connect 54 0 53 0; #X connect 54 0 53 0;
#X connect 54 1 44 0; #X connect 54 1 44 0;
#X connect 55 0 31 0; #X connect 55 0 31 0;
#X connect 57 0 18 0; #X connect 57 0 18 0;
#X connect 57 1 39 0; #X connect 57 1 39 0;
#X connect 58 0 57 0; #X connect 58 0 57 0;
#X connect 58 1 57 1; #X connect 58 1 57 1;
#X connect 58 2 50 4; #X connect 58 2 50 4;
#X connect 59 0 32 0; #X connect 59 0 32 0;
#X connect 60 0 52 0; #X connect 60 0 52 0;
#X connect 61 0 58 0; #X connect 61 0 58 0;
#X restore 45 509 pd segment-function-draw; #X restore 45 509 pd segment-function-draw;
#X msg 55 316 0 0 \, 1 50 \, 0 100; #X msg 55 316 0 0 \, 1 50 \, 0 100;
#X text 20 196 Attention: You must always define an array completely #X text 20 196 Attention: You must always define an array completely
\, from the first to last indexes (be it in relative or absolute indexes). \, from the first to last indexes (be it in relative or absolute indexes).
; ;
#X text 181 529 absolute index: 0-arraysize; #X text 181 529 absolute index: 0-arraysize;
#X text 27 692 Note: Each segment is written after a 1-block delay. #X text 27 692 Note: Each segment is written after a 1-block delay.
If you're thinking about using this tool for live audio \, make sure If you're thinking about using this tool for live audio \, make sure
you don't get side effects due to this technique.; you don't get side effects due to this technique.;
#X text 21 87 - index Value; #X text 21 87 - index Value;
#X text 21 107 - duration - in percentage of total duration (left inlet) #X text 21 107 - duration - in percentage of total duration (left inlet)
or in absolute indexes (right inlet); or in absolute indexes (right inlet);
#X text 20 56 Segment draw: Define each breakpoint with 2 or 3 indexes. #X text 20 56 Segment draw: Define each breakpoint with 2 or 3 indexes.
Each breakpoint is separated by commas:; Each breakpoint is separated by commas:;
#N canvas 0 0 668 457 (subpatch) 0; #N canvas 0 0 668 457 (subpatch) 0;
#X array array1 120 float 0; #X array array1 120 float 0;
#X coords 0 1 119 -1 120 90 1; #X coords 0 1 119 -1 120 90 1;
#X restore 145 581 graph; #X restore 145 581 graph;
#X obj 256 282 s \$0-arr-i; #X obj 256 282 s \$0-arr-i;
#X msg 256 262 symbol array1; #X msg 256 262 symbol array1;
#X obj 147 21 cnv 15 95 20 empty empty Segment-draw 5 11 0 12 -191407 #X obj 147 21 cnv 15 95 20 empty empty Segment-draw 5 11 0 12 -191407
-33289 0; -33289 0;
#X text 21 138 - curve steppness [-1 to 1]: 0 or missing for a straight #X text 21 138 - curve steppness [-1 to 1]: 0 or missing for a straight
line. 0 to 1 for exponential curve \, -1 to 0 for logarithmic curve. line. 0 to 1 for exponential curve \, -1 to 0 for logarithmic curve.
; ;
#X text 164 315 normal wave; #X text 164 315 normal wave;
#X msg 64 336 0 0 \, 1 50 0.15 \, 0 100 -0.15; #X msg 64 336 0 0 \, 1 50 0.15 \, 0 100 -0.15;
#X text 236 335 same wave \, but curved; #X text 236 335 same wave \, but curved;
#X text 20 244 To try out the waveforms below \, first choose this #X text 20 244 To try out the waveforms below \, first choose this
array as the array to be edited by clicking on:; array as the array to be edited by clicking on:;
#X text 83 376 more complex example; #X text 83 376 more complex example;
#X msg 164 433 0 0 \, 1 60 \, 0 120; #X msg 164 433 0 0 \, 1 60 \, 0 120;
#X msg 174 453 0 0 \, 1 60 0.15 \, 0 120 -0.15; #X msg 174 453 0 0 \, 1 60 0.15 \, 0 120 -0.15;
#X msg 185 473 0 0 \, -1.5 18 \, 1 60 \, 0.75 90 \, 0 120; #X msg 185 473 0 0 \, -1.5 18 \, 1 60 \, 0.75 90 \, 0 120;
#X text 93 413 Same examples as above \, with absolute coordinates #X text 93 413 Same examples as above \, with absolute coordinates
; ;
#X connect 0 0 2 0; #X connect 0 0 2 0;
#X connect 3 0 2 0; #X connect 3 0 2 0;
#X connect 12 0 11 0; #X connect 12 0 11 0;
#X connect 16 0 2 0; #X connect 16 0 2 0;
#X connect 20 0 2 1; #X connect 20 0 2 1;
#X connect 21 0 2 1; #X connect 21 0 2 1;
#X connect 22 0 2 1; #X connect 22 0 2 1;
#X restore 32 596 pd segment-draw; #X restore 32 596 pd segment-draw;
#X obj 12 640 bng 15 250 50 0 \$0-f-writ \$0-f-writ-i empty 17 7 0 #X obj 12 640 bng 15 250 50 0 \$0-f-writ \$0-f-writ-i empty 17 7 0
10 -228856 -1 -1; 10 -228856 -1 -1;
#X obj 12 597 bng 15 250 50 0 \$0-s-draw \$0-s-draw-i empty 17 7 0 #X obj 12 597 bng 15 250 50 0 \$0-s-draw \$0-s-draw-i empty 17 7 0
10 -228856 -1 -1; 10 -228856 -1 -1;
#X text 32 576 Draw a wave shape through break points; #X text 32 576 Draw a wave shape through break points;
#X text 32 619 Define a wave shape through its function; #X text 32 619 Define a wave shape through its function;
#X obj 12 549 cnv 15 100 20 empty empty Ploting.tools 5 11 0 12 -191407 #X obj 12 549 cnv 15 100 20 empty empty Ploting.tools 5 11 0 12 -191407
-33289 0; -33289 0;
#X text 94 685 (where everything works); #X text 94 685 (where everything works);
#X text 12 474 You can copy the commands and paste them in your patch: #X text 12 474 You can copy the commands and paste them in your patch:
; ;
#X obj 32 675 inlet; #X obj 32 675 inlet;
#N canvas 0 0 426 446 license 0; #N canvas 0 0 426 446 license 0;
#X text 8 47 All rights reserved.; #X text 8 47 All rights reserved.;
#X text 8 227 The names of its contributors may not be used to endorse #X text 8 227 The names of its contributors may not be used to endorse
or promote products derived from this software without specific prior or promote products derived from this software without specific prior
written permission.; written permission.;
#X text 8 87 Redistribution and use in source and binary forms \, with #X text 8 87 Redistribution and use in source and binary forms \, with
or without modification \, are permitted provided that the following or without modification \, are permitted provided that the following
conditions are met:; conditions are met:;
#X text 8 127 Redistributions of source code must retain the above #X text 8 127 Redistributions of source code must retain the above
copyright notice \, this list of conditions and the following disclaimer. copyright notice \, this list of conditions and the following disclaimer.
; ;
#X text 8 297 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND #X text 8 297 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES \, INCLUDING CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES \, INCLUDING
\, BUT NOT LIMITED TO \, THE IMPLIED WARRANTIES OF MERCHANTABILITY \, BUT NOT LIMITED TO \, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT \, INDIRECT THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT \, INDIRECT
\, INCIDENTAL \, SPECIAL \, EXEMPLARY \, OR CONSEQUENTIAL DAMAGES (INCLUDING \, INCIDENTAL \, SPECIAL \, EXEMPLARY \, OR CONSEQUENTIAL DAMAGES (INCLUDING
\, BUT NOT LIMITED TO \, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES \, BUT NOT LIMITED TO \, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES
; ;
#X text 8 167 Redistributions in binary form must reproduce the above #X text 8 167 Redistributions in binary form must reproduce the above
copyright notice \, this list of conditions and the following disclaimer copyright notice \, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the distribution. in the documentation and/or other materials provided with the distribution.
; ;
#X text 8 27 jmmmpais@googlemail.com; #X text 8 27 jmmmpais@googlemail.com;
#X text 8 7 Copyright 2006 \, Joo Pais; #X text 8 7 Copyright 2006 \, Joo Pais;
#X restore 32 724 pd license; #X restore 32 724 pd license;
#X text 99 724 (C) 2009 Joo Pais - jmmmpais@googlemail.com; #X text 99 724 (C) 2009 Joo Pais - jmmmpais@googlemail.com;
#X obj 197 216 cnv 15 187 25 empty empty empty 20 12 0 14 -191407 -66577 #X obj 197 216 cnv 15 187 25 empty empty empty 20 12 0 14 -191407 -66577
0; 0;
#X obj 202 221 tgl 15 0 \$0-wrapar \$0-wrapar-i empty 17 7 0 10 -228856 #X obj 202 221 tgl 15 0 \$0-wrapar \$0-wrapar-i empty 17 7 0 10 -228856
-1 -1 0 1; -1 -1 0 1;
#X text 221 220 Wraparound (last index ~0); #X text 221 220 Wraparound (last index ~0);
#X connect 44 0 45 0; #N canvas 278 215 494 344 META 0;
#X connect 64 0 0 0; #X text 12 55 AUTHOR Joo Pais <jmmmpais@googlemail.com>;
#X text 12 95 LICENSE BSD;
#X text 12 75 LIBRARY jmmmp;
#X text 12 35 KEYWORDS array edit;
#X text 12 135 VERSION 2009;
#X text 13 115 WEBSITE http://puredata.info/Members/jmmmp;
#X text 12 165 INLET_0 - symbol name of array to be edited;
#X text 12 5 DESCRIPTION Edit properties of arrays and populate them
following several formulas;
#X restore 32 744 pd META;
#X connect 44 0 45 0;
#X connect 64 0 0 0;
abstractions/jmmmp/bezier-help.pd
View file @ 7dc4f29c
#N struct bez-array float x float y array bez-c-arr bez-c float p0x #N struct 1124-bez-array float x float y array 1124-bez-c-arr 1124-bez-c
float p0y float p0x. float p0y. float p1x float p1y float p1x. float float p0x float p0y float p0x. float p0y. float p1x float p1y float
p1y. float p2x float p2y float p2x. float p2y. float p3x float p3y p1x. float p1y. float p2x float p2y float p2x. float p2y. float p3x
float p3x. float p3y. float rpx float rpy float rpx. float rpy.; float p3y float p3x. float p3y. float rpx float rpy float rpx. float
#N struct bez-c float x float y; rpy.;
#N canvas 280 17 921 908 10; #N struct 1124-bez-c float x float y;
#N canvas 31 5 921 704 10;
#X floatatom 415 741 5 0 0 0 - - -; #X floatatom 415 741 5 0 0 0 - - -;
#X obj 418 727 hsl 50 10 0 1 0 0 empty empty empty -2 -8 0 10 -228856 #X obj 418 727 hsl 50 10 0 1 0 0 empty empty empty -2 -8 0 10 -228856
-1 -1 4900 0; -1 -1 0 0;
#X floatatom 135 195 5 0 0 0 - - -; #X floatatom 135 195 5 0 0 0 - - -;
#X msg 125 134 canvas \$1; #X msg 125 134 canvas \$1;
#X floatatom 135 114 5 0 0 0 - - -; #X floatatom 135 114 5 0 0 0 - - -;
...@@ -14,18 +15,17 @@ float p3x. float p3y. float rpx float rpy float rpx. float rpy.; ...@@ -14,18 +15,17 @@ float p3x. float p3y. float rpx float rpy float rpx. float rpy.;
#X msg 415 687 0 \, 1 3000; #X msg 415 687 0 \, 1 3000;
#X obj 135 504 pack; #X obj 135 504 pack;
#X obj 145 484 t b f; #X obj 145 484 t b f;
#X obj 125 820 unpack; #X msg 228 820 p0 0.25 0.34 \, p1 0.34 0.88 \, p2 0.9 0.4 \, p3 0.85
#X msg 228 820 p0 0.142857 0.244898 \, p1 0.34 0.88 \, p2 0.9 0.4 \, 0.73;
p3 0.85 0.73;
#X text 543 84 Arguments; #X text 543 84 Arguments;
#X obj 148 457 hsl 50 10 0 1 0 0 empty empty X -16 6 0 12 -228856 -1 #X obj 148 457 hsl 50 10 0 1 0 0 empty empty X -16 6 0 12 -228856 -1
-1 700 1; -1 0 1;
#X obj 148 471 hsl 50 10 0 1 0 0 empty empty Y -16 6 0 12 -228856 -1 #X obj 148 471 hsl 50 10 0 1 0 0 empty empty Y -16 6 0 12 -228856 -1
-1 1200 1; -1 0 1;
#X obj 128 840 hsl 50 10 0 1 0 0 empty empty X -16 6 0 12 -228856 -1 #X obj 128 820 hsl 50 10 0 1 0 0 empty empty X -16 6 0 12 -228856 -1
-1 4165 1; -1 0 1;
#X obj 128 854 hsl 50 10 0 1 0 0 empty empty Y -16 6 0 12 -228856 -1 #X obj 128 834 hsl 50 10 0 1 0 0 empty empty Y -16 6 0 12 -228856 -1
-1 3577 1; -1 0 1;
#X text 135 297 default values; #X text 135 297 default values;
#X text 135 337 also first and last points can take any value; #X text 135 337 also first and last points can take any value;
#X text 222 154 Two values define x and y coordinates; #X text 222 154 Two values define x and y coordinates;
...@@ -36,7 +36,6 @@ a square ...; ...@@ -36,7 +36,6 @@ a square ...;
#X text 172 194 size \$1 - Define array size (minimum 2 points); #X text 172 194 size \$1 - Define array size (minimum 2 points);
#X text 240 789 Dump outlet: connect to a message box \, which you #X text 240 789 Dump outlet: connect to a message box \, which you
can later copy-paste.; can later copy-paste.;
#X text 105 869 Output: list with scaled x and y values;
#X text 545 163 If no arguments are given \, the default values are #X text 545 163 If no arguments are given \, the default values are
110 100 100 When no y argument is present \, a square with dimensions 110 100 100 When no y argument is present \, a square with dimensions
of x is created.; of x is created.;
...@@ -63,13 +62,8 @@ get formatted.; ...@@ -63,13 +62,8 @@ get formatted.;
#X text 543 254 Outlets; #X text 543 254 Outlets;
#X text 546 272 - float pair with x / y values; #X text 546 272 - float pair with x / y values;
#X text 546 292 - control point dump; #X text 546 292 - control point dump;
#X text 21 9 [bezier] - Transfer function with one cubic bzier curve
;
#X text 153 554 readpoint \$1 - Turn readpoint (red) display on or #X text 153 554 readpoint \$1 - Turn readpoint (red) display on or
off. Readpoint shows the curent place in the buffer.; off. Readpoint shows the curent place in the buffer.;
#X text 543 536 READPOINT NAO FUNCIONA COM VARIOS OBJECTOS \, ENVIA
PARA BEZIER CRIADO PRIMEIRO \; TIRAR TODOS OS SENDS \, OU FAZER UM
LOCAL SEND;
#X text 22 29 Create a transfer function between 0 and 1 \, using the #X text 22 29 Create a transfer function between 0 and 1 \, using the
four control points of a cubic bzier curve.; four control points of a cubic bzier curve.;
#X text 546 232 - floats [0 to 1] / commands (with parameters); #X text 546 232 - floats [0 to 1] / commands (with parameters);
...@@ -82,7 +76,7 @@ the red boundaries. Or send pX coordinates.; ...@@ -82,7 +76,7 @@ the red boundaries. Or send pX coordinates.;
#X text 70 814 OUTPUT; #X text 70 814 OUTPUT;
#X obj 415 761 s \$0-input; #X obj 415 761 s \$0-input;
#X obj 135 677 r \$0-input; #X obj 135 677 r \$0-input;
#X text 320 667 Send your input values between 0 and 1 here:; #X text 415 667 Send your input values between 0 and 1 here:;
#X msg 125 317 p0 0 0 \, p1 0.1 0.6 \, p2 0.9 0.4 \, p3 1 1; #X msg 125 317 p0 0 0 \, p1 0.1 0.6 \, p2 0.9 0.4 \, p3 1 1;
#X msg 125 357 p0 0.25 0.34 \, p1 0.34 0.88 \, p2 0.9 0.4 \, p3 0.85 #X msg 125 357 p0 0.25 0.34 \, p1 0.34 0.88 \, p2 0.9 0.4 \, p3 0.85
0.73; 0.73;
...@@ -97,30 +91,45 @@ the box - you won't be able to grab the graphic (see bug description) ...@@ -97,30 +91,45 @@ the box - you won't be able to grab the graphic (see bug description)
; ;
#X msg 125 583 readpoint \$1; #X msg 125 583 readpoint \$1;
#X msg 125 624 dump; #X msg 125 624 dump;
#X connect 0 0 52 0; #X text 65 849 Outputs: scaled x and y values;
#X text 21 9 [bezier] - Transfer function GUI with one cubic bzier
curve;
#N canvas 504 106 494 344 META 0;
#X text 12 55 AUTHOR Joo Pais <jmmmpais@googlemail.com>;
#X text 12 95 LICENSE BSD;
#X text 12 75 LIBRARY jmmmp;
#X text 12 5 DESCRIPTION Transfer function GUI with one cubic bézier
curve;
#X text 12 35 KEYWORDS bezier data structures;
#X text 12 135 VERSION 2010;
#X text 12 165 INLET_0 - all instructions;
#X text 12 185 OUTLET_0 - list with x/y values;
#X text 12 205 OUTLET_1 - dump current parameters;
#X text 13 115 WEBSITE http://puredata.info/Members/jmmmp;
#X restore 542 486 pd META;
#X connect 0 0 48 0;
#X connect 1 0 0 0; #X connect 1 0 0 0;
#X connect 2 0 60 0; #X connect 2 0 56 0;
#X connect 3 0 27 0; #X connect 3 0 25 0;
#X connect 4 0 3 0; #X connect 4 0 3 0;
#X connect 5 0 1 0; #X connect 5 0 1 0;
#X connect 6 0 5 0; #X connect 6 0 5 0;
#X connect 7 0 58 0; #X connect 7 0 54 0;
#X connect 8 0 7 0; #X connect 8 0 7 0;
#X connect 8 1 7 1; #X connect 8 1 7 1;
#X connect 9 0 14 0; #X connect 11 0 7 0;
#X connect 9 1 15 0; #X connect 12 0 8 0;
#X connect 12 0 7 0; #X connect 24 0 60 0;
#X connect 13 0 8 0; #X connect 25 0 13 0;
#X connect 26 0 64 0; #X connect 25 1 14 0;
#X connect 27 0 9 0; #X connect 25 2 9 0;
#X connect 27 1 10 0; #X connect 49 0 25 0;
#X connect 53 0 27 0; #X connect 51 0 25 0;
#X connect 55 0 27 0; #X connect 52 0 25 0;
#X connect 56 0 27 0; #X connect 53 0 25 0;
#X connect 57 0 27 0; #X connect 54 0 25 0;
#X connect 58 0 27 0; #X connect 56 0 25 0;
#X connect 60 0 27 0; #X connect 57 0 25 0;
#X connect 61 0 27 0; #X connect 58 0 25 0;
#X connect 62 0 27 0; #X connect 60 0 25 0;
#X connect 64 0 27 0; #X connect 61 0 25 0;
#X connect 65 0 27 0;
abstractions/jmmmp/bezier.pd
View file @ 7dc4f29c
#N struct bez-array float x float y array bez-c-arr bez-c float p0x
float p0y float p0x. float p0y. float p1x float p1y float p1x. float
p1y. float p2x float p2y float p2x. float p2y. float p3x float p3y
float p3x. float p3y. float rpx float rpy float rpx. float rpy.;
#N struct bez-c float x float y;
#N canvas 0 0 855 754 10; #N canvas 0 0 855 754 10;
#X scalar bez-array 0 0 -2 -2 3 3 8 58 13 63 88 38 93 43 98 98 103
103 98 98 103 103 \; 0 0 \; 0.26146 1.71676 \; 0.56528 3.38768 \; 0.91062
5.01372 \; 1.29664 6.59584 \; 1.7225 8.135 \; 2.18736 9.63216 \; 2.69038
11.0883 \; 3.23072 12.5043 \; 3.80754 13.8812 \; 4.42 15.22 \; 5.06726
16.5216 \; 5.74848 17.7869 \; 6.46282 19.0169 \; 7.20944 20.2126 \;
7.9875 21.375 \; 8.79616 22.505 \; 9.63458 23.6035 \; 10.5019 24.6715
\; 11.3973 25.71 \; 12.32 26.72 \; 13.2691 27.7024 \; 14.2437 28.6581
\; 15.243 29.5881 \; 16.2662 30.4934 \; 17.3125 31.375 \; 18.381 32.2338
\; 19.4708 33.0707 \; 20.5811 33.8867 \; 21.7111 34.6828 \; 22.86 35.46
\; 24.0269 36.2192 \; 25.2109 36.9613 \; 26.4112 37.6873 \; 27.627
38.3982 \; 28.8575 39.095 \; 30.1018 39.7786 \; 31.359 40.4499 \; 32.6283
41.1099 \; 33.9089 41.7596 \; 35.2 42.4 \; 36.5007 43.032 \; 37.8101
43.6565 \; 39.1274 44.2745 \; 40.4518 44.887 \; 41.7825 45.495 \; 43.1186
46.0994 \; 44.4592 46.7011 \; 45.8035 47.3011 \; 47.1507 47.9004 \;
48.5 48.5 \; 49.8505 49.1008 \; 51.2013 49.7037 \; 52.5516 50.3097
\; 53.9006 50.9198 \; 55.2475 51.535 \; 56.5914 52.1562 \; 57.9314
52.7843 \; 59.2667 53.4203 \; 60.5965 54.0652 \; 61.92 54.72 \; 63.2363
55.3856 \; 64.5445 56.0629 \; 65.8438 56.7529 \; 67.1334 57.4566 \;
68.4125 58.175 \; 69.6802 58.909 \; 70.9356 59.6595 \; 72.1779 60.4275
\; 73.4063 61.214 \; 74.62 62.02 \; 75.8181 62.8464 \; 76.9997 63.6941
\; 78.164 64.5641 \; 79.3102 65.4574 \; 80.4375 66.375 \; 81.545 67.3178
\; 82.6318 68.2867 \; 83.6971 69.2827 \; 84.7401 70.3068 \; 85.76 71.36
\; 86.7559 72.4432 \; 87.7269 73.5573 \; 88.6722 74.7033 \; 89.591
75.8822 \; 90.4825 77.095 \; 91.3458 78.3425 \; 92.18 79.6259 \; 92.9843
80.9459 \; 93.7579 82.3037 \; 94.5 83.7 \; 95.2097 85.1359 \; 95.8861
86.6125 \; 96.5284 88.1305 \; 97.1358 89.691 \; 97.7075 91.295 \; 98.2426
92.9434 \; 98.7402 94.6371 \; 99.1995 96.3771 \; 100 100 \; \;;
#X obj 217 10 inlet; #X obj 217 10 inlet;
#N canvas 627 482 718 464 inside 0; #N canvas 627 482 718 464 inside 0;
#X obj 20 82 inlet; #X obj 20 82 inlet;
#X obj 346 282 s \$0-bezier-a; #X obj 346 282 s \$0-bezier-a;
#N canvas 0 0 450 300 element 0; #N canvas 0 0 450 300 element 0;
#X obj 52 46 struct bez-c float x float y; #X obj 52 46 struct \$0-bez-c float x float y;
#X restore 20 322 pd element; #X restore 20 302 pd element;
#N canvas 665 149 542 409 array 0; #N canvas 665 149 542 409 array 0;
#X obj 11 87 route change click; #X obj 11 87 route change click;
#X obj 31 121 unpack p f; #X obj 31 121 unpack p f;
...@@ -58,12 +26,12 @@ p0x. p0y p0x. p0y. p0x p0y. p0x p0y; ...@@ -58,12 +26,12 @@ p0x. p0y p0x. p0y. p0x p0y. p0x p0y;
p3x. p3y p3x. p3y. p3x p3y. p3x p3y; p3x. p3y p3x. p3y. p3x p3y. p3x p3y;
#X obj 166 171 r \$0-read-point-view; #X obj 166 171 r \$0-read-point-view;
#X text 297 171 read point; #X text 297 171 read point;
#X obj 11 15 struct bez-array float x float y array bez-c-arr bez-c #X obj 11 15 struct \$0-bez-array float x float y array \$0-bez-c-arr
float p0x float p0y float p0x. float p0y. float p1x float p1y float \$0-bez-c float p0x float p0y float p0x. float p0y. float p1x float
p1x. float p1y. float p2x float p2y float p2x. float p2y. float p3x p1y float p1x. float p1y. float p2x float p2y float p2x. float p2y.
float p3y float p3x. float p3y. float rpx float rpy float rpx. float float p3x float p3y float p3x. float p3y. float rpx float rpy float
rpy.; rpx. float rpy.;
#X obj 166 111 plot bez-c-arr 9 2 0 0; #X obj 166 111 plot \$0-bez-c-arr 9 2 0 0;
#X obj 166 191 filledpolygon 900 900 1 rpx rpy rpx. rpy rpx. rpy. rpx #X obj 166 191 filledpolygon 900 900 1 rpx rpy rpx. rpy rpx. rpy. rpx
rpy. rpx rpy; rpy. rpx rpy;
#X connect 0 0 1 0; #X connect 0 0 1 0;
...@@ -74,7 +42,7 @@ rpy. rpx rpy; ...@@ -74,7 +42,7 @@ rpy. rpx rpy;
#X connect 5 0 3 0; #X connect 5 0 3 0;
#X connect 12 0 16 0; #X connect 12 0 16 0;
#X connect 14 0 0 0; #X connect 14 0 0 0;
#X restore 20 342 pd array; #X restore 20 322 pd array;
#N canvas 257 223 482 660 calculate 0; #N canvas 257 223 482 660 calculate 0;
#X obj 27 42 inlet; #X obj 27 42 inlet;
#X obj 27 202 until; #X obj 27 202 until;
...@@ -106,17 +74,17 @@ a escalonar tudo? talvez nao; ...@@ -106,17 +74,17 @@ a escalonar tudo? talvez nao;
#X obj 47 122 t b f f; #X obj 47 122 t b f f;
#X obj 27 272 *; #X obj 27 272 *;
#X obj 46 292 *; #X obj 46 292 *;
#X obj 141 190 get bez-array p0x; #X obj 141 190 get \$0-bez-array p0x;
#X obj 151 210 get bez-array p1x; #X obj 151 210 get \$0-bez-array p1x;
#X obj 161 230 get bez-array p2x; #X obj 161 230 get \$0-bez-array p2x;
#X obj 171 250 get bez-array p3x; #X obj 171 250 get \$0-bez-array p3x;
#X obj 311 190 get bez-array p0y; #X obj 311 190 get \$0-bez-array p0y;
#X obj 320 210 get bez-array p1y; #X obj 320 210 get \$0-bez-array p1y;
#X obj 331 230 get bez-array p2y; #X obj 331 230 get \$0-bez-array p2y;
#X obj 341 250 get bez-array p3y; #X obj 341 250 get \$0-bez-array p3y;
#X obj 108 498 element bez-array bez-c-arr; #X obj 108 498 element \$0-bez-array \$0-bez-c-arr;
#X obj 27 538 set bez-c x; #X obj 27 538 set \$0-bez-c x;
#X obj 46 558 set bez-c y; #X obj 46 558 set \$0-bez-c y;
#X connect 0 0 11 0; #X connect 0 0 11 0;
#X connect 1 0 2 0; #X connect 1 0 2 0;
#X connect 2 0 9 0; #X connect 2 0 9 0;
...@@ -168,8 +136,8 @@ a escalonar tudo? talvez nao; ...@@ -168,8 +136,8 @@ a escalonar tudo? talvez nao;
#X connect 34 0 19 0; #X connect 34 0 19 0;
#X connect 35 0 8 0; #X connect 35 0 8 0;
#X restore 20 362 pd calculate; #X restore 20 362 pd calculate;
#X obj 55 182 outlet; #X obj 65 202 outlet;
#N canvas 0 0 333 632 index 0; #N canvas 161 314 333 632 index 0;
#X obj 13 292 outlet; #X obj 13 292 outlet;
#X obj 208 142 r \$0-arrpoint; #X obj 208 142 r \$0-arrpoint;
#X obj 13 62 inlet; #X obj 13 62 inlet;
...@@ -178,82 +146,87 @@ a escalonar tudo? talvez nao; ...@@ -178,82 +146,87 @@ a escalonar tudo? talvez nao;
#X obj 106 102 - 1; #X obj 106 102 - 1;
#X obj 13 202 * 0.01; #X obj 13 202 * 0.01;
#X obj 106 202 * 0.01; #X obj 106 202 * 0.01;
#X obj 13 222 pack f f; #X obj 156 332 unpack;
#X obj 136 332 unpack; #X obj 246 282 r \$0-arrpoint;
#X obj 226 282 r \$0-arrpoint; #X obj 143 312 pointer;
#X obj 123 312 pointer; #X obj 143 452 t p p p p;
#X obj 123 452 t p p p p; #X obj 143 502 + 5;
#X obj 123 502 + 5; #X obj 173 572 + 5;
#X obj 153 572 + 5; #X obj 246 382 t p p;
#X obj 226 382 t p p; #X obj 199 372 - 2;
#X obj 179 372 - 2; #X obj 156 372 - 2;
#X obj 136 372 - 2; #X obj 143 262 pack;
#X obj 123 262 pack; #X obj 156 352 * 1;
#X obj 136 352 * 1; #X obj 199 352 * 1;
#X obj 179 352 * 1; #X obj 143 282 t b l;
#X obj 123 282 t b l; #X text 205 256 read point;
#X text 185 256 read point;
#X obj 53 32 inlet; #X obj 53 32 inlet;
#X text 94 31 update read point; #X text 94 31 update read point;
#X obj 53 52 t b b b; #X obj 53 52 t b b b;
#X obj 13 272 spigot 1; #X obj 13 272 spigot 1;
#X obj 68 252 0; #X obj 88 242 0;
#X obj 38 252 1; #X obj 58 242 1;
#X obj 13 102 f; #X obj 13 102 f;
#X obj 106 82 getsize bez-array bez-c-arr; #X obj 106 82 getsize \$0-bez-array \$0-bez-c-arr;
#X obj 13 162 element bez-array bez-c-arr; #X obj 13 162 element \$0-bez-array \$0-bez-c-arr;
#X obj 13 182 get bez-c x y; #X obj 13 182 get \$0-bez-c x y;
#X obj 137 402 set bez-array rpx; #X obj 156 402 set \$0-bez-array rpx;
#X obj 136 422 set bez-array rpy; #X obj 155 422 set \$0-bez-array rpy;
#X obj 123 482 get bez-array rpx; #X obj 143 482 get \$0-bez-array rpx;
#X obj 133 522 set bez-array rpx.; #X obj 153 522 set \$0-bez-array rpx.;
#X obj 153 552 get bez-array rpy; #X obj 173 552 get \$0-bez-array rpy;
#X obj 163 592 set bez-array rpy.; #X obj 183 592 set \$0-bez-array rpy.;
#X connect 1 0 31 1; #X obj 233 217 inlet;
#X connect 2 0 29 0; #X obj 53 342 outlet;
#X connect 3 0 30 0; #X obj 53 322 spigot 1;
#X connect 4 0 31 0; #X connect 1 0 30 1;
#X connect 2 0 28 0;
#X connect 3 0 29 0;
#X connect 4 0 30 0;
#X connect 5 0 4 4; #X connect 5 0 4 4;
#X connect 6 0 8 0; #X connect 6 0 25 0;
#X connect 7 0 8 1; #X connect 7 0 40 0;
#X connect 8 0 26 0; #X connect 8 0 18 0;
#X connect 9 0 19 0; #X connect 8 1 19 0;
#X connect 9 1 20 0; #X connect 9 0 10 0;
#X connect 9 0 14 0;
#X connect 10 0 11 0; #X connect 10 0 11 0;
#X connect 10 0 15 0; #X connect 11 0 34 0;
#X connect 11 0 12 0; #X connect 11 1 35 1;
#X connect 11 2 36 0;
#X connect 11 3 37 1;
#X connect 12 0 35 0; #X connect 12 0 35 0;
#X connect 12 1 36 1; #X connect 13 0 37 0;
#X connect 12 2 37 0; #X connect 14 0 33 1;
#X connect 12 3 38 1; #X connect 14 1 32 1;
#X connect 13 0 36 0; #X connect 15 0 33 0;
#X connect 14 0 38 0; #X connect 16 0 32 0;
#X connect 15 0 34 1; #X connect 17 0 20 0;
#X connect 15 1 33 1; #X connect 18 0 16 0;
#X connect 16 0 34 0; #X connect 19 0 15 0;
#X connect 17 0 33 0; #X connect 20 0 10 0;
#X connect 18 0 21 0; #X connect 20 1 8 0;
#X connect 19 0 17 0; #X connect 22 0 24 0;
#X connect 20 0 16 0; #X connect 24 0 27 0;
#X connect 21 0 11 0; #X connect 24 1 28 0;
#X connect 21 1 9 0; #X connect 24 2 26 0;
#X connect 23 0 25 0; #X connect 25 0 0 0;
#X connect 25 0 28 0; #X connect 26 0 25 1;
#X connect 25 1 29 0; #X connect 26 0 40 1;
#X connect 25 2 27 0; #X connect 27 0 25 1;
#X connect 26 0 0 0; #X connect 27 0 40 1;
#X connect 27 0 26 1; #X connect 28 0 4 0;
#X connect 28 0 26 1; #X connect 29 0 5 0;
#X connect 29 0 4 0; #X connect 30 0 31 0;
#X connect 30 0 5 0; #X connect 31 0 6 0;
#X connect 31 0 32 0; #X connect 31 0 17 0;
#X connect 32 0 6 0; #X connect 31 1 7 0;
#X connect 32 0 18 0; #X connect 31 1 17 1;
#X connect 32 1 7 0; #X connect 34 0 12 0;
#X connect 32 1 18 1; #X connect 36 0 13 0;
#X connect 35 0 13 0; #X connect 38 0 28 0;
#X connect 37 0 14 0; #X connect 40 0 39 0;
#X restore 55 162 pd index; #X restore 65 182 pd index;
#N canvas 0 0 332 180 size 0; #N canvas 0 0 332 180 size 0;
#X obj 18 17 inlet; #X obj 18 17 inlet;
#X obj 213 117 r \$0-arrpoint; #X obj 213 117 r \$0-arrpoint;
...@@ -262,7 +235,7 @@ a escalonar tudo? talvez nao; ...@@ -262,7 +235,7 @@ a escalonar tudo? talvez nao;
#X obj 18 37 moses 2; #X obj 18 37 moses 2;
#X msg 18 57 2; #X msg 18 57 2;
#X text 111 16 size \, wenigstens 2 Punkte; #X text 111 16 size \, wenigstens 2 Punkte;
#X obj 18 137 setsize bez-array bez-c-arr; #X obj 18 137 setsize \$0-bez-array \$0-bez-c-arr;
#X connect 0 0 4 0; #X connect 0 0 4 0;
#X connect 1 0 7 1; #X connect 1 0 7 1;
#X connect 3 0 7 0; #X connect 3 0 7 0;
...@@ -403,30 +376,30 @@ a escalonar tudo? talvez nao; ...@@ -403,30 +376,30 @@ a escalonar tudo? talvez nao;
#X connect 37 0 1 0; #X connect 37 0 1 0;
#X restore 52 546 pd convert-to-dump; #X restore 52 546 pd convert-to-dump;
#X obj 228 58 route p0 p1 p2 p3; #X obj 228 58 route p0 p1 p2 p3;
#X obj 480 236 set bez-array p3x; #X obj 480 236 set \$0-bez-array p3x;
#X obj 480 256 set bez-array p3y; #X obj 480 256 set \$0-bez-array p3y;
#X obj 340 236 set bez-array p2x; #X obj 340 236 set \$0-bez-array p2x;
#X obj 340 256 set bez-array p2y; #X obj 340 256 set \$0-bez-array p2y;
#X obj 199 236 set bez-array p1x; #X obj 199 236 set \$0-bez-array p1x;
#X obj 200 256 set bez-array p1y; #X obj 200 256 set \$0-bez-array p1y;
#X obj 60 236 set bez-array p0x; #X obj 60 236 set \$0-bez-array p0x;
#X obj 60 256 set bez-array p0y; #X obj 60 256 set \$0-bez-array p0y;
#X obj 47 362 get bez-array p0x; #X obj 47 362 get \$0-bez-array p0x;
#X obj 57 402 set bez-array p0x.; #X obj 57 402 set \$0-bez-array p0x.;
#X obj 77 432 get bez-array p0y; #X obj 77 432 get \$0-bez-array p0y;
#X obj 87 472 set bez-array p0y.; #X obj 87 472 set \$0-bez-array p0y.;
#X obj 267 472 set bez-array p1y.; #X obj 267 472 set \$0-bez-array p1y.;
#X obj 257 432 get bez-array p1y; #X obj 257 432 get \$0-bez-array p1y;
#X obj 237 402 set bez-array p1x.; #X obj 237 402 set \$0-bez-array p1x.;
#X obj 227 362 get bez-array p1x; #X obj 227 362 get \$0-bez-array p1x;
#X obj 407 362 get bez-array p2x; #X obj 407 362 get \$0-bez-array p2x;
#X obj 417 402 set bez-array p2x.; #X obj 417 402 set \$0-bez-array p2x.;
#X obj 437 433 get bez-array p2y; #X obj 437 433 get \$0-bez-array p2y;
#X obj 447 472 set bez-array p2y.; #X obj 447 472 set \$0-bez-array p2y.;
#X obj 626 472 set bez-array p3y.; #X obj 626 472 set \$0-bez-array p3y.;
#X obj 616 432 get bez-array p3y; #X obj 616 432 get \$0-bez-array p3y;
#X obj 596 402 set bez-array p3x.; #X obj 596 402 set \$0-bez-array p3x.;
#X obj 586 362 get bez-array p3x; #X obj 586 362 get \$0-bez-array p3x;
#X connect 0 0 16 0; #X connect 0 0 16 0;
#X connect 1 0 43 0; #X connect 1 0 43 0;
#X connect 1 1 29 0; #X connect 1 1 29 0;
...@@ -530,8 +503,8 @@ a escalonar tudo? talvez nao; ...@@ -530,8 +503,8 @@ a escalonar tudo? talvez nao;
#X connect 71 0 21 0; #X connect 71 0 21 0;
#X restore 89 342 pd point-befehle; #X restore 89 342 pd point-befehle;
#X obj 182 362 outlet; #X obj 182 362 outlet;
#X obj 110 222 s \$0-dump; #X obj 110 152 s \$0-dump;
#X obj 110 202 0; #X obj 110 132 0;
#N canvas 0 0 450 300 size-init 0; #N canvas 0 0 450 300 size-init 0;
#X obj 154 93 inlet; #X obj 154 93 inlet;
#X obj 154 133 sel 0; #X obj 154 133 sel 0;
...@@ -545,7 +518,7 @@ a escalonar tudo? talvez nao; ...@@ -545,7 +518,7 @@ a escalonar tudo? talvez nao;
#X connect 2 0 1 0; #X connect 2 0 1 0;
#X connect 3 0 5 0; #X connect 3 0 5 0;
#X connect 5 0 4 0; #X connect 5 0 4 0;
#X restore 334 82 pd size-init; #X restore 334 72 pd size-init;
#N canvas 0 0 450 300 create-init 0; #N canvas 0 0 450 300 create-init 0;
#X obj 129 118 pointer; #X obj 129 118 pointer;
#X obj 129 78 symbol \$0-bezier-a; #X obj 129 78 symbol \$0-bezier-a;
...@@ -554,7 +527,7 @@ a escalonar tudo? talvez nao; ...@@ -554,7 +527,7 @@ a escalonar tudo? talvez nao;
#X msg 129 98 traverse \$1 \, bang; #X msg 129 98 traverse \$1 \, bang;
#X obj 129 138 t b p; #X obj 129 138 t b p;
#X obj 129 58 inlet; #X obj 129 58 inlet;
#X obj 129 178 append bez-array x y; #X obj 129 178 append \$0-bez-array x y;
#X connect 0 0 5 0; #X connect 0 0 5 0;
#X connect 1 0 4 0; #X connect 1 0 4 0;
#X connect 3 0 7 0; #X connect 3 0 7 0;
...@@ -563,7 +536,7 @@ a escalonar tudo? talvez nao; ...@@ -563,7 +536,7 @@ a escalonar tudo? talvez nao;
#X connect 5 1 7 2; #X connect 5 1 7 2;
#X connect 6 0 1 0; #X connect 6 0 1 0;
#X connect 7 0 2 0; #X connect 7 0 2 0;
#X restore 351 62 pd create-init; #X restore 351 52 pd create-init;
#X obj 310 212 t f f; #X obj 310 212 t f f;
#X obj 310 232 pack; #X obj 310 232 pack;
#X obj 300 152 route float list; #X obj 300 152 route float list;
...@@ -584,7 +557,6 @@ dann muss man nicht die Grafik clicken.; ...@@ -584,7 +557,6 @@ dann muss man nicht die Grafik clicken.;
#X restore 20 252 pd get-pointer; #X restore 20 252 pd get-pointer;
#X obj 20 212 t b f; #X obj 20 212 t b f;
#X msg 89 312 p0 0 0 \, p1 0.1 0.6 \, p2 0.9 0.4 \, p3 1 1; #X msg 89 312 p0 0 0 \, p1 0.1 0.6 \, p2 0.9 0.4 \, p3 1 1;
#X obj 300 32 t b b b b;
#N canvas 0 0 403 272 canvas-init 0; #N canvas 0 0 403 272 canvas-init 0;
#X obj 68 104 sel 0; #X obj 68 104 sel 0;
#X obj 68 124 110; #X obj 68 124 110;
...@@ -620,62 +592,61 @@ und vielleicht y zu ber ...@@ -620,62 +592,61 @@ und vielleicht y zu ber
#X restore 300 132 pd canvas-init; #X restore 300 132 pd canvas-init;
#X obj 300 172 moses 20; #X obj 300 172 moses 20;
#X msg 300 192 20; #X msg 300 192 20;
#X obj 160 162 s \$0-read-point-view; #X obj 200 262 s \$0-read-point-view;
#X obj 20 112 route size float dump canvas readpoint; #X obj 20 112 route size float dump canvas readpoint;
#X obj 245 132 t b a; #X obj 245 132 t b a;
#X obj 300 12 lbang; #X obj 300 12 lbang;
#X obj 433 136 pointer; #X obj 417 132 pointer;
#X obj 433 96 symbol \$0-bezier-a; #X obj 417 92 symbol \$0-bezier-a;
#X obj 433 156 s \$0-arrpoint; #X obj 417 152 s \$0-arrpoint;
#X msg 433 116 traverse \$1 \, next \, bang; #X msg 417 112 traverse \$1 \, next \, bang;
#X obj 469 63 bng 15 250 50 0 empty empty empty 17 7 0 10 -262144 -1 #X text 321 362 ha demasiada accao a passar no patch \, optimizar;
-1;
#X obj 377 24 bng 15 250 50 0 empty empty empty 17 7 0 10 -262144 -1
-1;
#X text 330 357 ha demasiada accao a passar no patch \, optimizar;
#X text 366 43 depois apagar?;
#X text 323 386 botao para adicionar x curvas (p3 da anterior == p0 #X text 323 386 botao para adicionar x curvas (p3 da anterior == p0
da seguinte) \, criando uma mega-curva \; tornar tudo variavel \, nr da seguinte) \, criando uma mega-curva \; tornar tudo variavel \, nr
pontos do array... \; ajustar tamanha dos pontos kr de acordo com o pontos do array... \; ajustar tamanha dos pontos kr de acordo com o
tamanho do display; tamanho do display;
#X connect 0 0 26 0; #X obj 300 32 t b b b b;
#X connect 3 0 4 0; #X obj 20 342 t b b;
#X obj 110 202 outlet;
#X connect 0 0 25 0;
#X connect 3 0 35 0;
#X connect 6 0 5 0; #X connect 6 0 5 0;
#X connect 6 1 36 0;
#X connect 8 0 4 1; #X connect 8 0 4 1;
#X connect 8 1 9 0; #X connect 8 1 9 0;
#X connect 11 0 10 0; #X connect 11 0 10 0;
#X connect 12 0 26 0; #X connect 12 0 25 0;
#X connect 14 0 15 0; #X connect 14 0 15 0;
#X connect 14 1 15 1; #X connect 14 1 15 1;
#X connect 15 0 17 0; #X connect 15 0 17 0;
#X connect 16 0 23 0; #X connect 16 0 22 0;
#X connect 16 1 17 0; #X connect 16 1 17 0;
#X connect 17 0 1 0; #X connect 17 0 1 0;
#X connect 19 0 18 0; #X connect 19 0 18 0;
#X connect 19 1 7 0; #X connect 19 1 7 0;
#X connect 20 0 8 0; #X connect 20 0 8 0;
#X connect 21 0 22 0; #X connect 21 0 16 0;
#X connect 21 1 20 0; #X connect 22 0 23 0;
#X connect 21 2 12 0; #X connect 22 1 14 0;
#X connect 21 3 30 0; #X connect 23 0 14 0;
#X connect 22 0 16 0; #X connect 25 0 19 0;
#X connect 23 0 24 0; #X connect 25 1 6 0;
#X connect 23 1 14 0; #X connect 25 2 11 0;
#X connect 24 0 14 0; #X connect 25 3 16 0;
#X connect 26 0 19 0; #X connect 25 4 24 0;
#X connect 26 1 6 0; #X connect 25 5 26 0;
#X connect 26 2 11 0; #X connect 26 0 6 1;
#X connect 26 3 16 0; #X connect 26 1 8 0;
#X connect 26 4 25 0; #X connect 27 0 34 0;
#X connect 26 5 27 0; #X connect 28 0 30 0;
#X connect 27 0 6 1;
#X connect 27 1 8 0;
#X connect 28 0 21 0;
#X connect 29 0 31 0; #X connect 29 0 31 0;
#X connect 30 0 32 0; #X connect 31 0 28 0;
#X connect 32 0 29 0; #X connect 34 0 21 0;
#X connect 33 0 30 0; #X connect 34 1 20 0;
#X connect 34 0 13 0; #X connect 34 2 12 0;
#X connect 34 3 13 0;
#X connect 35 0 4 0;
#X connect 35 1 6 2;
#X restore 217 30 pd inside; #X restore 217 30 pd inside;
#X obj 287 10 namecanvas \$0-bezier-a; #X obj 287 10 namecanvas \$0-bezier-a;
#X obj 217 50 outlet; #X obj 217 50 outlet;
...@@ -707,7 +678,9 @@ in the documentation and/or other materials provided with the distribution. ...@@ -707,7 +678,9 @@ in the documentation and/or other materials provided with the distribution.
#X text 8 7 Copyright 2010 \, Joo Pais; #X text 8 7 Copyright 2010 \, Joo Pais;
#X restore 11 721 pd license; #X restore 11 721 pd license;
#X text 8 703 (C) 2010 Joo Pais - jmmmpais@googlemail.com; #X text 8 703 (C) 2010 Joo Pais - jmmmpais@googlemail.com;
#X connect 1 0 2 0; #X obj 242 70 outlet;
#X connect 2 0 4 0; #X connect 0 0 1 0;
#X connect 2 1 5 0; #X connect 1 0 3 0;
#X connect 1 1 7 0;
#X connect 1 2 4 0;
#X coords -20 120 120 -20 110 110 2 0 0; #X coords -20 120 120 -20 110 110 2 0 0;