World: r3wp

Louis, the way I benchmark in REBOL is to do a trace count.  In other 
words if the execution of the trace generates more output than another 
method then I assume that method is less efficient.

Stayed up all night, and succeeded in making a parse rule generator, 
so if we want to search a string for any substrings:

string: {Hello there Anton. Arrow in the box. What nice antlers you 
have.}
substrings: ["ant" "antler" "anton" "arrow" "bar" "box"]

rule: [start: [["a" [["nt" action ["ler" action | "on" action]] | 
"rrow" action]] | ["b" ["ar" action | "ox" action]]] | skip]
Found at: 13 Substring: "Ant"
Found at: 13 Substring: "Anton"
Found at: 20 Substring: "Arrow"
Found at: 33 Substring: "box"
Found at: 48 Substring: "ant"
Found at: 48 Substring: "antler"
true

So you can see the rule is built from the substrings.

Thus we are able to search large files for any number of substrings 
in a single pass parse. :)

(very happy about this..) I'll clean it up and publish it probably 
later tonight.

Nice job. Anton.

Thankyou, Jerry. I wonder if anyone else made a parse generator like 
that ?

Maxim and Anton, what difference does it make which value is returned? 
It is the true or false that I am looking for. If any of the strings 
are found, why look any farther? I'm sure you guys have a reason, 
but I want to know what it is.

is returned = is returned first

If you keep looking after already having an answer, how can that 
be more efficient?

Well, that functionality works perfectly for your case, but there 
are many other cases where the position of the match(es) is also 
wanted.

.. and a name like FINDALL suggests that it returns those matches.

Your functions might better be named:  ANY-SUBSTRINGS? and ALL-SUBSTRINGS?

FINDANY and FINDALL might be fine for personal use, but to get acceptance 
out in the community, the names should be more accurate.

For the single-pass parse, the action can be defined by the user 
to either continue or break the parse. (So FINDANY would break, whereas 
FINDALL would continue.)

OK, it really doesn't make any difference to me what the functions 
are named, as long as the names are easy to remember.

But I would really like to see funtions that find-any-substring and 
that find-all-substrings included in REBOL3, as they make programming 
a lot easier---at least for me.

Louis, hehe you'll eventually realize that semantics in rebol are 
pretty important... simply because Carl puts soooo much effort I 
guess it all makes us anal about it  ;-)

in parse, a good example of where the index creates many problems 
is when you use the 'TO or 'THRU words.

they jump exactly like the above... and well it makes them much less 
usefull within the context of trying to get to the next value of 
"equivalent" values.

Maxim, I see. Thanks for the explanation. It will be interesting 
to see Anton's function.

You guys a way more advance to me. That is why I hang out here---I 
get help when I get stuck. And by the way, thanks to all of you guys 
for the help.

Anton, my LIKE? function generates parse rules, but I doubt it's 
as advanced as yours, since it's just meant for simple pattern matching 
and doesn't deal with multiple search targets.

Gregg, I think I recently made a function probably similar to your 
LIKE?.  Have you published that somewhere ?

But yes, multiple search terms are the next level up. To get the 
full range of matching rules with multiple search terms will take 
some work, however the basis is there.

Ok, here it is:

http://anton.wildit.net.au/rebol/library/string-search-functions.r


do http://anton.wildit.net.au/rebol/library/demo-string-search-functions.r

It's on REBOl.org. I finally decided to publish it (it's old) when 
I published my file-list script, which uses it.

Anton, I think line 437 should be:

	find-every-string: func [

func [

 must of been accidentally deleted right before you sent the file.

Ah.. thankyou Louis.

Fixed and republished (with same version number).

http://www.rebol.net/r3blogs/0052.html<--- Change the Hash Datatype 
in 3.0?

http://www.rebol.net/r3blogs/0053.html<-- Vector datatype

So anyone know of a rough date for 3.0 ?

No, not even RT.

Let's assume December 2025, then we shouldn't be disappointed.... 
  =^_^=
(I hope....)

I hope it will be out before Duke Nukem Forever >;-)

My estimation is, that R3 (in some form) will be released for DevCon 
2007

... including View, without some parts as Unicode etc., just new 
architecture ....

hmm, pages for DevCon are down, so actually it is difficult to say, 
wehn it will happen :-)

So now we know the target date for R3 release :-) DevCon 2007 holds 
first conference session - By Carl Sassenrath - "Introducing REBOL 
3.0"

Pekr: "introducing R3" may mean just technology overview ;)

who here is going to devcon2007 ?

probably me. It depends if I opt for a new job or no, and if I am 
succesfull :-)

i'll be there 99%

I'lll be there 1%

As I recall, Paris is difficult to negotiate if you don't parlez 
francais

Is the date (May 10-11) fixed?

Paris is difficult to negociate unless you speak parisian... and 
even then, many french will tell you paris is almost like a separate 
country  ;-)

graham, just bring a sleeping bag and a really big lunchbox.

I will be there

Graham , yea I visited france last spring and was surprised how few 
people spoke english