World: r3wp

Or you can say I created an index and the query system with two function 
calls.

You mean a block containing string values?

sure ..

>> help find
USAGE:

    FIND series value /part range /only /case /any /with wild /skip size 
    /match /tail /last /reverse

Doesn't say blocks are not included

But it's not find/deep, which is what you want.

for the /match refinement

Since it's a read only db, perhaps I could use Cyphre's compiler 
:)

Not sure how /match is going to help you here. It only matches the 
start of the series.

>> find/match ["Aa" "Bb" "Cc"] ["Bb"]
== none
>> find/match ["Aa" "Bb" "Cc"] ["Aa" "Bb"]
== ["Cc"]

ok... find/deep then :)

for 18k strings, it seems overkill to use sqlite though

REFORM + FIND/ANY

Just sayin'. ;-)

I'm sure that it is fast .. but I want real fast so I'm going to 
see if I can create a hash

Perhaps Sunanda's skimp.r may be hiding some gems you could adopt.

Graham -- consider using a Trie

[that is more-or-less what skimp.r does, but the skimp data structures 
are badly disorted as I was struggling to find a deeply-nested block 
structure that did not trigger garbage collection bugs in the then-current 
REBOL core. (those bugs have been fixed)]
   http://en.wikipedia.org/wiki/Trie

is there a port scheme for trie:// ?

Graham, look at the filter function in LIST-VIEW.

filter-list ?

no, FILTER.

sorry, FILTER-ROWS.

I guess it's been split in several parts now, so it may be too hard 
to read.

Graham, I did that recently, where you get choices as you type. I 
had ~1000 strings though, so not sure how much it scales. I just 
indexed by the first two characters.

It seems to be working not too bad for me without a hash .. but I'll 
need to test it on a slower PC ( test inside a VM I guess ) ...

video of my current implementation http://screencast.com/t/ZGI5ZTJkOTct

Very nice Graham! Thanks for posting. 

How did you end up doing the matching?

search each one from the start :)

rebol seems fast enough

Cool. Yeah, there are times we need to use advanced algorithms, and 
times we don't.

Carl has a character by character search in Rebodex.  Not sure if 
that is any better than what you have done.

G raham a suffix tree may be what tou want for trem compleation

suffix tree?

a forest of trees where the words are on the path from root to leaf 
so at any interior node the possible compleations are the subtree 
the node you are on is the root of

if not clear blame it on post op drugs... I'm recovering from bad 
 cellulitus

It's a type of denormalised trie:
   http://marknelson.us/1996/08/01/suffix-trees/

It clearly has affected your typing!

I guess you didn't get the necrotizing fasciitis version!

So, all I need is to write a function that takes my data and builds 
the tree ...

it has affected my typing in that I have time to spend here

Since my data is also invariant ... I could save the data structure 
and send it to my users :)

if your controlled vocab chantes much it will be expensive

this is why controlled vocabularies are good

There aren't that many new drugs added to the pharmacopaiea on a 
monthly basis

The FDA makes sure of that!

sounds ideal

so how are the nodes represented?  blocks?  objects?

http://www.mail-archive.com/[list-:-rebol-:-com]/msg07839.html

if you can get away with blocks it should be cheaper , since you 
only decend,  parent is not needed just child blocks and value may 
work

Maybe Carl can add this as a native for find/deep :)

also look at prefix trees, may be a simpiler  variant for word compleation

Is there a case to be made for use/only ?

>> use [a][a: 1]
== 1
>> use/only [a][a: 1]
== [a: 1]

Replaces having to 'double bag' -
>> use [a][[a: 1]]

Am I missing an obvious equivalent?