PERFECT PANGRAM HASH : Anagram Hash Function

A pangram is a sentence or phrase that contains each letter of an alphabet
or character set at least once. A perfect pangram is an anagram of the
alphabet which contains each letter exactly once.

Pangram hash generates a perfect pangram hash digest consisting of a
anagram permutation of a character set. Each character in the output is
unique and non-repeating.

Below is purely procedural source code written in the FreePascal
programming language. Instructions and explanatory comments are located
in the source code. A plain text source file is embedded in the PDF
document. Additional resource files are also embedded in the PDF file.