/* Copyright (C) 2003-2015 LiveCode Ltd.

This file is part of LiveCode.

LiveCode is free software; you can redistribute it and/or modify it under

the terms of the GNU General Public License v3 as published by the Free

Software Foundation.

LiveCode is distributed in the hope that it will be useful, but WITHOUT ANY

WARRANTY; without even the implied warranty of MERCHANTABILITY or

FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License

for more details.

You should have received a copy of the GNU General Public License

along with LiveCode. If not see <http://www.gnu.org/licenses/>. */

#include "prefix.h"

#include "globdefs.h"

#include "filedefs.h"

#include "objdefs.h"

#include "parsedef.h"

#include "mcio.h"

#include "globals.h"

#include "objectstream.h"

#include "util.h"

#include "variable.h"

#include "mcio.h"

#include "exec.h"

#include "exec-interface.h"

////////////////////////////////////////////////////////////////////////////////

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, Keys, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, Extents, 2)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, Combine, 4)

// SN-2014-09-01: [[ Bug 13297 ]] Combining by column deserves its own function as it is too

// different from combining by row

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, CombineByRow, 2)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, CombineByColumn, 2)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, CombineAsSet, 3)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, Split, 4)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, SplitByRow, 2)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, SplitByColumn, 2)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, SplitAsSet, 3)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, Union, 3)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, Intersect, 3)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, UnionRecursive, 3)

MC_EXEC_DEFINE_EXEC_METHOD(Arrays, IntersectRecursive, 3)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, ArrayEncode, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, ArrayDecode, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, MatrixMultiply, 3)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, TransposeMatrix, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, IsAnArray, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, IsNotAnArray, 2)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, IsAmongTheKeysOf, 3)

MC_EXEC_DEFINE_EVAL_METHOD(Arrays, IsNotAmongTheKeysOf, 3)

////////////////////////////////////////////////////////////////////////////////

void MCArraysEvalKeys(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef& r_string)

{

if (MCArrayListKeys(p_array, '\n', r_string))

return;

ctxt . Throw();

}

////////////////////////////////////////////////////////////////////////////////

struct array_element_t

{

MCNameRef key;

MCValueRef value;

};

struct combine_array_t

{

uindex_t index;

array_element_t *elements;

};

static bool list_array_elements(void *p_context, MCArrayRef p_array, MCNameRef p_key, MCValueRef p_value)

{

combine_array_t *ctxt;

ctxt = (combine_array_t *)p_context;

ctxt -> elements[ctxt -> index] . key = p_key;

ctxt -> elements[ctxt -> index] . value = p_value;

ctxt -> index++;

return true;

}

static int compare_array_element(const void *a, const void *b)

{

const array_element_t *t_left, *t_right;

t_left = (const array_element_t *)a;

t_right = (const array_element_t *)b;

return MCStringCompareTo(MCNameGetString(t_left -> key), MCNameGetString(t_right -> key), kMCStringOptionCompareExact);

}

////////////////////////////////////////////////////////////////////////////////

// combine by row or column expects an integer-indexed array

struct array_int_indexed_element_t

{

index_t key;

MCValueRef value;

};

struct combine_int_indexed_array_t

{

uindex_t index;

array_int_indexed_element_t *elements;

MCExecContext* converter;

};

static bool list_int_indexed_array_elements(void *p_context, MCArrayRef p_array, MCNameRef p_key, MCValueRef p_value)

{

combine_int_indexed_array_t *ctxt;

ctxt = (combine_int_indexed_array_t *)p_context;

MCAutoNumberRef t_key;

if (ctxt -> converter -> ConvertToNumber(MCNameGetString(p_key), &t_key))

{

index_t t_key_num = MCNumberFetchAsInteger(*t_key);

if (t_key_num < 1) // Invalid index

return false;

ctxt -> elements[ctxt -> index] . key = t_key_num;

ctxt -> elements[ctxt -> index] . value = p_value;

++(ctxt -> index);

return true;

}

else

return false;

}

static int compare_int_indexed_elements(const void *a, const void* b)

{

const array_int_indexed_element_t *t_left, *t_right;

t_left = (const array_int_indexed_element_t *)a;

t_right = (const array_int_indexed_element_t *)b;

return (t_left -> key - t_right -> key < 0) ? -1 : (t_left -> key != t_right -> key ? 1 : 0);

}

////////////////////////////////////////////////////////////////////////////////

void MCArraysExecCombine(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef p_element_delimiter, MCStringRef p_key_delimiter, MCStringRef& r_string)

{

bool t_success;

t_success = true;

uindex_t t_count;

t_count = MCArrayGetCount(p_array);

MCAutoStringRef t_string;

if (t_success)

t_success = MCStringCreateMutable(0, &t_string);

combine_array_t t_lisctxt;

t_lisctxt . elements = nil;

if (t_success)

t_success = MCMemoryNewArray(t_count, t_lisctxt . elements);

if (t_success)

{

t_lisctxt . index = 0;

MCArrayApply(p_array, list_array_elements, &t_lisctxt);

qsort(t_lisctxt . elements, t_count, sizeof(array_element_t), compare_array_element);

for(uindex_t i = 0; i < t_count; i++)

{

MCAutoStringRef t_value_as_string;

t_success = ctxt . ConvertToString(t_lisctxt . elements[i] . value, &t_value_as_string);

if (!t_success)

break;

t_success =

(p_key_delimiter == nil ||

(MCStringAppend(*t_string, MCNameGetString(t_lisctxt . elements[i] . key)) &&

MCStringAppend(*t_string, p_key_delimiter)))&&

MCStringAppend(*t_string, *t_value_as_string) &&

(i == t_count - 1 ||

MCStringAppend(*t_string, p_element_delimiter));

if (!t_success)

break;

}

}

if (t_success)

t_success = MCStringCopy(*t_string, r_string);

MCMemoryDeleteArray(t_lisctxt . elements);

if (t_success)

return;

// Throw the current error code (since last library call returned false).

ctxt . Throw();

}

// Should be removed when 'combine by row' and 'combine by column' only differs by the delimiter used,

// not by the way the array is handled - any index is fine for combine by row

void MCArraysExecCombineByRow(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef &r_string)

{

MCAutoListRef t_list;

MCListCreateMutable(ctxt . GetRowDelimiter(), &t_list);

uindex_t t_count = MCArrayGetCount(p_array);

combine_array_t t_lisctxt;

bool t_success;

t_lisctxt . elements = nil;

t_lisctxt . index = 0;

t_success = MCMemoryNewArray(t_count, t_lisctxt . elements);

if (t_success)

{

MCArrayApply(p_array, list_array_elements, &t_lisctxt);

qsort(t_lisctxt . elements, t_count, sizeof(array_element_t), compare_array_element);

for (int i = 0; i < t_count && t_success; ++i)

{

MCAutoStringRef t_string;

if (ctxt . ConvertToString(t_lisctxt . elements[i] . value, &t_string))

t_success = MCListAppend(*t_list, *t_string);

else

t_success = false;

}

MCMemoryDeleteArray(t_lisctxt . elements);

}

if (t_success && MCListCopyAsString(*t_list, r_string))

return;

ctxt . Throw();

}

// SN-2014-09-01: [[ Bug 13297 ]] Combining by column deserves its own function as it is too

// different from combining by row

void MCArraysExecCombineByColumn(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef &r_string)

{

MCStringRef t_row_delimiter, t_col_delimiter;

t_row_delimiter = ctxt . GetRowDelimiter();

t_col_delimiter = ctxt . GetColumnDelimiter();

MCAutoListRef t_list;

MCListCreateMutable(t_row_delimiter, &t_list);

uindex_t t_count = MCArrayGetCount(p_array);

combine_int_indexed_array_t t_lisctxt;

bool t_success;

t_lisctxt . elements = nil;

t_lisctxt . index = 0;

t_lisctxt . converter = &ctxt;

t_success = MCMemoryNewArray(t_count, t_lisctxt . elements);

if (t_success)

{

if (MCArrayApply(p_array, list_int_indexed_array_elements, &t_lisctxt))

{

bool t_valid_keys;

qsort(t_lisctxt . elements, t_count, sizeof(array_element_t), compare_int_indexed_elements);

// Combine by row/column is only valid if all the indices are consecutive numbers

// Otherwise, an empty string is returned - no error

index_t t_last_index;

t_valid_keys = true;

t_last_index = 0;

for (int i = 0; i < t_count && t_valid_keys; ++i)

{

if (!t_last_index)

t_last_index = t_lisctxt . elements[i] . key;

else

t_valid_keys = ++t_last_index == t_lisctxt . elements[i] . key;

}

if (t_valid_keys)

{

// SN-2014-09-01: [[ Bug 13297 ]]

// We need to store the converted strings in a array, to be able to iterate through the elements by one row-delimitated

// at a time

MCStringRef* t_strings;

uindex_t *t_next_row_indices;

t_strings = NULL;

t_next_row_indices = NULL;

/* UNCHECKED */ MCMemoryNewArray(t_count, t_strings);

// MCMemoryNewArray initialises all t_next_row_indices elements to 0.

/* UNCHECKED */ MCMemoryNewArray(t_count, t_next_row_indices);

for (int i = 0; i < t_count && t_success; ++i)

{

if (t_lisctxt . elements[i] . key == 0) // The index 0 is ignored

continue;

t_success = ctxt . ConvertToString(t_lisctxt . elements[i] . value, t_strings[i]);

}

// SN-2014-09-01: [[ Bug 13297 ]] Added a missed part in column-combining:

// only combining row-by-row the array elements.

if (t_success)

{

uindex_t t_elements_over;

t_elements_over = 0;

// We iterate as long as one element still has uncombined rows

while (t_success && t_elements_over != t_count)

{

MCAutoListRef t_row;

t_success = MCListCreateMutable(t_col_delimiter, &t_row);

t_elements_over = 0;

// Iterate through all the elements of the array

for (int i = 0; i < t_count && t_success; ++i)

{

// Only consider this element if it has any uncombined rows remaining

if (t_next_row_indices[i] < MCStringGetLength(t_strings[i]))

{

MCRange t_cell_range;

if (MCStringFind(t_strings[i], MCRangeMake(t_next_row_indices[i], UINDEX_MAX), t_row_delimiter, ctxt.GetStringComparisonType(), &t_cell_range))

{

// We found a row delimiter, so we stop the copy range before it and update the next index from which to look

t_success = MCListAppendSubstring(*t_row, t_strings[i], MCRangeMake(t_next_row_indices[i], t_cell_range . offset - t_next_row_indices[i]));

t_next_row_indices[i] = t_cell_range . offset + t_cell_range . length;

}

else

{

// No row delimiter: we copy the remaining part of the string and mark the element

// as wholly combined by setting the next index to the length of the element

t_success = MCListAppendSubstring(*t_row, t_strings[i], MCRangeMake(t_next_row_indices[i], UINDEX_MAX));

t_next_row_indices[i] = MCStringGetLength(t_strings[i]);

}

}

else

{

// Everything has been combined in this element

t_elements_over++;

MCListAppend(*t_row, kMCEmptyString);

}

}

// One more row has been combined - doing it anyway mimics the previous behaviour of having an empty row

// added in the end when combining by columns

if (t_elements_over != t_count)

MCListAppend(*t_list, *t_row);

}

}

MCMemoryDeleteArray(t_next_row_indices);

MCMemoryDeleteArray(t_strings);

}

}

MCMemoryDeleteArray(t_lisctxt . elements);

}

if (t_success && MCListCopyAsString(*t_list, r_string))

return;

ctxt . Throw();

}

void MCArraysExecCombineAsSet(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef p_element_delimiter, MCStringRef& r_string)

{

// String into which the combined keys are accumulated

MCAutoStringRef t_string;

// The array keys are not added in any particular order

MCNameRef t_key;

MCValueRef t_value_ignored;

uintptr_t t_iterator = 0;

while (MCArrayIterate(p_array, t_iterator, t_key, t_value_ignored))

{

bool t_success;

t_success = true;

if (*t_string == nil)

t_success = MCStringMutableCopy(MCNameGetString(t_key), &t_string);

else

t_success = MCStringAppendFormat(*t_string, "%@%@", p_element_delimiter, t_key);

if (!t_success)

{

ctxt . Throw();

return;

}

}

if (*t_string == nil)

r_string = MCValueRetain(kMCEmptyString);

else

MCStringCopy(*t_string, r_string);

}

//////////

void MCArraysExecSplit(MCExecContext& ctxt, MCStringRef p_string, MCStringRef p_element_delimiter, MCStringRef p_key_delimiter, MCArrayRef& r_array)

{

/* Cannot split by empty delimiters */

if (MCStringIsEmpty(p_element_delimiter) ||

(nil != p_key_delimiter && MCStringIsEmpty(p_key_delimiter)))

{

ctxt.LegacyThrow(EE_ARRAYOP_BADEXP);

return;

}

if (MCStringSplit(p_string, p_element_delimiter, p_key_delimiter, ctxt . GetStringComparisonType(), r_array))

return;

ctxt . Throw();

}

void MCArraysExecSplitByColumn(MCExecContext& ctxt, MCStringRef p_string, MCArrayRef& r_array)

{

MCStringRef t_row_delim, t_column_delim;

t_row_delim = ctxt . GetRowDelimiter();

t_column_delim = ctxt . GetColumnDelimiter();

/* Cannot split by empty delimiters */

if (MCStringIsEmpty(t_row_delim) || MCStringIsEmpty(t_column_delim))

{

ctxt.LegacyThrow(EE_ARRAYOP_BADEXP);

return;

}

// Output array

MCAutoArrayRef t_array;

if (!MCArrayCreateMutable(&t_array))

{

ctxt . Throw();

return;

}

// Temporary array for storing columns

MCAutoArray<MCStringRef> t_temp_array;

// Iterate over the rows of the input string

uindex_t t_offset, t_length;

t_offset = 0;

t_length = MCStringGetLength(p_string);

bool t_success;

t_success = true;

uindex_t t_row_index;

t_row_index = 0;

while (t_success && t_offset < t_length)

{

// Find the end of this row

MCRange t_row_found;

if (!MCStringFind(p_string, MCRangeMake(t_offset, UINDEX_MAX), t_row_delim, ctxt . GetStringComparisonType(), &t_row_found))

{

t_row_found . offset = t_length;

t_row_found . length = 0;

}

// Iterate over the cells of this row

uindex_t t_cell_offset, t_column_index;

t_cell_offset = t_offset;

t_column_index = 0;

while (t_success && t_cell_offset <= t_row_found . offset)

{

// Find the end of this cell

MCRange t_cell_found;

if (!MCStringFind(p_string, MCRangeMake(t_cell_offset, UINDEX_MAX), t_column_delim, ctxt . GetStringComparisonType(), &t_cell_found) || t_cell_found . offset > t_row_found . offset)

{

t_cell_found . offset = t_row_found . offset;

// AL-2014-08-04: [[ Bug 13090 ]] Make sure cell offset is incremented eventually when the delimiter is not found

t_cell_found . length = 1;

}

// Check that the output array has a slot for this column

if (t_temp_array.Size() <= t_column_index)

t_temp_array.Extend(t_column_index + 1);

// Check that a string has been created to store this column

MCRange t_range;

t_range = MCRangeMake(t_cell_offset, t_cell_found . offset - t_cell_offset);

if (t_temp_array[t_column_index] == nil)

{

t_success = MCStringCreateMutable(0, t_temp_array[t_column_index]);

// AL-2014-08-04: [[ Bug 13090 ]] If we are creating a new column, make sure we pad with empty cells 'above' this one

uindex_t t_rows = t_row_index;

while (t_success && t_rows--)

t_success = MCStringAppend(t_temp_array[t_column_index], t_row_delim);

if (t_success)

t_success = MCStringAppendFormat(t_temp_array[t_column_index], "%*@", &t_range, p_string);

}

else

{

// AL-2014-06-12: [[ Bug 12610 ]] Range parameter to MCStringFormat must be a pointer to an MCRange

t_success = MCStringAppendFormat(t_temp_array[t_column_index], "%@%*@", t_row_delim, &t_range, p_string);

}

// Next cell

t_column_index++;

t_cell_offset = t_cell_found . offset + t_cell_found . length;

}

// AL-2014-08-04: [[ Bug 13090 ]] Pad the rest of this row with empty cells

index_t t_pad_number;

t_pad_number = t_temp_array . Size() - t_column_index;

if (t_success && t_pad_number > 0)

{

while (t_success && t_pad_number--)

t_success = MCStringAppend(t_temp_array[t_column_index++], t_row_delim);

}

// Next row

t_row_index++;

t_offset = t_row_found . offset + t_row_found . length;

}

// Convert the temporary array into a "proper" array

for (uindex_t i = 0; i < t_temp_array.Size() && t_success; i++)

{

t_success = MCArrayStoreValueAtIndex(*t_array, i + 1, t_temp_array[i]);

MCValueRelease(t_temp_array[i]);

}

if (t_success)

t_success = MCArrayCopy(*t_array, r_array);

if (!t_success)

ctxt . Throw();

}

void MCArraysExecSplitAsSet(MCExecContext& ctxt, MCStringRef p_string, MCStringRef p_element_delimiter, MCArrayRef& r_array)

{

/* Cannot split by empty delimiters */

if (MCStringIsEmpty(p_element_delimiter))

{

ctxt.LegacyThrow(EE_ARRAYOP_BADEXP);

return;

}

// Split the incoming string into its components

MCAutoArrayRef t_keys;

if (!MCStringSplit(p_string, p_element_delimiter, nil, ctxt . GetStringComparisonType(), &t_keys))

{

ctxt . Throw();

return;

}

// The new array, with keys equal to the components of the string

MCAutoArrayRef t_array;

if (!MCArrayCreateMutable(&t_array))

{

ctxt . Throw();

return;

}

MCNameRef t_key_ignored;

MCValueRef t_value;

uintptr_t t_iterator = 0;

while (MCArrayIterate(*t_keys, t_iterator, t_key_ignored, t_value))

{

// The value stored at each key is a boolean "true"

MCNewAutoNameRef t_keyname;

if (!ctxt . ConvertToName(t_value, &t_keyname)

|| !MCArrayStoreValue(*t_array, ctxt . GetCaseSensitive(), *t_keyname, kMCTrue))

{

ctxt . Throw();

return;

}

}

MCArrayCopy(*t_array, r_array);

}

////////////////////////////////////////////////////////////////////////////////

void MCArraysDoUnion(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, bool p_recursive, MCValueRef& r_result)

{

if (!MCValueIsArray(p_src))

{

r_result = MCValueRetain(p_dst);

return;

}

if (!MCValueIsArray(p_dst))

{

r_result = MCValueRetain(p_src);

return;

}

MCArrayRef t_src_array;

t_src_array = (MCArrayRef)p_src;

MCArrayRef t_dst_array;

t_dst_array = (MCArrayRef)p_dst;

MCAutoArrayRef t_result;

if (!MCArrayMutableCopy(t_dst_array, &t_result))

return;

MCNameRef t_key;

MCValueRef t_src_value;

MCValueRef t_dst_value;

uintptr_t t_iterator;

t_iterator = 0;

while(MCArrayIterate(t_src_array, t_iterator, t_key, t_src_value))

{

bool t_key_exists;

t_key_exists = MCArrayFetchValue(t_dst_array, ctxt . GetCaseSensitive(), t_key, t_dst_value);

if (t_key_exists && !p_recursive)

continue;

MCAutoValueRef t_recursive_result;

if (!t_key_exists)

{

t_recursive_result = t_src_value;

}

else if (p_recursive)

{

MCArraysDoUnion(ctxt, t_dst_value, t_src_value, true, &t_recursive_result);

if (ctxt . HasError())

return;

}

if (!MCArrayStoreValue(*t_result, ctxt . GetCaseSensitive(), t_key, *t_recursive_result))

{

ctxt . Throw();

return;

}

}

r_result = MCValueRetain(*t_result);

}

void MCArraysDoIntersect(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, bool p_recursive, bool p_top_level, MCValueRef& r_result)

{

// Existing 6.7 behavior, is to clobber the left on the top level if either side converts to empty array

if (p_top_level)

{

if (!MCValueIsArray(p_dst) || !MCValueIsArray(p_src))

{

r_result = MCValueRetain(kMCEmptyString);

return;

}

}

// And preserve the left in the recursive case if either side converts to empty array

else

{

if (!MCValueIsArray(p_dst) || !MCValueIsArray(p_src))

{

r_result = MCValueRetain(p_dst);

return;

}

}

MCArrayRef t_dst_array;

t_dst_array = (MCArrayRef)p_dst;

MCArrayRef t_src_array;

t_src_array = (MCArrayRef)p_src;

// Existing 6.7 behavior, is to clobber the left on the top level if either side converts to empty array

if (p_top_level)

{

if (MCArrayIsEmpty(t_dst_array) || MCArrayIsEmpty(t_src_array))

{

r_result = MCValueRetain(kMCEmptyString);

return;

}

}

// And preserve the left in the recursive case if either side converts to empty array

else

{

if (MCArrayIsEmpty(t_dst_array) || MCArrayIsEmpty(t_src_array))

{

r_result = MCValueRetain(p_dst);

return;

}

}

MCAutoArrayRef t_result;

if (!MCArrayMutableCopy(t_dst_array, &t_result))

return;

MCNameRef t_key;

MCValueRef t_src_value;

MCValueRef t_dst_value;

uintptr_t t_iterator;

t_iterator = 0;

while(MCArrayIterate(t_dst_array, t_iterator, t_key, t_dst_value))

{

bool t_key_exists;

t_key_exists = MCArrayFetchValue(t_src_array, ctxt . GetCaseSensitive(), t_key, t_src_value);

if (t_key_exists && !p_recursive)

continue;

if (!t_key_exists)

{

if (!MCArrayRemoveValue(*t_result, ctxt . GetCaseSensitive(), t_key))

{

ctxt . Throw();

return;

}

}

else if (p_recursive)

{

MCAutoValueRef t_recursive_result;

MCArraysDoIntersect(ctxt, t_dst_value, t_src_value, true, false, &t_recursive_result);

if (ctxt . HasError())

return;

if (!MCArrayStoreValue(*t_result, ctxt . GetCaseSensitive(), t_key, *t_recursive_result))

return;

}

}

r_result = MCValueRetain(*t_result);

}

void MCArraysExecUnion(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, MCValueRef& r_result)

{

MCArraysDoUnion(ctxt, p_dst, p_src, false, r_result);

}

void MCArraysExecIntersect(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, MCValueRef& r_result)

{

MCArraysDoIntersect(ctxt, p_dst, p_src, false, true, r_result);

}

void MCArraysExecUnionRecursive(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, MCValueRef& r_result)

{

MCArraysDoUnion(ctxt, p_dst, p_src, true, r_result);

}

void MCArraysExecIntersectRecursive(MCExecContext& ctxt, MCValueRef p_dst, MCValueRef p_src, MCValueRef& r_result)

{

MCArraysDoIntersect(ctxt, p_dst, p_src, true, true, r_result);

}

////////////////////////////////////////////////////////////////////////////////

void MCArraysEvalArrayEncode(MCExecContext& ctxt, MCArrayRef p_array, MCStringRef p_version, MCDataRef& r_encoding)

{

bool t_success;

t_success = true;

IO_handle t_stream_handle;

t_stream_handle = nil;

if (t_success)

{

t_stream_handle = MCS_fakeopenwrite();

if (t_stream_handle == nil)

t_success = false;

}

// AL-2014-05-15: [[ Bug 12203 ]] Add version parameter to arrayEncode, to allow

// version 7.0 variant to preserve unicode.

MCInterfaceStackFileVersion t_version;

if (p_version != nil)

MCInterfaceStackFileVersionParse(ctxt, p_version, t_version);

// AL-2014-05-22: [[ Bug 12547 ]] Make arrayEncode encode in 7.0 format by default.

bool t_legacy;

t_legacy = p_version != nil && t_version . version < 7000;

if (t_legacy)

{

MCObjectOutputStream *t_stream;

t_stream = nil;

if (t_success)

{

t_stream = new MCObjectOutputStream(t_stream_handle);

if (t_stream == nil)

t_success = false;

}

if (t_success)

{

if (t_stream -> WriteU8(kMCEncodedValueTypeLegacyArray) != IO_NORMAL)

t_success = false;

}

if (t_success)

if (MCArraySaveToStreamLegacy(p_array, false, *t_stream) != IO_NORMAL)

t_success = false;

if (t_success)

t_stream -> Flush(true);

delete t_stream;

}

else

{

if (t_success)

if (IO_write_uint1(kMCEncodedValueTypeArray, t_stream_handle) != IO_NORMAL)

t_success = false;

if (t_success)

if (IO_write_valueref_new(p_array, t_stream_handle) != IO_NORMAL)

t_success = false;

}

//////////

void *t_buffer;

size_t t_length;

t_buffer = nil;

t_length = 0;

if (MCS_closetakingbuffer(t_stream_handle, t_buffer, t_length) != IO_NORMAL)

t_success = false;

if (t_success)

t_success = MCDataCreateWithBytes((const byte_t *)t_buffer, t_length, r_encoding);

free(t_buffer);

if (t_success)

return;

ctxt . Throw();

}

void MCArraysEvalArrayDecode(MCExecContext& ctxt, MCDataRef p_encoding, MCArrayRef& r_array)

{

bool t_success;

t_success = true;

IO_handle t_stream_handle;

t_stream_handle = nil;

if (t_success)

{

t_stream_handle = MCS_fakeopen(MCDataGetBytePtr(p_encoding), MCDataGetLength(p_encoding));

if (t_stream_handle == nil)

t_success = false;

}

uint8_t t_type;

if (t_success)

if (IO_read_uint1(&t_type, t_stream_handle) != IO_NORMAL)

t_success = false;

// AL-2014-05-01: [[ Bug 11989 ]] If the type is 'empty' then just return the empty array.

if (t_success && t_type == kMCEncodedValueTypeEmpty)

{

r_array = MCValueRetain(kMCEmptyArray);

return;

}

// AL-2014-05-15: [[ Bug 12203 ]] Check initial byte for version 7.0 encoded array.

bool t_legacy;

t_legacy = t_type < kMCEncodedValueTypeArray;

MCArrayRef t_array;

t_array = nil;

if (t_success)

t_success = MCArrayCreateMutable(t_array);

if (t_legacy)

{

if (t_success)

if (MCS_putback(t_type, t_stream_handle) != IO_NORMAL)

t_success = false;

MCObjectInputStream *t_stream;

t_stream = nil;

if (t_success)

{

t_stream = new MCObjectInputStream(t_stream_handle, MCDataGetLength(p_encoding), false);

if (t_stream == nil)

t_success = false;

}

if (t_success)

if (t_stream -> ReadU8(t_type) != IO_NORMAL)

t_success = false;

if (t_success)

if (MCArrayLoadFromStreamLegacy(t_array, *t_stream) != IO_NORMAL)

t_success = false;

delete t_stream;

}

else

{

if (t_success)

if (IO_read_valueref_new((MCValueRef &)t_array, t_stream_handle) != IO_NORMAL)

t_success = false;

}

MCS_close(t_stream_handle);

if (t_success)

{

r_array = t_array;

return;

}

MCValueRelease(t_array);

ctxt . Throw();

}

////////////////////////////////////////////////////////////////////////////////

bool MCArraysSplitIndexes(MCNameRef p_key, integer_t*& r_indexes, uindex_t& r_count, bool& r_all_integers)

{

r_indexes = nil;

r_count = 0;

MCStringRef t_string = MCNameGetString(p_key);

uindex_t t_string_len = MCStringGetLength(t_string);

if (t_string_len == 0)

return true;

r_all_integers = true;

uindex_t t_start, t_finish;

t_start = 0;

t_finish = 0;

for(;;)

{

if (!MCStringFirstIndexOfChar(t_string, ',', t_start, kMCCompareExact, t_finish))

t_finish = t_string_len;

if (!MCMemoryResizeArray(r_count + 1, r_indexes, r_count))

return false;

MCAutoStringRef t_substring;

MCAutoNumberRef t_number;

MCStringCopySubstring(t_string, MCRangeMake(t_start, t_finish - t_start), &t_substring);

if (!MCNumberParse(*t_substring, &t_number))

{

r_indexes[r_count - 1] = 0;

r_all_integers = false;

break;

}

else

r_indexes[r_count - 1] = MCNumberFetchAsInteger(*t_number);

if (t_finish >= t_string_len)

break;

t_start = t_finish + 1;

}

return true;

}

struct array_extent_t

{

integer_t min;

integer_t max;

};

bool MCArraysCopyExtents(MCArrayRef self, array_extent_t*& r_extents, uindex_t& r_count)

{

uintptr_t t_index = 0;

MCNameRef t_key;

MCValueRef t_value;

bool t_has_extents = false;

uindex_t t_dimensions = 0;

MCAutoArray<array_extent_t> t_extents;

while (MCArrayIterate(self, t_index, t_key, t_value))

{

MCAutoPointer<index_t> t_indexes;

uindex_t t_index_count;

bool t_all_integers;

if (!MCArraysSplitIndexes(t_key, &t_indexes, t_index_count, t_all_integers))

return false;

if (!t_all_integers || t_index_count == 0)

{

t_has_extents = false;

break;

}

if (!t_has_extents)

{

t_dimensions = t_index_count;