var s = arguments.targetStruct; var aCols = ''; var i = 0; var count = 0; if (arguments.LCaseNames) arguments.colsList = LCase(arguments.colsList); aCols = ListToArray(arguments.colsList); count = ArrayLen(aCols); for (i = 1; i lte count; i = i + 1) s[aCols[i]] = arguments.query[aCols[i]][arguments.rowNum]; return s; var rtnXML = XmlNew(); var i = 1; rtnXML.xmlRoot = XmlElemNew(rtnXML,arguments.rootName); for(i=1;i<=ArrayLen(arrayOfStruct);i = i +1) rtnXML[arguments.rootName].XmlChildren[i] = XmlElemNew(rtnXML,arguments.nodeName); var nextMatch = 1; var objMatch = ""; var outstring = ""; var thisURL = ""; var thisLink = ""; do { objMatch = REFindNoCase("(((https?:|ftp:|gopher:)\/\/)|(www\.|ftp\.))[-[:alnum:]\?%,\.\/&##!;@:=\+~_]+[A-Za-z0-9\/]", arguments.strText, nextMatch, true); if (objMatch.pos[1] GT nextMatch OR objMatch.pos[1] EQ nextMatch) outString = outString & Mid(arguments.strText, nextMatch, objMatch.pos[1] - nextMatch); else outString = outString & Mid(arguments.strText, nextMatch, Len(arguments.strText)); nextMatch = objMatch.pos[1] + objMatch.len[1]; if (ArrayLen(objMatch.pos) GT 1) { // If the preceding character is an @, assume this is an e-mail address // (for addresses like admin@ftp.cdrom.com) if (Compare(Mid(arguments.strText, Max(objMatch.pos[1] - 1, 1), 1), "@") NEQ 0) { thisURL = Mid(arguments.strText, objMatch.pos[1], objMatch.len[1]); thisLink = "" & thisURL & ""; outString = outString & thisLink; // arguments.strText = Replace(arguments.strText, thisURL, thisLink); // nextMatch = nextMatch + Len(thisURL); } else { outString = outString & Mid(arguments.strText, objMatch.pos[1], objMatch.len[1]); } } } while (nextMatch GT 0); // Now turn e-mail addresses into mailto: links. outString = REReplace(outString, "([[:alnum:]_\.\-]+@([[:alnum:]_\.\-]+\.)+[[:alpha:]]{2,4})", "\1", "ALL"); if ( arguments.paragraph ) outString = ParagraphFormat(outString); return outString; var parsed = ""; var index = 0; var rows = 0; var thisArr = arrayNew(1); var retStruct = structNew(); var XMLText = ""; var retQuery = queryNew("title,link,description"); var nodeToReplace = ''; retStruct.success = false; if(isXML(XMLText)){ nodeToReplace = mid(XMLText, 1, find("?>", XMLText) + 1); XMLText = replaceNoCase(XMLText, nodeToReplace, "", "ALL"); parsed = XMLParse(XMLText); }else{ application.ADF.utils.logAppend( "Could not parse XML data in feedToQuery.
" &"Feed URL: #path#.
" &"XML Results:
" &application.ADF.utils.doDump(XMLText,"XMLText",0,1) &"

" ,"feedToQueryErrors.html" ); } //RDF if (find(" (SELECT * FROM ARGUMENTS.QueryOne ) UNION ALL ( SELECT * FROM ARGUMENTS.QueryTwo ) var numWords = 0; var str = trim(arguments.textStr); str = REReplace(str,"[[:space:]]{2,}"," ","ALL"); numWords = listLen(str," "); return numWords; var buf = CreateObject("java", "java.lang.StringBuffer"); var len = Len(arguments.str); var char = ""; var charcode = 0; var i = 0; buf.ensureCapacity(JavaCast("int", len+20)); // Make the array an query var aOfSQry = arrayOfStructuresToQuery(theArray=arguments.aOfS,forceColsToVarchar=arguments.forceColsToVarchar,allowComplexValues=arguments.allowComplexValues); var sortedQry = ""; SELECT * FROM aOfSQry ORDER BY #arguments.orderByKeyList# // Transform the query back to array of structs and Return return queryToArrayOfStructures(sortedQry); var Result=""; // Generated result var Str1=""; // Temp string var Str2=""; // Temp string var n=number; // Working copy var Billions=0; var Millions=0; var Thousands=0; var Hundreds=0; var Tens=0; var Ones=0; var Point=0; var HaveValue=0; // Flag needed to know if to process "0" var strHolder = StructNew(); // Initialize strings // Strings are "externalized" to simplify // changing text or translating if ( NOT StructKeyExists(REQUEST,"Strs") ) { REQUEST.Strs=StructNew(); REQUEST.Strs.space=" "; REQUEST.Strs.and="and"; REQUEST.Strs.point="Point"; REQUEST.Strs.n0="Zero"; REQUEST.Strs.n1="One"; REQUEST.Strs.n2="Two"; REQUEST.Strs.n3="Three"; REQUEST.Strs.n4="Four"; REQUEST.Strs.n5="Five"; REQUEST.Strs.n6="Six"; REQUEST.Strs.n7="Seven"; REQUEST.Strs.n8="Eight"; REQUEST.Strs.n9="Nine"; REQUEST.Strs.n10="Ten"; REQUEST.Strs.n11="Eleven"; REQUEST.Strs.n12="Twelve"; REQUEST.Strs.n13="Thirteen"; REQUEST.Strs.n14="Fourteen"; REQUEST.Strs.n15="Fifteen"; REQUEST.Strs.n16="Sixteen"; REQUEST.Strs.n17="Seventeen"; REQUEST.Strs.n18="Eighteen"; REQUEST.Strs.n19="Nineteen"; REQUEST.Strs.n20="Twenty"; REQUEST.Strs.n30="Thirty"; REQUEST.Strs.n40="Forty"; REQUEST.Strs.n50="Fifty"; REQUEST.Strs.n60="Sixty"; REQUEST.Strs.n70="Seventy"; REQUEST.Strs.n80="Eighty"; REQUEST.Strs.n90="Ninety"; REQUEST.Strs.n100="Hundred"; REQUEST.Strs.nK="Thousand"; REQUEST.Strs.nM="Million"; REQUEST.Strs.nB="Billion"; } // Save strings to an array once to improve performance if ( NOT StructKeyExists(REQUEST,"StrsA") ) { // Arrays start at 1, to 1 contains 0 // 2 contains 1, and so on REQUEST.StrsA=ArrayNew(1); ArrayResize(REQUEST.StrsA, 91); REQUEST.StrsA[1]=REQUEST.Strs.n0; REQUEST.StrsA[2]=REQUEST.Strs.n1; REQUEST.StrsA[3]=REQUEST.Strs.n2; REQUEST.StrsA[4]=REQUEST.Strs.n3; REQUEST.StrsA[5]=REQUEST.Strs.n4; REQUEST.StrsA[6]=REQUEST.Strs.n5; REQUEST.StrsA[7]=REQUEST.Strs.n6; REQUEST.StrsA[8]=REQUEST.Strs.n7; REQUEST.StrsA[9]=REQUEST.Strs.n8; REQUEST.StrsA[10]=REQUEST.Strs.n9; REQUEST.StrsA[11]=REQUEST.Strs.n10; REQUEST.StrsA[12]=REQUEST.Strs.n11; REQUEST.StrsA[13]=REQUEST.Strs.n12; REQUEST.StrsA[14]=REQUEST.Strs.n13; REQUEST.StrsA[15]=REQUEST.Strs.n14; REQUEST.StrsA[16]=REQUEST.Strs.n15; REQUEST.StrsA[17]=REQUEST.Strs.n16; REQUEST.StrsA[18]=REQUEST.Strs.n17; REQUEST.StrsA[19]=REQUEST.Strs.n18; REQUEST.StrsA[20]=REQUEST.Strs.n19; REQUEST.StrsA[21]=REQUEST.Strs.n20; REQUEST.StrsA[31]=REQUEST.Strs.n30; REQUEST.StrsA[41]=REQUEST.Strs.n40; REQUEST.StrsA[51]=REQUEST.Strs.n50; REQUEST.StrsA[61]=REQUEST.Strs.n60; REQUEST.StrsA[71]=REQUEST.Strs.n70; REQUEST.StrsA[81]=REQUEST.Strs.n80; REQUEST.StrsA[91]=REQUEST.Strs.n90; } //zero shortcut if(number is 0) return "Zero"; // How many billions? // Note: This is US billion (10^9) and not // UK billion (10^12), the latter is greater // than the maximum value of a CF integer and // cannot be supported. Billions=n\1000000000; if (Billions) { n=n-(1000000000*Billions); Str1=NumberAsString(Billions)&REQUEST.Strs.space&REQUEST.Strs.nB; if (Len(Result)) Result=Result&REQUEST.Strs.space; Result=Result&Str1; Str1=""; HaveValue=1; } // How many millions? Millions=n\1000000; if (Millions) { n=n-(1000000*Millions); Str1=NumberAsString(Millions)&REQUEST.Strs.space&REQUEST.Strs.nM; if (Len(Result)) Result=Result&REQUEST.Strs.space; Result=Result&Str1; Str1=""; HaveValue=1; } // How many thousands? Thousands=n\1000; if (Thousands) { n=n-(1000*Thousands); Str1=NumberAsString(Thousands)&REQUEST.Strs.space&REQUEST.Strs.nK; if (Len(Result)) Result=Result&REQUEST.Strs.space; Result=Result&Str1; Str1=""; HaveValue=1; } // How many hundreds? Hundreds=n\100; if (Hundreds) { n=n-(100*Hundreds); Str1=NumberAsString(Hundreds)&REQUEST.Strs.space&REQUEST.Strs.n100; if (Len(Result)) Result=Result&REQUEST.Strs.space; Result=Result&Str1; Str1=""; HaveValue=1; } // How many tens? Tens=n\10; if (Tens) n=n-(10*Tens); // How many ones? Ones=n\1; if (Ones) n=n-(Ones); // Anything after the decimal point? if (Find(".", number)) Point=Val(ListLast(number, ".")); // If 1-9 Str1=""; if (Tens IS 0) { if (Ones IS 0) { if (NOT HaveValue) Str1=REQUEST.StrsA[0]; } else // 1 is in 2, 2 is in 3, etc Str1=REQUEST.StrsA[Ones+1]; } else if (Tens IS 1) // If 10-19 { // 10 is in 11, 11 is in 12, etc Str1=REQUEST.StrsA[Ones+11]; } else { // 20 is in 21, 30 is in 31, etc Str1=REQUEST.StrsA[(Tens*10)+1]; // Get "ones" portion if (Ones) Str2=NumberAsString(Ones); Str1=Str1&REQUEST.Strs.space&Str2; } // Build result if (Len(Str1)) { if (Len(Result)) Result=Result&REQUEST.Strs.space&REQUEST.Strs.and&REQUEST.Strs.space; Result=Result&Str1; } // Is there a decimal point to get? if (Point) { Str2=NumberAsString(Point); Result=Result&REQUEST.Strs.space&REQUEST.Strs.point&REQUEST.Strs.space&Str2; } return Result; var TempList = ""; var CombinedList = ""; var i = 0; // Combine list 1 and list 2 with the proper delimiter CombinedList = ListChangeDelims(arguments.List1, arguments.Delim3, arguments.Delim1) & arguments.Delim3 & ListChangeDelims(arguments.List2, arguments.Delim3, arguments.Delim2); // Strip duplicates if indicated if ( arguments.removeDups ) { for (i=1; i LTE ListLen(CombinedList, arguments.Delim3); i=i+1) { if (NOT ListFindNoCase(TempList, ListGetAt(CombinedList, i, arguments.Delim3), arguments.Delim3)) { TempList = ListAppend(TempList, ListGetAt(CombinedList, i, arguments.Delim3), arguments.Delim3); } } } if ( arguments.SortType EQ "text" OR arguments.SortType EQ "numeric" ) return ListSort(TempList, arguments.SortType, arguments.SortOrder, arguments.Delim3); else return TempList;