World: r3wp

I like the idea from the R3 blogs about having SYSTEM be a function 
that generates objects, rather than an object. That way system/script 
would return an object that wouldn't mess up the infrastructure when 
it is changed.

its always safer to have hooks and apis, than direct data.

which is why I dearly hope R3 adds accessors.

many points in many r3 discussion would be moot with this simple 
concept added to a new class! or current object! engine.

I have been a big advocate of accessors here and in the blog comments, 
though mostly for interoperability with other object models that 
have them (all of the major platforms now). Safety is a good reason 
for them as well.

and invisible datatype... with accessors, I could code a liquid api 
which is completely hidden from users... totally non-aggressive to 
the way they currently code and yet still allow custom types of liquid, 
just by changing how the accessors are built.

I could do magic objects  ;-)

anyways... I'm getting OT... (rambo list)

Indeed.

what do you mean by "accessor" in rebol terms?

So, no objections to me creating a ticket for that ?

no objections from me

Petr, there were discussions in the R3 blog about accessors. It's 
quicker to just look there.

I think I understand - it is simply that some "variable" is not variable, 
but a function? In Visual Objects, we could define variable being 
an accessor, you then normally used oMyObject:myVar: 3 - which could 
mean - you either assign it to variable, or (if an accessor), the 
same syntax is being used, but it was passed as a parameter to function, 
which could do type checking, whatever ...

Yup, something like that. Accessors were introduced in Self, then 
ported to Delphi (as properties), then from there to ActiveX, Java 
(as a coding convention), C# (and the rest of .NET), and then many 
other modern languages and platforms (most of the major ones).

python is defined from ground up with accessors, you can replace 
the in-built datatypes!!!

I guess self is like that also.

Python is designed that way now, but it didn't start that way. That's 
something I like about Python - when they add new features in a new 
version, they are not afraid to redesign the whole system to take 
advantage of the new features.

Submitted the above crash code to RAMBO.

what do you think about these:

>> p: make port! http://
>> equal? reduce [p] reduce [p]
== true
>> equal? p p
** Access Error: Port none not open
** Near: equal? p p

or

>> a: tail [1]
== []
>> remove head a
== []
>> equal? reduce [a] reduce [a]
== true
>> equal? a a
** Script Error: Out of range or past end
** Near: equal? a a

it looks inconsistent to me and incompatible with FIND and SORT as 
well

It does look like a problem. Things like this are funny, because 
it seems like an obvious issue we would have hit long ago. :-\

ladislav, you aren't causing Carl any sleepless nights now, are you? 
:-)

no, he silently ignores my huge list

Except that I don't get the error you get on the second example.

you don't?

No. Let me try a fresh console.

Hmm. I got it this time.

it surprises me you didn't the first time

Me too. Let me check something.

ladislav, well it could be that he's incorporating fixes into R3.

Oh well, it happens every time now. Must have been something odd. 
Can't dupe it right now.

Can't dupe it working that is. :-)

that does not surprise me like the opposite did

That one comes back to the old issue of out of range indexes, which 
has been around for a long time, correct?

yes, it is an old issue, actually

but my point is, that you cannot state comparing A with A may be 
an error without asking for trouble

Agreed.

it is clearly more useful to allow comparisons as FIND or SORT demonstrate 
than to forbid them

I would say that you can't do *anything* safely on a series reference.

linked lists being an exception.

It obviously doesn't affect much code, though, or we would all be 
screaming about it.

they are easy to break and fuck up.

lists will be redesigned for R3 (with my contribution, I hope)

Re the new SWITCH proposal. ( Mezz/switch1.r). It fails in the following 
cases (due to FIND datatype searching properties):

switch-test: func [x] [
	switch :x [
		#[datatype! integer!] ["The first variant"]

  #[datatype! decimal!] #[datatype! block!] ["The second variant"]
	]
]

switch-test block!
switch-test decimal!

(the old SWITCH implementation fails for similar cases too)

I guess it would be useful to have a FIND/LITERAL refinement to behave 
differently when searching for datatypes

this is my gripe with lists:

>> a: make list! [1 2 3] clear a tail? a
** Script Error: Out of range or past end
** Near: tail? a

yes, that is an issue my proposal for lists solves

I often end up using REDUCE when dealing with datatypes that way.