Test of twoletter algorithm
<sed><e>s/^.*-(..).*\.rm$//</e><source variable=file><destination variable=twoletter></sed>
Input is <insert variable=file> and output is <insert variable=twoletter>.<P><HR>
Now trying the rename symlink eliminator<BR>
<cset preparse variable=renamedfile><insert variable=file></cset>
<if variable="file is UEFA-Europe-*">
<sed><e>s/UEFA-Europe(.*)-hi-/UEFA-Europe\1-enUK-00300-/</e><source variable=file><destination variable=renamedfile></sed>
<cset preparse variable=file><insert variable=renamedfile></cset>
</if>
Input is <insert variable=file> and output is <insert variable=renamedfile>.<P><HR>
Now doing the lookup parser<BR>
<cset preparse variable=file><insert variable=renamedfile></cset>


<arraycset preparse name=path delim="/"><insert variable=file encode=none></arraycset>
<arraysize name=path set=pathitem>
<COMMENT> FOR LOOP from HELL</COMMENT>
<formoutput><set variable=basenameptr expr="#pathitem#-1"</formoutput><if not variable=basenameptr><set variable=basenameptr value="0"></if>
<formoutput><cset variable=basename preparse><arrayfetch name=path index=#basenameptr# encode=none></cset></formoutput>
Input is <insert variable=file> and output is <insert variable=basename>.<P><HR>