Here's another update to the [list-s2l] prototype that uses a character table to try to maximize the chance of finding matching characters early -- on my machines it's cut some of the previous [realtime] measurements by about 80% depending on the message (on my macbook it takes 100 MS to break a symbol with all common ascii characters into its characters) -- but of course it's nowhere near as quick as the zexy object.
I think it's close to usable, especially for short symbols. Anyone wanna try it out?
Matt
On Wed, Nov 18, 2009 at 12:32 AM, Matt Barber brbrofsvl@gmail.com wrote:
OK, here's a [list-s2l] with delimiting. This wasn't easy. =o) Included are all the abstractions needed --
[symbollength] calculates the length of a symbol.
[list-l2f], as yet undocumented, attempts to build a float from an incoming stream of numbers and symbols -- works pretty well.
I tried to get as close as possible to the behavior of zexy [s2l] and [list-l2s] ...
It's probably not fast enough to use in practice, but it would be worth testing with small symbols to find out
If you could test it, I could work out the bugs. I'd take suggestions, of course.
Matt
On Mon, Nov 16, 2009 at 6:22 PM, Matt Barber brbrofsvl@gmail.com wrote:
Hello list,
Attached is a prototype for a vanilla + list-abs [list-s2l]. I have leaned on the side of completeness and error reduction rather than efficiency -- there are many many ways to make this more efficient. Also, it doesn't handle delimiters yet (right now it breaks a symbol into its constituent characters, casting float symbols back to float), but I think I could figure out how to do it.
Neither this nor [list-l2s] handles % appropriately...
I'd appreciate any feedback.
Matt