World: r3wp

My save-vars just pushes the temp variable values onto a stack, and 
restore-vars pops them.

I'll upload it, hang on.

How does it know which vars to push?

You tell it.

eg. 
rule: [
	recurse-into [var1 var2] some-rule
]

becomes:
rule: [
	save-vars [var1 var2]
	some-rule
	restore-vars [var1 var2]
]

(essentially)

http://home.wilddsl.net.au/anton/rebol/library/make-recursive-rule.r

Earlier in this discussion I suggested parse rule closures...

The use operation above would be a good semantic model for parse 
rule closures with recursion-safe temporaries. Imagine a new datatype 
called rule!, a parse rule block bundled with a recursion-safe context 
for local variables. You would create one with a mezzanine like this:


parse-rule: func [locals [block!] rule [block!]] [make rule! reduce 
[locals rule]]


It would be the equivalent of a function made by the HAS mezzanine 
- local variables, no parameters. The rule would be prebound to the 
context and the context would be fixed up on recursion just like 
function contexts are. Any time parse would accept a rule block! 
it would also accept a rule! value.

That would be good.

Using a stack as I have is faster, because we are not creating new 
objects (or values if they are the same), but it's not quite as elegant 
as your parse-rule above.

The trick is the addition of a new data type. It would allow the 
context to be fixed up internally. The rule! datatype would be a 
lot faster than even your stack model, and safer too. The use operation 
above would be a lot slower than your stacks though.

Yes, I think you should submit that for Rebol 3

That and the simple operations I wrote above.

I use Antons method sometimes, with an aditional trick: the push 
saves thevarnames too, and the pop is just "pop".

Can I vote in r3 to add to-any.. which stops at the first matching 
rules in the order of the block being parsed, as opposed to the order 
in the parse rules  This would make many rules simpler or make parse 
easier to use in Q&D stuff.

(actually, my method also pushes the var names as well as their values.)

http://www.colellachiara.com/soft/Misc/rewrite.html

Looks good to me. BTW, the mk2: in

    not match data [mk1: rules* mk2: (mk2: change/part mk1 prod mk2) 
    :mk1]
isn't used by your code. Did you mean mk1: instead?

The mk2: in the paren I mean..

What you mean here depends on whether you intend the rewrite to go 
through the entire data set before doing another pass (then you change 
the mk2: to mk1: ), or whether you want the next pass to pick up 
exactly where the previous one started (then you remove the mk2: 
as it isn't used).

Looking further t the docs, it appears that the existing behavior 
is what you intend. Better locality I guess. In that case, you might 
as well remove the mk2: from inside the paren in that line, as it 
doesn't do anything.

Gabriele's need to delimit the rules with '| brings up another old 
mezzanine thought: rejoin/with. I created a separate mezz, called 
DELIMIT, but this is a fairly common need IME. Should we start another 
ML thread? :-)

start another RAMBO thread :-) ... add it as a wish - I think it 
is the only channel RT actually scans, but of course not sure ...

Brian, yes, that's because earlier i had :mk2 after the paren, but 
I changed it to :mk1 because it's faster when you want to iteratively 
apply a rule.

That's the locality I was talking about.

The match functiion has a line
    parse block recurse
near the end that should be
    parse data recurse

Gabriele, rewrite - very nice and I expect endlessly useful. Thanks 
for publishing it.

Here is a suggestion for match - add /any and /case refinements like 
the parse refinements, and then change the line:
    parse data recurse
to this line, indented properly if needed:

    do pick pick [[parse parse/case] [parse/all parse/all/case]] none? 
    all none? case data recurse


It's the quickest way to pass along refinements I've figured out 
yet, short of rebcode apply.

Once rebcode is in REBOL, it would be a quicker way to implement 
match. That apply operation is nice.

After going nuts for some while now, I'll ask the community maybe 
someoe has a good tip for me:

I need an application that can do two things with more than 2 persons 
at the same time:
- video conferencing

- application sharing (or at least having one exporting his desktop 
to a number of users)


I thought that netmeeting might be good but it's quite old and doesn't 
seem to be further developed.

http://ultravnc.sourceforge.net/? for the sharing part. and something 
else for video?

Who should use UltraVNC?


Anyone who needs to support local or remote Windows users will find 
UltraVNC a must-have tool. It was specifically designed to answer 
the needs of:

    * Help desk (Internal & External)
    * IT departments

    * Home users that wants to help their relatives and friends or access 
    their home PC from work or cybercafés

there exists portrait from MS research...

Why hasn't someone added skype like feature to VNC yet?

closed source :)

why both in one application?

vnc is closed source? Ah, didn't knew that.

skype.

skype can only handle 1:1 video conferencing and I din't find a good 
app-sharing module yet.

I have finde some stuff:
- MS Research portrait (not tested)

- ivisit (seems to be a cool approach, P2P based, interesting app-sharing 
concept: just define an area of your screen to share)
- feestoon (skype plugin, not yet tested)
- good old netmeeting

Anyone fluent in Python here?  (respond privately pls)

Need a second pair of eyes to review some code...

Max is ...

Terry might still be

I think Tim Johnson is, he's on the ML.

Anyone done any work on rebol and LDAP?  Only stuff I've seen is 
the first couple hits on google such as http://softinnov.org/rebol/ldap.shtml
that haven't been updated in a long while

What do you want to know?  WE support LDAP and RADIUS in Qtask.

LDAP and RADIUS? as authN method? Implemented in REBOL? That would 
be interesting...

Where did you say the source was published ;-) ?