Update of /cvsroot/pure-data/externals/signal/fiddle~
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv26382/signal/fiddle~
Added Files:
fiddle~.c help-fiddle~.pd
Log Message:
dropped in goodie bag
--- NEW FILE: fiddle~.c ---
/* Copyright (c) 1997-1999 Miller Puckette and Ted Apel.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
/*
* Fiddle is a pitch tracker hardwired to have hop size ("…
[View More]H") equal to
* half its window size ("N").
*
* This version should compile for Max "0.26," JMAX, Pd, or Max/MSP.
*
* The "lastanalysis" field holds the shifted FT of the previous H
* samples. The buffer contains in effect points 1/2, 3/2, ..., (N-1)/2
* of the DTFT of a real vector of length N, half of whose points are zero,
* i.e., only the first H points are used. Put another way, we get the
* the odd-numbered points of the FFT of the H points, zero padded to 4*H in
* length. The integer points 0, 1, ..., H-1
* are found by interpolating these others, using the fact that the
* half-integer points are band-limited (they only have positive frequencies.)
* To facilitate the interpolation the "lastanalysis" buffer contains
[...1815 lines suppressed...]
imag = ip = real + MAXPOINTS;
src = buf;
for (i = 0; i < np; i++) {
*rp++ = *src++;
*ip++ = *src++;
}
if (inv)
ifft(np,real,imag);
else
fft(np,real,imag);
rp = real;
ip = imag;
src = buf;
for (i = 0; i < np; i++) {
*src++ = *rp++;
*src++ = *ip++;
}
}
#endif /* MSP */
--- NEW FILE: help-fiddle~.pd ---
#N canvas 93 26 980 745 10;
#X obj 262 522 phasor~;
#X obj 531 616 unpack;
#X floatatom 531 666 0 0 0 0 - - -;
#X msg 437 449 print;
#X obj 262 500 sig~;
#X floatatom 262 478 0 0 0 0 - - -;
#X obj 262 456 mtof;
#X floatatom 262 434 0 0 0 0 - - -;
#X floatatom 545 643 0 0 0 0 - - -;
#X obj 531 576 route 1 2 3 4;
#X obj 614 616 unpack;
#X floatatom 614 666 0 0 0 0 - - -;
#X floatatom 628 643 0 0 0 0 - - -;
#X obj 698 616 unpack;
#X floatatom 698 666 0 0 0 0 - - -;
#X floatatom 712 643 0 0 0 0 - - -;
#X obj 389 616 unpack;
#X floatatom 389 666 0 0 0 0 - - -;
#X floatatom 403 643 0 0 0 0 - - -;
#X obj 334 545 *~;
#X obj 322 394 loadbang;
#X obj 353 522 sig~;
#X floatatom 353 500 0 0 0 0 - - -;
#X msg 322 478 1;
#X msg 353 478 0;
#X floatatom 466 666 0 0 0 0 - - -;
#X obj 281 666 print attack;
#X obj 190 666 print pitch;
#X msg 555 45 \; pd dsp 1;
#X text 460 39 click here;
#X text 460 61 to start DSP;
#X text 226 4 FIDDLE - pitch estimator and sinusoidal peak finder;
#X text 8 70 The Fiddle object estimates the pitch and amplitude of
an incoming sound \, both continuously and as a stream of discrete
"note" events. Fiddle optionally outputs a list of detected sinusoidal
peaks used to make the pitch determination. Fiddle is described theoretically
in the 1998 ICMC proceedings \, reprinted on http://man104nfs.ucsd.edu/~mpuckett.
;
#X text 8 170 Fiddle's creation arguments specify an analysis window
size \, the maximum polyphony (i.e. \, the number of simultaneous "pitches"
to try to find) \, the number of peaks in the spectrum to consider
\, and the number of peaks \, if any \, to output "raw." The outlets
give discrete pitch (a number) \, detected attacks in the amplitude
envelope (a bang) \, one or more voices of continuous pitch and amplitude
\, overall amplitude \, and optionally a sequence of messages with
the peaks.;
#X text 8 296 The analysis hop size is half the window size so in the
example shown here \, one analysis is done every 512 samples (11.6
msec at 44K1) \, and the analysis uses the most recent 1024 samples
(23.2 msec at 44K1). The minimum frequency that Fiddle will report
is 2-1/2 cycles per analysis windows \, or about 108 Hz. (just below
MIDI 45.);
#X text 669 535 number of pitch outlets (1-3 \, default 1);
#X text 669 557 number of peaks to find (1-100 \, default 20);
#X text 669 579 number of peaks to output (default 0.);
#X msg 441 107 amp-range 40 50;
#X msg 439 227 reattack 100 10;
#X msg 438 282 npartial 7;
#X msg 438 170 vibrato 50 0.5;
#X text 560 91 a low and high amplitude threshold: if signal amplitude
is below the low threshold \, no pitches or peaks are output. The high
threshold is a minimum at which "cooked" outputs may appear.;
#X text 560 152 A period in milliseconds (50) over which the raw pitch
may not deviate more than an interval in half-tones (0.5) from the
average pitch to report it as a note to the "cooked" pitch outlet.
;
#X text 560 213 A period in milliseconds (100) over which a re-attack
is reported if the amplitude rises more than (1) dB. The re-attack
will result in a "bang" in the attack outlet and may give rise to repeated
notes in the cooked pitch output.;
#X text 142 432 test input pitch;
#X text 330 444 test input;
#X text 330 457 amplitude;
#X obj 410 545 fiddle~ 1024 1 20 3;
#X text 538 690 individual sinusoidal components;
#X text 466 688 amplitude;
#X text 476 703 (dB);
#X text 389 688 raw pitch;
#X text 376 712 and amplitude;
#X text 364 729 (up to 3 outputs);
#X text 287 686 bang on;
#X text 287 708 attack;
#X text 185 686 cooked pitch;
#X text 202 703 output;
#X text 545 545 ------ arguments:;
#X msg 262 412 57;
#X msg 440 331 auto 1;
#X msg 440 353 auto 0;
#X msg 439 418 bang;
#X text 561 416 poll current values --- useful if not in auto mode
\,;
#X text 560 274 Higher partials are weighed less strongly than lower
ones in determining the pitch. This specifies the number of the partial
(7) which will be weighted half as strongly as the fundamental.;
#X text 560 335 start and stop "auto" mode (on by default.) If off
\, output only appears on "bang" (poll mode).;
#X text 561 448 print out all settings;
#X text 669 513 window size (128-2048 \, default 1024);
#X msg 440 375 npoints 2048;
#X text 562 384 number of points in analysis window (power of 2 \,
128-2048);
#X msg 439 396 npoints 1024;
#X connect 0 0 19 0;
#X connect 1 0 2 0;
#X connect 1 1 8 0;
#X connect 3 0 48 0;
#X connect 4 0 0 0;
#X connect 5 0 4 0;
#X connect 6 0 5 0;
#X connect 7 0 6 0;
#X connect 9 0 1 0;
#X connect 9 1 10 0;
#X connect 9 2 13 0;
#X connect 10 0 11 0;
#X connect 10 1 12 0;
#X connect 13 0 14 0;
#X connect 13 1 15 0;
#X connect 16 0 17 0;
#X connect 16 1 18 0;
#X connect 19 0 48 0;
#X connect 20 0 60 0;
#X connect 20 0 23 0;
#X connect 21 0 19 1;
#X connect 22 0 21 0;
#X connect 23 0 22 0;
#X connect 24 0 22 0;
#X connect 38 0 48 0;
#X connect 39 0 48 0;
#X connect 40 0 48 0;
#X connect 41 0 48 0;
#X connect 48 0 27 0;
#X connect 48 1 26 0;
#X connect 48 2 16 0;
#X connect 48 3 25 0;
#X connect 48 4 9 0;
#X connect 60 0 7 0;
#X connect 61 0 48 0;
#X connect 62 0 48 0;
#X connect 63 0 48 0;
#X connect 69 0 48 0;
#X connect 71 0 48 0;
[View Less]
Update of /cvsroot/pure-data/externals/signal/expr~
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv26382/signal/expr~
Added Files:
LICENSE.txt README.txt fts_to_pd.h vexp.c vexp.h vexp_fun.c
vexp_if.c
Log Message:
dropped in goodie bag
--- NEW FILE: vexp.c ---
/*
* jMax
* Copyright (C) 1994, 1995, 1998, 1999 by IRCAM-Centre Georges Pompidou, Paris, France.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public …
[View More]License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* See file LICENSE for further informations on licensing terms.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
[...2103 lines suppressed...]
post("%c", ',');
break;
case OP_SEMI:
post("%c", ';');
break;
default:
post("expr: ex_print: bad op 0x%lx\n", eptr->ex_op);
}
break;
default:
post("expr: ex_print: bad type 0x%lx\n", eptr->ex_type);
}
eptr++;
}
post("\n");
}
#ifdef NT
void ABORT( void) {bug("expr");}
#endif
--- NEW FILE: vexp_fun.c ---
/*
* jMax
* Copyright (C) 1994, 1995, 1998, 1999 by IRCAM-Centre Georges Pompidou, Paris, France.
*
* 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 2
* of the License, or (at your option) any later version.
*
* See file LICENSE for further informations on licensing terms.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
[...1276 lines suppressed...]
/*
* ex_hypoth - Euclidean distance function
*/
FUNC_DEF(ex_hypoth, hypoth, (double), (double), 1);
/*
* ex_round - round to nearest integer, away from zero
*/
FUNC_DEF_UNARY(ex_round, round, (double), 1);
/*
* ex_trunc - round to interger, towards zero
*/
FUNC_DEF_UNARY(ex_trunc, trunc, (double), 1);
/*
* ex_nearbyint - round to nearest integer
*/
FUNC_DEF_UNARY(ex_nearbyint, nearbyint, (double), 1);
#endif
--- NEW FILE: fts_to_pd.h ---
/* fts_to_pd.h -- alias some fts names to compile in Pd.
copyright 1999 Miller Puckette;
permission is granted to use this file for any purpose.
*/
#define fts_malloc malloc
#define fts_calloc calloc
#define fts_free free
#define fts_realloc realloc
#define fts_atom_t t_atom
#define fts_object_t t_object
typedef t_symbol *fts_symbol_t;
#ifdef MSP
#define t_atom Atom
#define t_symbol Symbol
#define pd_new(x) newobject(x);
#define pd_free(x) freeobject(x);
#define t_outlet void
#define t_binbuf void
typedef t_class *t_pd;
typedef float t_floatarg;
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <errno.h>
void pd_error(void *object, char *fmt, ...);
#endif /* MSP */
#define post_error pd_error
#define fts_is_floatg(x) ((x)->a_type == A_FLOAT)
#define fts_new_symbol_copy gensym
#define fts_symbol_name(x) ((x)->s_name)
--- NEW FILE: vexp_if.c ---
/*
* jMax
* Copyright (C) 1994, 1995, 1998, 1999 by IRCAM-Centre Georges Pompidou, Paris, France.
*
* 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 2
* of the License, or (at your option) any later version.
*
* See file LICENSE for further informations on licensing terms.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
[...1184 lines suppressed...]
va_list ap;
t_int arg[8];
int i;
static int saidit = 0;
va_start(ap, fmt);
/* SDY
vsprintf(error_string, fmt, ap);
*/ post(fmt, ap);
va_end(ap);
/* SDY
fprintf(stderr, "error: %s\n", error_string);
error_object = object;
*/
if (!saidit)
{
post("... you might be able to track this down from the Find menu.");
saidit = 1;
}
}
#endif
--- NEW FILE: LICENSE.txt ---
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) 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
this service 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 make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. 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.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
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
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the 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 a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE 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.
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
convey 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) 19yy <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 2 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, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision 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, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This 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 Library General
Public License instead of this License.
--- NEW FILE: README.txt ---
You can get more information on the expr object at
http://www.crca.ucsd.edu/~yadegari/expr.html
-----------
New if Version 0.4
-access to variables (made by value object)
-multiple expression separated by ;
-added the following shorthands:
$y or $y1 = $y1[-1] and $y2 = $y2[-1]
-new functions:
if - conditional evaluation
cbrt - cube root
erf - error function
erfc - complementary error function
expm1 - exponential minus 1,
log1p - logarithm of 1 plus
isinf - is the value infinite,
finite - is the value finite
isnan -- is the resut a nan (Not a number)
copysign - copy sign of a number
ldexp - multiply floating-point number by integral power of 2
imodf - get signed integral value from floating-point number
modf - get signed fractional value from floating-point number
drem - floating-point remainder function
Thanks to Orm Finnendahl for adding the following functions:
fmod - floating-point remainder function
ceil - ceiling function: smallest integral value not less than argument
floor - largest integral value not greater than argument
------------
New in Version 0.3
-Full function functionality
------------
The object "expr" is used for expression evaluaion of control data.
Expr~ and fexpr~ are extentions to the expr object to work with vectors.
The expr~ object is designed to efficiently combine signal and control
stream processing by vector operations on the basis of the block size of
the environment.
fexpr~ object provides a flexible mechanism for building FIR and
IIR filters by evaluating expressions on a sample by sample basis
and providing access to prior samples of the input and output audio
streams. When fractional offset is used, fexpr~ uses linear interpolation
to determine the value of the indexed sample. fexpr~ evaluates the
expression for every single sample and at every evaluation previous
samples (limited by the audio vector size) can be accessed. $x is used to
denote a singnal input whose samples we would like to access. The syntax
is $x followed by the inlet number and indexed by brackets, for example
$x1[-1] specifies the previous sample of the first inlet. Therefore,
if we are to build a simple filter which replaces every sample by
the average of that sample and its previous one, we would use "fexpr~
($x1[0]+$x1[-1])/2 ". For ease of when the brackets are omitted, the
current sample is implied, so we can right the previous filter expression
as follows: " fexpr~ ($x1+$x1[-1])/2". To build IIR filters $y is used
to access the previous samples of the output stream.
The three objects expr, expr~, and fexpr~ are implemented in the same object
so the files expr~.pd_linux and fexpr~.pd_linux are links to expr.pd_linux
This release has been compiled and tested on Linux 6.0.
--------
Here are some syntax information: (refer to help-expr.pd for examples)
Syntyax:
The syntax is very close to how expression are written in
C. Variables are specified as follows where the '#' stands
for the inlet number:
$i#: integer input variable
$f#: float input variable
$s#: symbol input variable
Used for expr~ only:
$v#: signal (vector) input (vector by vector evaluation)
Used for fexpr~ only:
$x#[n]: the sample from inlet # indexed by n, where n has to
satisfy 0 => n >= -vector size,
($x# is a shorthand for $x#[0], specifying the current sample)
$y#[n]: the output value indexed by n, where n has to
satisfy 0 > n >= -vector size,
$y[n] is a shorthand for $y1[n]
I'll appreciate hearing about bugs, comments, suggestions, ...
Shahrokh Yadegari (sdy(a)ucsd.edu)
7/10/02
--- NEW FILE: vexp.h ---
/*
* jMax
* Copyright (C) 1994, 1995, 1998, 1999 by IRCAM-Centre Georges Pompidou, Paris, France.
*
* 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 2
* of the License, or (at your option) any later version.
*
* See file LICENSE for further informations on licensing terms.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* Based on Max/ISPW by Miller Puckette.
*
* Authors: Maurizio De Cecco, Francois Dechelle, Enzo Maggi, Norbert Schnell.
*
*/
/* "expr" was written by Shahrokh Yadegari c. 1989. -msp */
/* "expr~" and "fexpr~" conversion by Shahrokh Yadegari c. 1999,2000 */
#define MSP
#ifdef PD
#undef MSP
#endif
#ifdef PD
#include "m_pd.h"
#else /* MSP */
#include "ext.h"
#include "z_dsp.h"
#endif
#include "fts_to_pd.h"
/* This is put in fts_to_pd.h
#ifdef MSP
#define t_atom Atom
#define t_symbol Symbol
#define pd_new(x) newobject(x);
#define t_outlet void
#endif
*/
/*
* Currently the maximum number of variables (inlets) that are supported
* is 10.
*/
#define MAX_VARS 9
#define MINODES 10 /* was 200 */
/* terminal defines */
/*
* operations
* (x<<16|y) x defines the level of precedence,
* the lower the number the lower the precedence
* separators are defines as operators just for convenience
*/
#define OP_SEMI ((long)(1<<16|1)) /* ; */
#define OP_COMMA ((long)(2<<16|2)) /* , */
#define OP_LOR ((long)(3<<16|3)) /* || */
#define OP_LAND ((long)(4<<16|4)) /* && */
#define OP_OR ((long)(5<<16|5)) /* | */
#define OP_XOR ((long)(6<<16|6)) /* ^ */
#define OP_AND ((long)(7<<16|7)) /* & */
#define OP_NE ((long)(8<<16|8)) /* != */
#define OP_EQ ((long)(8<<16|9)) /* == */
#define OP_GE ((long)(9<<16|10)) /* >= */
#define OP_GT ((long)(9<<16|11)) /* > */
#define OP_LE ((long)(9<<16|12)) /* <= */
#define OP_LT ((long)(9<<16|13)) /* < */
#define OP_SR ((long)(10<<16|14)) /* >> */
#define OP_SL ((long)(10<<16|15)) /* << */
#define OP_SUB ((long)(11<<16|16)) /* - */
#define OP_ADD ((long)(11<<16|17)) /* + */
#define OP_MOD ((long)(12<<16|18)) /* % */
#define OP_DIV ((long)(12<<16|19)) /* / */
#define OP_MUL ((long)(12<<16|20)) /* * */
#define OP_UMINUS ((long)(13<<16|21)) /* - unary minus */
#define OP_NEG ((long)(13<<16|22)) /* ~ one complement */
#define OP_NOT ((long)(13<<16|23)) /* ! */
#define OP_RB ((long)(14<<16|24)) /* ] */
#define OP_LB ((long)(14<<16|25)) /* [ */
#define OP_RP ((long)(14<<16|26)) /* ) */
#define OP_LP ((long)(14<<16|27)) /* ( */
#define OP_STORE ((long)(15<<16|28)) /* = */
#define HI_PRE ((long)(100<<16)) /* infinite precedence */
#define PRE_MASK ((long)0xffff0000) /* precedence level mask */
struct ex_ex;
#define name_ok(c) (((c)=='_') || ((c)>='a' && (c)<='z') || \
((c)>='A' && (c)<='Z') || ((c) >= '0' && (c) <= '9'))
#define unary_op(x) ((x) == OP_NOT || (x) == OP_NEG || (x) == OP_UMINUS)
struct ex_ex {
union {
long v_int;
float v_flt;
t_float *v_vec; /* this is an for allocated vector */
long op;
char *ptr;
} ex_cont; /* content */
#define ex_int ex_cont.v_int
#define ex_flt ex_cont.v_flt
#define ex_vec ex_cont.v_vec
#define ex_op ex_cont.op
#define ex_ptr ex_cont.ptr
long ex_type; /* type of the node */
};
#define exNULL ((struct ex_ex *)0)
/* defines for ex_type */
#define ET_INT 1 /* an int */
#define ET_FLT 2 /* a float */
#define ET_OP 3 /* operator */
#define ET_STR 4 /* string */
#define ET_TBL 5 /* a table, the content is a pointer */
#define ET_FUNC 6 /* a function */
#define ET_SYM 7 /* symbol ("string") */
#define ET_VSYM 8 /* variable symbol ("$s?") */
/* we treat parenthesis and brackets */
/* special to keep a pointer to their */
/* match in the content */
#define ET_LP 9 /* left parenthesis */
#define ET_LB 10 /* left bracket */
#define ET_II 11 /* and integer inlet */
#define ET_FI 12 /* float inlet */
#define ET_SI 13 /* string inlet */
#define ET_VI 14 /* signal inlet */
#define ET_VEC 15 /* allocated signal vector */
/* special types for fexpr~ */
#define ET_YO 16 /* vector output for fexpr~ */
#define ET_YOM1 17 /* shorthand for $y?[-1] */
#define ET_XI 18 /* vector input for fexpr~ */
#define ET_XI0 20 /* shorthand for $x?[0] */
#define ET_VAR 21 /* variable */
/* defines for ex_flags */
#define EF_TYPE_MASK 0x07 /* first three bits define the type of expr */
#define EF_EXPR 0x01 /* expr - control in and out */
#define EF_EXPR_TILDE 0x02 /* expr~ signal and control in, signal out */
#define EF_FEXPR_TILDE 0x04 /* fexpr~ filter expression */
#define EF_STOP 0x08 /* is it stopped used for expr~ and fexpr~ */
#define EF_VERBOSE 0x10 /* verbose mode */
#define IS_EXPR(x) ((((x)->exp_flags&EF_TYPE_MASK)|EF_EXPR) == EF_EXPR)
#define IS_EXPR_TILDE(x) \
((((x)->exp_flags&EF_TYPE_MASK)|EF_EXPR_TILDE)==EF_EXPR_TILDE)
#define IS_FEXPR_TILDE(x) \
((((x)->exp_flags&EF_TYPE_MASK)|EF_FEXPR_TILDE)==EF_FEXPR_TILDE)
#define SET_EXPR(x) (x)->exp_flags |= EF_EXPR; \
(x)->exp_flags &= ~EF_EXPR_TILDE; \
(x)->exp_flags &= ~EF_FEXPR_TILDE;
#define SET_EXPR_TILDE(x) (x)->exp_flags &= ~EF_EXPR; \
(x)->exp_flags |= EF_EXPR_TILDE; \
(x)->exp_flags &= ~EF_FEXPR_TILDE;
#define SET_FEXPR_TILDE(x) (x)->exp_flags &= ~EF_EXPR; \
(x)->exp_flags &= ~EF_EXPR_TILDE; \
(x)->exp_flags |= EF_FEXPR_TILDE;
/*
* defines for expr_error
*/
#define EE_DZ 0x01 /* divide by zero error */
#define EE_BI_OUTPUT 0x02 /* Bad output index */
#define EE_BI_INPUT 0x04 /* Bad input index */
#define EE_NOTABLE 0x08 /* NO TABLE */
#define EE_NOVAR 0x10 /* NO VARIABLE */
typedef struct expr {
#ifdef PD
t_object exp_ob;
#else /* MSP */
t_pxobject exp_ob;
#endif
int exp_flags; /* are we expr~, fexpr~, or expr */
int exp_error; /* reported errors */
int exp_nexpr; /* number of expressions */
char *exp_string; /* the full expression string */
char *exp_str; /* current parsing position */
t_outlet *exp_outlet[MAX_VARS];
#ifdef PD
struct _exprproxy *exp_proxy;
#else /* MAX */
void *exp_proxy[MAX_VARS];
long exp_proxy_id;
#endif
struct ex_ex *exp_stack[MAX_VARS];
struct ex_ex exp_var[MAX_VARS];
struct ex_ex exp_res[MAX_VARS]; /* the evluation result */
t_float *exp_p_var[MAX_VARS];
t_float *exp_p_res[MAX_VARS]; /* the previous evaluation result */
t_float *exp_tmpres[MAX_VARS]; /* temporty result for fexpr~ */
int exp_vsize; /* the size of the signal vector */
int exp_nivec; /* # of vector inlets */
float exp_f; /* control value to be transformed to signal */
} t_expr;
typedef struct ex_funcs {
char *f_name; /* function name */
void (*f_func)(t_expr *, long, struct ex_ex *, struct ex_ex *);
/* the real function performing the function (void, no return!!!) */
long f_argc; /* number of arguments */
} t_ex_func;
/* function prototypes for pd-related functions called withing vexp.h */
extern int max_ex_tab(struct expr *expr, t_symbol *s, struct ex_ex *arg, struct ex_ex *optr);
extern int max_ex_var(struct expr *expr, t_symbol *s, struct ex_ex *optr);
extern int ex_getsym(char *p, t_symbol **s);
extern const char *ex_symname(t_symbol *s);
void ex_mkvector(t_float *fp, t_float x, int size);
extern void ex_size(t_expr *expr, long int argc, struct ex_ex *argv,
struct ex_ex *optr);
extern void ex_sum(t_expr *expr, long int argc, struct ex_ex *argv, struct ex_ex *optr);
extern void ex_Sum(t_expr *expr, long int argc, struct ex_ex *argv, struct ex_ex *optr);
extern void ex_avg(t_expr *expr, long int argc, struct ex_ex *argv, struct ex_ex *optr);
extern void ex_Avg(t_expr *expr, long int argc, struct ex_ex *argv, struct ex_ex *optr);
extern void ex_store(t_expr *expr, long int argc, struct ex_ex *argv, struct ex_ex *optr);
int value_getonly(t_symbol *s, t_float *f);
#ifdef NT
#pragma warning (disable: 4305 4244)
#define abort ABORT
void ABORT(void);
#endif
[View Less]
Update of /cvsroot/pure-data/externals/signal/bonk~
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv26382/signal/bonk~
Added Files:
bonk~.c help-bonk~.pd
Log Message:
dropped in goodie bag
--- NEW FILE: bonk~.c ---
/* Copyright 1997-1999 Miller Puckette (msp(a)ucsd.edu) and Ted Apel
(tapel(a)ucsd.edu). Permission is granted to use this software for any
noncommercial purpose. For commercial licensing please contact the UCSD
Technology Transfer Office.
THE AUTHORS AND THEIR EMPLOYERS …
[View More]MAKE NO WARRANTY, EXPRESS OR IMPLIED,
IN CONNECTION WITH THIS SOFTWARE!
*/
#include <math.h>
#include <stdio.h>
#ifdef NT
#pragma warning (disable: 4305 4244)
#endif
#ifdef MSP
#include "ext.h"
[...1044 lines suppressed...]
/* get current system time */
double clock_getsystime()
{
return gettime();
}
/* elapsed time in milliseconds since the given system time */
double clock_gettimesince(double prevsystime)
{
return ((gettime() - prevsystime));
}
float qrsqrt(float f)
{
return 1/sqrt(f);
}
#endif /* MSP */
--- NEW FILE: help-bonk~.pd ---
#N canvas 107 94 958 626 10;
#X obj 320 579 print;
#X floatatom 314 501 0 0 0;
#X obj 320 549 spigot;
#X msg 314 471 0;
#X msg 351 471 1;
#X msg 442 427 bang;
#X obj 429 518 bonk~;
#X msg 442 244 learn 1;
#X msg 442 304 learn 0;
#X msg 437 486 print;
#X obj 390 467 adc~;
#X text 320 597 cooked;
#X msg 565 76 \; pd dsp 1;
#X obj 257 579 print;
#X floatatom 251 501 0 0 0;
#X obj 257 549 spigot;
#X msg 251 471 0;
#X msg 282 471 1;
#X text 257 597 raw;
#N canvas 366 126 600 400 synth 0;
#X obj 112 24 r bonk-cooked;
#X obj 112 49 unpack;
#X obj 112 99 * 12;
#X obj 112 124 div 7;
#X obj 112 74 + 1;
#X obj 112 174 mtof;
#X obj 112 224 osc~;
#X obj 112 249 cos~;
#X obj 112 149 + 47;
#X obj 209 247 line~;
#X obj 209 272 *~;
#X obj 209 297 lop~ 500;
#X obj 112 274 *~;
#X obj 103 361 dac~;
#X obj 253 165 dbtorms;
#X obj 253 115 * 0.5;
#X obj 253 140 + 50;
#X obj 211 189 f;
#X msg 173 159 bang;
#X obj 258 83 inlet;
#X obj 111 307 hip~ 5;
#X msg 34 24 0 60;
#X obj 112 199 sig~;
#X msg 209 222 \$1 \, 0 200;
#X connect 0 0 1 0;
#X connect 1 0 4 0;
#X connect 2 0 3 0;
#X connect 3 0 8 0;
#X connect 4 0 2 0;
#X connect 5 0 18 0;
#X connect 5 0 22 0;
#X connect 6 0 7 0;
#X connect 7 0 12 0;
#X connect 8 0 5 0;
#X connect 9 0 10 0;
#X connect 9 0 10 1;
#X connect 10 0 11 0;
#X connect 11 0 12 1;
#X connect 12 0 20 0;
#X connect 14 0 17 1;
#X connect 15 0 16 0;
#X connect 16 0 14 0;
#X connect 17 0 23 0;
#X connect 18 0 17 0;
#X connect 19 0 15 0;
#X connect 20 0 13 1;
#X connect 20 0 13 0;
#X connect 21 0 1 0;
#X connect 22 0 6 0;
#X connect 23 0 9 0;
#X restore 804 86 pd synth;
#X obj 454 549 s bonk-cooked;
#X floatatom 804 63 0 0 0;
#X msg 804 33 0;
#X msg 442 274 learn 10;
#X msg 442 334 forget;
#X msg 442 364 write templates.txt;
#X msg 442 394 read templates.txt;
#X msg 835 33 90;
#X msg 442 120 thresh 6 50;
#X text 8 70 The Bonk object takes an audio signal input and looks
for "attacks" defined as sharp changes in the spectral envelope of
the incoming sound. Optionally \, and less reliably \, you can have
Bonk check the attack against a collection of stored templates to try
to guess which of two or more instruments was hit. Bonk is described
theoretically in the 1998 ICMC proceedings \, reprinted on http://man104nfs.ucsd.edu/~mpuckett.
;
#X text 470 70 click here;
#X text 471 83 to start DSP;
#X text 8 191 Bonk's two outputs are the raw spectrum of the attack
(provided as a list of 11 numbers giving the signal "loudness" in the
11 frequency bands used) \, and the "cooked" output which gives only
an instrument number (counting up from zero) and a "velocity". The
instrumnent number is significant only if Bonk has a "template set"
in memory.;
#X text 8 368 In this patch \, after starting DSP \, you can print
out the raw or cooked output using the two "spigots" or listen to a
synthesizer output by raising its volume.;
#X text 259 448 enable printout;
#X text 705 32 output volume;
#X text 719 50 (0-100);
#X text 533 118 Set low and high thresholds. Signal growth must exceed
the high one and then fall to the low one to make an attack.;
#X text 533 151 Minimum velocity to output (quieter notes are ignored.)
;
#X msg 442 180 mask 4 0.7;
#X msg 442 214 debounce 0;
#X text 8 299 Bonk's analysis is carried out on a 256-point window
(6 msec at 44.1 kHz) and by default the analysis period is 128 samples.
The analysis period can be specified as Bonk's creation argument but
must be a multiple of 64;
#X text 532 219 Minimum time (msec) between attacks;
#X text 532 170 Describes how energy in each frequency band masks later
energy in the band. Here the masking is total for 4 analysis periods
and then drops by 0.7 each period.;
#X text 530 244 Forget all templates and start learning new ones. The
argument gives the number of times you will hit each instrument (10
recommended.) Turn on the output volume above for audible feedback
as you train Bonk. "Learn 0" exits learn mode.;
#X text 530 328 Forget the last template. In Learn mode \, use "forget"
to erase and record over a template.;
#X text 595 368 Write templates to a file in text-editable format.
;
#X text 596 398 Read templates from a file.;
#X text 538 493 Print out all settings and templates.;
#X msg 442 150 minvel 10;
#X text 538 426 Poll the current spectrum via "raw" outlet \, You can
set a very high threshold if you don't want attacks mixed in.;
#X text 218 12 BONK - an attack detector for small percussion instruments
;
#X msg 634 517 print;
#X msg 437 456 debug 0;
#X text 538 466 turn debugging on or off.;
#X connect 1 0 2 1;
#X connect 2 0 0 0;
#X connect 3 0 1 0;
#X connect 4 0 1 0;
#X connect 5 0 6 0;
#X connect 6 0 15 0;
#X connect 6 1 2 0;
#X connect 6 1 20 0;
#X connect 7 0 6 0;
#X connect 8 0 6 0;
#X connect 9 0 6 0;
#X connect 10 0 6 0;
#X connect 14 0 15 1;
#X connect 15 0 13 0;
#X connect 16 0 14 0;
#X connect 17 0 14 0;
#X connect 21 0 19 0;
#X connect 22 0 21 0;
#X connect 23 0 6 0;
#X connect 24 0 6 0;
#X connect 25 0 6 0;
#X connect 26 0 6 0;
#X connect 27 0 21 0;
#X connect 28 0 6 0;
#X connect 39 0 6 0;
#X connect 40 0 6 0;
#X connect 49 0 6 0;
#X connect 53 0 6 0;
[View Less]
Update of /cvsroot/pure-data/externals/control/choice
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv26382/control/choice
Added Files:
choice.c help-choice.pd
Log Message:
dropped in goodie bag
--- NEW FILE: choice.c ---
/* choice -- match incoming list against a collection of stored templates. */
/* Copyright 1999 Miller Puckette.
Permission is granted to use this software for any purpose provided you
keep this copyright notice intact.
THE AUTHOR AND HIS EMPLOYERS MAKE NO …
[View More]WARRANTY, EXPRESS OR IMPLIED,
IN CONNECTION WITH THIS SOFTWARE.
This file is downloadable from http://www.crca.ucsd.edu/~msp .
*/
#include "m_pd.h"
#include <math.h>
static t_class *choice_class;
#define DIMENSION 10
typedef struct _elem
{
float e_age;
float e_weight[DIMENSION];
} t_elem;
typedef struct _choice
{
t_object x_obj;
t_elem *x_vec;
int x_n;
int x_nonrepeat;
} t_choice;
static void *choice_new(t_float fnonrepeat)
{
t_choice *x = (t_choice *)pd_new(choice_class);
outlet_new(&x->x_obj, gensym("float"));
x->x_vec = (t_elem *)getbytes(0);
x->x_n = 0;
x->x_nonrepeat = (fnonrepeat != 0);
return (x);
}
static void choice_clear(t_choice *x)
{
x->x_vec = (t_elem *)resizebytes(x->x_vec, x->x_n * sizeof(t_elem), 0);
x->x_n = 0;
}
static void choice_print(t_choice *x)
{
int j;
for (j = 0; j < x->x_n; j++)
{
t_elem *e = x->x_vec + j;
t_float *w = e->e_weight;
post("%2d age %2d \
w %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f",
j, (int)(e->e_age), w[0], w[1], w[2], w[3], w[4], w[5],
w[6], w[7], w[8], w[9]);
}
}
static void choice_add(t_choice *x, t_symbol *s, int argc, t_atom *argv)
{
int oldn = x->x_n, newn = oldn + 1, i;
t_elem *e;
float sum, normal;
x->x_vec = (t_elem *)resizebytes(x->x_vec, oldn * sizeof(t_elem),
newn * sizeof(t_elem));
x->x_n = newn;
e = x->x_vec + oldn;
e->e_age = 2;
for (i = 0, sum = 0; i < DIMENSION; i++)
{
float f = atom_getfloatarg(i, argc, argv);
e->e_weight[i] = f;
sum += f*f;
}
normal = (float)(sum > 0 ? 1./sqrt(sum) : 1);
for (i = 0; i < DIMENSION; i++)
e->e_weight[i] *= normal;
}
static void choice_list(t_choice *x, t_symbol *s, int argc, t_atom *argv)
{
int i, j;
float bestsum = 0;
int bestindex = -1;
t_float invec[DIMENSION];
for (i = 0; i < DIMENSION; i++)
invec[i] = atom_getfloatarg(i, argc, argv);
for (j = 0; j < x->x_n; j++)
{
t_elem *e = x->x_vec + j;
float sum;
for (i = 0, sum = 0; i < DIMENSION; i++)
sum += e->e_weight[i] * invec[i];
if (x->x_nonrepeat) sum *= (float)(log(e->e_age));
if (sum > bestsum)
{
bestsum = sum;
sum = 1;
bestindex = j;
}
}
if (bestindex >= 0)
{
for (j = 0; j < x->x_n; j++)
x->x_vec[j].e_age += 1.;
x->x_vec[bestindex].e_age = 1;
}
outlet_float(x->x_obj.ob_outlet, (float)bestindex);
}
static void choice_free(t_choice *x)
{
freebytes(x->x_vec, x->x_n * sizeof(t_elem));
}
void choice_setup(void)
{
choice_class = class_new(gensym("choice"), (t_newmethod)choice_new,
(t_method)choice_free, sizeof(t_choice), 0, A_DEFFLOAT, 0);
class_addmethod(choice_class, (t_method)choice_add, gensym("add"), A_GIMME, 0);
class_addmethod(choice_class, (t_method)choice_clear, gensym("clear"), 0);
class_addmethod(choice_class, (t_method)choice_print, gensym("print"), 0);
class_addlist(choice_class, choice_list);
}
--- NEW FILE: help-choice.pd ---
#N canvas 16 5 609 600 12;
#X obj 8 195 choice;
#X msg 41 86 print;
#X msg 29 63 clear;
#X msg 8 34 add 1 0 0 \, add 0 1 0 \, add 0 0 1 \, add 1 1 1 \, add
1 1 0;
#X obj 77 171 pack 0 0 0;
#X floatatom 182 125 0 0 0 0 - - -;
#X floatatom 148 125 0 0 0 0 - - -;
#X floatatom 115 125 0 0 0 0 - - -;
#X obj 77 147 f;
#X msg 77 125 bang;
#X floatatom 8 216 0 0 0 0 - - -;
#X obj 71 196 choice 1;
#X floatatom 71 217 0 0 0 0 - - -;
#X obj 76 4 choice;
#X text 135 3 - search for a best match to an incoming list;
#X text 19 243 The choice object holds a list of vectors \, each having
up to ten elements. When sent a list of numbers \, it outputs the index
of the known vector that matches most closely. The quality of the match
is the dot product of the two vectors after normalizing them \, i.e.
\, the vector whose direction is closest to that of the input wins.
;
#X text 19 340 If given a nonzero creation argument \, choice tries
to avoid repetitious outputs by weighting less recently output vectors
preferentially.;
#X text 20 389 You can use this to choose interactively between a number
of behaviors depending on their attributes. For example \, you might
have stored a number of melodies \, of which some are syncopated \,
some chromatic \, some are more than 100 years old \, some are bugle
calls \, and some are Christmas carols. You could then ask to find
a syncopated bugle call (1 \, 0 \, 0 \, 1 \, 0) and you'll get the
thing most closely matching the request.;
#X text 19 514 You can use numbers other than 0 and 1 to indicate relative
strengths of the attributes \, or even use negative numbers to indicate
opposites \, either in the incoming lists or in the stored ones.;
#X text 320 572 updated for Pd version-0.30;
#X text 79 62 delete all stored vectors;
#X text 498 34 add vectors;
#X text 94 84 debugging printout;
#X text 69 104 tweak the numbers and hit "bang" to input a list;
#X text 151 197 creation argument to avoid repeated outout;
#X text 108 219 output is the index of best match \, counting from
zero;
#X connect 0 0 10 0;
#X connect 1 0 0 0;
#X connect 2 0 0 0;
#X connect 2 0 11 0;
#X connect 3 0 0 0;
#X connect 3 0 11 0;
#X connect 4 0 0 0;
#X connect 4 0 11 0;
#X connect 5 0 4 2;
#X connect 6 0 4 1;
#X connect 7 0 8 1;
#X connect 8 0 4 0;
#X connect 9 0 8 0;
#X connect 11 0 12 0;
[View Less]