<?xml version="1.0" encoding="windows-1252"?>
<node id="79145" title="Re: Re: Re: Re: Golf: Arbitrary Alphabetical Sorting" created="2001-05-09 16:14:13" updated="2005-07-19 14:08:39">
<type id="11">
note</type>
<author id="53423">
Masem</author>
<data>
<field name="doctext">
In your code, you prep your translation hash %m with keys from the input alphabet, and values of a through z.  What if the input alphabet was &lt;CODE&gt;[a..z1]&lt;/CODE&gt;, or &lt;CODE&gt;[a..z0-9]&lt;/CODE&gt;?  These are more than 26 characters and thus, the 27th and higher characters will have null values for their keys, and will mess up your tr-and-back transformation.
&lt;HR&gt;
&lt;I&gt;
Dr. Michael K. Neylon - &lt;a href="mailto:mneylon-pm@masemware.com"&gt;mneylon-pm@masemware.com&lt;/a&gt;
||
"You've left the lens cap of your mind on again, Pinky" - The Brain
&lt;/I&gt;</field>
<field name="root_node">
79130</field>
<field name="parent_node">
79141</field>
</data>
</node>
