World: r3wp

ah ;)

oups...

hmm... need a delimeter in the key.. 
n/8497:9823 ;err invalid time
n/9384-5842; err invalid date

n/123x345

... doesn't work...

you could use an integer to store the 2 values (but each one limited 
to 2^32)

>> a: 1234
== 1234
>> b: 345
== 345

>> key: b or shift a 32
== 5299989643609

or you can make a string with the 2 parts and the delimiter as a 
key, but it will cost more memory

>> m/("123-456"): 45
== 45

there's no end of keys .. could use zero as the delim i suppose

what would the mem cost be to use strings?

there's theory and reality, just make some tests using dp

dp? duck pond?

? dp

dp.. your acronym.. what does it mean?

? dp

it's a function of R3

is it possible to search the value of map! without looping?

well... take that memory problem aside for the moment , and go with 
string keys :)

wow

ouch, don't think so...
Actually maybe your real key is the value and not the key.

that is REALLY fast
1,000,000 GETs  in 1.387 seconds

can't use the value as the key.. it could be 1GB

no matter.. can't search by value in Redis either.. i have a work 
around

or create a second map! with reversed key-values

ok, you can't

I'm going to try more test.. but if this is accurate,  this would 
be nearly 10x faster than Redis

great.. there goes my weekend :(

thanks for your help

small detail that may be useful:

>> series? make map! []
== false

DP: :DELTA-PROFILE, meaning change in profile. It's R3's built-in 
profiler. R3 also has a built-in timer, DT: :DELTA-TIME.

happy to have helped  :-)

Terry, try FIND VALUES-OF map value, if you can afford to trade memory 
overhead for the loop.

can you return the key somehow?

after some testing strings as keys and values are the way to go.. 
slightly faster ( to-binary? overhead?) and when you write the db 
to file, the strings are half the size

How does one sort on the 3 item in a seres?

example?

Use SORT/compare with an integer argument for the index of the records 
you want compared, and don't forget /skip for the record length. 
Like this:
>> sort/skip/compare [1 5 2 4 3 3 4 2 5 1] 2 2
== [5 1 4 2 3 3 2 4 1 5]

You mean using /skip and /compare to sort a series in sets?
s: [1 2 8 a   1 2 6 b   1 2 7 c]    ;; three sets of four items
sort/skip/compare s 4 [3]        ;; sort on the third item
== [1 2 6 b 1 2 7 c 1 2 8 a]

oops --- Brian just beat me to it!

thanks .. can someone update the docs http://www.rebol.com/docs/words/wsort.html

Didn't know you could put the /compare index in a block. Can you 
specify more than one index?

Yes you can:
sort/skip/compare s 4 [1 2 4 3]
== [1 2 8 a 1 2 6 b 1 2 7 c]

Graham, no, noone can update that doc page, it's a permissions issue. 
All docs updates by anyone other than Carl are on hold.

someone = Carl

:)

Ask in chat or CureCode, Carl won't see the request here.

It's best to ask in CureCode anyways, because the request will stay 
there where we can find it until the issue is fixed.

some of the browsers allow you to annotate the page so I can see 
my own notes

But the people who would fix the docs won't see your notes.