p.j.e.batchelor@gmail.com

I'm trying to use [funbuff] as (what I thought might be) an efficient way of having multiple abstractions reading from the same table simultaneously (they're reading constantly at about 20ms intervals, so they'll be quite busy!). But I'm getting some peculiar results and wonder whether anyone has any ideas why.

I'm attempting this because I rather assumed that having multiple instances of the same table (again, being read repeatedly and rapidly) in several abstractions is going to be a memory/cpu drain. But perhaps I'm wrong.

Any thoughts/advice/alternatives would be much appreciated.

I'm attempting this because I rather assumed that having multiple instances of the same table (again, being read repeatedly and rapidly) in several abstractions is going to be a memory/cpu drain. But perhaps I'm wrong. 

funbuff-peculiarity

It seems, but I'm not sure, that funbuff doesn't deal well with inverted function.

I presume that funbuff and table pretty much in the same way refer to the same location in memory in order to retrieve values. This then would be comparable to how buffer~ and several peek~ objects would work. On the other hand, doing interpolation, funbuff will have to do a number of operations on each retrieval. My hunch is that cpu wise it is better to go for table.

Quote:I'm attempting this because I rather assumed that having multiple instances of the same table (again, being read repeatedly and rapidly) in several abstractions is going to be a memory/cpu drain. But perhaps I'm wrong.

OK. Then I'll go with table. Many thanks, Johan.

OK. Then I'll go with table. Many thanks, Johan.
pete.


[funbuff] peculiarity