[PD] OSC in pd canonical (was Re: Re: pure == slow, impure == fast ? was purepd)

[Mathieu Bouchard]

On Mon, 21 Nov 2005, Frank Barknecht wrote:

> No. What is missing in Pd is a "hash" or "map" object, which allows fast
> lookup of data by keyword. Actually also a proper "vector" is missing,
> where one can store and retrieve lists by index number without having to
> traverse the whole vector sequentially.

What should their feature-sets be? Because i don't know what "proper"  
means here. Already existing vector-like things in Pd would be
arrays-of-floats, arrays-of-structs, and lists-of-atoms.

The thing that you need to traverse element-by-element is when you use 
(g)pointers such as with [get] [put] [elem], which is another kind of 
thing called a list.

What would the "hash" or "map" object would do that [pool] doesn't ?

What about Georg Holzmann's PdContainer ?

____________________________________________________________________
Mathieu Bouchard - tél:+1.514.383.3801 - http://artengine.ca/matju
Freelance Digital Arts Engineer, Montréal QC Canada