[PD] Data Structures: Lower and upper bound for graphical arrays
On a related note, is there a way to limit y for arrays with mutable y? If there'd be a way to detect changes, this would be actually easy to implement. Roman ___ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management - http://lists.puredata.info/listinfo/pd-list
Re: [PD] Data Structures: Lower and upper bound for graphical arrays
From: Roman Haefeli reduz...@gmail.com To: pd-list pd-list@iem.at Sent: Tuesday, June 11, 2013 6:02 AM Subject: [PD] Data Structures: Lower and upper bound for graphical arrays On a related note, is there a way to limit y for arrays with mutable y? If there'd be a way to detect changes, this would be actually easy to implement. There isn't a way to detect changes. But you can limit y with the -y flag of [plot]: [plot -y y(0:100)(0:100) etc.] ___ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management - http://lists.puredata.info/listinfo/pd-list
Re: [PD] Data Structures: Lower and upper bound for graphical arrays
On Die, 2013-06-11 at 08:37 -0700, Jonathan Wilkes wrote: __ From: Roman Haefeli reduz...@gmail.com To: pd-list pd-list@iem.at Sent: Tuesday, June 11, 2013 6:02 AM Subject: [PD] Data Structures: Lower and upper bound for graphical arrays On a related note, is there a way to limit y for arrays with mutable y? If there'd be a way to detect changes, this would be actually easy to implement. There isn't a way to detect changes. But you can limit y with the -y flag of [plot]: [plot -y y(0:100)(0:100) etc.] Ah, that is much more elegant than what seems impossible. Nice, thanks! Roman ___ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management - http://lists.puredata.info/listinfo/pd-list
