From: George Gallen [mailto:[EMAIL PROTECTED]
Sent: Tuesday, January 27, 2004 2:06 PM
To: 'U2 Users Discussion List'
Subject: RE: looking for faster Ideas...
I can't just check for names, it has to a name with a specific zip code
and if the name is fairly common, we also add in part of the address to
make sure no one else is weeded out that shouldn't be.
I suppose I could keep two or three arrays, do a specific lookup in each
saving the position, and if all three positions are identicle (asuming all
three arrays have the name, address, zip in the same order) then that would
be a match....Thanks
>From: Jeff Schasny [mailto:[EMAIL PROTECTED]]
>Sent: Tuesday, January 27, 2004 1:51 PM
>To: U2 Users Discussion List
>Subject: RE: looking for faster Ideas...
>how about keeping a list of excluded names as a record in a
>file (or as a
>flat file in a directory with each name/item/whatever on a
>line) and reading
>it into the program as a dynamic array then doing a locate on
>the string in
>question. Something like this:
>READ ALIST FROM AFILE,SOME-ID ELSE STOP
>X = 0
> X += 1
> ASTRING = INLIST<X>
>UNTIL ASTRING = ''
> LOCATE ASTRING IN ALIST SETTING POS THEN
> END ELSE
>Of course of you really want speed then sort the list and use
>a "BY clause
>in the locate
_______________________________________________ u2-users mailing list [EMAIL PROTECTED] http://www.oliver.com/mailman/listinfo/u2-users