World: r3wp

The baseline being:
>> select dp [] 'series-made
== 1

maybe for string to binary conversion a buffer is requested but i 
can bet that it's not neccessary for integers. It can be poked in 
place.

It's like I would do in asm or in C. casting of the 64 bits integer 
into a char (take the low byte) and poke it inside the binary serie, 
that's all I have to do.

that's why i think CHANGE #{00} 2, should not have to allocate a 
new buffer

but it's just optimization :)

Carl's question on R3 Chat:

#7301: post from Carl 36m ago:
FOR can include tail. Do we want to keep that behavior?

>> for a b: "abc" tail b 1 [probe a]
abc
bc
c



This happens because FOR is inclusive on its END value. (Remind me 
if we've talked about this before.)

Suggest it in CureCode Steeve, and I can tweak the ticket if need 
be. Now is the time - Carl is working on this kind of thing today.

I think that above behaviour for 'FOR is correct. That is why we 
have "back tail" usage pattern :-)

ok, I give it a try

I like to think that FOR works in indexes like AT, instead of offsets 
like SKIP. So that seems like good behavior to me.

me too

Brian, ticket posted

And refined.

thanks

Sorry, I had to put in a dig about #574 - it's a pet peeve with a 
known, already-submitted mezzanine solution.

(stupid profiler, including its own overhead in its results)

uhuh

It's not refined in my head yet enough but i think 'IN needs of a 
redesign.

Especially this form allowed by the specs but throwing an error currently.
>> in [obj1 obj2 ...] [a b c d]
== Error!

it could be powerfull, allowing to inherit properties from a hierarchy 
of objects (think about nested gobs with their own context)
But it's not enough...
I would like that the returned block discard the unbound words.
It would be consistent with the single form.
>> in context [a: 1] 'b
== none

I don't know if i'm clear...

That has already been suggested before (don't remember the ticket), 
though without the "discard the unbound words" feature that would 
break the code that IN context block! usually works with. IIRC it 
was dismissed, because IN is supposed to be a low-level function 
and this would slow it down immensely.

A big O slowdown, from O(n) to O(m * n).

So slow that we are better off not having such a feature, having 
to rewrite our code so we don't need to do that at all.

well, if it's discard only the unbound word (words having no context 
at all) there will be no sideeffect I guess
in context [a: 1] unbind [a b c]

Remember, IN whatever block! is usually preceded by DO. You don't 
want to remove words from code you are going to DO.

or just as an option

And lit-words and refinements also get bound, so removing them because 
they are unbound would be bad, since they have meaning beyond their 
binding. And adding options to IN will slow it down too; IN is supposed 
to be *fast*.

>> a: [a] same? a in self a
== true

IN something block! is like BIND, not BIND/copy - IN modifies. Don't 
remove stuff from the original.

IN something word doesn't modify though.

I think words are immutable in R3, like integers, tuples and typesets. 
When IN or BIND binds a block I think they replace the words they 
bind with new words that refer to the same symbols, but a new context. 
So IN and BIND never modify words - they replace them.

Words Immutable you say ?

>> p: to-path 'a
>> x: reduce [p p p p p p ]
== [a a a a a a]
>> p/1: 'b
>> x
== [b b b b b b]

lol...

Those are the bindings that the words point to. I am actually talking 
about word!, lit-word!, ... values themselves.

Was just a joke

You can't change the binding of a word. You can't change the symbol 
of a word. Either will result in a new word. There isn't anything 
else that makes up a word. The only thing you can change is the value 
slot that the word points to, but you can't change *which* value 
slot the word points to, just the contents of the slot.

And that value slot is not part of the word :)

hey stop i'm in your front side :)

Sorry, it was just weird that I just realized this now :)

don't want to be hurt...

I was in your brain just know, was weird enough... :)

A99 released ...

A99 downloaded...

Wow, that was quick! :)

Carl also adressed my complaint to website - it was kind of difficult 
to get to changelog. Now A99 is propagated even to main page of rebol.com 
 .... small changes, but helpful ...

Tested, it's good!

It seems that the migration of GUI to the external host is more difficult 
that expected.

yes Carls is struggling, but by what I hear, he really is committed 
to doing it.   he WANTS to do it... its just that he's realizing 
how deeply rooted the view code is... all kinds of tricks now have 
to be architectured and properly APIed.

Anyway to return the key used in a map when using find values-of 
map! ?

Carl is suddently on FIRE!!!!   Go Carl Go!!!!

Wouldn' t it be nice to do something like this:
a:   5
b: a < 10

where b gets set to the value of a instead of true?

We may have to include a new keyword such as bool to the mix just 
to get true or false when desired.

b: bool a < 10

Just a thought.

bool: func [val][not not val]
;-)

:-)