World: r3wp

3 new entries in the blog

Henrik, good suggestion with the loop working on more than one series 
(in your reply to Carl's blog). That must be possible with a function 
definition. But it should probably be part of REBOL, at least a mezzanine.

I realized that it's not possible with FOREACH since it would need 
to know the difference between two and three blocks as input (don't 
know if a refinement would take care of that)

but I use this a lot and it would make it easier to interlace many 
blocks this way

A new mezz, formany perhaps?

I got another idea. Please see the blog.

Henrik, try to implement your ideas in REBOL code. Post it to AltME 
if you need help. Let us hash out the details, improve it. If it 
turns out well, it could become a mezzanine function.

alrighty then

Someone mentioned Ladislav's build dialect, and look what happened 
to it... ;-)

haven't even followed it, but it seems that Carl likes it

noone remembers my nforeach function? :)

I think Carl was talking about his Include. I meant Ladislav mentioning 
the build dialect yesterday in this group and me suggesting bug fixes 
immediately. It's a little better than it was before as a result. 
Sometimes it seems that the best REBOL optimizer is its community 
showing off.

explain?

Yes, demonstrate?

well, anyway, carl's foreach already does what henrik is asking for.

my nforeach took a different approach, that is   nforeach [c1 a c2 
b] [...]

r3's one will probably be   foreach [[c1] [c2]] [a b]  [...]

Carl's foreach
 as in the one in R3? surely not the one in R2

yes, r3

that's good!

I won't waste my time then :-)

i don't know if we're going to have your suggested loop or pad refiniments

but, note that it is very likely that foreach will be a mezz, so 
we you can improve on it :)

pad and loop are sort of gimmicks anyway. I think the multiple block 
part is the important thing.

funny, i thought i was the only one wanting multiple blocks.

I really miss it alot

such a construct would make certain loops much simpler

When you combine this with the word, set-word trick, this could make 
for some interesting structure matching.

ah, about structure matching... let me switch to another group

Sure, as long as it's fast, make it a mezz and let it evolve.

Someone mentioned Ladislav's build dialect, and look what happened 
to it... ;-)

 - it was me who mentioned it, but this is about the third time I 
 mentioned it here as well as on the ML, so it is not as efficient 
 as Brian suggests :-)

I posted a comment to hash that contains the reason why Carl is reconsidering 
the HASH! datatype

re the BUILD issue - it has been used quite regularly, although not 
for lit-paths, because they are "rare" in a sense

Well I was joking, but yeah, the community-as-optimization does depend 
on the community having time and attention to spare...

Brian, you mentioned the usage of HASH! as an index. That is exactly 
the case (IMO) when HASH! is better than associative array. Are you 
using that often?

Sometimes I return a hash index as a query result set, for database-like 
functions. If I had to use an assoc instead I'm sure it would be 
fine as long as select was still O(1) like a hash.

Most of the time I use it like an assoc, or like a fully indexed 
table.

The main advantage a hash has over an assoc is that you aren't limited 
to simple key-value records, you can use longer records.

I would want an assoc to be able to have any string type as a key 
and words as well, at least.

The main advantage a hash has over an assoc is that you aren't limited 
to simple key-value records, you can use longer records.
 - yes, that is the domain where hash! should be better

(especially if you want to use more keys than one)

Plus you can use more interesting dialected records that are type-delimited 
rather than fixed length - all the tricks that blocks can do.

Still, if assocs are drastically faster it would be worth it. I could 
use blocks or lists and assoc indexes if I need them.

Assoc indexes to lists would be useful, as useful as I've found hash 
indexes to lists to be. I'd use hashes and lists more often if block 
parsing worked on them.

drastically faster

 - I think, that REMOVE and INSERT can be made faster by not "shuffling" 
 data as often

...as useful as I've found hash indexes to lists to be
 - do you have a short sample code you can post?

Insert tail
 should be not slow?

for remove, dont use it, clear the values instead. and have some 
way to recycle them.

Mostly adhoc database stuff that could be replaced by RebDB. I really 
can't post most of it (work for hire).

I've been wanting to look at the source of RebDB to see if there 
is anything about it I could improve.