valueDiff for arrays?

[Brian Milby]

On Sat, Aug 4, 2018 at 10:57 AM, Mark Waddingham via use-livecode <
use-livecode at lists.runrev.com> wrote:

> On 2018-08-04 04:00, Brian Milby via use-livecode wrote:
>
>> Other than the fact that coding is fun :)
>>
>
> Yes - but coding in LCS is much more fun, quicker (for me, anyway - and
> I've been writing C/C++ for nigh-on 30 years) - more importantly it is also
> MUCH MUCH more secure.
>

@Mark,
I wasn't necessarily suggesting that it belonged in the engine, but
pointing out why I would look at the code.

I will say from some other things that I've looked at recently that speed
would be so much faster in the engine - if it was a feature that merited
being there.  I did kind of cheat in that I looked at how the engine did
the array union/intersect functions.  The source actually contains LCS
versions of the logic too.  What I'm thinking is that there will be an
array size where iterating the array 3 times (twice by the engine-
intersect and symmetric difference or union) will be faster than iterating
the array once in LCS (using modified union logic).

All of the current engine array code is based on comparing the key.  The
distinction here is that a value comparison is also required.

Thanks,
Brian