Quickest was to compare 2 CR lists?
lists at futilism.com
Tue Nov 4 04:33:35 CST 2008
function listIntersect list1, list2
replace cr with comma & "1" & cr in list1
split list1 by cr and comma
repeat for each line L in list2
if list1[L] is not empty then put L & cr after tIntersect
This seems a bit faster (20-30%) than the repeat for each approach.
and for long lists with many duplicates it'll probably be faster still.
On 4 Nov 2008, at 09:08, Klaus Major wrote:
> Hi all,
> anyone knows the quickest ways to compare 2 CR delimited lists?
> I need to know what lines of list 1 are contained in list 2.
> Right now I am using repeat "for each" and "lineoffset", which is
> but I'm ure this can be done even faster :-)
> List 1 = k1
> List 2 = k2
> repeat for each line i in k1
> if lineoffset(i,k2) <> 0 then
> put i & CR after new_ list
> end if
> end repeat
> delete char -1 of new_ list
> return new_ list
> Klaus Major
> klaus at major-k.de
> use-revolution mailing list
> use-revolution at lists.runrev.com
> Please visit this url to subscribe, unsubscribe and manage your
> subscription preferences:
More information about the use-livecode