Fastest memory based search technique (was: Adding 1 to an array)

[Dick Kriesel]

On 6/24/07 10:51 AM, "David Bovill" <david at openpartnership.net> wrote:

> So whats wrong with the idea of creating arrays and then making unions of
> these arrays to get a fast in memory result equivalent to "SQL join"?

You'd need to update your arrays when you recompile anything, when you
rename almost any stack, and when you change the owner of almost anything,
if you're doing something like the following:
put tSignature & tab & tLongID & cr after tReference[tTerm]

What arrays do you envision?

> 
> I have scripts that automatically extract keywords and link relationships
> between the handlers - so a function "xml_GetText" is split into words
> "xml,get,text" 

Does it parse based on camelCaps and embedded delimiters like underscores?

> - I usually throw away the common stuff like "get", then I
> extract all the handler calls, and the built in transcript calls and
> generate keywords, and dependency relationships from them.

Does it parse call statements, value expressions, and do expressions?

If you've got that just about under control, then please also add the
ability to distinguish between finding terms in executable code and finding
terms outside executable code, such as in comments and redundant handlers.
Then please add the ability to distinguish between public handlers and
private handlers.

If you'd like suggestions about simplifying or speeding up your code, or
beta testing, I'd like to help.

-- Dick