Re: [PD] Efficient FIFO in Pd: How?

Roman > > > > > Gesendet: Sonntag, 22. November 2015 um 00:24 Uhr > > > Von: "Roman Haefeli" <reduz...@gmail.com> > > > An: Pd-List <pd-list@lists.iem.at> > > > Betreff: [PD] E

Re: [PD] Efficient FIFO in Pd: How?

ich works with lists and also lets you set the priority. >> I'm sure it's also faster than anything one can do with Pd >> objects. >> >> Thanks, somehow I forgot that zexy has that. It is indeed fast >> (as in linear fast). I'm going to use it. >>

Re: [PD] Efficient FIFO in Pd: How?

gt; > > Roman > > > > > >> On Sat, Nov 21, 2015 at 7:52 PM, Roman Haefeli > >> <reduz...@gmail.com> wrote: On Sun, 2015-11-22 at 00:47 +0100, > >> Christof Ressi wrote: > >>> Just in case you don't know: There's the [fifop] object in &

Re: [PD] Efficient FIFO in Pd: How?

ounds interesting to do, but I'm not sure whether I'm going to >>> invest time in it. [fifop] works pretty well for my current use >>> case. >>> >>> Roman >>> >>> >>>> On Sat, Nov 21, 2015 at 7:52 PM, Roman Haefeli >>>> <reduz..

Re: [PD] Efficient FIFO in Pd: How?

​You'd store the number of elements in the list at the first index of a fifo entry and the number of elements in the symbol or float just before the data for each atom -- on read you'd accumulate the atoms of the list and stop. The next index would be the number of elements in the next fifo list

Re: [PD] Efficient FIFO in Pd: How?

Hm, originally I was thinking this:[struct fifo float head float tail array a fifo-datum] [struct fifo-datum float flag float f symbol s] for a fifo of single-atom messages. But for a fifo of Pd messages I'm talking about this:[struct fifo float head float tail array a fifo-datum] [struct

Re: [PD] Efficient FIFO in Pd: How?

On Sun, 2015-11-22 at 16:24 +, Jonathan Wilkes wrote: > Are you trying to add Pd messages to a queue of Pd messages, or create > a fifo > > for atoms? I was/am interested in a FIFO implementation for Pd messages of any size (containing symbols and/or floats). Why are you asking? Do you

Re: [PD] Efficient FIFO in Pd: How?

t; >> <reduz...@gmail.com> wrote: On Sun, 2015-11-22 at 00:47 +0100, > >> Christof Ressi wrote: > >>> Just in case you don't know: There's the [fifop] object in > >> zexy which works with lists and also lets you set the priority. > >> I'm sure it's als

Re: [PD] Efficient FIFO in Pd: How?

I might be reading it wrong, but Matt's description sounds like a way to queue atoms, not Pd messages. With the "text" field of data structures it might be possible to add Pd messages to that design-- that is, you could have a data structure array where each element is a text field.  But Pd is

Re: [PD] Efficient FIFO in Pd: How?

> > An: Pd-List <pd-list@lists.iem.at> > > Betreff: [PD] Efficient FIFO in Pd: How? > > > > Hi all > > > > I'm looking for a way to implement a FIFO buffer in Pd. I'd like it to > > be able enqueue messages with an arbitrary number of elements in order >

Re: [PD] Efficient FIFO in Pd: How?

> > > > Gesendet: Sonntag, 22. November 2015 um 00:24 Uhr > > > Von: "Roman Haefeli" <reduz...@gmail.com> > > > An: Pd-List <pd-list@lists.iem.at> > > > Betreff: [PD] Efficient FIFO in Pd: How? > > > > > > Hi all > > &g

Re: [PD] Efficient FIFO in Pd: How?

I was looking at the help patch for [pipe] the other day, and noticed that there has been a change. I think it was to allow symbols too. (Sorry, can't check on my phone now) On Sunday, November 22, 2015, Roman Haefeli wrote: > Hi all > > I'm looking for a way to implement