code: protected String int2singlealphaCount(long val, CharArrayWrapper table)
    {
  
      int radix = table.getLength();
  
      // TODO:  throw error on out of range input
      if (val > radix)
      {
        return getZeroString();
      }
      else
        return (new Character(table.getChar((int)val - 1))).toString();  // index into table is off one, starts at 0
    }
docs: Convert a long integer into alphabetic counting, in other words
  count using the sequence A B C ... Z.
  
  @param val Value to convert -- must be greater than zero.
  @param table a table containing one character for each digit in the radix
  @return String representing alpha count of number.
  @see TransformerImpl#DecimalToRoman
  
  Note that the radix of the conversion is inferred from the size
  of the table.