shilling for my feature request 
gizmotron at earthlink.net
Fri Aug 20 13:27:08 EDT 2004
I finally found what I was looking for in the basic core for all my
pull-parser needs. With the help of those at Run Rev this was found:
This is exactly what I've been searching for all this time. It goes to
the heart of a speedy
solution for creating high speed custom parsers. This could be useful
to everyone for all
kinds of high speed searching not just parsers.
Please vote for this:
On Wednesday, August 18, 2004, at 03:10 AM, Mark Waddingham wrote:
> The one of most interest is the Boyer-Moore algorithm as this is
> to be the fastest.
> So, one idea is to implement a function:
> matchGlobal(stringToSearch, token)
> returning a list of all indices in stringToSearch of token.
> get matchGlobal("<a>foo</a><a>bar</a><a>baz</a>", "<a>")
> would give
> it = 1
> it = 10
> it = 20
More information about the Use-livecode