World: r3wp

That said, I would like to have the BIND? function also assigned 
to the word BOUND? by default, or perhaps BINDING? or CONTEXT? given 
its behavior. Just a preference.

What is R3 replacement for List! is it Map! or Vector! ?

Neither - it's just gone.

The block-like types that aren't block-like enough to be bound are 
gone. Map! is not block-like, it acts more like object.

Vector! is more like a typed array. There is nothing in R3 like list! 
or hash!.

It was found that they were not useful or even used enough to be 
included.

Most uses of hash! are replaced by map!, the rest by block!. The 
only use of list! that couldn't be done with block! was found to 
be so obscure that no code was found that used that technique.

I found hash! a very useful datatype, I still don't get why it has 
to be removed. Map! looks less flexible because you have to conform 
to the key/value data model and it doesn't seem possible to navigate 
in a map! like in a hash!. Why can't we have both hash! and map! 
in R3?

Maybe would help to add indexing to Map! ie reverse value -> key 
?

Exists a way to change user-agent with R3-alpha? I try system/schemes/http/user-agent: 
"Mozilla/4.0" but I get ** Script error: cannot access user-agent 
in path system/schemes/http/user-agent:

probably you have to modify do-request.
save %do-req.r mold do-request
edit in do.req.r the line 
User-Agent: "REBOL"
to whatever you desire, add the rebol [] header and do the file.

sorry 
save %do-req.r mold :do-request

hum, or you can pass a header block to the write function as is:
>> write [ url!  [ User-Agent: "TOTO" ... ]  #{...data...}]

but it's bugy, you have to add yourself some missing header properties 
in the block to generate a valid request.

like Content-Type: "application/x-www-form-urlencoded; charset=utf-8"

I liked list and hash and did use them a lot.  List was was buggy 
though.

eh ? bug in list ?

Yes, I reported it some time back.

http://www.rebol.net/cgi-bin/rambo.r?id=4314&

Because of list being buggy sort was modified so that it doesn't 
use list.

bah... not so painfull

it's a little incoherent to use sort on lists

it was slower than using blocks

there is someone using list!? I wonder if there is any advantage 
of list! over hash! and block!

No lists are faster than blocks for inserting data.

lists are fast with insertion and deletion, i use them sometimes

Oldes, yes there is an advantage to each.  Lists are faster for inserting 
and traversal.  Hash is faster for find operations.

by the way, some times ago, i made an algorhitm to simulate hash 
with blocks, it's quite fast and use much less memory than hash.

But it works only with integers key. i could search for it if someone 
is interested...

>> b: make list! 10001 tm 100 [clear head b repeat i 10000 [b: insert 
b i]]
0:00:00.25
== 0:00:00.25

>> b: make block! 10001 tm 100 [clear head b repeat i 10000 [b: insert 
b i]]
0:00:00.25
== 0:00:00.25

Oldes, you do appends not insertion

Anyway.. list! and hash! are no longer in R3

I see.. interesting.

>> b: make list! 10001 tm 100 [clear head b repeat i 10000 [insert 
b i]]
0:00:00.203
== 0:00:00.203

>> b: make block! 10001 tm 100 [clear head b repeat i 10000 [insert 
b i]]
0:00:13.031
== 0:00:13.031

I don't know much about vector or map but I hope that we haven't 
loss the functionality of list and hash in R3.

Or at least have something better.

I used list! once in list-view, but found that it had too much overhead, 
when needing to use it as a block, so it had to be converted.

Yeah that is what made list less desirable for me as well  Henrik.

Should to-block work on vector!?

I think so.

>> c: make vector! [32 100]
== vector!

>> c/1
== 0

>> c/1: 100000
== 100000

>> c/2: 200000
== 200000

>> c/1
== 100000

>> c/2
== 200000

>> to-block c
== [vector!]

the last piece seems abnormal to me.

I don't think is't ready already. Also map! still has some issues.

Map! has issues for now (see CureCode), and the traversal thing is 
being worked on. Vector! is almost completely nonfunctional now.

There are plans to extend FOREACH to map! and object!, and MAP could 
make sense too I suppose, but no plans for that. What did you use 
hash! for that wasn't keyed search, Doc, and what advantages did 
it give you over block! aside from a different datatype?

Also, don't forget user-defined datatypes. We are only including 
the most useful datatypes by default - you will be able to add your 
own later once we have user-defined datatypes.

Multiple keys pointing on the same data (I'm using traversal to locate 
the value once the key is found). I guess that using map!, it would 
require to duplicate the value for each key?

No, just duplicate *references* to the same value.

Paul if I understand documentation Vector must be one type (homogenous) 
ie good for file pointer, bad for records (multiple type)

It only becomes duplicate values if the value is not a reference 
type (numbers, characters, etc.).

Brian: Good to know.

Pavel, yes, the homogenous type is the only main difference relative 
to blocks. Only use vectors if you need that, else use blocks.

So, if I understand correctly, map! offers a superset of hash! features 
(without giving up anything)?

Not bad if the performance would be good (especially for quite large 
pointer table to database file), save in size was already mentioned