var myFuncs = StructNew(); var innerFuncs = StructNew(); var i = ''; var j = ''; if (structKeyExists(object,'functions')) { for (i=1; i lte arraylen(object.functions);i = i+1) { if ((not StructKeyExists(myFuncs,object.functions[i].NAME)) and (object.functions[i].ACCESS is "PUBLIC") and (object.functions[i].NAME is not "INIT")){ StructInsert(myFuncs,object.functions[i].NAME,object.functions[i],false); } } } if (listlast(object.extends.NAME,'.' ) neq "COMPONENT"){ innerFuncs = getFuncs(object.EXTENDS); StructAppend(myFuncs,innerFuncs,false); } var result = true; var i = ""; // Loop through the elements and compare them one at a time for (i=1;i lte arrayLen(LeftArray); i = i+1) { //elements is a structure, call structCompare() if (isStruct(LeftArray[i])){ result = structCompare(LeftArray[i],RightArray[i]); if (NOT result) return false; //elements is an array, call arrayCompare() } else if (isArray(LeftArray[i])){ result = arrayCompare(LeftArray[i],RightArray[i]); if (NOT result) return false; //A simple type comparison here } else { if(LeftArray[i] IS NOT RightArray[i]) return false; } } var result = true; var LeftStructKeys = ""; var RightStructKeys = ""; var key = ""; //Make sure both structures have the same keys LeftStructKeys = StructKeyList(LeftStruct); RightStructKeys = StructKeyList(RightStruct); if(LeftStructKeys neq RightStructKeys) return false; // Loop through the keys and compare them one at a time for (key in LeftStruct) { //Key is a structure, call structCompare() if (isStruct(LeftStruct[key])){ result = structCompare(LeftStruct[key],RightStruct[key]); if (NOT result) return false; //Key is an array, call arrayCompare() } else if (isArray(LeftStruct[key])){ result = arrayCompare(LeftStruct[key],RightStruct[key]); if (NOT result) return false; // A simple type comparison here, but DON'T compare the value of the FOUNDIN key! } else { if((key IS NOT "FOUNDIN") and (LeftStruct[key] IS NOT RightStruct[key])) return false; } }