Dan Nigrin

I currently store data in rows of a coll; the first value is 0 or 1 (representing Off or On). For each "On" coll row, the second value is the "distance" until the next On row. For each "Off" row, the second value is zero. The distance of the last On row is computed to be the distance until (# rows + 1). Here's an example:

In my app, the values of each row change from On to Off and vice versa frequently. Currently, if row N's value is changed, I first march backwards from N until I find the previous On row, and recompute its new distance. Then, if N got turned On, I march forward from N until I find the next On row (or end of rows) to compute its distance.

So now my question - is there an object (maybe one of Jitter's matrix objects?) that could keep track of and update these distances for me, instead of me using my manual method above?

I currently store data in rows of a coll; the first value is 0 or 1 (representing Off or On). For each "On" coll row, the second value is the "distance" until the next On row.  For each "Off" row, the second value is zero.  The distance of the last On row is computed to be the distance until (# rows + 1).  Here's an example:

In my app, the values of each row change from On to Off and vice versa frequently.  Currently,  if row N's value is changed, I first march backwards from N until I find the previous On row, and recompute its new distance.  Then, if N got turned On, I march forward from N until I find the next On row (or end of rows) to compute its distance.

computing-distance-to-neighbors

i am sorry I do not have a sollution for ya, ~Just want to support your problem. I have similar difficulties with max's matrices and list generators en coll/store objects. There should be more versatile matrix objects for more systematic algorithmic matrix and coll- "filling" so to speak.

Can anyone at cycling 74 support this? Let's ask for help onthis one....

i am sorry I do not have a sollution for ya, ~Just want to support your problem. I have similar difficulties with max's matrices and list generators en coll/store objects. There should be more versatile matrix objects for more systematic algorithmic matrix and coll- "filling" so to speak.
Can anyone at cycling 74 support this? Let's ask for help onthis one....

Why not use some of the other capabilities available for max/msp? 

java/javascript/rtcmix/maxlisp/peter-elsea's stuff/peter castine's

Some things just don't work well using a dataflow/event-driven

> i am sorry I do not have a sollution for ya, ~Just want to

> support your problem. I have similar difficulties with max's

> matrices and list generators en coll/store objects. There should

> be more versatile matrix objects for more systematic algorithmic

> matrix and coll- "filling" so to speak.

> Can anyone at cycling 74 support this? Let's ask for help onthis

Why not use some of the other capabilities available for max/msp? 
java/javascript/rtcmix/maxlisp/peter-elsea's stuff/peter castine's
stuff/etc.

Some things just don't work well using a dataflow/event-driven
approach.

>
> Hi there,
>
> i am sorry I do not have a sollution for ya, ~Just want to
> support your problem. I have similar difficulties with max's
> matrices and list generators en coll/store objects. There should
> be more versatile matrix objects for more systematic algorithmic
> matrix and coll- "filling" so to speak.
> Can anyone at cycling 74 support this? Let's ask for help onthis
> one....
>
> Doppio
>


thanks Brad - I'm certainly game for either Java or better still 

Javascript, but I don't know either well enough to understand whether 

they offer me what I'm looking for. Can you point me in a direction?

At 12:34 PM -0400 7/16/07, garton@columbia.edu wrote:

>Why not use some of the other capabilities available for max/msp?

>java/javascript/rtcmix/maxlisp/peter-elsea's stuff/peter castine's

>Some things just don't work well using a dataflow/event-driven

202 Hack / PC-1600 User / VSTi Host / OMS Convert / Jack OS X / Major 

thanks Brad - I'm certainly game for either Java or better still 
Javascript, but I don't know either well enough to understand whether 
they offer me what I'm looking for.  Can you point me in a direction?

At 12:34 PM -0400 7/16/07, garton@columbia.edu wrote:
>Why not use some of the other capabilities available for max/msp?
>java/javascript/rtcmix/maxlisp/peter-elsea's stuff/peter castine's
>stuff/etc.
>
>Some things just don't work well using a dataflow/event-driven
>approach.
>
>brad
>http://music.columbia.edu/~brad

-- 
Dan Nigrin
Defective Records
202 Hack / PC-1600 User / VSTi Host / OMS Convert / Jack OS X / Major 
Malfunction
http://www.defectiverecords.com
http://www.jackosx.com


if i were you, i 'd use the FTM library to do this sort of computation.

Thanks for the suggestion Guillaume. Having never looked at FTM 

before though, and just glancing now, it seems non-trivial to get 

At 11:07 AM -0600 7/16/07, guillaume wrote:

>if i were you, i 'd use the FTM library to do this sort of computation.

Thanks for the suggestion Guillaume.  Having never looked at FTM 
before though, and just glancing now, it seems non-trivial to get 
started...  I will try though, thanks.

At 11:07 AM -0600 7/16/07, guillaume wrote:
>hi
>
>if i were you, i 'd use the FTM library to do this sort of computation.
>
>g
>--
>GE
>http://ge.lib.free.fr/

Also, if you're going to get into something like this heavily, I'd 

recommend checking into MySQL or another database language. Handy 

things like last_insert_id OR SELECT max(id) WHERE inputType = 0. 

There's definitely a way of writing a procedure that will do this in a 

flash. Though there's some overhead in learning MySQL, it definitely 

pays off for large data management problems. (depends on the size of 

Also, if you're going to get into something like this heavily, I'd 
recommend checking into MySQL or another database language.  Handy 
things like last_insert_id OR SELECT max(id) WHERE inputType = 0.  
There's definitely a way of writing a procedure that will do this in a 
flash.  Though there's some overhead in learning MySQL, it definitely 
pays off for large data management problems.  (depends on the size of 
your problem though...)

Thanks Peter, that's a good idea too. My application is one that's 

very dependent on speed though, and so am a little nervous about the 

overhead of a database-based approach. Still, I know enough SQL to 

At 3:48 PM -0400 7/16/07, Peter McCulloch wrote:

>Also, if you're going to get into something like this heavily, I'd 

>recommend checking into MySQL or another database language. Handy 

>things like last_insert_id OR SELECT max(id) WHERE inputType = 0. 

>There's definitely a way of writing a procedure that will do this in 

>a flash. Though there's some overhead in learning MySQL, it 

>definitely pays off for large data management problems. (depends on 

Thanks Peter, that's a good idea too.  My application is one that's 
very dependent on speed though, and so am a little nervous about the 
overhead of a database-based approach.  Still, I know enough SQL to 
give the idea a try though.

At 3:48 PM -0400 7/16/07, Peter McCulloch wrote:
>Also, if you're going to get into something like this heavily, I'd 
>recommend checking into MySQL or another database language.  Handy 
>things like last_insert_id OR SELECT max(id) WHERE inputType = 0. 
>There's definitely a way of writing a procedure that will do this in 
>a flash.  Though there's some overhead in learning MySQL, it 
>definitely pays off for large data management problems.  (depends on 
>the size of your problem though...)
>
>Peter McCulloch
>www.petermcculloch.com
>

I suppose the retrieval speed for MySQL is potentially an issue. I've 

not used it with Max (OSX 10.3.9...ah, well), but the performance has 

been fine for me within a Java application that I'm writing. You can 

set priority for the update statements, and since everything you're 

doing is numbers, things should run pretty quick.

If it's not absolutely gigantor, you could even do it in Java. There's 

the nice COLT package out there for high performance matrix computing. 

The transition from Max to Java and back is probably more of a speed 

hit than the Java computation in that case.

I suppose the retrieval speed for MySQL is potentially an issue. I've 
not used it with Max (OSX 10.3.9...ah, well), but the performance has 
been fine for me within a Java application that I'm writing.  You can 
set priority for the update statements, and since everything you're 
doing is numbers, things should run pretty quick.

If it's not absolutely gigantor, you could even do it in Java.  There's 
the nice COLT package out there for high performance matrix computing.  
The transition from Max to Java and back is probably more of a speed 
hit than the Java computation in that case.

this does not help you, Dan, but recently i switched

to [text] instead of coll whenever i dont need to

this does not help you, Dan, but recently i switched
to [text] instead of coll whenever i dont need to
sort by index or things like that.


Thanks Peter, I'll look at that stuff. Re: # rows, not a lot - 

At 12:36 AM -0400 7/17/07, Peter McCulloch wrote:

>I suppose the retrieval speed for MySQL is potentially an issue. 

>I've not used it with Max (OSX 10.3.9...ah, well), but the 

>performance has been fine for me within a Java application that I'm 

>writing. You can set priority for the update statements, and since 

>everything you're doing is numbers, things should run pretty quick.

>If it's not absolutely gigantor, you could even do it in Java. 

>There's the nice COLT package out there for high performance matrix 

>computing. The transition from Max to Java and back is probably 

>more of a speed hit than the Java computation in that case.

Thanks Peter, I'll look at that stuff.  Re: # rows, not a lot - 
maximum would be 64.

At 12:36 AM -0400 7/17/07, Peter McCulloch wrote:
>I suppose the retrieval speed for MySQL is potentially an issue. 
>I've not used it with Max (OSX 10.3.9...ah, well), but the 
>performance has been fine for me within a Java application that I'm 
>writing.  You can set priority for the update statements, and since 
>everything you're doing is numbers, things should run pretty quick.
>
>If it's not absolutely gigantor, you could even do it in Java. 
>There's the nice COLT package out there for high performance matrix 
>computing.  The transition from Max to Java and back is probably 
>more of a speed hit than the Java computation in that case.
>
>How many rows are you looking at?
>
>Peter McCulloch

At 11:45 PM -0600 7/16/07, Roman Thilenius wrote:

>this does not help you, Dan, but recently i switched

>to [text] instead of coll whenever i dont need to

At 11:45 PM -0600 7/16/07, Roman Thilenius wrote:
>this does not help you, Dan, but recently i switched
>to [text] instead of coll whenever i dont need to
>sort by index or things like that.

computing distance to neighbors