[PD] "prev" for Data Structures?

Miller Puckette mpuckett at imusic1.ucsd.edu
Mon Apr 14 23:33:24 CEST 2008

Horribly unfeasible -- the data are stored as a singly linked list.
Going back would require searching forward from the beginning.


On Mon, Apr 14, 2008 at 11:36:13AM -0700, Luke Iannini (pd) wrote:
> Hi all,
> How feasible would a "prev" message to [pointer] be (naturally, this
> would be the complement to the "next" message, outputting the previous
> pointer in the list)?
> I'm very keen to make a "scrubbable" sequencer that can be driven by
> [line]s rather than the usual [del]-based arrangement, but my current
> method of just dumping the entire data-structure on every tick and
> searching for elements whose x-value matches the current time requires
> twice the CPU I have available.
> I thought about mirroring the data-structure and traversing one or the
> other depending on direction, but I think this will get untenable
> quickly.
> Cheers
> Luke
> _______________________________________________
> PD-list at iem.at mailing list
> UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list

More information about the Pd-list mailing list